Path: utzoo!utgpu!news-server.csri.toronto.edu!mailrus!cs.utexas.edu!swrinde!zaphod.mps.ohio-state.edu!sunybcs!spica.cs.buffalo.edu!prussak
From: prussak@spica.cs.buffalo.edu (Michal Prussak)
Newsgroups: comp.graphics
Subject: Re: Fastest 2D line clipper
Message-ID: <21266@eerie.acsu.Buffalo.EDU>
Date: 8 Apr 90 19:19:10 GMT
References: <2130@crash.cts.com>
Sender: nobody@acsu.Buffalo.EDU
Reply-To: prussak@spica.cs.buffalo.edu (Michal Prussak)
Lines: 9

In article <2130@crash.cts.com>, jcs@crash.cts.com (John Schultz) writes:
>   The C version of this algorithm was shown to be twice as
> fast as the Cohen-Sutherland (CS) algorithm.

In my understanding, Cohen-Sutherland is not presently the state
of the art algorithm. The best that I know is a Liong-Barski algorithm.
I don't see any point comparing your algorithm to an outdated one.

Michal Prussak