Obstacle growing in a nonpolygonal world

DOI10.1016/0020-0190(87)90091-3MaRDI QIDQ1107992zbMATH OpenOpenAlexFDO

Authors 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

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)

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; zbMATH DE number 4108220
• 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

Cites work

• scientific article; zbMATH DE number 3902440 (Why is no real title available?)
• scientific article; zbMATH DE number 3657150 (Why is no real title available?)
• scientific article; zbMATH DE number 3635510 (Why is no real title available?)
• scientific article; zbMATH DE number 3299324 (Why is no real title available?)
• An O(n2) shortest path algorithm for a non-rotating convex body
• Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
• Plane-sweep algorithms for intersecting geometric figures
• Spatial Planning: A Configuration Space Approach

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)