A Fast Hybrid Ellipse-Drawing Algorithm
A fast hybrid algorithm for drawing ellipse is proposed in this paper. The algorithm is established based on the observation that each quarter ellipse is composed of three regions, and only one kind of primitives appears in one region, such as vertical segment, discrete point pair, and horizontal segment. Among this, the lengths of the vertical and horizontal segments are calculated with double-step iteration by redefining decision parameters, and the style of the discrete point pairs may be decided in a similar manner. Every primitive is output in one time. The region conversion points are judged by incremental method and multiplication operation is avoided. The experiment results prove that on average only 3-4 times basic operations are consumed in once pixel selection, and then the ellipse drawing speed can be almost doubled comparing with that of the classical middle-point algorithm, and is also faster than other previously published ones. Furthermore, the algorithm is very simple and can be developed to draw other conic curves.
ellipse drawing incremental scheme run-length algorithm middle-point algorith double-step scan conversion
Haiwen Feng Lianqiang Niu
School of Software,Shenyang University of Technology,Shenyang 110023,China
国际会议
太原
英文
259-263
2011-02-26（万方平台首次上网日期，不代表论文的发表时间）