The geometry of homothetic covering and illumination

DOI10.1007/978-3-319-78434-2_1zbMATH Open1432.52012arXiv1602.06040OpenAlexW2490745741MaRDI QIDQ1740468FDOQ1740468

Károly Bezdek, Muhammad Ali Khan

Publication date: 30 April 2019

Abstract: At a first glance, the problem of illuminating the boundary of a convex body by external light sources and the problem of covering a convex body by its smaller positive homothetic copies appear to be quite different. They are in fact two sides of the same coin and give rise to one of the important longstanding open problems in discrete geometry, namely, the Illumination Conjecture. In this paper, we survey the activity in the areas of discrete geometry, computational geometry and geometric analysis motivated by this conjecture. Special care is taken to include the recent advances that are not covered by the existing surveys. We also include some of our recent results related to these problems and describe two new approaches -- one conventional and the other computer-assisted -- to make progress on the illumination problem. Some open problems and conjectures are also presented.

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

zbMATH Keywords

covering indexcovering parameterillumination numberillumination parameterillumination conjectureX-ray number\(\epsilon \)-net of convex bodiescovering conjecturecylindrical covering parametersseparation conjectureX-ray conjecture

Mathematics Subject Classification ID

Inequalities and extremum problems involving convexity in convex geometry (52A40) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Other problems of combinatorial convexity (52A37) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)

Cited In (30)

• Covering functionals of cones and double cones
• HILBERT TRANSFORMS ALONG LIPSCHITZ DIRECTION FIELDS: A LACUNARY MODEL
• Covering a convex body vs. covering the set of its extreme points
• On the Hadwiger covering problem in low dimensions
• Covering functionals of convex polytopes
• Covering functionals of convex polytopes with few vertices
• On parallel packing and covering of squares and cubes
• Cube is a strict local maximizer for the illumination number
• On directional Whitney inequality
• Reconstruction of atomic measures from their halfspace depth
• Borsuk's problem, Boltyanski's illumination problem, and circumradius
• Estimations of covering functionals of simplices
• Partition bounded sets into sets having smaller diameters
• Covering convex hulls of compact convex sets with smaller homothetic copies
• On Boltyanski and Gohberg's partition conjecture
• Covering by homothets and illuminating convex bodies
• A New Bound for Hadwiger’s Covering Problem in \(\boldsymbol{\mathbb{E}}^3\)
• Online unit covering in Euclidean space
• On the illumination of a class of convex bodies
• Covering functionals of Minkowski sums and direct sums of convex bodies
• From spherical to Euclidean illumination
• Homothetic covering of convex hulls of compact convex sets
• Halfspace depth for general measures: the ray basis theorem and its consequences
• New covering and illumination results for a class of polytopes
• A branch-and-bound approach for estimating covering functionals of convex bodies
• On \(k\)-diametral point configurations in Minkowski spaces
• On the illumination of centrally symmetric cap bodies in small dimensions
• Improved bounds for Hadwiger's covering problem via thin-shell estimates
• Illuminating spiky balls and cap bodies
• Spherical coverings and X-raying convex bodies of constant width

This page was built for publication: The geometry of homothetic covering and illumination

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