Marching cubes: A high resolution 3D surface construction algorithm
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
Surface reconstruction from unorganized points
SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
The Ball-Pivoting Algorithm for Surface Reconstruction
IEEE Transactions on Visualization and Computer Graphics
Computing and Rendering Point Set Surfaces
IEEE Transactions on Visualization and Computer Graphics
Dual Marching Cubes: Primal Contouring of Dual Grids
PG '04 Proceedings of the Computer Graphics and Applications, 12th Pacific Conference
Robust moving least-squares fitting with sharp features
ACM SIGGRAPH 2005 Papers
Curve and Surface Reconstruction: Algorithms with Mathematical Analysis (Cambridge Monographs on Applied and Computational Mathematics)
Multi-level partition of unity implicits
SIGGRAPH '05 ACM SIGGRAPH 2005 Courses
Poisson surface reconstruction
SGP '06 Proceedings of the fourth Eurographics symposium on Geometry processing
Voronoi-based variational reconstruction of unoriented point sets
SGP '07 Proceedings of the fifth Eurographics symposium on Geometry processing
Streaming surface reconstruction using wavelets
SGP '08 Proceedings of the Symposium on Geometry Processing
Smooth surface reconstruction via natural neighbour interpolation of distance functions
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 |
We present a new algorithm to reconstruct approximating watertight surfaces from finite oriented point clouds. The Convex Hull (CH) of an arbitrary set of points, constructed as the intersection of all the supporting linear half spaces, is a piecewise linear watertight surface, but usually a poor approximation of the sampled surface. We introduce the Non-Convex Hull (NCH) of an oriented point cloud as the intersection of complementary supporting spherical half spaces; one per point. The boundary surface of this set is a piecewise quadratic interpolating surface, which can also be described as the zero level set of the NCH Signed Distance function. We evaluate the NCH Signed Distance function on the vertices of a volumetric mesh, regular or adaptive, and generate an approximating polygonal mesh for the NCH Surface using an isosurface algorithm. Despite its simplicity, this simple algorithm produces high quality polygon meshes competitive with those generated by state-of-the-art algorithms. The relation to the Medial Axis Transform is described.