Approximating a planar convex set using a sparse grid

DOI10.1016/J.IPL.2019.05.002MaRDI QIDQ2274483zbMATH OpenOpenAlexWikidataFDO

Authors Aditya Bhaskara, Antoine Vigneron

Publication date 20 September 2019

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2019.05.002

zbMATH Keywords

computational geometrydiscrepancypolygon approximation

Mathematics Subject Classification ID

Random convex sets and integral geometry (aspects of convex geometry) (52A22) Approximation by convex sets (52A27) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• scientific article; zbMATH DE number 4178824
• Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets
• Approximation Algorithms for the Minimum Convex Partition Problem
• Sparse convex hull coverage
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science

Cites work

• A Lower Bound for the Volume of Strictly Convex Bodies with many Boundary Lattice Points
• Approximating extent measures of points.
• Approximating the maximum overlap of polygons under translation
• Computational geometry. Algorithms and applications.
• Geometric discrepancy. An illustrated guide
• Hausdorff approximation of convex polygons
• Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets
• Metric entropy of some classes of sets with differentiable boundaries
• On the combinatorial complexity of approximating polytopes
• On the discrepancy of convex plane sets

Cited in

(7)

• On guaranteed estimates of the area of convex subsets of compact sets on the plane
• Sparse convex hull coverage
• Sparse approximation via generating point sets
• scientific article; zbMATH DE number 4119101 (Why is no real title available?)
• Sparse Approximation via Generating Point Sets
• Spreading points using gradient and tabu
• Approximating polyhedra with sparse inequalities

This page was built for publication: Approximating a planar convex set using a sparse grid

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