Research On The Algorithm Of Mesh Generation And Optimization For Scattered Point Clouds Based On Slicing Data

The mesh generation and optimization for scattered point cloud is deeply studied, and an algorithm of mesh generation and optimization based on slicing data is proposed, which can express information of model exactly with less triangular facets, and has significance for the development efficiency of product. The main research contents and achievements are as follows:1) The spatial index structure of scattered point cloud and triangular mesh is proposed based on the R*-tree, in which the node splitting and re-insertion algorithms of R*-tree are improved, and the R*-tree is adjusted at last. Experiments show that the spacial index structure of point cloud and triangular mesh based on the improved R*-tree can improve the efficiency of spatial quering and the utilization of storage space.2) The algorithm of auto-slicing for scattered point cloud is proposed, in which, the slicing position are computered according to the distribution of leaf-nodes' MBR in spatial index structure, then the neighbor points of slice is obtained with depth-first-travelling and be partited to two parts, connect the two parts' points and intersect with slicing plane to get slicing points, then the auto-slicing of scattered point cloud is realized. This algorithm can improve the obtaining efficiency and precision of slicing points.3) The algorithm of mesh generation based on slicing points is proposed, which has two steps: first, the scattered point cloud is sliced to get slicing points; second, the slicing points of neighbor slicing layer are connected to generate triangular mesh. The algorithm can reduce the points in the process of slicing, and improve the efficiency of mesh generation. At last the error analysis method for triangular mesh is proposed to meet the projects.4) The self-adaptive subdivision algorithm for triangular meshes is proposed, which includes three steps: first, the spatial index structure of triangular meshes is established; second, the topological adjacent triangular facets of target facet is obtained based on the structure and its curvature is computed; third, the facets with larger curvature are subdivided and the flat facets are not subdivided, then algorithm is realized, and which is proved that it can improve smoothness of triangular mesh and the efficiency of subdivision.