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)
The pleasures of “perp dot” products
Graphics gems IV
Isosurface extraction using particle systems
VIS '97 Proceedings of the 8th conference on Visualization '97
A new Voronoi-based surface reconstruction algorithm
Proceedings of the 25th annual conference on Computer graphics and interactive techniques
Surface reconstruction with anisotropic density-scaled alpha shapes
Proceedings of the conference on Visualization '98
Twinned meshes for dynamic triangulation of implicit surfaces
GI '07 Proceedings of Graphics Interface 2007
Fan clouds: an alternative to meshes
Proceedings of the 11th international conference on Theoretical foundations of computer vision
Regular and non-regular point sets: Properties and reconstruction
Computational Geometry: Theory and Applications
GPU local triangulation: an interpolating surface reconstruction algorithm
EuroVis'08 Proceedings of the 10th Joint Eurographics / IEEE - VGTC conference on Visualization
| Hi-index | 0.00 |
Many applications produce three-dimensional points that must be further processed to generate a surface. Surface reconstruction algorithms that start with a set of unorganized points are extremely time-consuming. Sometimes, however, points are generated such that there is additional information available to the reconstruction algorithm. We present Spiraling Edge, a specialized algorithm for surface reconstruction that is three orders of magnitude faster than algorithms for the general case. In addition to sample point locations, our algorithm starts with normal information and knowledge of each point's neighbors. Our algorithm produces a localized approximation to the surface by creating a star-shaped triangulation between a point and a subset of its nearest neighbors. This surface patch is extended by locally triangulating each of the points along the edge of the patch. As each edge point is triangulated, it is removed from the edge and new edge points along the patch's edge are inserted in its place. The updated edge spirals out over the surface until the edge encounters a surface boundary and stops growing in that direction, or until the edge reduces to a small hole that is filled by the final triangle.