Calculating circle´s points coordinates.

[Joshua Muskovitz]

> I'm not sure of the original poster's requirements, but if he wants to
plot
> a set of points on a integer-based grid (e.g., a memory-mapped display),
> then the Bresenham Circle algorithm is usually recommended.  It's very
fast
> and it doesn't have a problem with "holes" in the point set.

The original poster included a jpeg showing an n-sided polygon.  Bresenham
is a very good raster circle solution, and is quite fast, because you get to
plot 8 points for every computation.  Then again, drawing line segments
between computed points also avoids holes.  :-)

-- josh




-----= Posted via Newsfeeds.Com, Uncensored Usenet News =-----
http://www.newsfeeds.com - The #1 Newsgroup Service in the World!
-----==  Over 80,000 Newsgroups - 16 Different Servers! =-----