Pages that link to "Item:Q5054837"
From MaRDI portal
The following pages link to An ε — Approximation algorithm for weighted shortest paths on polyhedral surfaces (Q5054837):
Displaying 15 items.
- On representing a simple polygon perceivable to a blind person (Q506157) (← links)
- Algorithms for approximate shortest path queries on weighted polyhedral surfaces (Q603866) (← links)
- Approximation algorithms for shortest descending paths in terrains (Q972363) (← links)
- On discretization methods for approximating optimal paths in regions with direction-dependent costs (Q1045920) (← links)
- On approximating shortest paths in weighted triangular tessellations (Q2154121) (← links)
- Discrete geodesic graph (DGG) for computing geodesic distances on polyhedral surfaces (Q2357709) (← links)
- An optimal-time algorithm for shortest paths on a convex polytope in three dimensions (Q2482203) (← 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)
- An ε — Approximation algorithm for weighted shortest paths on polyhedral surfaces (Q5054837) (← links)
- Approximate Shortest Paths in Polygons with Violations (Q5149572) (← links)
- Pursuit evasion on polyhedral surfaces (Q5963379) (← links)
- On approximating shortest paths in weighted triangular tessellations (Q6161478) (← links)
- Path planning in a weighted planar subdivision under the Manhattan metric (Q6184991) (← links)
- A Steiner-point-based algorithm for approximate shortest paths in weighted equilateral-triangle meshes (Q6499550) (← links)
