摘要
一般多面体的消隐，算法复杂，计算工作量大．但对于二维半多面体，则可利用其特点，使得消隐算法得到简化．本文就二维半多面体消隐进行了分析，提出了一种快速消隐算法．这种算法不用做深度测试，求交计算量也非常小．
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.
出处
《计算机辅助设计与图形学学报》
EI
CSCD
北大核心
1998年第3期216-220,共5页
Journal of Computer-Aided Design & Computer Graphics
关键词
二维多半面体
消隐
算法
D polyhedra,eliminating hidden line,algorithm
