Diffuse reflection diameter in simple polygons
From MaRDI portal
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 1424300 (Why is no real title available?)
- scientific article; zbMATH DE number 1424307 (Why is no real title available?)
- A linear time algorithm for minimum link paths inside a simple polygon
- A linear worst-case lower bound on the number of holes inside regions visible due to multiple diffuse reflections
- LOGARITHMIC-TIME LINK PATH QUERIES IN A SIMPLE POLYGON
- Polygonal Rooms Not Illuminable from Every Point
- The Complexity of Diffuse Reflections in a Simple Polygon
- Visibility Algorithms in the Plane
- Visibility with multiple diffuse reflections
- Visibility with multiple reflections
- Visibility with one reflection
Cited in
(6)- Algorithms for Computing Diffuse Reflection Paths in Polygons
- Reflective guarding a gallery
- Polygonal Rooms Not Illuminable from Every Point
- Diffuse reflection diameter and radius for convex-quadrilateralizable polygons
- ПОЛУТЕНЬ В ТЕПЛОВОЙ ДИФРАКЦИИ НА МНОГОУГОЛЬНИКЕ
- Modular Fibers and Illumination Problems
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)