Lower bounds on moving a ladder in two and three dimensions

DOI10.1007/BF02187908zbMath0646.68059OpenAlexW2064867966MaRDI QIDQ1104091

Joseph O'Rourke, Yan Ke

Publication date: 1988

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/131046

zbMATH Keywords

computational geometrymotion-planning

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computing methodologies and applications (68U99)

Cites Work

• A new efficient motion-planning algorithm for a rod in two-dimensional polygonal space
• On the “piano movers'” problem I. The case of a two-dimensional rigid polygonal body moving amidst polygonal barriers
• On the piano movers' problem: V. The case of a rod moving in three-dimensional space amidst polyhedral obstacles
• Constructing Arrangements of Lines and Hyperplanes with Applications

This page was built for publication: Lower bounds on moving a ladder in two and three dimensions