摘要
将梯形划分算法应用到线段求交算法中,代替传统的线段求交算法,并通过建立线段在空间位置上的连续关系,达到快速消除隐藏线的目的。
Apply trapezoid decomposition algorithm to counting segment intersection, instead of traditional algorithm of counting segment intersection. And through establishing continuous relations among segments in the space position, achive to eliminate hidden-lines lastly.
出处
《南京工业职业技术学院学报》
2005年第4期33-34,共2页
Journal of Nanjing Institute of Industry Technology
关键词
多面体
隐藏线消除
梯形划分
polyhedra
hidden-lines removal
trapezoid decomposition
