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)
Guaranteed-quality mesh generation for curved surfaces
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Piecewise smooth surface reconstruction
SIGGRAPH '94 Proceedings of the 21st 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
Differential and topological properties of medial axis transforms
Graphical Models and Image Processing
Systems of coordinates associated with points scattered in the plane
Computer Aided Geometric Design
A-shapes of a finite point set
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
A triangulation-based object reconstruction method
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Improved incremental randomized Delaunay triangulation
Proceedings of the fourteenth annual symposium on Computational geometry
A new Voronoi-based surface reconstruction algorithm
Proceedings of the 25th annual conference on Computer graphics and interactive techniques
r-regular shape reconstruction from unorganized points
Computational Geometry: Theory and Applications - special issue on applied computational geometry
Curve reconstruction: connecting dots with good reason
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Curve reconstruction, the traveling salesman problem and Menger's theorem on length
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Geometric structures for three-dimensional shape representation
ACM Transactions on Graphics (TOG)
Introduction to Implicit Surfaces
Introduction to Implicit Surfaces
The Ball-Pivoting Algorithm for Surface Reconstruction
IEEE Transactions on Visualization and Computer Graphics
On the shape of a set of points in the plane
IEEE Transactions on Information Theory
Natural neighbor coordinates of points on a surface
Computational Geometry: Theory and Applications
Complexity of the delaunay triangulation of points on surfaces the smooth case
Proceedings of the nineteenth annual symposium on Computational geometry
ACM SIGGRAPH 2003 Papers
A new bivariate rational interpolation based on function values
Information Sciences—Informatics and Computer Science: An International Journal
An integrating approach to meshing scattered point data
Proceedings of the 2005 ACM symposium on Solid and physical modeling
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Provably good sampling and meshing of surfaces
Graphical Models - Solid modeling theory and applications
Medial axis approximation and unstable flow complex
Proceedings of the twenty-second annual symposium on Computational geometry
A composite approach to meshing scattered data
Graphical Models - Special issue on SPM 05
An effective condition for sampling surfaces with guarantees
SM '04 Proceedings of the ninth ACM symposium on Solid modeling and applications
An incremental algorithm for reconstruction of surfaces of arbitrary codimension
Computational Geometry: Theory and Applications
Bounded Property and Point Control of a Bivariate Rational Interpolating Surface
Computers & Mathematics with Applications
Interactive topology-aware surface reconstruction
ACM SIGGRAPH 2007 papers
Surface reconstruction from noisy point clouds
SGP '05 Proceedings of the third Eurographics symposium on Geometry processing
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
Geometric and topological guarantees for the WRAP reconstruction algorithm
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Automatic Order of Data Points in RE Using Neural Networks
IDEAL '08 Proceedings of the 9th International Conference on Intelligent Data Engineering and Automated Learning
From Segmented Images to Good Quality Meshes Using Delaunay Refinement
Emerging Trends in Visual Computing
Dynamic picking system for 3D seismic data: Design and evaluation
International Journal of Human-Computer Studies
Optimization-based approach for curve and surface reconstruction
Computer-Aided Design
Automatic sequence of 3D point data for surface fitting using neural networks
Computers and Industrial Engineering
On the normal vector estimation for point cloud data from smooth surfaces
Computer-Aided Design
Manifold homotopy via the flow complex
SGP '09 Proceedings of the Symposium on Geometry Processing
Optimal reconstruction might be hard
Proceedings of the twenty-sixth annual symposium on Computational geometry
Vietoris-rips complexes also provide topologically correct reconstructions of sampled shapes
Proceedings of the twenty-seventh annual symposium on Computational geometry
Reconstructing 3D compact sets
Computational Geometry: Theory and Applications
Applying natural neighbor coordinates for electromagnetic tracker calibration
ISCIS'06 Proceedings of the 21st international conference on Computer and Information Sciences
Feature-Preserving Reconstruction of Singular Surfaces
Computer Graphics Forum
Vietoris-Rips complexes also provide topologically correct reconstructions of sampled shapes
Computational Geometry: Theory and Applications
A benchmark for surface reconstruction
ACM Transactions on Graphics (TOG)
SIGGRAPH Asia 2013 Technical Briefs
| Hi-index | 0.00 |
We present an algorithm to reconstruct smooth surfaces of arbitrary topology from unorganised sample points and normals. The method uses natural neighbour interpolation, works in any dimension and accommodates non-uniform samples. The reconstructed surface interpolates the data points and is implicitly represented as the zero set of some pseudo-distance function. It can be meshed so as to satisfy a user-defined error bound, which makes the method especially relevant for small point sets. Experimental results are presented for surfaces in R^3.