Double-step incremental generation of lines and circles

An explicit discussion of the possible speed-up of curve generation due to an increase in the size of increment has not appeared in literature. This paper proposes a methodology and its rationale for scan-converting lines and circles two pixels per iteration. The double-step line and circle algorithms require the same amount of integer arithmetic per iteration as the single-step algorithms but only half the number of iterations. The algorithms take advantage of some simple properties of discrete loci of mathematical curves in the raster plane.