Shortest paths with single point visibility constraint
From MaRDI portal
Recommendations
- Query-point visibility constrained shortest paths in simple polygons
- Query-points visibility constraint minimum link paths in simple polygons
- Shortest paths in simple polygons with polygon-meet constraints
- Visiting a Polygon on the Optimal Way to a Query Point
- Shortest path solves edge-to-edge visibility in a polygon
Cited in
(5)- Shortest paths in simple polygons with polygon-meet constraints
- Query-point visibility constrained shortest paths in simple polygons
- Shortest path to a segment and quickest visibility queries
- Query-points visibility constraint minimum link paths in simple polygons
- Single-Point Visibility Constraint Minimum Link Paths in Simple Polygons
This page was built for publication: Shortest paths with single point visibility constraint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3535949)
