Shortest paths in simple polygons with polygon-meet constraints
From MaRDI portal
Publication:2390305
Recommendations
- The shortest path in a simple polygon with obstacles
- Shortest paths in the plane with convex polygonal obstacles
- Shortest paths in the plane with polygonal obstacles
- Optimal shortest path queries in a simple polygon
- Approximate shortest paths in simple polyhedra
- On Shortest Paths Amidst Convex Polyhedra
- Shortest path in a polygon using sublinear space
- Shortest Path in a Polygon using Sublinear Space.
- Shortest path between two simple polygons
- Shortest Path Queries in Polygonal Domains
Cites work
- An Optimal Algorithm for Euclidean Shortest Paths in the Plane
- Approximation algorithms for the watchman route and zookeeper's problems.
- Approximation algorithms for TSP with neighborhoods in the plane
- Finding shortest safari routes in simple polygons
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Shortest paths with single point visibility constraint
- Shortest watchman routes in simple polygons
- The zookeeper route problem
- Touring a sequence of polygons
- Watchman routes under limited visibility
Cited in
(8)- Query-point visibility constrained shortest paths in simple polygons
- The shortest path in a simple polygon with obstacles
- Visiting a Polygon on the Optimal Way to a Query Point
- Shortest paths with single point visibility constraint
- How to Keep an Eye on Small Things
- Approximate Shortest Paths in Polygons with Violations
- Shortest Path in a Polygon using Sublinear Space.
- Finding a shortest Hamiltonian path inside a simple polygon
This page was built for publication: Shortest paths in simple polygons with polygon-meet constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2390305)
