Shortest paths for line segments
From MaRDI portal
Publication:686741
DOI10.1007/BF01891839zbMATH Open0781.68118OpenAlexW1993813109WikidataQ54309488 ScholiaQ54309488MaRDI QIDQ686741FDOQ686741
Authors: Christian Icking, Günter Rote, Chee K. Yap, Emo 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
Recommendations
Computing methodologies and applications (68U99) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the “piano movers'” problem I. The case of a two-dimensional rigid polygonal body moving amidst polygonal barriers
- Title not available (Why is that?)
- 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
- The Minimum Path and the Minimum Motion of a Moved Line Segment
Cited In (11)
- A question of Bellman
- Shortest path to a segment and quickest visibility queries
- Shortest path geometric rounding
- Title not available (Why is that?)
- Title not available (Why is that?)
- Shortest coordinated motion for square robots
- Watchman routes for lines and line segments
- Title not available (Why is that?)
- An approximation algorithm ford1-optimal motion of a rod robot with fixed rotations
- Time-optimal trajectories of a rod in the plane subject to velocity constraints
- Shortest curves for vehicles on surfaces of celestial bodies
This page was built for publication: Shortest paths for line segments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q686741)