| dc.rights.license | CC-BY-NC-ND | |
| dc.contributor.advisor | Staals, F | |
| dc.contributor.author | Rombouts, Youri | |
| dc.date.accessioned | 2022-07-14T00:01:10Z | |
| dc.date.available | 2022-07-14T00:01:10Z | |
| dc.date.issued | 2022 | |
| dc.identifier.uri | https://studenttheses.uu.nl/handle/20.500.12932/41740 | |
| dc.description.sponsorship | Utrecht University | |
| dc.language.iso | EN | |
| dc.subject | Geometric graph similarity is a problem that can be used to evaluate the performance of road map construction algorithms. In this document we describe a research which investigates the possibilities of more continuous and error tolerant graph similarity measures than the ones in use in the field today. This is done by developing an error tolerant geometric graph distance ILP, based on the one introduced by Cheong et al. (2009). | |
| dc.title | Geometric Graph Similarity | |
| dc.type.content | Master Thesis | |
| dc.rights.accessrights | Open Access | |
| dc.subject.keywords | Geometric Graphs, ILP, Edit Distance, Sampling, Fréchet Distance | |
| dc.subject.courseuu | Computing Science | |
| dc.thesis.id | 5502 | |
