基于扫描线的多面体隐藏线消除算法

Algorithms for hidden-lines removal of polyhedra on scan line

在多面体隐藏线消除算法中计算投影后二维线段的交点时,通常采用的是传统的线段求交算法.本文从提高其速度入手,将计算几何领域中新的研究成果即扫描线算法应用到线段求交算法中,代替传统的线段求交算法,并通过建立线段在空间位置上的连续关系,达到快速消除隐藏线的目的.

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 fleetlv.