基于哈希表的STL面片冗余顶点快速滤除算法

Algorithm for fast filtering redundancy vertex in STL solid based on Hashtable

为了滤除STL面片数据中的冗余顶点 ,提出了基于哈希表的快速算法 ,使用链地址法处理冲突 ,根据顶点坐标设计高效哈希函数 ,直接滤除冗余顶点 ,从而提高运行效率 ,节省存储空间 .经测试验证 ,该算法效率远远高于三轴分块排序算法 .本算法已经成功应用于华塑CAE系统 。

An algorithm for fast filtering redundancy vertex in STL solid was discussed based on Hashtable. The link-address method was used to solve collision. The hash function was designed with vertex coordinates. The redundancy vertex was filtered to improve efficiency and save memory greatly. The efficiency of this algorithm was much better than three axes sorting algorithm by cases testing. The algorithm was applied in HSCAE system and other systems with STL being data exchange format.