Lower bounds on moving a ladder in two and three dimensions
- 1 September 1988
- journal article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 3 (3) , 197-217
- https://doi.org/10.1007/bf02187908
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Moving a ladder in three dimensions: upper and lower boundsPublished by Association for Computing Machinery (ACM) ,1987
- Constructing Arrangements of Lines and Hyperplanes with ApplicationsSIAM Journal on Computing, 1986
- A new efficient motion-planning algorithm for a rod in polygonal spacePublished by Association for Computing Machinery (ACM) ,1986
- An efficient and simple motion planning algorithm for a ladder moving in two-dimensional space amidst polygonal barriers (extended abstract)Published by Association for Computing Machinery (ACM) ,1985
- On the piano movers' problem: V. The case of a rod moving in three‐dimensional space amidst polyhedral obstaclesCommunications on Pure and Applied Mathematics, 1984
- 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
- RetractionPublished by Association for Computing Machinery (ACM) ,1983