| dc.rights.license | CC-BY-NC-ND | |
| dc.contributor.advisor | Staals, F | |
| dc.contributor.author | Theunissen, Lorenzo | |
| dc.date.accessioned | 2023-08-10T00:02:24Z | |
| dc.date.available | 2023-08-10T00:02:24Z | |
| dc.date.issued | 2023 | |
| dc.identifier.uri | https://studenttheses.uu.nl/handle/20.500.12932/44564 | |
| dc.description.sponsorship | Utrecht University | |
| dc.language.iso | EN | |
| dc.subject | We present an algorithm and data structure to support approximate geodesic nearest neighbour queries for a set of sites S in a static polygon P with holes. Our data structure allows us to take a query point q from the set Q of query points that lie in P, and ask for the site in S closest to q. All distances are measured using the geodesic distance, that is, the length of the shortest path that is completely contained in P. | |
| dc.title | Dynamic Approximate Geodesic Nearest Neighbour Searching in Polygons with Holes | |
| dc.type.content | Master Thesis | |
| dc.rights.accessrights | Open Access | |
| dc.subject.keywords | data structure; polygon with holes; geodesic distance; approximation algorithm; nearest neighbour searching; theoretical computer science; geometric algorithm | |
| dc.subject.courseuu | Computing Science | |
| dc.thesis.id | 21332 | |
