基于哈希表的STL文件拓扑关系快速重建算法

Fast Topological Reconstruction Algorithm for STL File Based on Hash Table

针对3D打印中因三维模型转换成STL文件而丢失其原有拓扑关系的问题,在分析STL文件信息存储特点的基础上,提出基于哈希表的STL文件拓扑关系快速重建算法。在读入每个三角形顶点坐标时,通过哈希表构建无冗余坐标信息的点表,同时在面表中记录该顶点的索引值;在所有三角形顶点都读取完成后,运用点表与面表中点索引值来获取每个三角形邻接面信息,进行快速拓扑关系重建。

In the field of 3D printing, while 3D models converted into STL file, its original topological relationship was lost. In order to solve this problem, a fast-topological reconstruction algorithm for STL file based on Hash Table was proposed after analyzing STL storage features. First, when the coordinates of the vertex were read, the vertex table without redundant vertex coordinates was established by hash table; meanwhile, the index value of the vertex was recorded in the facet table. After all triangles had been read,the fast-topological relation was reconstructed by obtaining the adjacent facet index value according the vertex table and the facet table.