A near-quadratic algorithm for planning the motion of a polygon in a polygonal environment
Open Access
- 1 February 1996
- journal article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 16 (2) , 121-134
- https://doi.org/10.1007/bf02716803
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Almost tight upper bounds for the single cell and zone problems in three dimensionsDiscrete & Computational Geometry, 1995
- On lazy randomized incremental constructionDiscrete & Computational Geometry, 1995
- Castles in the air revisitedDiscrete & Computational Geometry, 1994
- External polygon containment problemsComputational Geometry, 1994
- A convex polygon among polygonal obstacles: placement and high-clearance motionComputational Geometry, 1993
- Combinatorics and Algorithms of ArrangementsPublished by Springer Nature ,1993
- 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 number of critical free contacts of a convex polygonal object moving in two-dimensional polygonal spaceDiscrete & Computational Geometry, 1987
- Data Structures and Network AlgorithmsPublished by Society for Industrial & Applied Mathematics (SIAM) ,1983