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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
SHUN Jia-guang, YAND Chang-gui. Computer graphics in Chinese (in Chinese)[M]. Beijing: Tsinghua University Press, 1995
REN Ji-cheng, LIU Zen-quan. The improved algorithm of scan-line region filling[J]. Journal of Computer-aided design & computer graphics in Chinese (in Chinese), 1998, 10(6): 481–486
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
LI Zi-qiang. A filling algorithmic of filling any region with italicized filling-line in Chinese[J]. Natural Science Journal of Xiangtan University (in Chinese), 1999, 4(1): 60–65
Author information
Authors and Affiliations
Additional information
Biography of the first author: WANG Jia-yang, associate professor, born in Oct. 1963, majoring in multimedia, computer graphics.
Rights and permissions
About this article
Cite this article
Wang, Jy., Chen, Sq. & Wang, Cd. Study on polygon region filling method. J Cent. South Univ. Technol. 7, 104–106 (2000). https://doi.org/10.1007/s11771-000-0043-7
Received:
Issue Date:
DOI: https://doi.org/10.1007/s11771-000-0043-7