Obstacle growing in a nonpolygonal world

DOI10.1016/0020-0190(87)90091-3zbMath0653.68024OpenAlexW2056156249MaRDI QIDQ1107992

Jean-Paul Laumond

Publication date: 1987

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(87)90091-3

zbMATH Keywords

algorithmic complexitycombinatorial geometryroboticsmathematical morphologypath finding

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computing methodologies and applications (68U99) Other problems of combinatorial convexity (52A37)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
• Spatial Planning: A Configuration Space Approach
• An O(n2) shortest path algorithm for a non-rotating convex body
• Plane-sweep algorithms for intersecting geometric figures