Shortest path between two simple polygons

DOI10.1016/0020-0190(87)90150-5zbMath0653.68025OpenAlexW2005422822MaRDI QIDQ1107993

Takao Asano, Hiroshi Imai, Tetsuo Asano

Publication date: 1987

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(87)90150-5

zbMATH Keywords

computational complexityshortest pathcomputational geometryvisibility polygonwire routing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Other problems of combinatorial convexity (52A37)

Related Items

An algorithmic approach to some problems in terrain navigation

Cites Work

• A note on two problems in connexion with graphs
• Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
• Visibility of disjoint polygons
• Euclidean shortest paths in the presence of rectilinear barriers