基于相关遮蔽面的多面体隐线消除的快速算法

A Rapid Algorithm for Hidden Line Removal in Polyhedron Based on the Interrelated Cover-Surface

本文首先提出多面体的面凸度与相关遮蔽面的概念,然后给出相关遮蔽面的判定定理和判定算法,在此基础上提出多面体隐线消除的快速算法.该算法与目前的各种隐线消除算法相比,具有计算量小,消隐速度快且无需做深度比较等优点.

In this paper,first,the concept of the interrelated cover—surface and theconvexity of surface in polyhedron is proposed;then,the decision theorem and the de-cision algorithm for the interrelated cover—surface art given;finally,a rapidalgorithm for hidden line removal in polyhedron based on the interrelated cov- re—surface is presented.In the algorithm,the calculations are for less than those inothers,the speed of eliminating hidden lines is faster than others',and the calcula-tions of intersection are not necessary.