From: Jon M. Taylor <taylorj@ecs.csus.edu>
  To  : ggi-develop@eskimo.com
  Date: Wed, 8 Jul 1998 20:16:11 -0700 (PDT)

Re: Fast lines

On Wed, 8 Jul 1998, Frank W. Miller wrote:

> > 
> > 	The fastest linedrawing/clipping routine possible uses the x and y
> > coordinates of the two endpoints of the line and two corners of the
> > clipping region as offsets into a sparse precalculated array of x,y pairs
> > stored as offsets into a linear framebuffer + one extra entry at the
> > beginning for the number of pixels in the line, making up all possible
> > lines.  For a 320x200x8bpp framebuffer, this would require ~3.5 heptabytes
> > of RAM, but the computational cost is: 
> > 
> > and the conditional branch.  A good pipeline will reduce this loop to ONE
> > CYCLE per pixel.  Beat *that*! |->
> > 
> 
> I stand corrected.  };)

	Now if you had said that the fastest purely computational
linedrawing algorithm is Bresenham, you would have been correct.  I think
this has been proven. 

Jon

---
'Cloning and the reprogramming of DNA is the first serious step in 
becoming one with God.'
	- Scientist G. Richard Seed