Algorithms for Computing Diffuse Reflection Paths in Polygons
From MaRDI portal
Publication:3605484
Recommendations
Cites work
- scientific article; zbMATH DE number 605056 (Why is no real title available?)
- A linear worst-case lower bound on the number of holes inside regions visible due to multiple diffuse reflections
- An Output-Sensitive Algorithm for Computing Visibility Graphs
- An optimal visibility graph algorithm for triangulated simple polygons
- Computing the visibility polygon from a convex set and related problems
- Euclidean shortest paths in the presence of rectilinear barriers
- Minimum-link paths among obstacles in the plane
- Optimal shortest path queries in a simple polygon
- Polygonal Rooms Not Illuminable from Every Point
- Ray shooting in polygons using geodesic triangulations
- The Complexity of Diffuse Reflections in a Simple Polygon
- The vertex-edge visibility graph of a polygon
- Triangulating a simple polygon in linear time
- Visibility Algorithms in the Plane
- Visibility with multiple diffuse reflections
- Visibility with multiple reflections
- Visibility with one reflection
Cited in
(3)
This page was built for publication: Algorithms for Computing Diffuse Reflection Paths in Polygons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3605484)