| dc.rights.license | CC-BY-NC-ND | |
| dc.contributor.advisor | Staals, Frank | |
| dc.contributor.advisor | Löffler, Maarten | |
| dc.contributor.author | Kwaks, G. | |
| dc.date.accessioned | 2020-12-18T19:00:10Z | |
| dc.date.available | 2020-12-18T19:00:10Z | |
| dc.date.issued | 2020 | |
| dc.identifier.uri | https://studenttheses.uu.nl/handle/20.500.12932/38359 | |
| dc.description.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. | |
| dc.description.sponsorship | Utrecht University | |
| dc.format.extent | 973349 | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | en | |
| dc.title | I/O-efficient shortest path algorithm for simple polygons | |
| dc.type.content | Master Thesis | |
| dc.rights.accessrights | Open Access | |
| dc.subject.keywords | I/O-efficient, shortest path, algorithm | |
| dc.subject.courseuu | Game and Media Technology | |
