Illuminating high-dimensional convex sets

DOI10.1007/BF01267636zbMath0838.52007OpenAlexW2124542296MaRDI QIDQ1900056

Bruno Gaujal, Jorge Urrutia, Eduardo Rivera-Campo, Joseph Zaks, Jurek Czyzowicz

Publication date: 17 October 1995

Published in: Geometriae Dedicata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01267636

zbMATH Keywords

convex polytopeilluminationconvex set

Mathematics Subject Classification ID

Other problems of combinatorial convexity (52A37) Variants of convex sets (star-shaped, ((m, n))-convex, etc.) (52A30)

Related Items (2)

Illuminating high-dimensional convex sets ⋮ Guarding curvilinear art galleries with edge or mobile guards via 2-dominance of triangulation graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complexity of d-dimensional Voronoi diagrams
• Arbitrarily large neighborly families of symmetric convex polytopes
• Guarding rectangular art galleries
• Illuminating high-dimensional convex sets
• Cutting disjoint disks by straight lines
• Illumination of convex discs

This page was built for publication: Illuminating high-dimensional convex sets