81 research outputs found

    Visualization of Graph Structures

    Get PDF
    Import 03/11/2016Bakalářská práce se zabývá vytvořením aplikace pro vizualizaci grafových struktur, která bude umožňovat zobrazení a základní práci s grafovými strukturami. První část této práce popisuje současné trendy v oblasti vizualizace a práce s daty a jejich prezentací. Druhá část je zaměřená na výběr algoritmů a implementaci aplikace. Třetí část je zaměřena na výkonnostní testy aplikace ve zpracování dat za použití ruzných prohlížečů a při různých nastaveních.The bachelor thesis deals with create appliaction for visualization graph structures, which will allow display and basic work with graph structures. The first part of this work describes current trends in visualization and work with data and their presentation. The second part is focused to selection algorithms and implementation application. The third part is focused on performance testing application in data processing using different browsers and at different settings.460 - Katedra informatikyvelmi dobř

    Peacock Bundles: Bundle Coloring for Graphs with Globality-Locality Trade-off

    Full text link
    Bundling of graph edges (node-to-node connections) is a common technique to enhance visibility of overall trends in the edge structure of a large graph layout, and a large variety of bundling algorithms have been proposed. However, with strong bundling, it becomes hard to identify origins and destinations of individual edges. We propose a solution: we optimize edge coloring to differentiate bundled edges. We quantify strength of bundling in a flexible pairwise fashion between edges, and among bundled edges, we quantify how dissimilar their colors should be by dissimilarity of their origins and destinations. We solve the resulting nonlinear optimization, which is also interpretable as a novel dimensionality reduction task. In large graphs the necessary compromise is whether to differentiate colors sharply between locally occurring strongly bundled edges ("local bundles"), or also between the weakly bundled edges occurring globally over the graph ("global bundles"); we allow a user-set global-local tradeoff. We call the technique "peacock bundles". Experiments show the coloring clearly enhances comprehensibility of graph layouts with edge bundling.Comment: Appears in the Proceedings of the 24th International Symposium on Graph Drawing and Network Visualization (GD 2016

    Visualization of Frequent Itemsets with Nested Circular Layout and Bundling Algorithm

    Get PDF
    International audienceFrequent itemset mining is one of the major data mining issues. Once generated by algorithms, the itemsets can be automatically processed, for instance to extract association rules. They can also be explored with visual tools, in order to analyze the emerging patterns. Graphical itemsets representation is a convenient way to obtain an overview of the global interaction structure. However, when the complexity of the database increases, the network may become unreadable. In this paper, we propose to display itemsets on concentric circles, each one being organized to lower the intricacy of the graph through an optimization process. Thanks to a graph bundling algorithm, we finally obtain a compact representation of a large set of itemsets that is easier to exploit. Colors accumulation and interaction operators facilitate the exploration of the new bundle graph and to illustrate how much an itemset is supported by the data

    Edge Routing with Ordered Bundles

    Full text link
    Edge bundling reduces the visual clutter in a drawing of a graph by uniting the edges into bundles. We propose a method of edge bundling drawing each edge of a bundle separately as in metro-maps and call our method ordered bundles. To produce aesthetically looking edge routes it minimizes a cost function on the edges. The cost function depends on the ink, required to draw the edges, the edge lengths, widths and separations. The cost also penalizes for too many edges passing through narrow channels by using the constrained Delaunay triangulation. The method avoids unnecessary edge-node and edge-edge crossings. To draw edges with the minimal number of crossings and separately within the same bundle we develop an efficient algorithm solving a variant of the metro-line crossing minimization problem. In general, the method creates clear and smooth edge routes giving an overview of the global graph structure, while still drawing each edge separately and thus enabling local analysis
    corecore