Sökning: "Sugiyama layout algorithm"
Hittade 4 uppsatser innehållade orden Sugiyama layout algorithm.
1. Kravbaserad layout - Algoritm för automatisk grafritning
Kandidat-uppsats, KTH/Skolan för informations- och kommunikationsteknik (ICT)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
2. CluStic – Automatic graph drawing with clusters
Master-uppsats, KTH/Skolan för datavetenskap och kommunikation (CSC)Sammanfattning : Finding a visually pleasing layout from a set of vertices and edges is the goal of automatic graph drawing. A requirement that has been barely explored however, is that users would like to specify portions of their layouts that are not altered by such algorithms. LÄS MER
3. Evaluation and Improvement of a 2D UML Class Diagram Layout Algorithm
Magister-uppsats, Matematiska och systemtekniska institutionenSammanfattning : Measuring the quality of software is a complex task. Various analyses and computations of software quality metrics support this process. For certain investigations it is helpful to visualize the relations between different components of software in order to check quality aspects. LÄS MER
4. Development and Implementation of an Algorithm for the Automatic Computation of Layouts for UML2.0 Class Diagrams
Kandidat-uppsats, Matematiska och systemtekniska institutionenSammanfattning : Reverse Engineering of software is a complex task. It is supported by various analyses and the computation of certain software quality metrics. To get an overview of the structure of the analysed software it is often necessary to visualize the relations between different components of software. LÄS MER