Single-Point Visibility Constraint Minimum Link Paths in Simple Polygons
From MaRDI portal
Recommendations
- Query-points visibility constraint minimum link paths in simple polygons
- Shortest paths with single point visibility constraint
- Query-point visibility constrained shortest paths in simple polygons
- Finding simple paths on given points in a polygonal region
- Minimal link visibility paths inside a simple polygon
Cites work
- A linear time algorithm for minimum link paths inside a simple polygon
- Computing the visibility polygon from a convex set and related problems
- Corrections to Lee's visibility polygon algorithm
- Finding an approximate minimum-link visibility path inside a simple polygon
- scientific article; zbMATH DE number 1424300 (Why is no real title available?)
- LOGARITHMIC-TIME LINK PATH QUERIES IN A SIMPLE POLYGON
- Minimal link visibility paths inside a simple polygon
- Minimum-link paths among obstacles in the plane
- Optimal Point Location in a Monotone Subdivision
- Optimal Shortest Path and Minimum-Link Path Queries between Two Convex Polygons inside a Simple Polygonal Obstacle
- Single-Point Visibility Constraint Minimum Link Paths in Simple Polygons
This page was built for publication: Single-Point Visibility Constraint Minimum Link Paths in Simple Polygons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5056907)