Pages that link to "Item:Q3191995"
From MaRDI portal
The following pages link to Approximation algorithms for geometric shortest path problems (Q3191995):
Displaying 21 items.
- Approximating generalized distance functions on weighted triangulated surfaces with applications (Q425342) (← links)
- Line facility location in weighted regions (Q543511) (← links)
- A survey of geodesic paths on 3D surfaces (Q654287) (← links)
- Shortest monotone descent path problem in polyhedral terrain (Q876505) (← links)
- Approximation algorithms for shortest descending paths in terrains (Q972363) (← links)
- Approximating the integral Fréchet distance (Q1615637) (← links)
- Path refinement in weighted regions (Q1799222) (← links)
- Shortest path geometric rounding (Q1977118) (← links)
- On approximating shortest paths in weighted triangular tessellations (Q2154121) (← links)
- Curve matching, time warping, and light fields: New algorithms for computing similarity between curves (Q2384118) (← links)
- An approximation algorithm for computing shortest paths in weighted 3-d domains (Q2391841) (← links)
- Efficient computation of geodesic shortest paths (Q2819608) (← links)
- An Experimental Study of Weighted k-Link Shortest Path Algorithms (Q3564306) (← links)
- Modeling Optimal Beam Treatment with Weighted Regions for Bio-medical Applications (Q3628368) (← links)
- Line Segment Facility Location in Weighted Subdivisions (Q3638446) (← links)
- Fast Algorithms for Geometric Traveling Salesman Problems (Q4024311) (← links)
- Geometric <i>k</i> Shortest Paths (Q5363016) (← links)
- Fundamentals of Computation Theory (Q5900801) (← links)
- Approximating shortest paths on weighted polyhedral surfaces (Q5940611) (← links)
- On approximating shortest paths in weighted triangular tessellations (Q6161478) (← links)
- A Steiner-point-based algorithm for approximate shortest paths in weighted equilateral-triangle meshes (Q6499550) (← links)
