An O(n2) shortest path algorithm for a non-rotating convex body
From MaRDI portal
Publication:3792242
DOI10.1016/0196-6774(88)90003-XzbMath0647.68048MaRDI QIDQ3792242
Leonidas J. Guibas, J. E. Hershberger
Publication date: 1988
Published in: Journal of Algorithms (Search for Journal in Brave)
shortest path; path graph; computational geometry; polygonal obstacles; moving a convex body; tangent-visibility
68Q25: Analysis of algorithms and problem complexity
52A10: Convex sets in (2) dimensions (including convex curves)
Related Items
Obstacle growing in a nonpolygonal world, On fast planning of suboptimal paths amidst polygonal obstacles in plane, Computing the intersection-depth to polyhedra