Double-step generation of ellipses
The principle of double-step incremental generation of nonparametric curves on a discrete plane is used to develop a double-step algorithm for scan converting ellipses in sixteen separate segments. The algorithm iterates only half as many times as current algorithms, while each iteration demands the same number of operations or slightly fewer operations than M. Pitteway's (1967, 1985) algorithm (previously the fastest one). This marked gain in the speed of scan conversion is due to the fact that the middle pixel in a two-step increment is obtained without computation.<<ETX>>