摘要
A region-growing method for reconstructing triangulated surfaces from massive unorganized points is presented. To save memory space, a ring data structure is adopted to build connections between points and triangulated surfaces. The data-structure allows the efficient retrieval of all neighboring vertices and triangles of a given vertice, To narrow the search range of adjacent points and avoid tuangle intersection, an influence area is defined for each active-edge, In the region-growing process of triangulated surfaces, a minimum-edge-angle-product algorithm is put forward to select an appropriate point to form a new triangle for an active edge. Results indicate that the presented method has high efficiency and needs less memory space, optimized triangulated surfaces with reliable topological quality can be obtained after triangulation,
A region-growing method for reconstructing triangulated surfaces from massive unorganized points is presented. To save memory space, a ring data structure is adopted to build connections between points and triangulated surfaces. The data-structure allows the efficient retrieval of all neighboring vertices and triangles of a given vertice, To narrow the search range of adjacent points and avoid tuangle intersection, an influence area is defined for each active-edge, In the region-growing process of triangulated surfaces, a minimum-edge-angle-product algorithm is put forward to select an appropriate point to form a new triangle for an active edge. Results indicate that the presented method has high efficiency and needs less memory space, optimized triangulated surfaces with reliable topological quality can be obtained after triangulation,
