Pages that link to "Item:Q3798231"
From MaRDI portal
The following pages link to On the shortest paths between two convex polyhedra (Q3798231):
Displaying 11 items.
- 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)
- Time and space efficient algorithms for shortest paths between convex polygons (Q1098634) (← links)
- Simplified Voronoi diagrams (Q1101687) (← links)
- Unobstructed shortest paths in polyhedral environments (Q1102729) (← links)
- On the geodesic Voronoi diagram of point sites in a simple polygon (Q1115602) (← links)
- Improved lower bounds on the length of Davenport-Schinzel sequences (Q1119587) (← links)
- A survey of motion planning and related geometric algorithms (Q1123032) (← links)
- Approximating shortest paths on a nonconvex polyhedron (Q2706111) (← links)
- (Q3706430) (← links)
- New results on shortest paths in three dimensions (Q5361664) (← links)