Surface reconstruction using region_growing and Gabriel graph

This paper presents a surface reconstruction algorithm from unorganized point sets based on region-growing and Gabriel. It begins with computing the Gabriel graph of the sampling point sets, and then performs a region growing process to ‘grow’ into a triangulated surface from the Gabriel structure. Compared with the traditional approach based on Delaunay and region-growing, the proposed algorithm requires only a subset of the Delaunary structure and needs no Voronoi information, so it is more efficient. Experimental results show that this method is robust and effective on handling surfaces with complex topology, boundaries, and even non-uniform sample points.