Query-points visibility constraint minimum link paths in simple polygons
From MaRDI portal
Recommendations
- Query-point visibility constrained shortest paths in simple polygons
- Finding simple paths on given points in a polygonal region
- scientific article; zbMATH DE number 742973
- Shortest paths with single point visibility constraint
- Optimal Shortest Path and Minimum-Link Path Queries between Two Convex Polygons inside a Simple Polygonal Obstacle
Cites work
- A linear time algorithm for minimum link paths inside a simple polygon
- An optimal visibility graph algorithm for triangulated simple polygons
- Computing the visibility polygon from a convex set and related problems
- Finding minimal convex nested polygons
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- LOGARITHMIC-TIME LINK PATH QUERIES IN A SIMPLE POLYGON
- Minimum-link paths among obstacles in the plane
- Optimal Point Location in a Monotone Subdivision
- Optimal shortest path queries in a simple polygon
- Query-point visibility constrained shortest paths in simple polygons
- Quickest visibility queries in polygonal domains
- Shortest path to a segment and quickest visibility queries
- Triangulating a simple polygon in linear time
Cited in
(5)- Query-point visibility constrained shortest paths in simple polygons
- Finding simple paths on given points in a polygonal region
- Shortest paths with single point visibility constraint
- scientific article; zbMATH DE number 742973 (Why is no real title available?)
- Single-Point Visibility Constraint Minimum Link Paths in Simple Polygons
This page was built for publication: Query-points 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 Q5025050)
