Time and Space Efficient Algorithms for Shortest Paths Between Convex Polygons

Hans Rohnert. Time and Space Efficient Algorithms for Shortest Paths Between Convex Polygons. Inf. Process. Lett., 27(4):175-179, 1988.

Abstract

Abstract is missing.