Hoppa till huvudinnehåll

2019 och senare



CS MSc Thesis Presentation 25 April 2024

Tid: 2024-04-25 13:15 till 14:00 Föreläsning

One Computer Science MSc thesis to be presented on 25 April

Thursday, 25 April there will be a master thesis presentation in Computer Science at Lund University, Faculty of Engineering.

The presentation will take place in E:2405 (Glasburen).

Note to potential opponents: N.B. No more places for opponents for this presentation. Register as an opponent to the presentation of your choice by sending an email to the examiner for that presentation (firstname.lastname@cs.lth.se). Do not forget to specify the presentation you register 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 too late. Registrations are individual, just as the oppositions are! More instructions are found on this page.

13:15-14:00 in E:2405 (Glasburen)

Presenter: Isak Nilsson
Title: Force Directed Drawing Algorithms and Parameter Optimisation
Examiner: Flavius Gruian
Supervisors: Jonas Skeppstedt (LTH), Jens Oknelid (Neo4j, inc)

Through my thesis I have implemented and compared some different graph drawing algorithms in addition to some methods to speed up the slow parts of these algorithms. These algorithms were then used to test what to the best of my knowledge is a novel approach to select parameter values for graph drawing algorithms. For this, I use methods similar to those used in Machine Learning to select parameter values and measure the utility of any set of parameters by creating my own utility function. I created this function by looking at objective measures of drawing quality that are commonly known, such as the number of edge crossings, along with the time it took to draw a given graph. The resulting method for parameter optimisation could find significant increases in the speed of graph drawing for several of my implemented drawing algorithms without compromising drawing quality. Furthermore, the approach is not specific to any parameter set, and can with some modification be applied to any graph drawing algorithm dependent on some constants.

Link to popular science summary: To be uploaded


Om händelsen
Tid: 2024-04-25 13:15 till 14:00

E:2405 (Glasburen)

birger [dot] swahn [at] cs [dot] lth [dot] se

Sidansvarig: peter.moller@cs.lth.se | 2024-03-18