An efficient and simple motion planning algorithm for a ladder amidst polygonal barriers
Authors:
- Daniel LevenDLDaniel Leven
- Micha SharirMSMicha Sharir
- 1 June 1987
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 8 (2) , 192-215
Abstract
No abstract availableKeywords
Funding Information
- Office of Naval Research (NOOO14-82-K-0381)
- International Business Machines Corporation
- National Science Foundation (20085)
This publication has 5 references indexed in Scilit:
- Generalized voronoi diagrams for moving a ladder. I: Topological analysisCommunications on Pure and Applied Mathematics, 1986
- Constructing the visibility graph for n-line segments in O(n2) timeInformation Processing Letters, 1985
- On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifoldsAdvances in Applied Mathematics, 1983
- On the Piano Movers' Problem: III. Coordinating the Motion of Several Independent Bodies: The Special Case of Circular Bodies Moving Amidst Polygonal BarriersThe International Journal of Robotics Research, 1983
- On the “piano movers'” problem I. The case of a two‐dimensional rigid polygonal body moving amidst polygonal barriersCommunications on Pure and Applied Mathematics, 1983