An efficient motion-planning algorithm for a convex polygonal object in two-dimensional polygonal space
- 1 January 1990
- journal article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 5 (1) , 43-75
- https://doi.org/10.1007/bf02187779
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- A new efficient motion-planning algorithm for a rod in two-dimensional polygonal spaceAlgorithmica, 1987
- Generalized Voronoi diagrams for a ladder: II. Efficient construction of the diagramAlgorithmica, 1987
- On the number of critical free contacts of a convex polygonal object moving in two-dimensional polygonal spaceDiscrete & Computational Geometry, 1987
- An efficient and simple motion planning algorithm for a ladder amidst polygonal barriersJournal of Algorithms, 1987
- Planning a purely translational motion for a convex object in two-dimensional space using generalized Voronoi diagramsDiscrete & Computational Geometry, 1987
- Almost linear upper bounds on the length of general davenport—schinzel sequencesCombinatorica, 1987
- Generalized voronoi diagrams for moving a ladder. I: Topological analysisCommunications on Pure and Applied Mathematics, 1986
- Nonlinearity of davenport—Schinzel sequences and of generalized path compression schemesCombinatorica, 1986
- On the union of Jordan regions and collision-free translational motion amidst polygonal obstaclesDiscrete & Computational Geometry, 1986
- A “retraction” method for planning the motion of a discJournal of Algorithms, 1985