Show simple item record

Datastructures for approximate shortest paths queries in polygons with holes

dc.rights.licenseCC-BY-NC-ND
dc.contributor.advisorStaals, F
dc.contributor.authorGlazenburg, Erwin
dc.date.accessioned2022-09-09T02:01:12Z
dc.date.available2022-09-09T02:01:12Z
dc.date.issued2022
dc.identifier.urihttps://studenttheses.uu.nl/handle/20.500.12932/42516
dc.description.sponsorshipUtrecht University
dc.language.isoEN
dc.subjectWe introduce a datastructure to find approximate Euclidean shortest paths, based on a datastructure to find exact Manhattan shortest paths. We prove that it works in theory, and implement it and test it in practice.
dc.titleDatastructures for approximate shortest paths queries in polygons with holes
dc.type.contentMaster Thesis
dc.rights.accessrightsOpen Access
dc.subject.courseuuComputing Science
dc.thesis.id9266


Files in this item

Thumbnail
Name:
Final_thesis.pdf
Size:
2.189Mb
Format:
PDF
View/Open

This item appears in the following Collection(s)

Show simple item record