Tight cocone: a water-tight surface reconstructor
SM '03 Proceedings of the eighth ACM symposium on Solid modeling and applications
Reconstruction with Voronoi centered radial basis functions
SGP '06 Proceedings of the fourth Eurographics symposium on Geometry processing
Optimization-based approach for curve and surface reconstruction
Computer-Aided Design
Surface reconstruction from point clouds by transforming the medial scaffold
Computer Vision and Image Understanding
A heuristic approach to reconstruct triangle mesh from unorganized point cloud
FSKD'09 Proceedings of the 6th international conference on Fuzzy systems and knowledge discovery - Volume 5
Manifold reconstruction using tangential Delaunay complexes
Proceedings of the twenty-sixth annual symposium on Computational geometry
Journal of Computational Physics
A new mesh-growing algorithm for fast surface reconstruction
Computer-Aided Design
Reconstructing 3D compact sets
Computational Geometry: Theory and Applications
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
Visible neighborhood graph of point clouds
Graphical Models
A fast algorithm for approximate surface reconstruction from sampled points
Advances in Engineering Software
SMI 2013: Minimizing edge length to connect sparsely sampled unstructured point sets
Computers and Graphics
| Hi-index | 0.00 |
In this paper, we present a new greedy algorithm for surface reconstruction from unorganized point sets. Starting from a seed facet, a piecewise linear surface is grown by adding Delaunay triangles one by one. The most plausible triangles are added first and in such a way as to prevent the appearance of topological singularities. The output is thus guaranteed to be a piecewise linear orientable manifold, possibly with boundary. Experiments show that this method is very fast and achieves topologically correct reconstruction in most cases. Moreover, it can handle surfaces with complex topology, boundaries, and nonuniform sampling.