Visibility with multiple diffuse reflections
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4065813 (Why is no real title available?)
- A linear algorithm for computing the visibility polygon from a point
- A linear time algorithm for minimum link paths inside a simple polygon
- Algorithms for Reporting and Counting Geometric Intersections
- An \(O(n \log n)\) algorithm for computing a link center in a simple polygon
- Computing the link center of a simple polygon
- Computing the visibility polygon from a convex set and related problems
- Computing the visibility polygon from an edge
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Visibility of a simple polygon
- Visibility with multiple reflections
- Visibility with one reflection
Cited in
(8)- Visibility with one reflection
- Visibility with multiple reflections
- The Complexity of Diffuse Reflections in a Simple Polygon
- Algorithms for Computing Diffuse Reflection Paths in Polygons
- A linear worst-case lower bound on the number of holes inside regions visible due to multiple diffuse reflections
- Critical visibility and outward rays
- Diffuse reflection diameter in simple polygons
- Diffuse reflection diameter and radius for convex-quadrilateralizable polygons
This page was built for publication: Visibility with multiple diffuse reflections
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1392849)