二维半多面体消隐快速算法
A FAST ALGORITHM TO THE HIDDEN LINE PROBLEM FOR 2.5D POLYHEDRA
-
摘要: 一般多面体的消隐,算法复杂,计算工作量大.但对于二维半多面体,则可利用其特点,使得消隐算法得到简化.本文就二维半多面体消隐进行了分析,提出了一种快速消隐算法.这种算法不用做深度测试,求交计算量也非常小.Abstract: Generally speaking,the calculation to hidden-line problem for polyhedra is complexity.But the caluclation for 2.5D polyhedra is easier to tackle by taking advantage of the feature of the 2.5D polyhedra.In this paper the hidden line problem for 2.5D polyhedra is discussed and a fast algorithm is given.With this algorithm the depth testing is not needed and the works for solving for points of intersection become much less.
下载: