Path: utzoo!mnetor!uunet!seismo!sundc!hqda-ai!yendor!gmg
From: gmg@yendor.UUCP (Gary Godfrey)
Newsgroups: comp.graphics
Subject: Re: Line Drawing Algorithms
Message-ID: <50@yendor.UUCP>
Date: 2 Jan 88 04:16:57 GMT
References: <174@nucleus.UUCP>
Organization: Applied Computing Technology, Reston, VA
Lines: 14

in article <174@nucleus.UUCP>, hacker@nucleus.UUCP (Thomas Hacker) says:
> 
> 
>    I'm working on a project that requires a very "quick" line drawing 
> algorithm (i.e. Draw (x1, y1, x2, y2)).  The fastest I know of is 
> Bresenham's algorithm, which is a DDA using integer arithmatic 
> instead of float.  If anyone knows of a superior algorithm, please
> let me know.
> 
> 		Thank You
> 
>     		   Thomas Hacker
>  		   Academic Computer Services
> 		   Oakland University