Algorithms for Computing Diffuse Reflection Paths in Polygons
From MaRDI portal
Publication:3605484
DOI10.1007/978-3-642-00202-1_5zbMath1211.68467OpenAlexW1588543750MaRDI QIDQ3605484
Anil Maheshwari, Swami Sarvattomananda, Partha P. Goswami, Subir Kumar Ghosh, Sudebkumar Prasant Pal, Subhas C. Nandy
Publication date: 24 February 2009
Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-00202-1_5
Related Items (2)
Diffuse reflection diameter and radius for convex-quadrilateralizable polygons ⋮ Diffuse reflection radius in a simple polygon
Cites Work
- Unnamed Item
- An optimal visibility graph algorithm for triangulated simple polygons
- Triangulating a simple polygon in linear time
- Minimum-link paths among obstacles in the plane
- Visibility with multiple reflections
- Ray shooting in polygons using geodesic triangulations
- The vertex-edge visibility graph of a polygon
- 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
- Optimal shortest path queries in a simple polygon
- Euclidean shortest paths in the presence of rectilinear barriers
- The Complexity of Diffuse Reflections in a Simple Polygon
- An Output-Sensitive Algorithm for Computing Visibility Graphs
- Polygonal Rooms Not Illuminable from Every Point
- Visibility Algorithms in the Plane
- Computing the visibility polygon from a convex set and related problems
This page was built for publication: Algorithms for Computing Diffuse Reflection Paths in Polygons
