Pages that link to "Item:Q1262130"

The following pages link to On the general motion-planning problem with two degrees of freedom (Q1262130):

Displaying 32 items.

• Computing a single cell in the overlay of two simple polygons (Q287185) (← links)
• The complexity and construction of many faces in arrangements of lines and of segments (Q582900) (← links)
• A convex polygon among polygonal obstacle: Placement and high-clearance motion (Q685605) (← links)
• Tail estimates for the efficiency of randomized incremental algorithms for line segment intersection (Q686143) (← links)
• Storing line segments in partition trees (Q911289) (← links)
• Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences (Q911595) (← links)
• An optimal algorithm for the boundary of a cell in a union of rays (Q911755) (← links)
• The upper envelope of piecewise linear functions: Algorithms and applications (Q919830) (← links)
• Constrained Minkowski sums: A geometric framework for solving interval problems in computational biology efficiently (Q1028588) (← links)
• Arrangements of curves in the plane --- topology, combinatorics, and algorithms (Q1185003) (← links)
• Improved combinatorial bounds and efficient techniques for certain motion planning problems with three degrees of freedom (Q1194309) (← links)
• The number of edges of many faces in a line segment arrangement (Q1200271) (← links)
• Approximate motion planning and the complexity of the boundary of the union of simple geometric figures (Q1201745) (← links)
• On arrangements of Jordan arcs with three intersections per pair (Q1262864) (← links)
• On the complexity of a single cell in certain arrangements of surfaces related to motion planning (Q1314439) (← links)
• Castles in the air revisited (Q1334929) (← links)
• Excess in arrangements of segments (Q1349964) (← links)
• A new algorithm for shortest paths among obstacles in the plane (Q1356167) (← links)
• Coordinated motion planning for two independent robots (Q1356168) (← links)
• The common exterior of convex polygons in the plane (Q1367170) (← links)
• Combinatorial complexity of translating a box in polyhedral 3-space (Q1384201) (← links)
• Preprocessing chains for fast dihedral rotations is hard or even impossible. (Q1410594) (← links)
• Robot motion planning and the single cell problem in arrangements (Q1842755) (← links)
• Almost tight upper bounds for the single cell and zone problems in the three dimensions (Q1906044) (← links)
• Combinatorial complexity of signed discs (Q1917033) (← links)
• Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D (Q2482197) (← links)
• Minimum Cell Connection in Line Segment Arrangements (Q3132917) (← links)
• GUARDING A POLYGON FROM TWO NEARLY-OPPOSITE DIRECTIONS (Q3575388) (← links)
• Polyhedral Assembly Partitioning Using Maximally Covered Cells in Arrangements of Convex Polytopes (Q4513205) (← links)
• Arrangements in higher dimensions: Voronoi diagrams, motion planning, and other applications (Q5057426) (← links)
• Combinatorial complexity of signed discs (Q5060148) (← links)
• On lazy randomized incremental construction (Q5917712) (← links)