Pages that link to "Item:Q1917032"
From MaRDI portal
The following pages link to Computing depth orders for fat objects and related problems (Q1917032):
Displaying 14 items.
- Generalized disk graphs (Q832849) (← links)
- An optimal-time algorithm for shortest paths on realistic polyhedra (Q848859) (← links)
- Improved bounds on the union complexity of fat objects (Q946687) (← links)
- A research note on design of fair surfaces over irregular domains using data-dependent triangulation (Q949998) (← links)
- Smoothed analysis of probabilistic roadmaps (Q1028227) (← links)
- 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects (Q1370928) (← links)
- Models and motion planning (Q1614069) (← links)
- On the flatness of Minkowski sums (Q1847384) (← links)
- Removing depth-order cycles among triangles: an algorithm generating triangular fragments (Q2225657) (← links)
- Fair and square: cake-cutting in two dimensions (Q2358562) (← links)
- Envy-Free Division of Land (Q3387907) (← links)
- Models and motion planning (Q5054845) (← links)
- Dynamic data structures for fat objects and their applications (Q5096947) (← links)
- Keep your distance: land division with separation (Q6114476) (← links)
