Movement Problems for 2-Dimensional Linkages
From MaRDI portal
Publication:3716331
DOI10.1137/0213038zbMATH Open0588.68054OpenAlexW2076369477MaRDI QIDQ3716331FDOQ3716331
Sue Whitesides, Deborah Joseph, John Hopcroft
Publication date: 1984
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://hdl.handle.net/1813/6355
Computing methodologies and applications (68U99) Analysis of algorithms and problem complexity (68Q25) Artificial intelligence (68T99)
Cited In (19)
- Higher-order rigidity -- what is the proper definition?
- Characterization and computation of feasible trajectories for an articulated probe with a variable-length end segment
- Trajectory planning for an articulated probe
- A survey of motion planning and related geometric algorithms
- The Set of Admissible Positions for a Two‐DOF Linkage in the Presence of Obstacles
- Folding rulers inside triangles
- Distances in a rigid unit-distance graph in the plane
- Nonconvex cases for carpenter's rulers
- Title not available (Why is that?)
- On boundaries of highly visible spaces and applications
- On the reconfiguration of chains
- Reconfiguring shortest paths in graphs
- A tight lower bound for the complexity of path-planning for a disc
- Title not available (Why is that?)
- New algorithms for multilink robot arms
- Randomized query processing in robot path planning
- Computational complexity of puzzles and related topics
- Automated generation of Kempe linkage and its complexity
- Algorithms for solving reachability problems in 2-link planar arms using Gröbner bases
Recommendations
This page was built for publication: Movement Problems for 2-Dimensional Linkages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3716331)
