Combinatorial problems on the illumination of convex bodies
DOI10.1007/S000100050074zbMATH Open0937.52006OpenAlexW2049798553MaRDI QIDQ1296951FDOQ1296951
Authors: Horst Martini, Valeriu Soltan 
Publication date: 7 June 2000
Published in: Aequationes Mathematicae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s000100050074
Recommendations
Inequalities and extremum problems involving convexity in convex geometry (52A40) Research exposition (monographs, survey articles) pertaining to convex and discrete geometry (52-02) Other problems of combinatorial convexity (52A37)
Cited In (50)
- New covering and illumination results for a class of polytopes
- Covering functionals of cones and double cones
- Asymmetry of convex polytopes and vertex index of symmetric convex bodies
- Generating the kernel of a staircase starshaped set from certain staircase convex subsets
- Covering a convex body vs. covering the set of its extreme points
- Directional end of a convex set: theory and applications.
- A quantitative program for Hadwiger's covering conjecture
- On the vertex index of convex bodies
- An upper bound on the \(k\)-modem illumination problem
- Characteristic properties of ellipsoids and convex quadrics
- Covering functionals of convex polytopes
- Quantitative Illumination of Convex Bodies and Vertex Degrees of Geometric Steiner Minimal Trees
- Covering the boundary of a convex body with its smaller homothetic copies
- Illumination of direct vector sums of convex bodies
- The geometry of homothetic covering and illumination
- Convex solids whose point-source shadow-boundaries lie in hyperplanes
- Covering functionals of convex polytopes with few vertices
- On the covering index of convex bodies
- Covering unit spheres and balls of normed spaces by smaller balls
- On the blocking number and the covering number of a convex body
- Illumination for Unions of Boxes in R d
- Illuminated caps of the unit spheres of Banach spaces and related inequalities
- On solution sets of information inequalities
- Borsuk's problem, Boltyanski's illumination problem, and circumradius
- Estimations of covering functionals of simplices
- Partition bounded sets into sets having smaller diameters
- Linear semi-infinite programming theory: an updated survey
- Illuminating and covering convex bodies
- On translative coverings of convex bodies
- Covering convex hulls of compact convex sets with smaller homothetic copies
- Covering by homothets and illuminating convex bodies
- Around Borsuk's hypothesis
- Illuminating spindle convex bodies and minimizing the volume of spherical sets of constant width
- Generating a staircase starshaped set from a minimal collection of its subsets
- A Helly-type theorem for intersections of orthogonally starshaped sets in \(\mathbb R^d\)
- A spiky ball
- Generating a staircase starshaped set and its kernel in \({{\mathbb R}^3}\) from certain staircase convex subsets
- Covering a set with homothets of a convex body
- Illumination complexes, \(\varDelta\)-zonotopes, and the polyhedral curtain theorem
- On the illumination of a class of convex bodies
- Illuminating disjoint line segments in the plane
- On weighted covering numbers and the Levi-Hadwiger conjecture
- Covering functionals of Minkowski sums and direct sums of convex bodies
- Ball and spindle convexity with respect to a convex body
- Segments in ball packings
- Starshaped sets
- Visibility and diameter maximization of convex bodies
- On covering functionals of convex bodies
- A branch-and-bound approach for estimating covering functionals of convex bodies
- Separation in totally-sewn 4-polytopes with the decreasing universal edge property
This page was built for publication: Combinatorial problems on the illumination of convex bodies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1296951)
