Pages that link to "Item:Q1201745"
From MaRDI portal
The following pages link to Approximate motion planning and the complexity of the boundary of the union of simple geometric figures (Q1201745):
Displayed 19 items.
- Generalized disk graphs (Q832849) (← links)
- An optimal-time algorithm for shortest paths on realistic polyhedra (Q848859) (← links)
- On realistic terrains (Q934023) (← links)
- Improved bounds on the union complexity of fat objects (Q946687) (← links)
- On \(k\)-sets in arrangements of curves and surfaces (Q1179129) (← links)
- Simultaneous inner and outer approximation of shapes (Q1201744) (← links)
- The complexity of the free space for a robot moving amidst fat obstacles (Q1314536) (← links)
- 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects (Q1370928) (← links)
- On fat partitioning, fat covering and the union size of polygons (Q1384209) (← links)
- Models and motion planning (Q1614069) (← links)
- On the union complexity of families of axis-parallel rectangles with a low packing number (Q1627208) (← links)
- The complexity of the free space for motion planning amidst fat obstacles (Q1842754) (← links)
- On the flatness of Minkowski sums (Q1847384) (← links)
- Computing depth orders for fat objects and related problems (Q1917032) (← links)
- Visibility of rectagular objects in<i>L</i><sub>1</sub>metric (Q4236100) (← links)
- Models and motion planning (Q5054845) (← links)
- Two- and three- dimensional point location in rectangular subdivisions (Q5056154) (← links)
- Computing depth orders and related problems (Q5056161) (← links)
- Dynamic data structures for fat objects and their applications (Q5096947) (← links)