Visualizer of bi-connected graphs
Name
Sander Tiganik
Abstract
The goal of this thesis is to look at the problems connected with the visualization
of planar graphs, more precisely, how to determine the planarity of certain
kinds of graphs. Bi-connected graphs are viewed separately. There are many
well known solving algorithms for this graph class. This thesis concentrates on
the path addition method created by J. Hopcroft and R. Tarjan. The algorithm
is used to solve the problem of how to create the best possible planar projection
of a non-planar graph. As a result of this thesis a program was created, which
lets you find such a projection in PDF-format. Also the user can interactively
improve the outcome.
Graduation Thesis language
Estonian
Graduation Thesis type
Bachelor - Computer Science
Supervisor(s)
Ahti Peder
Defence year
2015