Efficient integer algorithms for the generation of Conic Sections

Efficient integer 8-connected algorithms for the fast generation of Conic S ections whose axes art aligned to the coordinate axes are described based o n a Bresenham-like methodology. Performance results show that in the case o f the ellipse, the algorithm is at least as fast as other known integer alg orithms but requires lower integer range and always performs correct region transitions. Antialiasing is easily incorporated. (C) 1998 Elsevier Scienc e Ltd. All rights reserved.