Surface reconstruction from unorganized points
SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
Topology representing networks
Neural Networks
Journal of the ACM (JACM)
Reconstruction and representation of 3D objects with radial basis functions
Proceedings of the 28th annual conference on Computer graphics and interactive techniques
The Ball-Pivoting Algorithm for Surface Reconstruction
IEEE Transactions on Visualization and Computer Graphics
Complexity of the delaunay triangulation of points on surfaces the smooth case
Proceedings of the nineteenth annual symposium on Computational geometry
Fast Surface Reconstruction Using the Level Set Method
VLSM '01 Proceedings of the IEEE Workshop on Variational and Level Set Methods (VLSM'01)
Manifold reconstruction from point samples
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Topology guaranteeing manifold reconstruction using distance function to noisy data
Proceedings of the twenty-second annual symposium on Computational geometry
A sampling theory for compact sets in Euclidean space
Proceedings of the twenty-second annual symposium on Computational geometry
Manifold reconstruction in arbitrary dimensions using witness complexes
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Reconstruction using witness complexes
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Complexity of Delaunay triangulation for points on lower-dimensional polyhedra
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Finding the Homology of Submanifolds with High Confidence from Random Samples
Discrete & Computational Geometry
Topological estimation using witness complexes
SPBG'04 Proceedings of the First Eurographics conference on Point-Based Graphics
Manifold reconstruction in arbitrary dimensions using witness complexes
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Geodesic Delaunay triangulation and witness complex in the plane
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Towards persistence-based reconstruction in euclidean spaces
Proceedings of the twenty-fourth annual symposium on Computational geometry
A growing self-organizing network for reconstructing curves and surfaces
IJCNN'09 Proceedings of the 2009 international joint conference on Neural Networks
Geodesic delaunay triangulations in bounded planar domains
ACM Transactions on Algorithms (TALG)
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
| Hi-index | 0.00 |
The main result of this paper is an extension of de Silva's Weak Delaunay Theorem to smoothly embedded curves and surfaces in Euclidean space. Assuming a sufficiently fine sampling, we prove that i + 1 points in the sample span an i-simplex in the restricted Delaunay triangulation iff every subset of the i + 1 points has a weak witness.