Lower bounds on moving a ladder in two and three dimensions

DOI10.1007/BF02187908zbMATH Open0646.68059OpenAlexW2064867966MaRDI QIDQ1104091FDOQ1104091

Authors: Yan Ke, Joseph O'Rourke 

Publication date: 1988

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

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

Recommendations

• An efficient and simple motion planning algorithm for a ladder amidst polygonal barriers
• A new efficient motion-planning algorithm for a rod in two-dimensional polygonal space
• A note on the Papadimitriou-Silverberg algorithm for planning optimal piecewise-linear motion of a ladder
• Optimal piecewise linear motion of an object among obstacles
• Generalized voronoi diagrams for moving a ladder. I: Topological analysis

zbMATH Keywords

computational geometrymotion-planning

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (4)

• Title not available (Why is that?)
• An efficient and simple motion planning algorithm for a ladder amidst polygonal barriers
• Generalized voronoi diagrams for moving a ladder. I: Topological analysis
• Mountain Climbing, Ladder Moving, and the Ring-Width of a Polygon

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1104091)