Moving a disc between polygons
From MaRDI portal
DOI10.1007/BF01759040zbMATH Open0712.68100OpenAlexW2009897161MaRDI QIDQ749237FDOQ749237
Authors: Hans Rohnert 
Publication date: 1991
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01759040
Recommendations
- scientific article; zbMATH DE number 4060716
- Shortest paths in the plane with polygonal obstacles
- Time and space efficient algorithms for shortest paths between convex polygons
- On the “piano movers'” problem I. The case of a two-dimensional rigid polygonal body moving amidst polygonal barriers
- A “retraction” method for planning the motion of a disc
Cites Work
- Title not available (Why is that?)
- An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments
- Fast Algorithms for Finding Nearest Common Ancestors
- Optimal Point Location in a Monotone Subdivision
- Location of a Point in a Planar Subdivision and Its Applications
- Generalization of Voronoi Diagrams in the Plane
- A “retraction” method for planning the motion of a disc
- A tight lower bound for the complexity of path-planning for a disc
- Title not available (Why is that?)
Cited In (6)
- The visibility-Voronoi complex and its applications
- Title not available (Why is that?)
- A “retraction” method for planning the motion of a disc
- A tight lower bound for the complexity of path-planning for a disc
- A compact piecewise-linear Voronoi diagram for convex sites in the plane
- Computing push plans for disk-shaped robots
This page was built for publication: Moving a disc between polygons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q749237)
