Pages that link to "Item:Q3217189"
From MaRDI portal
The following pages link to On the “piano movers'” problem I. The case of a two-dimensional rigid polygonal body moving amidst polygonal barriers (Q3217189):
Displaying 50 items.
- Motion planning algorithms for molecular simulations: a survey (Q465699) (← links)
- Computing the configuration space for a robot on a mesh-of-prosessors (Q582158) (← links)
- Partitioning a planar assembly into two connected parts is NP-complete (Q672026) (← links)
- Discrete warehouse problem (Q673763) (← links)
- Continuous alternation: the complexity of pursuit in continuous domains (Q686740) (← links)
- Shortest paths for line segments (Q686741) (← links)
- Moving a disc between polygons (Q749237) (← links)
- On the ''Piano Movers'' problem. II: General techniques for computing topological properties of real algebraic manifolds (Q760006) (← links)
- On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles (Q1076976) (← links)
- Planning a purely translational motion of a convex object in two- dimensional space using generalized Voronoi diagrams (Q1084674) (← links)
- Dynamic path planning for a planar articulated robot arm moving amidst unknown obstacles (Q1094158) (← links)
- Generalized Voronoi diagrams for a ladder. II: Efficient construction of the diagram (Q1094871) (← links)
- Motion planning among time dependent obstacles (Q1096427) (← links)
- Partitioning and separating sets of orthogonal polygons (Q1097030) (← links)
- A search algorithm for motion planning with six degrees of freedom (Q1097053) (← links)
- Optimal piecewise linear motion of an object among obstacles (Q1098643) (← links)
- A new efficient motion-planning algorithm for a rod in two-dimensional polygonal space (Q1102109) (← links)
- Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape (Q1102132) (← links)
- Motion planning with inertial constraints (Q1102133) (← links)
- Lower bounds on moving a ladder in two and three dimensions (Q1104091) (← links)
- Obstacle growing in a nonpolygonal world (Q1107992) (← links)
- Algorithmic and complexity issues of robot motion in an uncertain environment (Q1109740) (← links)
- A survey of motion planning and related geometric algorithms (Q1123032) (← links)
- Moving a food trolley around a corner (Q1127326) (← links)
- Arrangements of curves in the plane --- topology, combinatorics, and algorithms (Q1185003) (← 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 assembly partitioning (Q1313730) (← links)
- The complexity of the free space for a robot moving amidst fat obstacles (Q1314536) (← links)
- Approximate kinodynamic planning using \(L_ 2\)-norm dynamic bounds (Q1324341) (← links)
- Geometry and search in motion planning. (Q1353911) (← links)
- Time-optimal trajectories of a rod in the plane subject to velocity constraints (Q1355721) (← links)
- On-line motion planning: Case of a planar rod (Q1356165) (← links)
- Coordinated motion planning for two independent robots (Q1356168) (← links)
- Models and motion planning (Q1614069) (← links)
- On the number of critical free contacts of a convex polygonal object moving in two-dimensional polygonal space (Q1821354) (← links)
- Voronoi diagrams with barriers and on polyhedra for minimal path planning (Q1822055) (← links)
- Characterizing the shortest path of an object among obstacles (Q1823707) (← links)
- Fast composition of sparse maps (Q1836265) (← links)
- The complexity of the free space for motion planning amidst fat obstacles (Q1842754) (← links)
- A near-quadratic algorithm for planning the motion of a polygon in a polygonal environment (Q1923770) (← links)
- Planning motions of polyhedral parts by rolling (Q1974472) (← links)
- Characterization and computation of feasible trajectories for an articulated probe with a variable-length end segment (Q1984612) (← links)
- Motion planning via manifold samples (Q2017878) (← links)
- Trajectory planning for an articulated probe (Q2206741) (← links)
- On soft predicates in subdivision motion planning (Q2354924) (← links)
- Tracking an omnidirectional evader with a differential drive robot at a bounded variable distance (Q2511768) (← links)
- On the two-dimensional Davenport-Schinzel problem (Q2638785) (← links)
- The Complexity of Cylindrical Algebraic Decomposition with Respect to Polynomial Degree (Q2829999) (← links)
- Pianos are not flat: rigid motion planning in three dimensions (Q2921707) (← links)
