Optimal volume-sensitive bounds for polytope approximation
From MaRDI portal
Cites work
- A Funk perspective on billiards, projective geometry and Mahler volume
- Approximating multiplicatively weighted Voronoi diagrams: efficient construction with linear size
- Approximation by polygons and polyhedra
- Approximation of convex sets by polytopes
- Approximation of general smooth convex bodies
- Better -dependencies for offline approximate nearest neighbor search, Euclidean minimum spanning trees, and -kernels
- Building triangulations using \({\epsilon}\)-nets
- Economical convex coverings and applications
- Economical Delone sets for approximating convex bodies
- Fine approximation of convex bodies by polytopes
- From the Mahler conjecture to Gauss linking integrals
- Geometric approximation algorithms
- How hard is half-space range searching?
- scientific article; zbMATH DE number 3140980 (Why is no real title available?)
- scientific article; zbMATH DE number 480235 (Why is no real title available?)
- scientific article; zbMATH DE number 236540 (Why is no real title available?)
- scientific article; zbMATH DE number 5019895 (Why is no real title available?)
- scientific article; zbMATH DE number 3229353 (Why is no real title available?)
- scientific article; zbMATH DE number 3052220 (Why is no real title available?)
- scientific article; zbMATH DE number 3058525 (Why is no real title available?)
- Inequalities between intrinsic volumes
- Learnability and the Vapnik-Chervonenkis dimension
- Metric entropy of some classes of sets with differentiable boundaries
- Near-optimal -kernel construction and related problems
- New volume ratio properties for convex symmetric bodies in \({\mathbb{R}}^ n\)
- Non-linear angle-sum relations for polyhedral cones and polytopes
- On the Blaschke-Santaló inequality
- Optimal approximate polytope membership
- Optimal area-sensitive bounds for polytope approximation
- Optimal Bound on the Combinatorial Complexity of Approximating Polytopes
- Perspectives on projective geometry. A guided tour through real and complex geometry
- Polar Means of Convex Bodies and a Dual to the Brunn-Minkowski Theorem
- Polygonal approximation of plane convex bodies
- Polyhedral approximation of smooth convex bodies
- Polytopal approximation of elongated convex bodies
- Random polytopes, convex bodies, and approximation
- Sampling in combinatorial and geometric set systems
- The approximation of convex sets by polyhedra
- The directions of the line segments and of the r ‐dimensional balls on the boundary of a convex body in Euclidean space
- The Hörmander proof of the Bourgain-Milman theorem
- The technique of \(M\)-regions and cap coverings: A survey
- Ueber die gerade Linie als kürzestes Verbindung zweier Punkte.
This page was built for publication: Optimal volume-sensitive bounds for polytope approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6878299)
