Path: utzoo!utgpu!water!watmath!clyde!att!osu-cis!tut.cis.ohio-state.edu!mailrus!ames!vsi1!altnet!uunet!sco!hiramc
From: hiramc@sco.COM (Hiram Clawson)
Newsgroups: comp.graphics
Subject: Re: clipper
Keywords: 2-D line clipping.
Message-ID: <349@scolex>
Date: 14 Jul 88 18:13:37 GMT
References: <6506@well.UUCP> <1116@nunki.usc.edu>
Reply-To: hiramc@sco.COM (Hiram Clawson)
Organization: The Santa Cruz Operation, Inc.
Lines: 18

In article <1116@nunki.usc.edu> mcvey@sal24.usc.edu (Stephanie Salsbury Mc Vey) writes:
>             I am currently looking for a fast 2-d clipper. 
>I have 2 algorithms (one that uses the general euqation for a line -> division
>is used and the other one that uses the halfpoint subdivion of the line to 

Is one of those the algorithm published in SIGGRAPH proceedings
of 1987?  The algorithm there claims to be one of the fastest,
with appropriate charts and graphs to prove it.

Check it out.  SIGGRAPH conference proceedings of 1987.

--Hiram

-- 
|            Negativism?  We don't need no stinking negativism!               |
|Hiram Clawson - Engineer/Programmer-Graphics    |1700 Mission St., CA 95061  |
|WB6RSS        SCO : The Santa Cruz Operation -> |     408-458-1422 x3289     |
|Disclaimer: I'm responsible only for myself.    |...!ucbvax!ucscc!sco!hiramc |