Polytope approximation and the Mahler volume
From MaRDI portal
Publication:5743375
zbMATH Open1422.68240MaRDI QIDQ5743375FDOQ5743375
Authors: Sunil Arya, David M. Mount, Guilherme D. Da Fonseca 
Publication date: 10 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=2095119
Recommendations
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55)
Cites Work
- New volume ratio properties for convex symmetric bodies in \({\mathbb{R}}^ n\)
- Computational geometry. Algorithms and applications.
- Separation and approximation of polyhedral objects
- Building triangulations using \({\epsilon}\)-nets
- From the Mahler conjecture to Gauss linking integrals
- Title not available (Why is that?)
- Approximation of general smooth convex bodies
- Simultaneous inner and outer approximation of shapes
- Algorithms for polytope covering and approximation
- The convergence rate of the sandwich algorithm for approximating convex functions
- Polyhedral approximation of smooth convex bodies
- Approximation of convex sets by polytopes
- On ray shooting in convex polytopes
- Reporting points in halfspaces
- Linear Optimization Queries
- Title not available (Why is that?)
- Linear programming queries revisited
- Optimal partition trees
- The approximation of convex sets by polyhedra
- Asymptotic estimates for best and stepwise approximation of convex bodies II
- Metric entropy of some classes of sets with differentiable boundaries
- Polygonal approximation of plane convex bodies
- Space-time tradeoffs for approximate nearest neighbor searching
- Approximation by polygons and polyhedra
- EFFICIENT APPROXIMATION OF CONVEX POLYGONS
- Approximate polytope membership queries
Cited In (13)
- Economical convex coverings and applications
- Approximate polytope membership queries
- Economical Delone sets for approximating convex bodies
- Approximate convex intersection detection with applications to width and Minkowski sums
- Optimal approximate polytope membership
- Approximate polytope membership queries
- Conic nearest neighbor queries and approximate Voronoi diagrams
- Polytope membership in high dimension
- Optimal area-sensitive bounds for polytope approximation
- On the combinatorial complexity of approximating polytopes
- On the combinatorial complexity of approximating polytopes
- Floating body, illumination body, and polytopal approximation
- Volume function and Mahler measure of exact polynomials
This page was built for publication: Polytope approximation and the Mahler volume
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5743375)
