Pages that link to "Item:Q1821354"

The following pages link to On the number of critical free contacts of a convex polygonal object moving in two-dimensional polygonal space (Q1821354):

Displaying 18 items.

• On critical orientations in the Kedem-Sharir motion planning algorithm (Q677023) (← links)
• A convex polygon among polygonal obstacle: Placement and high-clearance motion (Q685605) (← links)
• Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences (Q911595) (← links)
• Planar realizations of nonlinear Davenport-Schinzel sequences by segments (Q1098294) (← links)
• Separating two simple polygons by a sequence of translations (Q1104080) (← links)
• Improved lower bounds on the length of Davenport-Schinzel sequences (Q1119587) (← links)
• A survey of motion planning and related geometric algorithms (Q1123032) (← links)
• An efficient motion-planning algorithm for a convex polygonal object in two-dimensional polygonal space (Q1263972) (← links)
• The union of moving polygonal pseudodiscs -- combinatorial bounds and applications (Q1272309) (← links)
• The complexity of the free space for a robot moving amidst fat obstacles (Q1314536) (← links)
• Extremal polygon containment problems (Q1330463) (← links)
• Combinatorial complexity of translating a box in polyhedral 3-space (Q1384201) (← links)
• A near-linear algorithm for the planar segment-center problem (Q1816414) (← links)
• A near-quadratic algorithm for planning the motion of a polygon in a polygonal environment (Q1923770) (← links)
• On the two-dimensional Davenport-Schinzel problem (Q2638785) (← links)
• Stabbing Convex Polygons with a Segment or a Polygon (Q3541074) (← links)
• Polygon placement under translation and rotation (Q3816980) (← links)
• Enumerating Davenport-Schinzel sequences (Q4020509) (← links)