Efficient Motion Planning for an L-Shaped Object
From MaRDI portal
Publication:3990095
DOI10.1137/0221001zbMath0743.68129OpenAlexW2016217878MaRDI QIDQ3990095
Dan Halperin, Micha Sharir, Mark H. Overmars
Publication date: 28 June 1992
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0221001
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (6)
Complexity of stratifications of semi-Pfaffian sets ⋮ Improved combinatorial bounds and efficient techniques for certain motion planning problems with three degrees of freedom ⋮ The complexity of the free space for motion planning amidst fat obstacles ⋮ Robot motion planning and the single cell problem in arrangements ⋮ On the complexity of a single cell in certain arrangements of surfaces related to motion planning ⋮ The complexity of the free space for a robot moving amidst fat obstacles
This page was built for publication: Efficient Motion Planning for an L-Shaped Object
