Economical Delone sets for approximating convex bodies

DOI10.4230/LIPICS.SWAT.2018.4MaRDI QIDQ5116467zbMATH OpenOpenAlexFDO

Authors Ahmed Abdelkader, David M. Mount

Publication date 25 August 2020

Full work available at URL https://dblp.uni-trier.de/db/conf/swat/swat2018.html#AbdelkaderM18

zbMATH Keywords

Delone setsHilbert geometryMacbeath regionsapproximate polytope membership

Mathematics Subject Classification ID

Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Approximation by convex sets (52A27) Metric spaces, metrizability (54E35)

Recommendations

• On the combinatorial complexity of approximating polytopes
• On the combinatorial complexity of approximating polytopes
• Fine approximation of convex bodies by polytopes
• Polytope approximation and the Mahler volume
• scientific article; zbMATH DE number 665688

Cites work

• scientific article; zbMATH DE number 1305422 (Why is no real title available?)
• scientific article; zbMATH DE number 1149836 (Why is no real title available?)
• scientific article; zbMATH DE number 6469222 (Why is no real title available?)
• A theorem on non-homogeneous lattices
• Approximate polytope membership queries
• Approximating extent measures of points.
• Approximation algorithms for convex hulls
• Building triangulations using \({\epsilon}\)-nets
• Convex bodies, economic cap coverings, random polytopes
• Fast Construction of Nets in Low-Dimensional Metrics and Their Applications
• Handbook of Hilbert geometry
• How hard is half-space range searching?
• Linear Optimization Queries
• Linear programming queries revisited
• Metric entropy of some classes of sets with differentiable boundaries
• Near-optimal -kernel construction and related problems
• On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension
• On balls in a Hilbert polygonal geometry
• On ray shooting in convex polytopes
• On the combinatorial complexity of approximating polytopes
• Optimal approximate polytope membership
• Output-sensitive results on convex hulls, extreme points, and related problems
• Polytope approximation and the Mahler volume
• Reporting points in halfspaces
• The directions of the line segments and of the r ‐dimensional balls on the boundary of a convex body in Euclidean space
• The technique of \(M\)-regions and cap coverings: A survey

Cited in

(6)

• Economical convex coverings and applications
• Approximate nearest-neighbor search for line segments
• Optimal volume-sensitive bounds for polytope approximation
• Covering convex bodies and the closest vector problem
• Delaunay triangulations in the Hilbert metric
• Ipelets for the convex polygonal geometry (media exposition)

This page was built for publication: Economical Delone sets for approximating convex bodies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5116467)