多面体拓扑信息的阵列算法

在计算机图形学中,拓扑信息与几何信息是相互关联的。著名的Euler公式是建立拓扑信息的依据。为节省存贮空间和提高执行速度,本文提出了阵列算法,它是一种统一处理多面体拓扑信息、隐藏线面、图形轮廓和体素造型的综合算法。特点在于:隐含拓扑信息;用顺道判可见法、免去深度检测来处理凹消隐问题;由于本算法是在投影后对顶点坐标进行处理的,因此便于同几何变换相联接。可望推出新型简化数据结构的图形软件系统。

ARRAY ALGORITHM FOR TOPOLOG1CAL INFORMATION OF POLYHEDRON

In computer graphics, the information of topology is related to that of geometry. The famous Euler formula is the basis for establishing the information of topology. Considering the importance of saving space and increasing the soeed of operation, the author has put foward, in the paper, the Array Algorithm,which is so comprehensive in actual use as to be capable of dealing with the information of topology, invisible lines and planes, the contours of figures and the voxel-formation, and is characterized by storing information of topology, dealing with the problem of dispelling concave hidden lines and planes through judging the visible or invisible lines and planes in a clockwise or counter-clockwise manner, and avoiding the survey of depth. As the treatment of the coordina value of the end point is performed after the projection, it is convenient to connect the geometry transpositions,and this algorithm will probably bring forth new graphic software systems of simple data structure.