| 基于扫描线的多面体隐藏线消除算法 |
| |
| 引用本文： | 杨静丽. 基于扫描线的多面体隐藏线消除算法[J]. 安徽大学学报(自然科学版), 2006, 30(5): 25-28 |
| |
| 作者姓名： | 杨静丽 |
| |
| 作者单位： | 南京工业职业技术学院,信息工程系,江苏,南京,210046 |
| |
| 摘 要： | 在多面体隐藏线消除算法中计算投影后二维线段的交点时,通常采用的是传统的线段求交算法.本文从提高其速度入手,将计算几何领域中新的研究成果即扫描线算法应用到线段求交算法中,代替传统的线段求交算法,并通过建立线段在空间位置上的连续关系,达到快速消除隐藏线的目的.
|
| 关 键 词： | 多面体 隐藏线消除 线段求交 可见性判断 |
| 文章编号： | 1000-2162（2006）05-0025-04 |
| 收稿时间： | 2006-03-02 |
| 修稿时间： | 2006-03-02 |
Algorithms for hidden-lines removal of polyhedra on scan line |
| |
| YANG Jing-li. Algorithms for hidden-lines removal of polyhedra on scan line[J]. Journal of Anhui University(Natural Sciences), 2006, 30(5): 25-28 |
| |
| Authors: | YANG Jing-li |
| |
| Affiliation: | Deparment of Information Technology, Nanjing Institute of Industry Technology, Nanjing 210046, China |
| |
| Abstract: | Counting segment intersection in algorithms for hidden-lines removal of polyhedra adopts traditional algorithms usually.In order to improve the speed of counting segment intersection,we apply scan line algorithm which is recent research production in computational geometry field to counting segment intersection,instead of traditional algorithm of counting segment intersection.And through establishing continuous relations among segments in the space position,it achieves to eliminate hidden-lines fleetly. |
| |
| Keywords: | polyhedra hidden-lines removal intersection of segments visibility test |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
