扫描线多边形区域填充算法研究 |
| |
引用本文: | 卫洪春,彭小利. 扫描线多边形区域填充算法研究[J]. 达县师范高等专科学校学报, 2012, 0(5): 77-82 |
| |
作者姓名: | 卫洪春 彭小利 |
| |
作者单位: | 四川文理学院计算机科学系,四川达州635000 |
| |
摘 要: | 在CAD系统中,经常需要对封闭区域进行填充,对于一个功能完善的CAD系统而言,区域填充算法是十分重要的内容,同时该算法也是图形学的基本算法之一.单连通多边形是解决复杂区域填充问题的基础,从扫描线区域填充的原理、数据结构的设计、算法实现等几个方面进行了详细的分析.
|
关 键 词: | 多边形 活性边表 填充 记录 |
Study on the Algrithm of Scanning Line Filling in Polygon Area |
| |
Affiliation: | WEI Hong - chun, PENG Xiao - li ( Computer Science Department of Sichuan University of Arts and Science, Dazhou Sichuan 635000, China) |
| |
Abstract: | In CAD System, filling something in the closed polygon is always needed. The algorithm of Area filling is very impor- tant to a well functional CAD System. At the same time, this algorithm is basic in Computer Graphics. The problem of complicat- ed area filling can be resoled by simply connected polygon. This paper analyzes the filling of complicated polygon, from the fol- lowing aspects : principle of filling region based on scanning line, the design of data structure, the algorithm implementation. |
| |
Keywords: | polygon active edge table filling record |
本文献已被 维普 等数据库收录! |
|