Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
The quickhull algorithm for convex hulls
ACM Transactions on Mathematical Software (TOMS)
The Ball-Pivoting Algorithm for Surface Reconstruction
IEEE Transactions on Visualization and Computer Graphics
k-means++: the advantages of careful seeding
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Streaming surface reconstruction using wavelets
SGP '08 Proceedings of the Symposium on Geometry Processing
The power crust, unions of balls, and the medial axis transform
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
Several methods (discrete and continuous) for surface reconstruction have been proposed over the past years. Convex hull is one of them, which is the minimal convex envelope for a set of points X in a real vector space V. We present a method to 3D surface reconstruction which refines the convex hull by means of a peeling process with an adaptive radius. Tests with points of different objects, some of them from the AimatShape Project, were carried out, showing a better approximation than the one using traditional convex hull, and a little reduction in number of points used and computer time elapsed.