System and method for converting disordered point cloud to triangular net based on adaptive flatness

Abstract

This invention relates to a system and a method for converting non-sequence spot-clouds into triangle griddings based on adaptive flatness, which carries out triangle analysis to spot-clouds in space directly by a non-sequence spot-cloud increment rebuilding algorithm based on adaptive flatness to structure a partial gridding ring from the initial central point based on the partial flat character of a curvature face and a Delaunary analysis rule of triangles and takes points on said gridding ring as the central point according to the generation sequence to structure the partial ring repeatedly to circulate in linearity and spread it to the entire spot set and get a topological structure finally so as to increase conversion velocity and reduce conversion time.

Description

technical field [0001] The invention relates to a system and method for converting disordered point clouds into triangular meshes based on adaptive flatness. Background technique [0002] The surface reconstruction of massive scattered point data is widely used in many fields such as mechanical product measurement and modeling, geographic information system and so on. Among them, the reconstruction of triangular meshes has been a hot research topic at home and abroad. Boissonnate first used 3D Delaunay-based tetrahedronization for interpolation grid construction, and Nina Amenta proposed a Crust-based tetrahedronization engraving algorithm, which theoretically ensures that the reconstructed mesh model is topologically consistent with the underlying geometric model. However, the grids constructed by such algorithms are all based on Delaunay tetrahedronization, and the time consumption is 0(n2), which is difficult to apply to large-scale data. Chen directly determines the mi...

AI Technical Summary

Problems solved by technology

This method first needs to project the three-dimensional data points to the two-dimensional plane, which leads to difficulties in processing closed surfaces or approximately closed surfaces. It is also difficult to find a suitable projection plane for more complex surfaces. Gopi and Crossno proposed a method based on local two-dimensional Dimensional Delaunay triangular mesh incremental construction algorithm, although these have achieved linear reconstruction of the mesh, but it is difficult to guarantee the mesh quality

Images