A note on the Papadimitriou-Silverberg algorithm for planning optimal piecewise-linear motion of a ladder

DOI10.1016/0020-0190(89)90042-2zbMath0679.68094OpenAlexW2086051681MaRDI QIDQ1822971

Micha Sharir

Publication date: 1989

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(89)90042-2

zbMATH Keywords

shortest pathsmotion planningcomputational geometryarrangements of curvesDavenport-Schinzel sequences

Mathematics Subject Classification ID

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

Related Items (2)

Shortest paths for line segments ⋮ An approximation algorithm ford₁-optimal motion of a rod robot with fixed rotations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences
• Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
• Optimal piecewise linear motion of an object among obstacles
• A new efficient motion-planning algorithm for a rod in two-dimensional polygonal space

This page was built for publication: A note on the Papadimitriou-Silverberg algorithm for planning optimal piecewise-linear motion of a ladder