Pages that link to "Item:Q3000734"
From MaRDI portal
The following pages link to Approximate Shortest Paths in Simple Polyhedra (Q3000734):
Displaying 15 items.
- Efficiently determining a locally exact shortest path on polyhedral surfaces (Q628181) (← links)
- Distance-preserving approximations of polygonal paths (Q868106) (← links)
- Fast computation of shortest watchman routes in simple polygons (Q1607078) (← links)
- Optimal shortest path queries in a simple polygon (Q1823689) (← links)
- Shortest paths in simple polygons with polygon-meet constraints (Q2390305) (← links)
- Approximating shortest paths on a nonconvex polyhedron (Q2706111) (← links)
- Approximate Shortest Path Queries Using Voronoi Duals (Q3052756) (← links)
- On the shortest paths between two convex polyhedra (Q3798231) (← links)
- Constructing Approximate Shortest Path Maps in Three Dimensions (Q4268702) (← links)
- Walking in a Planar Poisson–Delaunay Triangulation: Shortcuts in the Voronoi Path (Q4557734) (← links)
- Approximate Shortest Paths in Polygons with Violations (Q5149572) (← links)
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science (Q5191519) (← links)
- Shortest paths, single origin‐destination network design, and associated polyhedra (Q5287444) (← links)
- IMPROVING SHORTEST PATHS IN THE DELAUNAY TRIANGULATION (Q5300011) (← links)
- Shortest Path in a Polygon using Sublinear Space. (Q5368680) (← links)