| 复杂区域的通用性填充算法研究 |
| |
| 引用本文： | 刘晓东,胡兵,李又生.复杂区域的通用性填充算法研究[J].华中科技大学学报(自然科学版),1997(6). |
| |
| 作者姓名： | 刘晓东 胡兵 李又生 |
| |
| 作者单位： | 激光技术与工程研究院 |
| |
| 摘 要： | 提出了一种对于复杂区域的快速填充算法，该算法利用复杂区域的连通性和有界性，建立有向环与封闭区域的对应关系，并提出有向环走向的判断准则．在此基础上，用水平射线切割有向环所形成的出入点对，实现对区域的填充．算法效率高，通用性强．
|
| 关 键 词： | 计算机图形学 填充算法 有向环 入点 出点 |
A General Algorithm for Filling a Complicated Region |
| |
| Liu Xiaodong Dept. of Electronics &
Information Eng.,HUST,Wuhan ,China.
Hu Bin Li Yousheng Zhu Yaoting.A General Algorithm for Filling a Complicated Region[J].JOURNAL OF HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY.NATURE SCIENCE,1997(6). |
| |
| Authors: | Liu Xiaodong Dept of Electronics &
Information Eng HUST Wuhan China
Hu Bin Li Yousheng Zhu Yaoting |
| |
| Institution: | Liu Xiaodong Dept. of Electronics &
Information Eng.,HUST,Wuhan 430074,China.
Hu Bin Li Yousheng Zhu Yaoting |
| |
| Abstract: | Based on the connectedness and boundedness of a
complicated region, a fast filling algorithm is proposed. The correspondence relationship between
the closed region and the directed loop is established, and a criterion for judging the direction of
the directed loop is presented. Horizontal rays are used to cut the loops to form pairs of in points
and out points, thus realizing the filling of region. The algorithm is proved to be efficient and with
good generality |
| |
| Keywords: | computer graphics filling algorithm directed loop in point out point |
| 本文献已被 CNKI 等数据库收录！ |
