| dc.rights.license | CC-BY-NC-ND | |
| dc.contributor.advisor | Staals, F | |
| dc.contributor.author | Vroegindeweij, Jeppe | |
| dc.date.accessioned | 2024-07-24T23:02:38Z | |
| dc.date.available | 2024-07-24T23:02:38Z | |
| dc.date.issued | 2024 | |
| dc.identifier.uri | https://studenttheses.uu.nl/handle/20.500.12932/46855 | |
| dc.description.abstract | This thesis is focused on the cutting tree data structure, which can be used for simplex range searching problems. The cutting tree is a data structure that allows for fast query times, but this comes at the cost of memory. The memory cost of using the cutting tree is O(n^2), which is unsuited for practical implementations. To overcome this problem we have analysed the data structure from an I/O efficiency standpoint since memory cost is less of a problem in external memory. We also constructed an implementation of the cutting tree to better analyse the bottlenecks of using the data structure. | |
| dc.description.sponsorship | Utrecht University | |
| dc.language.iso | EN | |
| dc.subject | I/O efficient cutting trees, analysis of the geometric data structure cutting tree in an external memory capacity and a practical implementation | |
| dc.title | I/O efficient cutting trees | |
| dc.type.content | Master Thesis | |
| dc.rights.accessrights | Open Access | |
| dc.subject.keywords | Cutting tree, I/O efficiency, Computation geometry, external memory, data structure | |
| dc.subject.courseuu | Game and Media Technology | |
| dc.thesis.id | 34860 | |
