Building triangulations using ε-nets
From MaRDI portal
Publication:2931397
DOI10.1145/1132516.1132564zbMath1301.68238OpenAlexW2052967435MaRDI QIDQ2931397
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
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Computer-aided design (modeling of curves and surfaces) (65D17)
Related Items
Invariance under quasi-isometries of subcritical and supercritical behavior in the Boolean model of percolation ⋮ Stability and minimax optimality of tangential Delaunay complexes for manifold reconstruction ⋮ Linear-size approximations to the Vietoris-Rips filtration ⋮ Learning smooth shapes by probing ⋮ On the combinatorial complexity of approximating polytopes ⋮ Anisotropic quadrangulation ⋮ Optimal triangulation of saddle surfaces ⋮ An obstruction to Delaunay triangulations in Riemannian manifolds ⋮ Orphan-free anisotropic Voronoi diagrams ⋮ Triangulating smooth submanifolds with light scaffolding ⋮ Modeling time and topology for animation and visualization with examples on parametric geometry ⋮ Economical Delone Sets for Approximating Convex Bodies ⋮ Unnamed Item
