Study on polygon region filling method

Jia-yang Wang; Song-qiao Chen; Can-dong Wang

doi:10.1007/s11771-000-0043-7

Journal of Central South University ›› 2000, Vol. 7 ›› Issue (2) : 104 -106. DOI: 10.1007/s11771-000-0043-7

Article

Study on polygon region filling method

Author information +

History +

PDF

Abstract

The paper puts forward a highly efficient and practical scan-line based on the filling algorithm. The algorithm takes the lines of polygon as line segments with directions and introduces the concept of marked value when the apex of polygon faces scan-line, determines whether there are intersection points between the lines of polygon and scan-lines, by judging whether the marked value has changed or not. This method avoids the extra decision and treatment of odd points in traditional algorithm, and it needs little calculations but it is highly efficient.

Keywords

computer graphics / filling algorithm / polygon

Cite this article

Download citation ▾

Jia-yang Wang, Song-qiao Chen, Can-dong Wang. Study on polygon region filling method. Journal of Central South University, 2000, 7(2): 104-106 DOI:10.1007/s11771-000-0043-7

登录浏览全文

4963

注册一个新账户忘记密码

References

Publishing order | Descend order by publishing year | Descend order by cited within

[1]	ShunJia-guang, YandChang-guiComputer graphics in Chinese (in Chinese)[M], 1995, Beijing, Tsinghua University Press

[2]	RenJi-cheng, LiuZen-quan. The improved algorithm of scan-line region filling[J]. Journal of Computer-aided design & computer graphics in Chinese, 1998, 10(6): 481-486(in Chinese)

[3]	HUANG Di-long, WAND Yi-dong. Programming of an algorithm to fill contours[J]. Journal of Chendu University of Technology in Chinese (in Chinese), 1999(2):191–194

[4]	LiZi-qiang. A filling algorithmic of filling any region with italicized filling-line in Chinese[J]. Natural Science Journal of Xiangtan University, 1999, 4(1): 60-65(in Chinese)