Planning a purely translational motion for a convex object in two-dimensional space using generalized Voronoi diagrams
- 1 March 1987
- journal article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 2 (1) , 9-31
- https://doi.org/10.1007/bf02187867
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- On the union of Jordan regions and collision-free translational motion amidst polygonal obstaclesDiscrete & Computational Geometry, 1986
- Intersection and Closest-Pair Problems for a Set of Planar DiscsSIAM Journal on Computing, 1985
- A “retraction” method for planning the motion of a discJournal of Algorithms, 1985
- Voronoi diagrams based on convex distance functionsPublished by Association for Computing Machinery (ACM) ,1985
- 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
- A fast algorithm for polygon containment by translationPublished by Springer Nature ,1985
- A kinetic framework for computational geometryPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1983
- 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
- Efficient computation of continuous skeletonsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1979