Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!swrinde!cs.utexas.edu!romp!auschs!d75!awdprime!piobe.austin.ibm.com!sjb
From: sjb@piobe.austin.ibm.com (Scott J Brickner)
Newsgroups: comp.lang.c
Subject: Re: Help w/Plotting a circle...
Message-ID: <8433@awdprime.UUCP>
Date: 12 Jun 91 22:13:59 GMT
References: <1991Jun11.154335.130@sugaree.uu.net>
Sender: news@awdprime.UUCP
Reply-To: sjb@piobe.austin.ibm.com
Organization: IBM Austin, Contractor
Lines: 12


I seem to remember a really neat article in Dr Dobbs Journal (the
magazine) about two or three years ago...  it had about six different
circle and line drawing algorithms of varying complexity... does anyone
else remember this and know which issue it was in?

In general, though, a quick optimization for any of the circle drawing
algorithms is to only COMPUTE 1/8th of the points, and use reflection
about the various axes x=0, y=0, y=x, and y= -x for the remainder.

Good luck...
Scott