Pages that link to "Item:Q1102109"
From MaRDI portal
The following pages link to A new efficient motion-planning algorithm for a rod in two-dimensional polygonal space (Q1102109):
Displaying 15 items.
- Simple wriggling is hard unless you are a fat hippo (Q692941) (← links)
- On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles (Q1076976) (← links)
- Separating two simple polygons by a sequence of translations (Q1104080) (← links)
- Lower bounds on moving a ladder in two and three dimensions (Q1104091) (← links)
- A survey of motion planning and related geometric algorithms (Q1123032) (← links)
- Improved combinatorial bounds and efficient techniques for certain motion planning problems with three degrees of freedom (Q1194309) (← links)
- On the general motion-planning problem with two degrees of freedom (Q1262130) (← links)
- An efficient motion-planning algorithm for a convex polygonal object in two-dimensional polygonal space (Q1263972) (← links)
- On the complexity of a single cell in certain arrangements of surfaces related to motion planning (Q1314439) (← links)
- The complexity of the free space for a robot moving amidst fat obstacles (Q1314536) (← links)
- On-line motion planning: Case of a planar rod (Q1356165) (← links)
- Coordinated motion planning for two independent robots (Q1356168) (← links)
- A note on the Papadimitriou-Silverberg algorithm for planning optimal piecewise-linear motion of a ladder (Q1822971) (← links)
- The complexity of the free space for motion planning amidst fat obstacles (Q1842754) (← links)
- An approximation algorithm for<i>d</i><sub>1</sub>-optimal motion of a rod robot with fixed rotations (Q3423757) (← links)
