I/O-efficient shortest path algorithm for simple polygons

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.