Time and space efficient algorithms for shortest paths between convex polygons

DOI10.1016/0020-0190(88)90022-1zbMath0637.68051OpenAlexW2069500078MaRDI QIDQ1098634

Hans Rohnert

Publication date: 1988

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

Full work available at URL: https://doi.org/10.1016/0020-0190(88)90022-1

zbMATH Keywords

shortest pathscomputational geometryconvex polygon obstacles

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) History of convex and discrete geometry (52-03)

Related Items (3)

A new algorithm for shortest paths among obstacles in the plane ⋮ Minimal tangent visibility graphs ⋮ Topologically sweeping visibility complexes via pseudotriangulations

Cites Work

• Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
• Shortest paths in the plane with convex polygonal obstacles
• A fast algorithm for the Boolean masking problem

This page was built for publication: Time and space efficient algorithms for shortest paths between convex polygons