Toggle navigation
Toggle navigation
View Item
Utrecht University Student Theses Repository Home
UU Theses Repository
Theses
View Item
Utrecht University Student Theses Repository Home
UU Theses Repository
Theses
View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.
Browse
All of UU Student Theses Repository
By Issue Date
Authors
Titles
Subjects
This Collection
By Issue Date
Authors
Titles
Subjects
I/O-efficient shortest path algorithm for simple polygons
View/
Open
Thesis_Gijs_Kwaks_4133080.pdf (950.5Kb)
Publication date
2020
Author
Kwaks, G.
Metadata
Show full item record
Summary
In this thesis we determine whether an I/O-efficient shortest path algorithm has practical applications by comparing it to a state of the art internal memory competitor.
URI
https://studenttheses.uu.nl/handle/20.500.12932/38359
Collections
Theses