Shortest paths for line segments

DOI10.1007/BF01891839zbMath0781.68118OpenAlexW1993813109WikidataQ54309488 ScholiaQ54309488MaRDI QIDQ686741

Christian Icking, Günter Rote, Chee-Keng Yap, Ermo Welzl

Publication date: 13 October 1993

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01891839

zbMATH Keywords

optimizationmotion planningUlam's problemCauchy's surface-area formula

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computing methodologies and applications (68U99)

Related Items (3)

Time-optimal trajectories of a rod in the plane subject to velocity constraints ⋮ Shortest coordinated motion for square robots ⋮ An approximation algorithm ford₁-optimal motion of a rod robot with fixed rotations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal piecewise linear motion of an object among obstacles
• Über Kurven konstanter Breite
• A note on the Papadimitriou-Silverberg algorithm for planning optimal piecewise-linear motion of a ladder
• On the “piano movers'” problem I. The case of a two-dimensional rigid polygonal body moving amidst polygonal barriers
• The Minimum Path and the Minimum Motion of a Moved Line Segment

This page was built for publication: Shortest paths for line segments