Search
Now showing items 1-1 of 1
Using Landmarks for Near-Optimal Pathfinding on the CPU and GPU
(The Eurographics Association, 2020)
We present a new approach for path finding in weighted graphs using pre-computed minimal distance fields. By selecting the most promising minimal distance field at any given node and switching between them, our algorithm ...