Movement Problems for 2-Dimensional Linkages
From MaRDI portal
Recommendations
Cited in
(24)- Higher-order rigidity -- what is the proper definition?
- Characterization and computation of feasible trajectories for an articulated probe with a variable-length end segment
- The complexity of (un)folding
- A survey of motion planning and related geometric algorithms
- Trajectory planning for an articulated probe
- Locked and unlocked smooth embeddings of surfaces
- The Set of Admissible Positions for a Two‐DOF Linkage in the Presence of Obstacles
- Distances in a rigid unit-distance graph in the plane
- Folding rulers inside triangles
- Motion planning and control of a planar polygonal linkage
- Nonconvex cases for carpenter's rulers
- Stratified deformation space and path planning for a planar closed chain with revolute joints
- 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
- Introducing a new NP-hard problem regarding an open chain linkage using an new greedy method
- On the geometric definition of the hinge mechanism, Kempe's theorem and overripe mathematics
- 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
- scientific article; zbMATH DE number 2145225 (Why is no real title available?)
- Algorithms for solving reachability problems in 2-link planar arms using Gröbner bases
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)