Computing the visibility polygon of an island in a polygonal domain
From MaRDI portal
Publication:513290
DOI10.1007/s00453-015-0058-yzbMath1364.68343OpenAlexW2165366584MaRDI QIDQ513290
Publication date: 6 March 2017
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-015-0058-y
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
Reachable region query and its applications, Minimizing Distance-to-Sight in Polygonal Domains, Quickest visibility queries in polygonal domains
Cites Work
- Planar rectilinear shortest path computation using corridors
- Visibility and intersection problems in plane geometry
- Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
- Shortest paths in the plane with convex polygonal obstacles
- Visibility of disjoint polygons
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Corrections to Lee's visibility polygon algorithm
- Triangulating a simple polygon in linear time
- An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane
- Visibility-based planning of sensor control strategies
- Visibility and ray shooting queries in polygonal domains
- Weak visibility queries of line segments in simple polygons
- Computing the visibility polygon from an edge
- A Nearly Optimal Algorithm for Finding L 1 Shortest Paths among Polygonal Obstacles in the Plane
- Visibility of a simple polygon
- A linear algorithm for computing the visibility polygon from a point
- An Output-Sensitive Algorithm for Computing Visibility Graphs
- On the correctness of a linear-time visibility polygon algorithm∗
- An optimal parallel algorithm for the visibility of a simple polygon from a point
- An Optimal Algorithm for Computing Visibility in the Plane
- Computing the visibility polygon from a convex set and related problems
