I/O-efficient shortest path algorithm for simple polygons
Publication date
Authors
Kwaks, G.
DOI
Document Type
Master Thesis
Metadata
Show full item recordCollections
License
CC-BY-NC-ND
Abstract
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.
Keywords
I/O-efficient, shortest path, algorithm