Algorithms for Generating the Sequence of Points Best Approximating a Circle in Cartesian Coordinate
Original Publication Date: 1981-Nov-01
Included in the Prior Art Database: 2005-Feb-12
An algorithm is required to efficiently generate in sequence the adjacent points best approximating a circle in an integer cartesian coordinate system. The disclosed algorithm is guaranteed to generate the best sequence of points for the given circle and does so with only simple addition and subtraction (no multiplication, division, or trigonometric calculations being required).