Moving a disc between polygons

DOI10.1007/BF01759040MaRDI QIDQ749237zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

computational geometrymotion planningpolygonal obstacles

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

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

• scientific article; zbMATH DE number 3780615 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• A tight lower bound for the complexity of path-planning for a disc
• A “retraction” method for planning the motion of a disc
• An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments
• Fast Algorithms for Finding Nearest Common Ancestors
• Generalization of Voronoi Diagrams in the Plane
• Location of a Point in a Planar Subdivision and Its Applications
• Optimal Point Location in a Monotone Subdivision

Cited in

(6)

• The visibility-Voronoi complex and its applications
• scientific article; zbMATH DE number 4060716 (Why is no real title available?)
• 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)