Shortest path solves edge-to-edge visibility in a polygon
From MaRDI portal
Recommendations
Cited in
(14)- Visibility between two edges of a simple polygon
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- An \(O(n\log n)\) algorithm for computing the link center of a simple polygon
- Computing the full visibility graph of a set of line segments
- On separating two simple polygons by a single translation
- Efficient visibility queries in simple polygons
- Query-point visibility constrained shortest paths in simple polygons
- Shortest paths with single point visibility constraint
- VISIBILITY STABS AND DEPTH-FIRST SPIRALLING ON LINE SEGMENTS IN OUTPUT SENSITIVE TIME
- scientific article; zbMATH DE number 1424307 (Why is no real title available?)
- An O(n n) algorithm for computing a link center in a simple polygon
- Tracing compressed curves in triangulated surfaces
- An optimal algorithm for finding the edge visibility polygon under limited visibility
- Characterizing and recognizing weak visibility polygons
This page was built for publication: Shortest path solves edge-to-edge visibility in a polygon
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3771676)