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

DOI10.1142/S0218195997000077zbMath0877.68113MaRDI QIDQ4340963

Yi-Jen Chiang, Roberto Tamassia

Publication date: 27 July 1997

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

zbMATH Keywords

data structureshortest-pathminimum-link-path queries

Mathematics Subject Classification ID

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

Related Items (5)

Single-Point Visibility Constraint Minimum Link Paths in Simple Polygons ⋮ Shortest path planning for a tethered robot ⋮ Unnamed Item ⋮ MINIMUM SEPARATION IN WEIGHTED SUBDIVISIONS ⋮ Quickest visibility queries in polygonal domains

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