Building triangulations using -nets
From MaRDI portal
Publication:2931397
Recommendations
Cited in
(15)- Stability and minimax optimality of tangential Delaunay complexes for manifold reconstruction
- On the combinatorial complexity of approximating polytopes
- Optimal triangulation of saddle surfaces
- An obstruction to Delaunay triangulations in Riemannian manifolds
- Invariance under quasi-isometries of subcritical and supercritical behavior in the Boolean model of percolation
- Modified Delaunay empty sphere condition in the problem of approximation of the gradient
- Anisotropic quadrangulation
- Economical Delone sets for approximating convex bodies
- Polytope approximation and the Mahler volume
- Orphan-free anisotropic Voronoi diagrams
- Triangulating smooth submanifolds with light scaffolding
- Optimal volume-sensitive bounds for polytope approximation
- Learning smooth shapes by probing
- Construction of \(\epsilon\)-nets
- Modeling time and topology for animation and visualization with examples on parametric geometry
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)