Minimizing Distance-to-Sight in Polygonal Domains
From MaRDI portal
Publication:5091052
DOI10.4230/LIPIcs.ISAAC.2018.59OpenAlexW2904659240MaRDI QIDQ5091052
Publication date: 21 July 2022
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2018/10007/pdf/LIPIcs-ISAAC-2018-59.pdf/
Cites Work
- Unnamed Item
- On a class of \(O(n^2)\) problems in computational geometry
- Computing the visibility polygon of an island in a polygonal domain
- Computational geometry in a curved world
- Maintenance of configurations in the plane
- Parallel methods for visibility and shortest-path problems in simple polygons
- An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane
- Shortest path to a segment and quickest visibility queries
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Parallel Merge Sort
- An Optimal Algorithm for Euclidean Shortest Paths in the Plane
- Computing Shortest Paths among Curved Obstacles in the Plane
- On Romeo and Juliet Problems: Minimizing Distance-to-Sight.
