Pages that link to "Item:Q2819608"
From MaRDI portal
The following pages link to Efficient computation of geodesic shortest paths (Q2819608):
Displaying 29 items.
- Approximating generalized distance functions on weighted triangulated surfaces with applications (Q425342) (← links)
- A survey of geodesic paths on 3D surfaces (Q654287) (← links)
- Computing generalized higher-order Voronoi diagrams on triangulated surfaces (Q732480) (← links)
- An optimal-time algorithm for shortest paths on realistic polyhedra (Q848859) (← links)
- Shortest monotone descent path problem in polyhedral terrain (Q876505) (← links)
- On realistic terrains (Q934023) (← links)
- Shortest curves in planar regions with curved boundary (Q1210291) (← links)
- Designing approximation minimal parametric surfaces with geodesics (Q1788755) (← links)
- Shortest path geometric rounding (Q1977118) (← links)
- Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane (Q2084662) (← links)
- Routing among convex polygonal obstacles in the plane (Q2149846) (← links)
- Discrete geodesic graph (DGG) for computing geodesic distances on polyhedral surfaces (Q2357709) (← links)
- Curve matching, time warping, and light fields: New algorithms for computing similarity between curves (Q2384118) (← links)
- An optimal-time algorithm for shortest paths on a convex polytope in three dimensions (Q2482203) (← links)
- Metric combinatorics of convex polyhedra: cut loci and nonoverlapping unfoldings (Q2482209) (← links)
- Space complexity of exact discrete geodesic algorithms on regular triangulations (Q2628269) (← links)
- Constructing a minimum path on a polyhedral surface in \(\mathbb R^3\) (Q2850299) (← links)
- Approximation algorithms for geometric shortest path problems (Q3191995) (← links)
- (Q3574261) (← links)
- Computing geodesic paths on manifolds (Q3838485) (← links)
- Finding Shortest Paths in a Sequence of Triangles in 3D by the Planar Unfolding (Q4631913) (← links)
- Drawing Shortest Paths in Geodetic Graphs (Q5014127) (← links)
- Drawing Shortest Paths in Geodetic Graphs (Q5050002) (← links)
- Geometric <i>k</i> Shortest Paths (Q5363016) (← links)
- Thaw: A Tool for Approximating Cut Loci on a Triangulation of a Surface (Q5471251) (← links)
- Variational, Geometric, and Level Set Methods in Computer Vision (Q5493293) (← links)
- Fundamentals of Computation Theory (Q5900801) (← links)
- Inapproximability of finding maximum hidden sets on polygons and terrains (Q5959557) (← links)
- Routing among convex polygonal obstacles in the plane (Q6610091) (← links)
