Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!uwm.edu!linac!att!rutgers!cmcl2!adm!news
From: CDCKAB%EMUVM1.BITNET@cunyvm.cuny.edu ( Karl Brendel)
Newsgroups: comp.lang.pascal
Subject: Re: Circle algorithm
Message-ID: <26886@adm.brl.mil>
Date: 14 May 91 13:33:49 GMT
Sender: news@adm.brl.mil
Lines: 39

In article <1991May8.153016.19558@sbcs.sunysb.edu>
  clane@libserv1.ic.sunysb.edu (Charles F Lane) wrote:

[...deleted...]

>ellipses, etc.  What I need to know is what algorithm to use to draw
>circles. I am using the following equations currently:
>
>        X = r * COS(w)
>        Y = r * SIN(w)
>
>where r is the radius, w is the angle (0-360 plugged in to the
>equation), and x and y are the coordinates of the points to be
>plotted to form the circle. There are two problems with this
>equation, though.  First, it is too slooooooow!  Second, the larger
>the radius of the circle, the farther apart

[...deleted...]

The subject of rapidly drawing good circles is common in programming
magazines. I'd particularly suggest you scan the last couple of
years of _Programmer's Journal_ and recent issues of Dr Dobbs'
Journal and Computer Language.

>      P.S.  I hate to be a nag, but please respond directly via
>            E-mail as I may not be able to read all postings before
>            the older ones get periodically deleted.  Sometimes rn
>            says, "6500 unread messages" and only 150 of them are
>            available!

I can't help but think that either you are subscribing to too many
lists, or you aren't reading your mail often enough--or both! ;)

+====================================================================+
| Karl Brendel                           Centers for Disease Control |
| Internet: CDCKAB@EMUVM1.BITNET         Epidemiology Program Office |
| Bitnet: CDCKAB@EMUVM1                  Atlanta GA  30093       USA |
|                        Home of Epi Info 5.0                        |
+====================================================================+