Diffuse reflection diameter and radius for convex-quadrilateralizable polygons
DOI10.1016/J.DAM.2012.12.020zbMATH Open1290.52002OpenAlexW2068488146MaRDI QIDQ2446331FDOQ2446331
Authors: Arindam Khan, Sudebkumar Prasant Pal, Mridul Aanjaneya, Arijit Bishnu, Subhas C. Nandy 
Publication date: 16 April 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2012.12.020
Recommendations
diametercombinatorial geometryradiusvisibilityilluminationdiffuse reflectionconvex-quadrilateralizable polygon
Cites Work
- Title not available (Why is that?)
- Computing the visibility polygon from a convex set and related problems
- Title not available (Why is that?)
- 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
- Polygonal Rooms Not Illuminable from Every Point
- Title not available (Why is that?)
- Visibility Algorithms in the Plane
- A combinatorial theorem in plane geometry
- Title not available (Why is that?)
- Computing the link center of a simple polygon
- An \(O(n\log n)\) algorithm for computing the link center of a simple polygon
- Algorithms for Computing Diffuse Reflection Paths in Polygons
- Title not available (Why is that?)
Cited In (4)
This page was built for publication: Diffuse reflection diameter and radius for convex-quadrilateralizable polygons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2446331)
