Xref: utzoo comp.graphics:4483 sci.math:5711 comp.sources.wanted:6380
Path: utzoo!utgpu!utstat!jarvis.csri.toronto.edu!mailrus!tut.cis.ohio-state.edu!ucbvax!decwrl!sgi!daisy!klee
From: klee@daisy.UUCP (Ken Lee)
Newsgroups: comp.graphics,sci.math,comp.sources.wanted
Subject: Re: looking for a fast ellipse algorithm
Message-ID: <2692@daisy.UUCP>
Date: 16 Feb 89 00:27:09 GMT
References: <399@peritek.UUCP> <1311@ndmath.UUCP> <1403@mtunb.ATT.COM>
Reply-To: klee@daisy.UUCP (Ken Lee)
Organization: Daisy Systems Corp., Mountain View, Ca.
Lines: 9

If anyone's interested, Bresenham's circle generation algorithm is presented
in Chapter 11.4.2  of *Fundamentals of Interactive Computer Graphics* by
Foley & Van Dam.  It's all integer with about 3 adds and 1 multiply per
pixel, i.e., about as fast as you can get in software on raster displays.

Ken Lee
-- 
klee@daisy.uucp
Daisy Systems Corp., Interactive Graphics Tools Dept.