Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
- 1 December 1992
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 8 (1-6) , 391-406
- https://doi.org/10.1007/bf01758853
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- 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
- Davenport-Schinzel Sequences and their Geometric ApplicationsPublished by Springer Nature ,1988
- Planning a purely translational motion for a convex object in two-dimensional space using generalized Voronoi diagramsDiscrete & Computational Geometry, 1987
- Optimal Point Location in a Monotone SubdivisionSIAM Journal on Computing, 1986
- On the union of Jordan regions and collision-free translational motion amidst polygonal obstaclesDiscrete & Computational Geometry, 1986
- An efficient algorithm for planning collision-free translational motion of a convex polygonal object in 2-dimensional space amidst polygonal obstaclesPublished by Association for Computing Machinery (ACM) ,1985