Journal of Computer Applications ›› 2014, Vol. 34 ›› Issue (9): 2720-2724.DOI: 10.11772/j.issn.1001-9081.2014.09.2716

Previous Articles     Next Articles

Fast topological reconstruction algorithm for a STL file

WANG Zengbo   

  1. Department of Mathematics and Computational Science, Hengyang Normal University, Hengyang Hunan 421002, China
  • Received:2014-03-31 Revised:2014-06-16 Online:2014-09-30 Published:2014-09-01
  • Contact: WANG Zengbo

STL格式文件的快速拓扑重建算法

王增波   

  1. 衡阳师范学院 数学与计算科学系,湖南 衡阳 421002
  • 通讯作者: 王增波
  • 作者简介: 
    王增波(1975-),男,湖南衡阳人,讲师,硕士,主要研究方向:计算机图形学、智能算法。

Abstract:

Because the lack of the necessary topological relation between graphic factors, through analyzing the STL (Stereolithographic) format file and reading it, and using the hash table as a lookup table, the topological relation among various elements of three-dimensional model is quickly created. Using the Hash table, this algorithm created the point table and the surface table for the elements, and realized the topological reconstruction. The time complexity of this algorithm is O(n), while the space complexity of this algorithm is O(3n+(4+m)f+m). Finally, the algorithm was compared with the direct algorithm and red-black tree algorithm through five examples, and the results show that the proposed algorithm costs less time and the model with 650 thousand triangular facets can be reconstructed within 2.3 seconds on PC.

摘要:

针对立体光刻(STL)文件所表示的图形要素之间缺乏必要的拓扑关系,对STL格式文件进行分析和读取,以哈希表作为查找表快速建立三维模型各要素间的拓扑关系,建立能表示要素关系的点表和面表,利用基于哈希表的拓扑重建算法实现了拓扑结构的快速建立, 算法时间复杂度仅为O(n), 空间复杂度为O(3n+(4+m)f+m)。最后,列举5个实例进行验证测试,实验结果显示,与直接算法和红黑树法相比,所提出的算法用时更少,在普通计算机上重建含有65万个三角面片模型的拓扑结构只需2.3s。

CLC Number: