A convex cover for closed unit curves has area at least 0.1

DOI10.1016/j.disopt.2020.100608zbMath1506.52030arXiv2004.03063OpenAlexW3080316965MaRDI QIDQ2218649

Sittichoke Som-am, Bogdan Grechuk

Publication date: 15 January 2021

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2004.03063

zbMATH Keywords

convex hullclosed curvesworm problemconvex coverminimal-area cover

Mathematics Subject Classification ID

Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Length, area, volume and convex sets (aspects of convex geometry) (52A38) Convex sets in (2) dimensions (including convex curves) (52A10)

Related Items (3)

Universal convex covering problems under translations and discrete rotations ⋮ Viterbo's conjecture as a worm problem ⋮ A Convex Cover for Closed Unit Curves has Area at Least 0.0975

Cites Work

• Unnamed Item
• Unnamed Item
• Covers for closed curves of length two
• Problems, problems, problems
• An improved upper bound for Leo Moser's worm problem
• Boxes for curves of constant length
• Der zentralsymmetrische Kern und die zentralsymmetrische Hülle von konvexen Körpern
• LOWER BOUND FOR CONVEX HULL AREA AND UNIVERSAL COVER PROBLEMS
• Packing smooth curves inR^q
• A smaller cover for closed unit curves
• Minimal Covers for Closed Curves
• A LOWER BOUND FOR LEBESGUE'S UNIVERSAL COVER PROBLEM

This page was built for publication: A convex cover for closed unit curves has area at least 0.1