Efficient Motion Planning for an L-Shaped Object
- 1 February 1992
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 21 (1) , 1-23
- https://doi.org/10.1137/0221001
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- Counting facets and incidencesDiscrete & Computational Geometry, 1992
- Triangles in space or building (and analyzing) castles in the airCombinatorica, 1990
- An efficient motion-planning algorithm for a convex polygonal object in two-dimensional polygonal spaceDiscrete & Computational Geometry, 1990
- On the general motion-planning problem with two degrees of freedomDiscrete & Computational Geometry, 1989
- Concatenable segment treesPublished by Springer Nature ,1989
- Lower bounds on moving a ladder in two and three dimensionsDiscrete & Computational Geometry, 1988
- An efficient and simple motion planning algorithm for a ladder amidst polygonal barriersJournal of Algorithms, 1987
- On the union of Jordan regions and collision-free translational motion amidst polygonal obstaclesDiscrete & Computational Geometry, 1986
- Data Structures and Algorithms 3Published by Springer Nature ,1984
- An algorithm for planning collision-free paths among polyhedral obstaclesCommunications of the ACM, 1979