Return to search

Implementace algoritmu pro shlukování hran grafu / Implementing Edge Clustering for Graphs

The objective of the thesis is to explore graph layout and edge clustering to improve graph visibility and the overall edge crossings. A summary of tools focusing on improving of graph visualisation is given. The thesis describes in more details a method of geometry--based edge clustering. Further, the method is implemented in a C++ library. The library itself can handle both simple and more complex graphs with a lot of vertices and edges.

Identiferoai:union.ndltd.org:nusl.cz/oai:invenio.nusl.cz:264934
Date January 2015
CreatorsKlimčíková, Iveta
ContributorsCharvát, Lukáš, Smrčka, Aleš
PublisherVysoké učení technické v Brně. Fakulta informačních technologií
Source SetsCzech ETDs
LanguageCzech
Detected LanguageEnglish
Typeinfo:eu-repo/semantics/masterThesis
Rightsinfo:eu-repo/semantics/restrictedAccess

Page generated in 0.002 seconds