Moving a disc between polygons

DOI10.1007/BF01759040zbMath0712.68100OpenAlexW2009897161MaRDI QIDQ749237

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

motion planningcomputational geometrypolygonal obstacles

Mathematics Subject Classification ID

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

Related Items

A compact piecewise-linear Voronoi diagram for convex sites in the plane, The visibility-Voronoi complex and its applications

Cites Work

• Unnamed Item
• Unnamed Item
• An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments
• A tight lower bound for the complexity of path-planning for a disc
• A “retraction” method for planning the motion of a disc
• Fast Algorithms for Finding Nearest Common Ancestors
• Optimal Point Location in a Monotone Subdivision
• Generalization of Voronoi Diagrams in the Plane
• Location of a Point in a Planar Subdivision and Its Applications