Motion planning for a convex polygon in a polygonal environment

P. K. Agarwal*, B. Aronov, M. Sharir

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


We study the motion-planning problem for a convex m-gon P in a planar polygonal environment Q bounded by n edges. We give the first algorithm that constructs the entire free configuration space (the three-dimensional space of all free placements of P in Q) in time that is near-quadratic in mn, which is nearly optimal in the worst case. The algorithm is also conceptually simple. Previous solutions were incomplete, more expensive, or produced only part of the free configuration space. Combining our solution with parametric searching, we obtain an algorithm that finds the largest placement of P in Q in time that is also near-quadratic in mn. In addition, we describe an algorithm that preprocesses the computed free configuration space so that reachability queries can be answered in polylogarithmic time.

Original languageEnglish
Pages (from-to)201-221
Number of pages21
JournalDiscrete and Computational Geometry
Issue number2
StatePublished - Sep 1999


Dive into the research topics of 'Motion planning for a convex polygon in a polygonal environment'. Together they form a unique fingerprint.

Cite this