The complexity of the free space for motion planning amidst fat obstacles
- 1 March 1994
- journal article
- Published by Springer Nature in Journal of Intelligent & Robotic Systems
- Vol. 11 (1-2) , 21-44
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Fat Triangles Determine Linearly Many HolesSIAM Journal on Computing, 1994
- The complexity of the free space for a robot moving amidst fat obstaclesComputational Geometry, 1993
- Point location in fat subdivisionsInformation Processing Letters, 1992
- Approximate motion planning and the complexity of the boundary of the union of simple geometric figuresAlgorithmica, 1992
- Efficient Motion Planning for an L-Shaped ObjectSIAM Journal on Computing, 1992
- Robot Motion Planning1991
- An efficient motion-planning algorithm for a convex polygonal object in two-dimensional polygonal spaceDiscrete & Computational Geometry, 1990
- An efficient and simple motion planning algorithm for a ladder amidst polygonal barriersJournal of Algorithms, 1987
- A “retraction” method for planning the motion of a discJournal of Algorithms, 1985
- Range searching in a set of line segments1985