Time and space efficient algorithms for shortest paths between convex polygons
From MaRDI portal
Publication:1098634
DOI10.1016/0020-0190(88)90022-1zbMath0637.68051MaRDI QIDQ1098634
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
Related Items
A new algorithm for shortest paths among obstacles in the plane, Topologically sweeping visibility complexes via pseudotriangulations, Minimal tangent visibility graphs
Cites Work