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
A volumetric method for building complex models from range images
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
MAPS: multiresolution adaptive parameterization of surfaces
Proceedings of the 25th annual conference on Computer graphics and interactive techniques
A new Voronoi-based surface reconstruction algorithm
Proceedings of the 25th annual conference on Computer graphics and interactive techniques
Multiresolution signal processing for meshes
Proceedings of the 26th annual conference on Computer graphics and interactive techniques
A simple algorithm for homeomorphic surface reconstruction
Proceedings of the sixteenth annual symposium on Computational geometry
The digital Michelangelo project: 3D scanning of large statues
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Proceedings of the sixth ACM symposium on Solid modeling and applications
Dual contouring of hermite data
Proceedings of the 29th annual conference on Computer graphics and interactive techniques
Modelling with implicit surfaces that interpolate
ACM Transactions on Graphics (TOG)
Proceedings of the conference on Visualization '01
The Ball-Pivoting Algorithm for Surface Reconstruction
IEEE Transactions on Visualization and Computer Graphics
Curvature-Dependent Triangulation of Implicit Surfaces
IEEE Computer Graphics and Applications
Multi-level partition of unity implicits
ACM SIGGRAPH 2003 Papers
Shape modeling with point-sampled geometry
ACM SIGGRAPH 2003 Papers
Provably good surface sampling and approximation
Proceedings of the 2003 Eurographics/ACM SIGGRAPH symposium on Geometry processing
Guaranteed Quality Triangulation of Molecular Skin Surfaces
VIS '04 Proceedings of the conference on Visualization '04
Spectral surface reconstruction from noisy point clouds
Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing
Robust moving least-squares fitting with sharp features
ACM SIGGRAPH 2005 Papers
Methods and Framework for Visualizing Higher-Order Finite Elements
IEEE Transactions on Visualization and Computer Graphics
High-Quality Extraction of Isosurfaces from Regular and Irregular Grids
IEEE Transactions on Visualization and Computer Graphics
SGP '06 Proceedings of the fourth Eurographics symposium on Geometry processing
A streaming algorithm for surface reconstruction
SGP '07 Proceedings of the fifth Eurographics symposium on Geometry processing
Efficient Surface Reconstruction using Generalized Coulomb Potentials
IEEE Transactions on Visualization and Computer Graphics
Computer Aided Geometric Design
On fast surface reconstruction methods for large and noisy point clouds
ICRA'09 Proceedings of the 2009 IEEE international conference on Robotics and Automation
SMI 2012: Full Consensus meshing
Computers and Graphics
Hardware-accelerated extraction and rendering of point set surfaces
EUROVIS'06 Proceedings of the Eighth Joint Eurographics / IEEE VGTC conference on Visualization
A survey of methods for moving least squares surfaces
SPBG'08 Proceedings of the Fifth Eurographics / IEEE VGTC conference on Point-Based Graphics
Fast extraction of high-quality crease surfaces for visual analysis
EuroVis'11 Proceedings of the 13th Eurographics / IEEE - VGTC conference on Visualization
An adaptive normal estimation method for scanned point clouds with sharp features
Computer-Aided Design
3D image modelling and specific treatments in orthodontics domain
Applied Bionics and Biomechanics
Hi-index | 0.00 |
We introduce an algorithm for constructing a high-quality triangulation directly from Point Set Surfaces. Our algorithm requires no intermediate representation and no post-processing of the output, and naturally handles noisy input data, typically in the form of a set of registered range scans. It creates a triangulation where triangle size respects the geometry of the surface rather than the sampling density of the range scans. Our technique does not require normal information, but still produces a consistent orientation of the triangles, assuming the sampled surface is an orientable two-manifold. Our work is based on using Moving Least-Squares (MLS) surfaces as the underlying representation. Our technique is a novel advancing front algorithm, that bounds the Hausdorff distance to within a user-specified limit. Specifically, we introduce a way of augmenting advancing front algorithms with global information, so that triangle size adapts gracefully even when there are large changes in surface curvature. Our results show that our technique generates high-quality triangulations where other techniques fail to reconstruct the correct surface due to irregular sampling on the point cloud, noise, registration artifacts, and underlying geometric features, such as regions with high curvature gradients.