Combinatorial problems on the illumination of convex bodies
From MaRDI portal
Publication:1296951
DOI10.1007/s000100050074zbMath0937.52006MaRDI QIDQ1296951
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
52A40: Inequalities and extremum problems involving convexity in convex geometry
52A37: Other problems of combinatorial convexity
52-02: Research exposition (monographs, survey articles) pertaining to convex and discrete geometry
Related Items
Unnamed Item, Segments in ball packings, Generating a staircase starshaped set from a minimal collection of its subsets, A quantitative program for Hadwiger's covering conjecture, Separation in totally-sewn 4-polytopes with the decreasing universal edge property, Illuminating spindle convex bodies and minimizing the volume of spherical sets of constant width, 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, Asymmetry of convex polytopes and vertex index of symmetric convex bodies, Illuminating disjoint line segments in the plane, Directional end of a convex set: theory and applications., Linear semi-infinite programming theory: an updated survey, Convex solids whose point-source shadow-boundaries lie in hyperplanes, Ball and spindle convexity with respect to a convex body, On the vertex index of convex bodies, Generating the kernel of a staircase starshaped set from certain staircase convex subsets, A Helly-type theorem for intersections of orthogonally starshaped sets in \(\mathbb R^d\), Around Borsuk's hypothesis, Visibility and diameter maximization of convex bodies, Quantitative Illumination of Convex Bodies and Vertex Degrees of Geometric Steiner Minimal Trees, On the blocking number and the covering number of a convex body
