Visiting a Polygon on the Optimal Way to a Query Point

DOI10.1007/978-3-540-69311-6_26MaRDI QIDQ3507339zbMATH OpenOpenAlexFDO

Authors Ramtin Khosravi, Mohammad Ghodsi

Publication date 19 June 2008

Published in Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-69311-6_26

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Programming involving graphs or networks (90C35)

Recommendations

• Shortest paths in simple polygons with polygon-meet constraints
• Query-point visibility constrained shortest paths in simple polygons
• Optimal shortest path queries in a simple polygon
• Shortest path to a segment and quickest visibility queries
• Shortest path to a segment and quickest visibility queries

Cites work

• An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane
• An Optimal Algorithm for Euclidean Shortest Paths in the Plane
• Approximation algorithms for TSP with neighborhoods in the plane
• Corrections to Lee's visibility polygon algorithm
• SHORTEST PATHS AMONG OBSTACLES IN THE PLANE
• Shortest paths in simple polygons with polygon-meet constraints
• Touring a sequence of polygons
• Visibility of a simple polygon

Cited in

(2)

• Polygon queries for convex hulls of points
• Shortest paths with single point visibility constraint

This page was built for publication: Visiting a Polygon on the Optimal Way to a Query Point

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3507339)