摘要
STL格式文件用三角网格面来描述实体模型,实际应用如逆向工程中需要建立三角形、边和顶点的邻接拓扑关系,其中查找并去除重复顶点是建立拓扑结构的关键。着重讨论拓扑关系构建过程中数据查找的3种方法:线性表、平衡二叉树和三轴分块排序,通过实测数据对这3种方法的性能进行了分析和比较。
STL formatted files describe the entity models by the method of using triangular grid surface , which is applied to reverse engineering about establishing the adjacent relation of the triangle, the edge and the vertex points .among which searching and removing duplicate vertex points is the key to establish topology structure. Focuses on the three methods of searching data during the process of establishing topology structure ： linear list, balance binary tree and three-axis partitioning sorting order. Via real testing data to analyse and compare the performance of three methods mentioned above.
出处
《现代计算机》
2009年第2期60-63,共4页
Modern Computer
关键词
STL文件
平衡二叉树
三轴分块排序
STL Files
Balance Binary Tree
Three-Axis Partitioning Sorting Order
