BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:ab4f2a0cabfe57ae713096ced8ae3a2a
DTSTAMP:20261113T075836Z
SUMMARY:CS MSc Thesis Presentation 12 December 2025
DESCRIPTION:Kontakt: birger.swahn@cs.lth.se\n\nFriday\, 12 December there w
 ill be a master thesis presentation in Computer Science at Lund University
 \, Faculty of Engineering.The presentation will take place in E:2116.Note 
 to potential opponents: Register as an opponent to the presentation of you
 r choice by sending an email to the examiner for that presentation (firstn
 ame.lastname@cs.lth.se). Do not forget to specify the presentation you reg
 ister for! Note that the number of opponents may be limited (often to two)
 \, so you might be forced to choose another presentation if you register t
 oo late. Registrations are individual\, just as the oppositions are! More 
 instructions for opponents are found here on the LTH thesis project page.1
 3:15-14:00 in E:2116 N.B. No more opponents for this presentationPresenter
 s: Hanna Hertzberg\, Alfred AnderssonTitle: Comparison of data structures 
 for spatial databasesExaminer: Flavius GruianSupervisor: Jonas Skeppstedt 
 (LTH)\, Tobias Leksell (Tactel)This thesis compares the performance of thr
 ee types of search trees---the point-region quadtree\, the Guttman R-tree 
 and the Hilbert packed R-tree. The goal was to find the fastest data struc
 ture when querying for points within a radius of a given point\, and find 
 the polygon a given point is situated inside of.The results showed the Hil
 bert tree and quadtree to be performing equally fast when searching within
  a radius of a given point. The R-tree\, on the other hand\, performed poo
 rly by being both the slowest and the most complicated to implement. For t
 he polygon problem the quadtree was not used due to the structure's inabil
 ity to handle polygons. Again the Hilbert tree outperformed the R-tree.Eva
 luation was done by measuring the execution time of different operations o
 n a POWER9 server. All code was written in C++.&nbsp\;\n\nMer information 
 om händelsen: https://www.cs.lth.se/evenemang/cs-msc-thesis-presentation-
 12-december-2025
DTSTART;TZID=GMT:20251212T121500
DTEND;TZID=GMT:20251212T130000
LOCATION:E:2116
END:VEVENT
END:VCALENDAR
