Library for graph visualization in 3D space

Library for graph visualization in 3D space

Peter Kajan

Abstract. The presented thesis deals with the visualization of large graphs. Chosen dynamic graph layout algorithms are analyzed in this paper. Algorithms computed on GPU are also mentioned and one of them is analyzed. Further, this paper deals with rendering optimization using scene graph. The goal of this thesis was to design and implement system able to visualize large graphs in 3D space using one of the analyzed layout algorithms and one of the scene graphs. The system has been tested on the set of graphs with known and unknown shape. It achieves “nice”drawings of graphs up to 5000 vertices in satisfying period of time. Results are presented at the end of this paper.

Enslyon (2682 nodes).

Veolia (639 nodes).

Graph illustrating small world (100 nodes).

Graph illustrating sending mail between people during year.