Building triangulations using -nets

DOI10.1145/1132516.1132564MaRDI QIDQ2931397zbMATHOpenAlexFDO

Authors Kenneth L. Clarkson

Publication date 25 November 2014

Published in Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1132516.1132564

zbMATH Keywords

manifoldsDelone setscurvaturemeshes

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Computer-aided design (modeling of curves and surfaces) (65D17)

Recommendations

• Provably good sampling and meshing of surfaces
• Delaunay triangulation of manifolds
• The Delaunay triangulation for multidimensional surfaces and its approximative properties
• Triangulating smooth submanifolds with light scaffolding
• scientific article; zbMATH DE number 1786513

Cited in

(14)

• Orphan-free anisotropic Voronoi diagrams
• Invariance under quasi-isometries of subcritical and supercritical behavior in the Boolean model of percolation
• Modeling time and topology for animation and visualization with examples on parametric geometry
• Optimal triangulation of saddle surfaces
• Polytope approximation and the Mahler volume
• Anisotropic quadrangulation
• Stability and minimax optimality of tangential Delaunay complexes for manifold reconstruction
• On the combinatorial complexity of approximating polytopes
• Learning smooth shapes by probing
• Modified Delaunay empty sphere condition in the problem of approximation of the gradient
• An obstruction to Delaunay triangulations in Riemannian manifolds
• Economical Delone sets for approximating convex bodies
• Triangulating smooth submanifolds with light scaffolding
• Construction of \(\epsilon\)-nets

This page was built for publication: Building triangulations using \({\epsilon}\)-nets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2931397)