Pages that link to "Item:Q1842754"

The following pages link to The complexity of the free space for motion planning amidst fat obstacles (Q1842754):

Displayed 21 items.

• Unions of fat convex polytopes have short skeletons (Q443910) ‎ (← links)
• Preprocessing imprecise points for Delaunay triangulation: simplified and extended (Q644800) ‎ (← links)
• A QPTAS for TSP with fat weakly disjoint neighborhoods in doubling metrics (Q650109) ‎ (← links)
• An optimal-time algorithm for shortest paths on realistic polyhedra (Q848859) ‎ (← links)
• On realistic terrains (Q934023) ‎ (← links)
• Ray shooting and intersection searching amidst fat convex polyhedra in 3-space (Q934024) ‎ (← links)
• Improved bounds on the union complexity of fat objects (Q946687) ‎ (← links)
• Kinetic collision detection for convex fat objects (Q1016518) ‎ (← links)
• Decompositions and boundary coverings of non-convex fat polyhedra (Q1037773) ‎ (← links)
• Dynamic motion planning in low obstacle density environments (Q1276943) ‎ (← links)
• Range searching in low-density environments (Q1350104) ‎ (← links)
• 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects (Q1370928) ‎ (← links)
• Guarding scenes against invasive hypercubes. (Q1405005) ‎ (← links)
• Models and motion planning (Q1614069) ‎ (← links)
• Local polyhedra and geometric graphs (Q1775780) ‎ (← links)
• The complexity of the free space for motion planning amidst fat obstacles (Q1842754) ‎ (← links)
• On the flatness of Minkowski sums (Q1847384) ‎ (← links)
• Walking around fat obstacles. (Q1853053) ‎ (← links)
• Approximate unions of lines and Minkowski sums (Q2369877) ‎ (← links)
• The Complexity of Bisectors and Voronoi Diagrams on Realistic Terrains (Q3541078) ‎ (← links)
• Placing Text Boxes on Graphs (Q3611861) ‎ (← links)