Building triangulations using -nets
From MaRDI portal
Publication:2931397
DOI10.1145/1132516.1132564zbMATH Open1301.68238OpenAlexW2052967435MaRDI QIDQ2931397FDOQ2931397
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
Recommendations
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Computer-aided design (modeling of curves and surfaces) (65D17)
Cited In (15)
- Optimal triangulation of saddle surfaces
- Linear-size approximations to the Vietoris-Rips filtration
- Invariance under quasi-isometries of subcritical and supercritical behavior in the Boolean model of percolation
- Anisotropic quadrangulation
- Modeling time and topology for animation and visualization with examples on parametric geometry
- Stability and minimax optimality of tangential Delaunay complexes for manifold reconstruction
- Learning smooth shapes by probing
- An obstruction to Delaunay triangulations in Riemannian manifolds
- On the combinatorial complexity of approximating polytopes
- Construction of \(\epsilon\)-nets
- Orphan-free anisotropic Voronoi diagrams
- Triangulating smooth submanifolds with light scaffolding
- Economical Delone Sets for Approximating Convex Bodies
- Modified Delaunay empty sphere condition in the problem of approximation of the gradient
- Title not available (Why is that?)
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)