面向网格简化的STL拓扑信息快速重建算法

以STL模型为研究对象，针对网格简化要求的显式、完整拓扑关系，提出了一种快速构建拓扑信息的新算法．在优化选取拓扑信息构建顺序的基础上，一方面针对各种几何元素的特点选取有效的数据结构，在数据组织层次上保证顶点归并的效率和几何元素的检索效率；另一方面，充分利用顶点与其邻接点和邻接面的关系，将边归并的比较范围控制在顶点的邻域，并在全局遍历时选择数据规模最小的顶点．算法具备优良的时间效率性，提高了网格简化预处理的效率．

Fast Generation of the Topological Information in STL for Mesh Simplification

A novel method was proposed to rebuild an apparent and complete topological structure necessary for mesh simplification based on a STL model. The sequence of rebuilding the topological information for various geometric elements was determined. Then, appropriate data structures were selected for different element according to their characters to get high efficiency for both vertex equivalence testing and element searching. At the same time, the relation of a vertex and its neighboring vertices and neighboring faces was fully exploited to limit the field of comparison for edge equivalence testing, and a vertex was chosen for global traversal because of its minimum size. Finally, the efficiency of pre-handling of mesh simplification was improved efficiently.