Generating Conic Sections Using an Efficient Algorithms

Abstract

Efficient integer algorithms for the fast generation of Conic Sections whose axes are aligned to the coordinate axes are described based on a Bresenham-like methodology and simulating midpoint algorithm concepts. Performance results show that in the case of the ellipse, the algorithm is at least as fast as other known integer algorithms but requires lower integer range and always performs correct region transitions. Also efficient techniques for generating hyperbola and parabola are designed