Pages that link to "Item:Q3219802"
From MaRDI portal
The following pages link to A “retraction” method for planning the motion of a disc (Q3219802):
Displayed 34 items.
- Characterization of contour elements that generate abstract Voronoi diagrams (Q676068) (← links)
- A convex polygon among polygonal obstacle: Placement and high-clearance motion (Q685605) (← links)
- Moving a disc between polygons (Q749237) (← links)
- The visibility-Voronoi complex and its applications (Q870429) (← links)
- The complexity of planar compliant motion planning under uncertainty (Q911278) (← 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)
- An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments (Q1093370) (← links)
- Generalized Voronoi diagrams for a ladder. II: Efficient construction of the diagram (Q1094871) (← links)
- Simplified Voronoi diagrams (Q1101687) (← links)
- A new efficient motion-planning algorithm for a rod in two-dimensional polygonal space (Q1102109) (← links)
- A tight lower bound for the complexity of path-planning for a disc (Q1111039) (← links)
- A survey of motion planning and related geometric algorithms (Q1123032) (← links)
- Learning metric-topological maps for indoor mobile robot navigation (Q1128610) (← links)
- Constructing the Voronoi diagram of a set of line segments in parallel (Q1206435) (← 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)
- Swap conditions for dynamic Voronoi diagrams for circles and line segments (Q1274463) (← 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)
- On fast planning of suboptimal paths amidst polygonal obstacles in plane (Q1367531) (← links)
- Construction of optimal programmed paths for the motion of a robotic manipulator (Q1375265) (← links)
- The complexity of the free space for motion planning amidst fat obstacles (Q1842754) (← links)
- A compact piecewise-linear Voronoi diagram for convex sites in the plane (Q1907612) (← links)
- Voronoi-like partition of lattice in cellular automata (Q1914936) (← links)
- Stability of solutions in problems of computational geometry (Q1974331) (← links)
- On soft predicates in subdivision motion planning (Q2354924) (← links)
- Symbolic treatment of geometric degeneracies (Q2638833) (← links)
- Soft Subdivision Search in Motion Planning, II: Axiomatics (Q3452548) (← links)
- Approximating Voronoi Diagrams of Convex Sites in Any Dimension (Q4513208) (← links)
- KINETIC COLLISION DETECTION FOR SIMPLE POLYGONS (Q4818544) (← links)
- Rods and Rings: Soft Subdivision Planner for R^3 x S^2. (Q5088973) (← links)
- Multi-robot motion planning for unit discs with revolving areas (Q6110072) (← links)