基于STL文件的拓扑重构新方法

A novel method for the topological reconstruction based on STL files

通过对STL文件的分析和几种常用数据结构的比较,给出了一种层次环状数据结构,该结构是由快速排序顶点序列进行冗余顶点滤除,并建立顶点邻接表和三角面片邻接表而得到的。由于邻接表中存储的是点、面的索引号,从而提高了后续查找的效率,节省了存储空间。本方法已成功应用于虚拟牙齿矫正系统的开发,同时也适用于其它各种以STL为数据交换格式的系统。

A hierarchy and circularity of data structure was presented by analyzed STL files and compared a several of frequently used data structures. The structure acquired from redundancy vertex was filtered by vertex sequence of quick sort, and vertex adjacent list and triangle face adjacent list was established. The index number of vertex and facet are stored in the adjacent list of this structure. Therefore, the efficiency of following lookup and save memory has been greatly improved. The method was applied in virtual orthodontic treatment system and other system with STL begin data exchange format.