Diffuse reflection radius in a simple polygon
From MaRDI portal
Publication:727965
DOI10.1007/978-3-319-08783-2_21zbMath1352.68267arXiv1402.5303OpenAlexW1538189031MaRDI QIDQ727965
Eli Fox-Epstein, Csaba D. Tóth, Andrew Winslow
Publication date: 21 December 2016
Published in: Algorithmica, Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1402.5303
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maintaining visibility of a polygon with a moving point of view
- Diffuse reflection diameter in simple polygons
- Computing the geodesic center of a simple polygon
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Computing the link center of a simple polygon
- A Helly-type theorem for intersections of compact connected sets in the plane
- An \(O(n\log n)\) algorithm for computing the link center of a simple polygon
- Visibility queries and maintenance in simple polygons
- 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
- Efficient visibility queries in simple polygons
- A Helly-type theorem for simple polygons
- Weak visibility queries of line segments in simple polygons
- Diffuse reflection diameter and radius for convex-quadrilateralizable polygons
- A linear time algorithm for minimum link paths inside a simple polygon
- The Complexity of Diffuse Reflections in a Simple Polygon
- Algorithms for Computing Diffuse Reflection Paths in Polygons
- Some Unsolved Problems in Plane Geometry
- An Optimal Algorithm for Finding the Kernel of a Polygon
- Matrix Searching with the Shortest-Path Metric
- A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk
- Polygonal Rooms Not Illuminable from Every Point
- Computing the L 1-diameter and center of a simple rectilinear polygon in parallel
- Computing the L 1 Geodesic Diameter and Center of a Simple Polygon in Linear Time
- Visibility Algorithms in the Plane
- SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS
This page was built for publication: Diffuse reflection radius in a simple polygon
