An algorithm for approximate closest-point queries
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Delaunay triangulations and Voronoi diagrams for Riemannian manifolds
Proceedings of the sixteenth annual symposium on Computational geometry
Optimal triangulation and quadric-based surface simplification
Computational Geometry: Theory and Applications - Special issue on multi-resolution modelling and 3D geometry compression
Local search heuristic for k-median and facility location problems
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Variational shape approximation
ACM SIGGRAPH 2004 Papers
The power crust, unions of balls, and the medial axis transform
Computational Geometry: Theory and Applications
Learning smooth shapes by probing
Computational Geometry: Theory and Applications
Tighter bounds for random projections of manifolds
Proceedings of the twenty-fourth annual symposium on Computational geometry
Modeling time and topology for animation and visualization with examples on parametric geometry
Theoretical Computer Science
Curvature-aware adaptive re-sampling for point-sampled geometry
Computer-Aided Design
Proceedings of the 14th ACM Symposium on Solid and Physical Modeling
Geodesic Methods in Computer Vision and Graphics
Foundations and Trends® in Computer Graphics and Vision
Approximate polytope membership queries
Proceedings of the forty-third annual ACM symposium on Theory of computing
Computer Aided Geometric Design
Polytope approximation and the Mahler volume
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Duals of orphan-free anisotropic voronoi diagrams are embedded meshes
Proceedings of the twenty-eighth annual symposium on Computational geometry
Linear-size approximations to the vietoris-rips filtration
Proceedings of the twenty-eighth annual symposium on Computational geometry
Optimal area-sensitive bounds for polytope approximation
Proceedings of the twenty-eighth annual symposium on Computational geometry
A fast algorithm for well-spaced points and approximate delaunay graphs
Proceedings of the twenty-ninth annual symposium on Computational geometry
| Hi-index | 0.00 |
This work addresses the problem of approximating a manifold by a simplicial mesh, and the related problem of building triangulations for the purpose of piecewise-linear approximation of functions. It has long been understood that the vertices of such meshes or triangulations should be "well-distributed," or satisfy certain "sampling conditions." This work clarifies and extends some algorithms for finding such well-distributed vertices, by showing that they can be regarded as finding ε-nets or Delone sets in appropriate metric spaces. In some cases where such Delone properties were already understood, such as for meshes to approximate smooth manifolds that bound convex bodies, the upper and lower bound results are extended to more general manifolds; in particular, under some general conditions, the minimum Hausdorff distance for a mesh with n simplices to a d-manifold M is Θ((∫M√|κ(x)|/n)2/d) as n ⋺ ∞, where κ(x) is the Gaussian curvature at point x ∈ M. We also relate these constructions to Dudley's approximation scheme for convex bodies, which can be interpreted as involving an ε-net in a metric space whose distance function depends on surface normals.