Join us for a 60 ECTS MSc thesis defence in Computer Science of Arnór Friðriksson on his thesis: "Methods of constructing and analyzing points using graph theory".

Room: M119, all welcome.

Defence committee:

Supervisor :

 Szabolcs-Endre Horvát, Assistant Professor, Department of Computer Science, Reykjavik University

Committee members: 

María Óskarsdóttir, Associate Professor, Reykjavik University, Iceland

Luca Aceto, Professor, professor, Department of Computer Science, Reykjavik University

Abstract:

β-skeletons are a type of parametrized proximity graph that represents neighbourhood relations of spatial point sets, and accurately captures their local structure in arbitrary dimensions.  β-skeletons have recently been proposed as a tool for characterizing spatial point patterns through the corresponding proximity graphs.  To aid such analysis, and help better understand the relationship between the characteristics of point patterns and their proximity graphs, artificial point sets with controlled structures are investigated.  We consider both the direct and inverse problem: investigating the graphs that result from known point sets, and constraining the resulting graph in some way and producing a point set that induces it.  We examine two types of point patterns: Fibonacci lattices (including a detailed treatment of their properties), and patterns generated so as to keep their β-skeletons connected even for high β. As part of this work, we developed an efficient software implementation for computing β-skeletons in arbitrary dimensions, and integrated them into the popular igraph network analysis library.