Obstacle growing in a nonpolygonal world

DOI10.1016/0020-0190(87)90091-3zbMATH Open0653.68024OpenAlexW2056156249MaRDI QIDQ1107992FDOQ1107992

J.-P. 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

Recommendations

• On the “piano movers'” problem I. The case of a two-dimensional rigid polygonal body moving amidst polygonal barriers
• scientific article; zbMATH DE number 3945381
• scientific article
• Solving the two-dimensional findpath problem using a line-triangle representation of the robot
• Geometry and robotics. Workshop, Toulouse, France, May 26-28, 1988. Proceedings

zbMATH Keywords

combinatorial geometryroboticsmathematical morphologyalgorithmic complexitypath finding

Mathematics Subject Classification ID

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

Cites Work

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

This page was built for publication: Obstacle growing in a nonpolygonal world

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1107992)