Diffuse reflection diameter in simple polygons

DOI10.1016/j.dam.2015.04.025zbMath1339.52004arXiv1302.2271OpenAlexW1539989949MaRDI QIDQ299067

Sarah M. Cannon, Eli Fox-Epstein, Gill Barequet, Andrew Winslow, Diane L. Souvaine, Csaba D. Tóth, Benjamin J. Hescott

Publication date: 22 June 2016

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

illuminationart gallerylink distance

Mathematics Subject Classification ID

Convex sets in (2) dimensions (including convex curves) (52A10)

Related Items (2)

Reflective guarding a gallery ⋮ Diffuse reflection radius in a simple polygon

Cites Work

• Unnamed Item
• Unnamed Item
• Visibility with multiple reflections
• Visibility with one reflection
• Visibility with multiple diffuse reflections
• A linear worst-case lower bound on the number of holes inside regions visible due to multiple diffuse reflections
• A linear time algorithm for minimum link paths inside a simple polygon
• The Complexity of Diffuse Reflections in a Simple Polygon
• LOGARITHMIC-TIME LINK PATH QUERIES IN A SIMPLE POLYGON
• Polygonal Rooms Not Illuminable from Every Point
• Visibility Algorithms in the Plane

This page was built for publication: Diffuse reflection diameter in simple polygons