Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Reischl, Maximilian"'
Publikováno v:
In Computers & Graphics February 2022 102:1-8
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 tries to find the shortest pa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c58b0de398a9428de04946f77fd049d5
