Sökning: "graph drawing algorithm"

Visar resultat 1 - 5 av 8 uppsatser innehållade orden graph drawing algorithm.

  1. 1. Improving The Visualization And Animation Of Weighted Dynamic Networks Using Force-Directed Graph Drawing Algorithms

    Master-uppsats, Linköpings universitet/Institutet för analytisk sociologi, IAS; Linköpings universitet/Filosofiska fakulteten

    Författare :Guus Winkelmolen; [2021]
    Nyckelord :;

    Sammanfattning : The visualization of networks as graphs composed of nodes and vertices benefits many fields of science including social network analysis. The use case of visualizations is twofold. Firstly, easy initial visualization of networks will help researchers find and specify their hypotheses before having to do any technical analysis. LÄS MER

  3. 2. Interactive visualization of community structure in complex networks

    Master-uppsats, Umeå universitet/Institutionen för fysik

    Författare :Anton Eriksson; [2018]
    Nyckelord :networks; visualization; clustering; community detection; graph layout;

    Sammanfattning : Several applied sciences model system dynamics with networks. Since networks often contain thousands or millions of nodes and links, researchers have developed methods that reveal and high- light their essential structures. LÄS MER

  4. 3. Kravbaserad layout - Algoritm för automatisk grafritning

    Kandidat-uppsats, KTH/Skolan för informations- och kommunikationsteknik (ICT)

    Författare :Zimin Chen; Huan Xie; [2016]
    Nyckelord :graph drawing algorithm; constraints-based; Sugiyama framework; Force-directed layout; Grafritningsalgoritm; kravbaserad; Sugiyama-ramverk; kraftbaserad layout.;

    Sammanfattning : I den här studien utformas och implementeras en prototyp av ett automatiskt grafritningsverktyg. Under processen analyseras och evalueras flera välkända och viktiga algoritmer. Algoritmen som används i prototypen modifieras och förbättras för att uppfylla företaget FindOuts speciella krav. LÄS MER

  5. 4. Comparison and implementation of graph visualization algorithms using JavaFX

    M1-uppsats, Linköpings universitet/Databas och informationsteknik

    Författare :Dennis Örnberg; [2016]
    Nyckelord :;

    Sammanfattning : Graph drawing is an important area in computer science and it has many different application areas. For example, graphs can be used to visualize structures like networks and databases. When the graphs are really big, however, it becomes difficult to draw them so that the user can get a good overview of the whole graph and all of its data. LÄS MER

  7. 5. Comparison of Visualization Algorithms for Graphs and Implementation of Visualization Algorithm for Multi-Touch table using JavaFX

    M1-uppsats, Linköpings universitet/Databas och informationsteknik

    Författare :Daniel Sund; [2016]
    Nyckelord :algorithms; javafx; visualization; graph; ontology;

    Sammanfattning : Ontologies are representations of specific domains. They help with understanding the concepts within these domains by providing definitions of their components and how they relate to each other. Ontologies are often huge and may contain thousands to hundreds of thousands of concepts. LÄS MER