Path: utzoo!attcan!uunet!lll-winken!lll-tis!ames!ll-xn!oberon!nunki.usc.edu!sal24.usc.edu!mcvey
From: mcvey@sal24.usc.edu (Stephanie Salsbury Mc Vey)
Newsgroups: comp.graphics
Subject: clipper
Message-ID: <1116@nunki.usc.edu>
Date: 12 Jul 88 20:42:23 GMT
References: <6506@well.UUCP>
Sender: news@nunki.usc.edu
Reply-To: mcvey@sal24.usc.edu (Stephanie Salsbury Mc Vey)
Organization: University of Southern California, Los Angeles, CA
Lines: 9

hello to all of you byte burners !!!
after my Cordic frenzy that resulted into a better knowledge of things past
and present, 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 
find the its intersection with the borders of the screen ) 

Now I am looking for a faster clipper routine . Any geniuses among you ?

                  run_dmc VEY