Reconstruction Algorithm Of Surface Meshes Based On STL Files In Two-dimensional Manifolds

STL(stereo lithography)as a 3D scan data and rapid prototyping manufacturing de facto standards,which are widely used in entertainment,manufacturing and Internet and other fields.However,with the 3D model becoming more and more complicated,the amount of data is more and more large,from the STL file is difficult to quickly obtain a complete topology relationship and its existence of a large number of redundant information shortcomings,restricting the STL grid model for further optimization and application.To do this,grid reconstruction is required for the STL grid model.The STL file storage model information stores only the vertex coordinates of the triangle unit,does not store any topological relations,and stores the vertices in the triangular cells to store it repeatedly,resulting in excessive vertex redundancy.Not only occupy the storage space,more is in the reconstruction of the topology of the top of the vertex redundancy search comparison time-consuming,so remove the redundant vertex topology reconstruction must solve a key issue.In this paper,we have done a lot of research on the reconstruction of STL file grid at home and abroad.The more commonly used method is to remove the redundant vertices and reconstruct the topology.In the existing algorithm is usually used in the half-side structure for vertex reading,coupled with auxiliary data structure for topology reconstruction,with more auxiliary data structure with balanced binary tree,hash table and so on.According to the definition of the two-dimensional manifold,it can be seen that two triangular elements in the curved triangular mesh belonging to the two-dimensional manifold are only two triangular elements.The corresponding slice of the saturation point can only be a saturated slice.For a closed-form triangular mesh of a two-dimensional manifold,all vertices are saturated and all edges are internal.Therefore,this paper proposes a fast grid reconstruction method for STL triangular surface mesh model of two-dimensional manifold.In this paper,the algorithm is mainly used to construct the topological reconstruction of the surface mesh model of the two-dimensional manifold.It mainly uses the vertices to be saturated in the reconstruction process in order to reduce the number of vertexes that need to be compared,and improve the vertex with the correlation of STL file data Search and comparison efficiency.For non-closed surface grids,the algorithm can effectively extract the boundary information of the surface mesh model while improving the efficiency of surface mesh reconstruction.In addition,the reconstructed surface grid data file greatly reduces the storage space,and can effectively remove the redundant data without adding any auxiliary data structure.The experimental results show that the algorithm is efficient and robust.