基于哈希表的STL格式文件拓扑重建的算法  

Algorithm of topological reconstruction for STL format file based on Hash table

作　　者：王彦云[1] 陈鸿[1] 谢明师[1] 杨凯祥 

机构地区：[1]中北大学仪器与电子学院,太原030051

出　　处：《现代制造工程》2015年第12期61-64,共4页Modern Manufacturing Engineering

摘　　要：针对STL文件所包含的三角面片之间缺乏必要的拓扑关系,在对STL格式文件进行分析和读取时,采用了基于哈希表的拓扑重建算法。首先,以哈希表作为查找表,查找每一个三角形的顶点并将冗余顶点去除;然后,建立1个包含所有不重复顶点的点表和包含所有三角形在点表中索引值的面表,通过建立的点表和面表快速地实现拓扑结构的重建,使其后续的切片效率大大提高。To solving the lack of topological relation between triangle patches in STL files,when reading and analysing the STL files,topology reconstruction algorithm based on Hash table was used in. Firstly,the Hash table was taking as look-up table to find vertexes of every triangle and remove the redundant vertexes. Secondly a point table contained all the no-repeat vertexes and a surface list contained all the index values of triangles in point table were established. Through the point table and surface list,the topological structure was reconstructed rapidly which extremely improved the efficient of follow-on slicing up.

关 键 词：STL文件 哈希表 去除冗余 拓扑重建 

分 类 号：TN301.6[电子电信—物理电子学]