Query-Points Visibility Constraint Minimum Link Paths in Simple Polygons
From MaRDI portal
Publication:5025050
DOI10.3233/FI-2021-2075OpenAlexW3214830522MaRDI QIDQ5025050
Nasrollah Moghaddam Charkari, Mohammad Reza Zarrabi
Publication date: 1 February 2022
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2004.02220
Cites Work
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- An optimal visibility graph algorithm for triangulated simple polygons
- Triangulating a simple polygon in linear time
- Minimum-link paths among obstacles in the plane
- Finding minimal convex nested polygons
- Optimal shortest path queries in a simple polygon
- Quickest visibility queries in polygonal domains
- Query-point visibility constrained shortest paths in simple polygons
- A linear time algorithm for minimum link paths inside a simple polygon
- Optimal Point Location in a Monotone Subdivision
- LOGARITHMIC-TIME LINK PATH QUERIES IN A SIMPLE POLYGON
- Shortest path to a segment and quickest visibility queries
- Computing the visibility polygon from a convex set and related problems
