Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
Surface reconstruction from unorganized points
SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
Three-dimensional alpha shapes
ACM Transactions on Graphics (TOG)
A volumetric method for building complex models from range images
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Improved incremental randomized Delaunay triangulation
Proceedings of the fourteenth annual symposium on Computational geometry
A new Voronoi-based surface reconstruction algorithm
Proceedings of the 25th annual conference on Computer graphics and interactive techniques
Triangulations in CGAL (extended abstract)
Proceedings of the sixteenth annual symposium on Computational geometry
Smooth surface reconstruction via natural neighbour interpolation of distance functions
Proceedings of the sixteenth annual symposium on Computational geometry
Geometric structures for three-dimensional shape representation
ACM Transactions on Graphics (TOG)
Proceedings of the sixth ACM symposium on Solid modeling and applications
Reconstruction and representation of 3D objects with radial basis functions
Proceedings of the 28th annual conference on Computer graphics and interactive techniques
The Ball-Pivoting Algorithm for Surface Reconstruction
IEEE Transactions on Visualization and Computer Graphics
Tight cocone: a water-tight surface reconstructor
SM '03 Proceedings of the eighth ACM symposium on Solid modeling and applications
Graph-Based Surface Reconstruction Using Structures in Scattered Point Sets
CGI '98 Proceedings of the Computer Graphics International 1998
Edge-Based Data Structures for Solid Modeling in Curved-Surface Environments
IEEE Computer Graphics and Applications
A polyhedron representation for computer vision
AFIPS '75 Proceedings of the May 19-22, 1975, national computer conference and exposition
A New Combinatorial Approach to Surface Reconstruction with Sharp Features
IEEE Transactions on Visualization and Computer Graphics
A new global accessibility algorithm for a polyhedral model with convex polygonal facets
Computer-Aided Design
A new interpolation method in mesh reconstruction from 3D point cloud
Proceedings of the 10th International Conference on Virtual Reality Continuum and Its Applications in Industry
SMI 2012: Full Consensus meshing
Computers and Graphics
Surface creation on unstructured point sets using neural networks
Computer-Aided Design
| Hi-index | 0.00 |
This paper presents a Delaunay-based region-growing (DBRG) surface reconstruction algorithm that holds the advantages of both Delaunay-based and region-growing approaches. The proposed DBRG algorithm takes a set of unorganized sample points from the boundary surface of a three-dimensional object and produces an orientable manifold triangulated model with a correct geometry and topology that is faithful to the original object. Compared with the traditional Delaunay-based approach, the DBRG algorithm requires only one-pass Delaunay computation and needs no Voronoi information because it improves the non-trivial triangle extraction by using a region-growing technique. Compared with the traditional region-growing methods, the proposed DBRG algorithm makes the surface reconstruction more systematic and robust because it inherits the structural characteristics of the Delaunay triangulation, which nicely complements the absence of geometric information in a set of unorganized points. The proposed DBRG algorithm is capable of handling surfaces with complex topology, boundaries, and even non-uniform sample points. Experimental results show that it is highly efficient compared with other existing algorithms.