Diffuse reflection diameter in simple polygons
From MaRDI portal
Publication:299067
DOI10.1016/J.DAM.2015.04.025zbMATH Open1339.52004arXiv1302.2271OpenAlexW1539989949MaRDI QIDQ299067FDOQ299067
Authors: Gill Barequet, Sarah Cannon, Eli Fox-Epstein, Diane L. Souvaine, Andrew Winslow, Csaba D. Tóth, Benjamin Hescott
Publication date: 22 June 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Abstract: We prove a conjecture of Aanjaneya, Bishnu, and Pal that the minimum number of diffuse reflections sufficient to illuminate the interior of any simple polygon with walls from any interior point light source is . Light reflecting diffusely leaves a surface in all directions, rather than at an identical angle as with specular reflections.
Full work available at URL: https://arxiv.org/abs/1302.2271
Recommendations
Cites Work
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Visibility Algorithms in the Plane
Cited In (5)
This page was built for publication: Diffuse reflection diameter in simple polygons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q299067)