Surface reconstruction from unorganized points
SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
Three-dimensional alpha shapes
VVS '92 Proceedings of the 1992 workshop on Volume visualization
Boundaries through scattered points of unknown density
Graphical Models and Image Processing
A new and simple algorithm for quality 2-dimensional mesh generation
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
A simple algorithm for homeomorphic surface reconstruction
Proceedings of the sixteenth annual symposium on Computational geometry
Geometric structures for three-dimensional shape representation
ACM Transactions on Graphics (TOG)
Smooth-surface reconstruction in near-linear time
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Surface reconstruction using umbrella filters
Computational Geometry: Theory and Applications - Special issue on: Sixteenth European Workshop on Computational Geometry (EUROCG-2000)
The Ball-Pivoting Algorithm for Surface Reconstruction
IEEE Transactions on Visualization and Computer Graphics
The flow complex: a data structure for geometric modeling
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
An Algorithm to Triangulate Surfaces in 3D Using Unorganised Point Clouds
Geometric Modelling
Tight cocone: a water-tight surface reconstructor
SM '03 Proceedings of the eighth ACM symposium on Solid modeling and applications
A geometric convection approach of 3-D reconstruction
Proceedings of the 2003 Eurographics/ACM SIGGRAPH symposium on Geometry processing
Provable surface reconstruction from noisy samples
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
A greedy Delaunay-based surface reconstruction algorithm
The Visual Computer: International Journal of Computer Graphics
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Poisson surface reconstruction
SGP '06 Proceedings of the fourth Eurographics symposium on Geometry processing
Geometric and topological guarantees for the WRAP reconstruction algorithm
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Reconstruction Using Witness Complexes
Discrete & Computational Geometry
Optimization-based approach for curve and surface reconstruction
Computer-Aided Design
Provable surface reconstruction from noisy samples
Computational Geometry: Theory and Applications
Manifold homotopy via the flow complex
SGP '09 Proceedings of the Symposium on Geometry Processing
Interpolating an unorganized 2D point cloud with a single closed shape
Computer-Aided Design
Regular and non-regular point sets: Properties and reconstruction
Computational Geometry: Theory and Applications
The power crust, unions of balls, and the medial axis transform
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
Most methods for interpolating unstructured point clouds handle densely sampled point sets quite well but get into trouble when the point set contains regions with much sparser sampling, a situation often encountered in practice. In this paper, we present a new method that provides a better interpolation of sparsely sampled features. We pose the surface construction problem as finding the triangle mesh which minimizes the sum of all triangles' longest edge. Since searching for matching umbrellas among sparsely sampled points to yield a closed manifold shape is a difficult problem, we introduce suitable heuristics. Our algorithm first connects the points by triangles chosen in order of their longest edge and with the requirement that all edges must have at least two incident triangles. This yields a closed non-manifold shape which we call the Boundary Complex. Then we transform it into a manifold triangulation using topological operations. We show that in practice, runtime is linear to that of the Delaunay triangulation of the points. Source code is available online.