Home > Search Results: keywords:"algoritmus Kanai Suzuki"
Search:
Search Tips :: Advanced Search
Search collections:
Sort by: Display results: Output format:
National Repository of Grey Literature 2 records found  Search took 0.00 seconds. 
Single Pair Shortest Path on Surface
 Mezera, Lukáš ; Švub, Miroslav (referee) ; Šiler, Ondřej (advisor)
Finding the shortest path is a fundamental problem in computational geometry. Optimal solution is computation by force of Dijkstra algorithm. There are many approximation algorithms which we can use for calculate the shortest path.
Detailed record
Single Pair Shortest Path on Surface
 Mezera, Lukáš ; Švub, Miroslav (referee) ; Šiler, Ondřej (advisor)
Finding the shortest path is a fundamental problem in computational geometry. Optimal solution is computation by force of Dijkstra algorithm. There are many approximation algorithms which we can use for calculate the shortest path.
Detailed record

Interested in being notified about new results for this query?
Subscribe to the RSS feed.
Digital Repository :: Search :: Submit :: Personalize :: Help
Powered by Invenio v1.1.2
Maintained by admin.invenio@techlib.cz
This site is also available in the following languages:
Česky  English