Optimal Shortest Path and Minimum-Link Path Queries between Two Convex Polygons inside a Simple Polygonal Obstacle

DOI10.1142/S0218195997000077MaRDI QIDQ4340963zbMATH OpenFDO

Authors Yi-Jen Chiang, Roberto Tamassia

Publication date 27 July 1997

Published in International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0218195997000077

zbMATH Keywords

data structureminimum-link-path queriesshortest-path

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Time and space efficient algorithms for shortest paths between convex polygons
• Shortest paths in the plane with convex polygonal obstacles
• Optimal shortest path queries in a simple polygon
• Shortest paths in the plane with polygonal obstacles

Cited in

(9)

• Optimal shortest path queries in a simple polygon
• Quickest visibility queries in polygonal domains
• MINIMUM SEPARATION IN WEIGHTED SUBDIVISIONS
• scientific article; zbMATH DE number 742973 (Why is no real title available?)
• LOGARITHMIC-TIME LINK PATH QUERIES IN A SIMPLE POLYGON
• Query-points visibility constraint minimum link paths in simple polygons
• Single-Point Visibility Constraint Minimum Link Paths in Simple Polygons
• Computing realistic terrains from imprecise elevations
• Shortest path planning for a tethered robot

This page was built for publication: Optimal Shortest Path and Minimum-Link Path Queries between Two Convex Polygons inside a Simple Polygonal Obstacle

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