DOCSLIB.ORG

Algorithms for Graph Visualization Flow Methods: Orthogonal Layout

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Algorithms for Graph Visualization Flow Methods: Orthogonal Layout Algorithms for Graph Visualization Flow Methods: Orthogonal Layout INSTITUT FUR¨ THEORETISCHE INFORMATIK · FAKULTAT¨ FUR¨ INFORMATIK Tamara Mchedlidze 18.01.2018 1 Dr. Tamara Mchedlidze · Algorithmen zur Visualisierung von Graphen Flussmethoden: orthogonales Graphenzeichnen Orthogonal Layout • Edges consist of vertical and horizontal segments • Applied in many areas ER diagram in OGDF UML diagram by Oracle Organigram of HS Limburg Circuit diagram by Jeff Atwood 2 - 1 Dr. Tamara Mchedlidze · Algorithmen zur Visualisierung von Graphen Flussmethoden: orthogonales Graphenzeichnen Orthogonal Layout • Edges consist of vertical and horizontal segments • Applied in many areas Aesthetic functions? ER diagram in OGDF UML diagram by Oracle Organigram of HS Limburg Circuit diagram by Jeff Atwood 2 - 2 Dr. Tamara Mchedlidze · Algorithmen zur Visualisierung von Graphen Flussmethoden: orthogonales Graphenzeichnen Orthogonal Layout • Edges consist of vertical and horizontal segments • Applied in many areas Aesthetic functions: • number of bends • length of edges • ER diagram in OGDF width, height, area • monotonicity of edges UML diagram by Oracle • ... Organigram of HS Limburg Circuit diagram by Jeff Atwood 2 - 3 Dr. Tamara Mchedlidze · Algorithmen zur Visualisierung von Graphen Flussmethoden: orthogonales Graphenzeichnen (Planar) Orthogonal Drawings Three-step approach: Topology { Shape { Metrics [Tamassia SIAM J. Comput. 1987] V = fv1; v2; v3; v4g E = fv1v2; v1v3; v1v4; v2v3; v2v4g 3 - 1 Dr. Tamara Mchedlidze · Algorithmen zur Visualisierung von Graphen Flussmethoden: orthogonales Graphenzeichnen (Planar) Orthogonal Drawings Three-step approach: Topology { Shape { Metrics [Tamassia SIAM J. Comput. 1987] V = fv1; v2; v3; v4g E = fv1v2; v1v3; v1v4; v2v3; v2v4g combinatorial embedding/ planarization 4 3 Reduce Crossings 2 1 3 - 2 Dr. Tamara Mchedlidze · Algorithmen zur Visualisierung von Graphen Flussmethoden: orthogonales Graphenzeichnen (Planar) Orthogonal Drawings Three-step approach: Topology { Shape { Metrics [Tamassia SIAM J. Comput. 1987] V = fv1; v2; v3; v4g E = fv1v2; v1v3; v1v4; v2v3; v2v4g combinatorial embedding/ planarization 4 4 3 Bend Minimization Reduce Crossings 1 3 2 orthogonal 1 representation 2 3 - 3 Dr. Tamara Mchedlidze · Algorithmen zur Visualisierung von Graphen Flussmethoden: orthogonales Graphenzeichnen (Planar) Orthogonal Drawings Three-step approach: Topology { Shape { Metrics [Tamassia SIAM J. Comput. 1987] 4 V = fv1; v2; v3; v4g 3 E = fv1v2; v1v3; v1v4; v2v3; v2v4g 1 combinatorial 2 embedding/ planar planarization Area- orthogonal minimization 4 drawing 4 3 Bend Minimization Reduce Crossings 1 3 2 orthogonal 1 representation 2 3 - 4 Dr. Tamara Mchedlidze · Algorithmen zur Visualisierung von Graphen Flussmethoden: orthogonales Graphenzeichnen (Planar) Orthogonal Drawings Three-step approach: Topology { Shape { Metrics [Tamassia SIAM J. Comput. 1987] 4 V = fv1; v2; v3; v4g 3 E = fv1v2; v1v3; v1v4; v2v3; v2v4g 1 combinatorial 2 embedding/ planar planarization Area- orthogonal minimization 4 drawing 4 3 Bend Minimization Reduce Crossings 1 3 2 orthogonal 1 representation 2 3 - 5 Dr. Tamara Mchedlidze · Algorithmen zur Visualisierung von Graphen Flussmethoden: orthogonales Graphenzeichnen Orthogonal Representation Given: planar Graph G = (V; E), set of faces F, outer face f0 Find: orthogonale representation H(G) = fH(f) j f 2 Fg Face representation H(f): of f is a clockwise* ordered sequence of edge descriptions (e; δ; α) with • e edge of f • δ is sequence of f0; 1g∗ (0 = right bend, 1 = left bend) • π 3π 0 α is angle 2 f 2 ; π; 2 ; 2πg between e and next edge e 4 Dr. Tamara Mchedlidze · Algorithmen zur Visualisierung von Graphen Flussmethoden: orthogonales Graphenzeichnen Orthogonal Representation: Example π 3π π H(f0) = ((e1; 11; 2 ); (e5; 111; 2 ); (e4; ;; π); (e3; ;; π); (e2; ;; 2 )) 3π π H(f1) = ((e1; 00; 2 ); (e2; ;; 2 ); (e6; 00; π)) π π π H(f2) = ((e5; 000; 2 ); (e6; 11; 2 ); (e3; ;; π); (e4; ;; 2 )) e3 f e2 0 Combinatorial \drawing" of H(G)? f1 f2 e4 e6 e1 e5 5 - 1 Dr. Tamara Mchedlidze · Algorithmen zur Visualisierung von Graphen Flussmethoden: orthogonales Graphenzeichnen Orthogonal Representation: Example π 3π π H(f0) = ((e1; 11; 2 ); (e5; 111; 2 ); (e4; ;; π); (e3; ;; π); (e2; ;; 2 )) 3π π H(f1) = ((e1; 00; 2 ); (e2; ;; 2 ); (e6; 00; π)) π π π H(f2) = ((e5; 000; 2 ); (e6; 11; 2 ); (e3; ;; π); (e4; ;; 2 )) 1 e1 1 f0 0 0 1 e2 e3 e4 e e 3 0 f0 2 0 f1 0 f1 f2 e4 e 1 f2 e6 1 6 e1 0 0 e5 1 e5 1 5 - 2 Dr. Tamara Mchedlidze · Algorithmen zur Visualisierung von Graphen Flussmethoden: orthogonales Graphenzeichnen Orthogonal Representation: Example π 3π π H(f0) = ((e1; 11; 2 ); (e5; 111; 2 ); (e4; ;; π); (e3; ;; π); (e2; ;; 2 )) H(f ) = ((e ; 00; 3π ); (e ; ;; π ); (e ; 00; π)) 1 1 2 2 2 6 is f0 listed wrongly!? π π π H(f2) = ((e5; 000; 2 ); (e6; 11; 2 ); (e3; ;; π); (e4; ;; 2 )) 1 e1 1 f0 0 0 1 e2 e3 e4 e e 3 0 f0 2 0 f1 0 f1 f2 e4 e 1 f2 e6 1 6 e1 0 0 e5 1 e5 1 5 - 3 Dr. Tamara Mchedlidze · Algorithmen zur Visualisierung von Graphen Flussmethoden: orthogonales Graphenzeichnen Orthogonal Representation: Example π 3π π H(f0) = ((e1; 11; 2 ); (e5; 111; 2 ); (e4; ;; π); (e3; ;; π); (e2; ;; 2 )) 3π π H(f1) = ((e1; 00; 2 ); (e2; ;; 2 ); (e6; 00; π)) π π π H(f2) = ((e5; 000; 2 ); (e6; 11; 2 ); (e3; ;; π); (e4; ;; 2 )) 1 e1 1 f0 0 0 π π e2 e3 π e4 3π 1 2 π 3π 2 π e3 π π π π π 2 e 0 2 2 2 2 2 f0 2 0 f1 0 f1 f2 e4 e 1 f2 e6 1 6 e1 0 0 e5 1 e5 1 5 - 4 Dr. Tamara Mchedlidze · Algorithmen zur Visualisierung von Graphen Flussmethoden: orthogonales Graphenzeichnen Orthogonal Representation: Example π 3π π H(f0) = ((e1; 11; 2 ); (e5; 111; 2 ); (e4; ;; π); (e3; ;; π); (e2; ;; 2 )) 3π π H(f1) = ((e1; 00; 2 ); (e2; ;; 2 ); (e6; 00; π)) π π π H(f2) = ((e5; 000; 2 ); (e6; 11; 2 ); (e3; ;; π); (e4; ;; 2 )) 1 e1 1 f0 π 0 0 2 π π π e2 e3 π e4 3π 1 0 3π 2 π e3 2 π π π π 2 e 2 2 2 2 f0 2 f1 f1 f2 e4 0 0 f2 e6 1 e6 1 e1 0 0 e5 1 e5 1 5 - 5 Dr. Tamara Mchedlidze · Algorithmen zur Visualisierung von Graphen Flussmethoden: orthogonales Graphenzeichnen Orthogonal Representation: Example π 3π π H(f0) = ((e1; 11; 2 ); (e5; 111; 2 ); (e4; ;; π); (e3; ;; π); (e2; ;; 2 )) 3π π H(f1) = ((e1; 00; 2 ); (e2; ;; 2 ); (e6; 00; π)) π π π H(f2) = ((e5; 000; 2 ); (e6; 11; 2 ); (e3; ;; π); (e4; ;; 2 )) 1 e1 1 f0 π 0 0 2 π π π e2 e3 π e4 3π 1 0 3π 2 π e3 2 π π π π 2 e 2 2 2 2 f0 2 f1 f1 f2 e4 0 0 f2 e6 1 e6 1 e1 0 0 e5 1 e5 1 concrete coordinates are not fixed yet! 5 - 6 Dr. Tamara Mchedlidze · Algorithmen zur Visualisierung von Graphen Flussmethoden: orthogonales Graphenzeichnen Correctness of an Orthogonal Representation (H1) H(G) corresponds to F; f0 6 - 1 Dr. Tamara Mchedlidze · Algorithmen zur Visualisierung von Graphen Flussmethoden: orthogonales Graphenzeichnen Correctness of an Orthogonal Representation (H1) H(G) corresponds to F; f0 (H2) for an edge fu; vg shared by faces f and g with ((u; v); δ1; α1) 2 H(f) and ((v; u); δ2; α2) 2 H(g) sequence δ1 is reverced and inverted δ2 6 - 2 Dr. Tamara Mchedlidze · Algorithmen zur Visualisierung von Graphen Flussmethoden: orthogonales Graphenzeichnen Correctness of an Orthogonal Representation (H1) H(G) corresponds to F; f0 (H2) for an edge fu; vg shared by faces f and g with ((u; v); δ1; α1) 2 H(f) and ((v; u); δ2; α2) 2 H(g) sequence δ1 is reverced and inverted δ2 (H3) Let jδj0 (resp. jδj1) be the number of zeros (resp. ones) in δ and r = (e; δ; α). For C(r) := jδj0 − jδj1 + 2 − 2α/π holds X X that: C(r) = 4 for f 6= f0 and C(r) = −4 r2H(f) r2H(f0) 6 - 3 Dr. Tamara Mchedlidze · Algorithmen zur Visualisierung von Graphen Flussmethoden: orthogonales Graphenzeichnen Correctness of an Orthogonal Representation (H1) H(G) corresponds to F; f0 (H2) for an edge fu; vg shared by faces f and g with ((u; v); δ1; α1) 2 H(f) and ((v; u); δ2; α2) 2 H(g) sequence δ1 is reverced and inverted δ2 (H3) Let jδj0 (resp. jδj1) be the number of zeros (resp. ones) in δ and r = (e; δ; α). For C(r) := jδj0 − jδj1 + 2 − 2α/π holds X X that: C(r) = 4 for f 6= f0 and C(r) = −4 r2H(f) r2H(f0) (H4) For each node v the summ of incident angles is 2π 6 - 4 Dr. Tamara Mchedlidze · Algorithmen zur Visualisierung von Graphen Flussmethoden: orthogonales Graphenzeichnen Correctness of an Orthogonal Representation (H1) H(G) corresponds to F; f0 (H2) for an edge fu; vg shared by faces f and g with ((u; v); δ1; α1) 2 H(f) and ((v; u); δ2; α2) 2 H(g) sequence δ1 is reverced and inverted δ2 (H3) Let jδj0 (resp. jδj1) be the number of zeros (resp. ones) in δ and r = (e; δ; α). For C(r) := jδj0 − jδj1 + 2 − 2α/π holds X X that: C(r) = 4 for f 6= f0 and C(r) = −4 r2H(f) r2H(f0) (H4) For each node v the summ of incident angles is 2π Pair, think and share: 5 min What does the condition (H3) mean intuitively? 6 - 5 Dr. Tamara Mchedlidze · Algorithmen zur Visualisierung von Graphen Flussmethoden: orthogonales Graphenzeichnen Bend Minization with Given Embedding Problem: Geometric Bend Minimization Given: • planar Graph G = (V; E) with maximum degree 4 • combinatorial embedding F and outer face f0 Find: orthogonal drawing with minimum number of bends that preserves the embedding 7 - 1 Dr.
Load more

Recommended publications
  • Graph Drawing  Dagstuhl Seminar 
    05191 Abstracts Collection Graph Drawing Dagstuhl Seminar Michael Jünger1, Stephen Kobourov2 and Petra Mutzel3 1 Univ. of Köln, DE 2 Univ. of Arizona, US [email protected] 3 Univ. of Dortmund, DE [email protected] Abstract. From 08.05. to 13.05.05, the Dagstuhl Seminar 05191 Graph Drawing was held in the International Conference and Research Cen- ter (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The rst section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available. Keywords. Graph Drawing, Visualization, Layout Algorithms, Inter- active Visualization 05191 Executive Summary Graph Drawing This paper summarizes the topics, aims, and achievements of the Dagstuhl Sem- inar 05191 on Graph Drawing. Keywords: Graph drawing Joint work of: Jünger, Michael; Kobourov, Stephen; Mutzel, Petra Full Paper: http://drops.dagstuhl.de/opus/volltexte/2006/342 05191 Open Problem Session Report This is a report on an informal session intended to stimulate communication and sharing of problems. Hence the attributions and citations may contain inaccu- racies, and are certainly not complete. Keywords: Open problems, graph drawing Joint work of: Whitesides, Sue Full Paper: http://drops.dagstuhl.de/opus/volltexte/2006/338 Dagstuhl Seminar Proceedings 05191 Graph Drawing http://drops.dagstuhl.de/opus/volltexte/2006/348 2 M. Jünger, S. Kobourov and P. Mutzel Matrix Zoom: A Visual Interface to Semi-external Graphs James Abello (Rutgers Univ.
    [Show full text]
  • The Open Graph Drawing Framework (OGDF)
    17 The Open Graph Drawing Framework (OGDF) Markus Chimani Friedrich-Schiller-Universit¨at Jena 17.1 Introduction::::::::::::::::::::::::::::::::::::::::::::::::: 543 • Carsten Gutwenger The History of the OGDF Outline TU Dortmund 17.2 Major Design Concepts:::::::::::::::::::::::::::::::::::: 544 Modularization • Self-Contained and Portable Source Code Michael J¨unger 17.3 General Algorithms and Data Structures ::::::::::::::: 546 • University of Cologne Augmentation and Subgraph Algorithms Graph Decomposition • Planarity and Planarization Gunnar W. Klau 17.4 Graph Drawing Algorithms ::::::::::::::::::::::::::::::: 550 • Centrum Wiskunde & Planar Drawing Algorithms Hierarchical Drawing • • Informatica Algorithms Energy-Based Drawing Algorithms Drawing Clustered Graphs Karsten Klein 17.5 Success Stories :::::::::::::::::::::::::::::::::::::::::::::: 562 • • TU Dortmund SPQR-Trees Exact Crossing Minimization Upward Graph Drawing Petra Mutzel Acknowledgments :::::::::::::::::::::::::::::::::::::::::::::::::: 564 TU Dortmund References :::::::::::::::::::::::::::::::::::::::::::::::::::::::::: 565 17.1 Introduction We present the Open Graph Drawing Framework (OGDF), a C++ library of algorithms and data structures for graph drawing. The ultimate goal of the OGDF is to help bridge the gap between theory and practice in the field of automatic graph drawing. The library offers a wide variety of algorithms and data structures, some of them requiring complex and involved implementations, e.g., algorithms for planarity testing and planarization, or data structures for graph decomposition. A substantial part of these algorithms and data structures are building blocks of graph drawing algorithms, and the OGDF aims at pro- viding such functionality in a reusable form, thus also providing a powerful platform for implementing new algorithms. The OGDF can be obtained from its website at: http://www.ogdf.net This website also provides further information like tutorials, examples, contact information, and links to related projects.
    [Show full text]
  • The Graph Crossing Number and Its Variants: a Survey
    The Graph Crossing Number and its Variants: A Survey Marcus Schaefer School of Computing DePaul University Chicago, Illinois 60604, USA [email protected] Submitted: Dec 20, 2011; Accepted: Apr 4, 2013; Published: April 17, 2013 Third edition, Dec 22, 2017 Mathematics Subject Classifications: 05C62, 68R10 Abstract The crossing number is a popular tool in graph drawing and visualization, but there is not really just one crossing number; there is a large family of crossing number notions of which the crossing number is the best known. We survey the rich variety of crossing number variants that have been introduced in the literature for purposes that range from studying the theoretical underpinnings of the crossing number to crossing minimization for visualization problems. 1 So, Which Crossing Number is it? The crossing number, cr(G), of a graph G is the smallest number of crossings required in any drawing of G. Or is it? According to a popular introductory textbook on combi- natorics [460, page 40] the crossing number of a graph is “the minimum number of pairs of crossing edges in a depiction of G”. So, which one is it? Is there even a difference? To start with the second question, the easy answer is: yes, obviously there is a differ- ence, the difference between counting all crossings and counting pairs of edges that cross. But maybe these different ways of counting don’t make a difference and always come out the same? That is a harder question to answer. Pach and Tóth in their paper “Which Crossing Number is it Anyway?” [369] coined the term pair crossing number, pcr, for the crossing number in the second definition.
    [Show full text]
  • A New Approximation Algorithm for Bend Minimization in the Kandinsky Model
    A New Approximation Algorithm for Bend Minimization in the Kandinsky Model Wilhelm Barth1, Petra Mutzel2, and Canan Yıldız1 1 Institute of Computer Graphics and Algorithms, Vienna University of Technology Favoritenstraße 9-11, 1040 Wien, Austria {barth,yildizca}@ads.tuwien.ac.at http://www.ads.tuwien.ac.at/ 2 Department of Computer Science, University of Dortmund Otto-Hahn-Str. 14, D-44227 Dortmund, Germany [email protected] http://ls11-www.cs.uni-dortmund.de/ Abstract. The Kandinsky model has been introduced by F¨oßmeier and Kaufmann in order to deal with planar orthogonal drawings of planar graphs with maximal vertex degree higher than four [7]. No polynomial- time algorithm is known for computing a (region preserving) bend mini- mal Kandinsky drawing. In this paper we suggest a new 2-approximation algorithm for this problem. Our extensive computational experiments [13] show that the quality of the computed solutions is better than those of its predecessors [6]. E.g., for all instances in the Rome graph bench- mark library [4] it computed the optimal solution, and for randomly generated triangulated graphs with up to 800 vertices, the absolute error was less than 2 on average. 1 Introduction Given a planar graph G =(V,E,F) with a fixed embedding F ,weconsider the problem of finding a region-preserving planar orthogonal drawing with the minimum number of bends. For graphs with maximal degree 4 this problem can be solved in polynomial time [12] if no parallel edge segments leaving a vertex at the same side are allowed. The idea is to set up a network in which each flow corresponds to an orthogonal drawing and vice versa.
    [Show full text]
  • New Approaches on Octilinear Graph Drawing
    New Approaches on Octilinear Graph Drawing Dissertation der Mathematisch-Naturwissenschaftlichen Fakult¨at der Eberhard Karls Universit¨atT¨ubingen zur Erlangung des Grades eines Doktors der Naturwissenschaften (Dr. rer. nat.) vorgelegt von Dipl.-Inform. (Bioinf.) Robert Krug aus Ulm T¨ubingen 2015 abc Gedruckt mit Genehmigung der Mathematisch-Naturwissenschaftlichen Fakult¨at der Eberhard Karls Universit¨atT¨ubingen. Tag der m¨undlichen Qualifikation 28.04.2015 Dekan: Prof. Dr. Wolfgang Rosenstiel 1. Berichterstatter: Prof. Dr. Michael Kaufmann 2. Berichterstatter: Prof. Dr. Peter Hauck Acknowledgements First and foremost I thank my advisor Prof. Dr. Michael Kaufmann, for giving me the opportunity to be part of his great group and write this thesis, for supporting me this whole time and enabling me to visit several international workshops and conferences. I am deeply grateful to my colleague Dr. Michael Bekos who not only par- ticipated in every research project that made it into this thesis but also gave me great support during the writing of this thesis and was a very pleasant officemate. My thanks also go to my current and former colleagues Till Bruckdorfer, Philip Effinger, Andreas Gerasch, Niklas Heinsohn, Markus Geyer, Stephan Kottler, Martin Siebenhaller and Christian Zielke who provided a very nice working atmosphere and valuable input in many scientific and non-scientific discussions during our coffee-breaks. I thank all my coauthors, namely Michael Bekos, Markus Geyer, Martin Gronemann, Michael Kaufmann, Thorsten Ludwig, Stefan N¨aherand Vin- cenzo Roselli for the pleasant and productive collaborations. I am most thankful to my friends Chrissi and Klaus who, together with Ju- lian and Laura, always offered me delicious meals and delightful company which I especially appreciated in stressful times of approaching deadlines.
    [Show full text]
  • Part I: Graph Drawing – an Introduction
    Part I: Graph Drawing { An Introduction Alexander Wolff Lehrstuhl fur¨ Informatik I Universit¨at Wurzburg¨ Alexander Wolff · Lehrstuhl fur¨ Informatik I · Universit¨at Wurzburg¨ Part I: Graph Drawing { An Introduction Alexander Wolff Lehrstuhl fur¨ Informatik I Universit¨at Wurzburg¨ Alexander Wolff · Lehrstuhl fur¨ Informatik I · Universit¨at Wurzburg¨ Part I: Graph Drawing { An Introduction Alexander Wolff Lehrstuhl fur¨ Informatik I Universit¨at Wurzburg¨ BandyopadhyayChakrabortyGovindarajanKrishn enduMukhopadhyayaMukhopadhyayVenkateshx Alexander Wolff · Lehrstuhl fur¨ Informatik I · Universit¨at Wurzburg¨ Part I: Graph Drawing { An Introduction Alexander Wolff Lehrstuhl fur¨ Informatik I Universit¨at Wurzburg¨ BandyopadhyayChakrabortyGovindarajanKrishn enduMukhopadhyayaMukhopadhyayVenkateshx WurzburgG¨ ¨ottingenSch¨obelKarlsruheSaarbruck¨ enGoerikHoeferKaiserslauternFrankfurtM¨ohring Alexander Wolff · Lehrstuhl fur¨ Informatik I · Universit¨at Wurzburg¨ Part I: Graph Drawing { An Introduction Alexander Wolff Lehrstuhl fur¨ Informatik I Universit¨at Wurzburg¨ BandyopadhyayChakrabortyGovindarajanKrishn enduMukhopadhyayaMukhopadhyayVenkateshx WurzburgG¨ ¨ottingenSch¨obelKarlsruheSaarbruck¨ enGoerikHoeferKaiserslauternFrankfurtM¨ohring Alexander Wolff · Lehrstuhl fur¨ Informatik I · Universit¨at Wurzburg¨ Wurzburg???¨ pronounce: [Vurtsburk]¨ Alexander Wolff · Lehrstuhl fur¨ Informatik I · Universit¨at Wurzburg¨ Wurzburg???¨ pronounce: [Vurtsburk]¨ . baroque architecture! Alexander Wolff · Lehrstuhl fur¨ Informatik I · Universit¨at Wurzburg¨ Wurzburg???¨
    [Show full text]
  • Automatic Graph Drawing with Clusters
    DEGREE PROJECT IN COMPUTER SCIENCE 120 CREDITS, SECOND CYCLE STOCKHOLM, SWEDEN 2015 CluStic - Automatic graph drawing with clusters VILLIAM ASPEGREN KTH ROYAL INSTITUTE OF TECHNOLOGY SCHOOL OF COMPUTER SCIENCE AND COMMUNICATION Master of Science Thesis CSC CluStic – Automatic graph drawing with clusters CluStic – Automatisk grafritning med avseende på kluster Villiam Aspegren Approved Examiner Supervisor 2015-12-12 Johan Håstad Michael Minock Commissioner Contact person Decerno Sven Norman Master of Science Thesis CSC KTH Computer Science SE-100 44 STOCKHOLM Abstract 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. For example the user may have put a lot of manual effort into fixing a portion of a large layout and, while they would like an automatic layout applied to most of the layout, they do not want their work undone on the portion they manually fixed earlier. CluStic, the system developed and evaluated in this thesis, provides this capability. CluStic maintain the internal structure of a cluster by giving it priority over other elements in the graph. After high priority element has been positioned, non-priority vertices may be placed at the most appropriate remaining positions. Furthermore CluStic produces layouts which also maintain common aesthetic criteria: edge crossing minimization, layout height and edge straightening. Our method in this thesis is to first conduct an initial exploration study where we cross compare four industrial tools: Cytogate, GraphDraw, Diagram.Net and GraphNet.
    [Show full text]
  • Accelerated Bend Minimization Sabine Cornelsen Andreas Karrenbauer
    Journal of Graph Algorithms and Applications http://jgaa.info/ vol. 16, no. 3, pp. 635{650 (2012) DOI: 10.7155/jgaa.00265 Accelerated Bend Minimization Sabine Cornelsen Andreas Karrenbauer Department of Computer & Information Science, University of Konstanz, Germany Abstract We present an (n3=2) algorithm for minimizing the number of bends O in an orthogonal drawing of a plane graph. It has been posed as a long standing open problem at Graph Drawing 2003, whether the bound of (n7=4plog n) shown by Garg and Tamassia in 1996 could be improved. O To answer this question, we show how to solve the uncapacitated min-cost flow problem on a planar bidirected graph with bounded costs and face sizes in (n3=2) time. O Submitted: Reviewed: Revised: Accepted: Final: October 2011 February 2012 March 2012 April 2012 April 2012 Published: September 2012 Article type: Communicated by: Regular paper M. van Kreveld and B. Speckmann Andreas Karrenbauer is supported by the Zukunftskolleg of the University of Konstanz. E-mail addresses: [email protected] (Sabine Cornelsen) Andreas.Karrenbauer@ uni-konstanz.de (Andreas Karrenbauer) 636 S. Cornelsen and A. Karrenbauer Accelerated Bend Minimization 1 Introduction A drawing of a planar graph is called orthogonal if all edges are non-crossing axis-parallel polylines, i.e. sequences of finitely many horizontal and vertical line segments. The intersection point of a vertical and a horizontal line segment of an edge is a bend. Examples of orthogonal drawings can be found in Fig. 1. (a) GD Contest 2008 [13] (b) Octahedron Figure 1: Orthogonal drawings.
    [Show full text]
  • 55 GRAPH DRAWING Emilio Di Giacomo, Giuseppe Liotta, Roberto Tamassia
    55 GRAPH DRAWING Emilio Di Giacomo, Giuseppe Liotta, Roberto Tamassia INTRODUCTION Graph drawing addresses the problem of constructing geometric representations of graphs, and has important applications to key computer technologies such as soft- ware engineering, database systems, visual interfaces, and computer-aided design. Research on graph drawing has been conducted within several diverse areas, includ- ing discrete mathematics (topological graph theory, geometric graph theory, order theory), algorithmics (graph algorithms, data structures, computational geometry, vlsi), and human-computer interaction (visual languages, graphical user interfaces, information visualization). This chapter overviews aspects of graph drawing that are especially relevant to computational geometry. Basic definitions on drawings and their properties are given in Section 55.1. Bounds on geometric and topological properties of drawings (e.g., area and crossings) are presented in Section 55.2. Sec- tion 55.3 deals with the time complexity of fundamental graph drawing problems. An example of a drawing algorithm is given in Section 55.4. Techniques for drawing general graphs are surveyed in Section 55.5. 55.1 DRAWINGS AND THEIR PROPERTIES TYPES OF GRAPHS First, we define some terminology on graphs pertinent to graph drawing. Through- out this chapter let n and m be the number of graph vertices and edges respectively, and d the maximum vertex degree (i.e., number of edges incident to a vertex). GLOSSARY Degree-k graph: Graph with maximum degree d k. ≤ Digraph: Directed graph, i.e., graph with directed edges. Acyclic digraph: Digraph without directed cycles. Transitive edge: Edge (u, v) of a digraph is transitive if there is a directed path from u to v not containing edge (u, v).
    [Show full text]
  • Planar L-Drawings of Directed Graphs?
    Planar L-Drawings of Directed Graphs? Steven Chaplick1, Markus Chimani2, Sabine Cornelsen3, Giordano Da Lozzo4, Martin N¨ollenburg5, Maurizio Patrignani6, Ioannis G. Tollis7, and Alexander Wolff8 1 Universit¨atW¨urzburg,Germany; [email protected] 2 Universit¨atOsnabr¨uck, Germany; [email protected] 3 Universit¨atKonstanz, Germany; [email protected] 4 University of California, Irvine, CA, USA; [email protected] 5 TU Wien, Austria; [email protected] 6 Roma Tre University, Rome, Italy; [email protected] 7 University of Crete, Heraklion, Greece; [email protected] 8 Universit¨atW¨urzburg,Germany; orcid.org/0000-0001-5872-718X Abstract. We study planar drawings of directed graphs in the L-drawing standard. We provide necessary conditions for the existence of these drawings and show that testing for the existence of a planar L-drawing is an NP-complete problem. Motivated by this result, we focus on upward- planar L-drawings. We show that directed st-graphs admitting an upward- (resp. upward-rightward-) planar L-drawing are exactly those admitting a bitonic (resp. monotonically increasing) st-ordering. We give a linear- time algorithm that computes a bitonic (resp. monotonically increasing) st-ordering of a planar st-graph or reports that there exists none. 1 Introduction In an L-drawing of a directed graph each vertex v is assigned a point in the plane with exclusive integer x- and y-coordinates, and each directed edge (u; v) consists of a vertical segment exiting u and of a horizontal segment entering v [1]. The drawings of two edges may cross and partially overlap, following the model of [18].
    [Show full text]
  • Lipics-Socg-2017-29.Pdf (2
    On Bend-Minimized Orthogonal Drawings of Planar 3-Graphs Yi-Jun Chang∗1 and Hsu-Chun Yen†2 1 Department of EECS, University of Michigan, Ann Arbor, MI, USA 2 Department of Electrical Engineering, National Taiwan University, Taipei, Taiwan Abstract An orthogonal drawing of a graph is a planar drawing where each edge is drawn as a sequence of horizontal and vertical line segments. Finding a bend-minimized orthogonal drawing of a planar graph of maximum degree 4 is NP-hard. The problem becomes tractable for planar graphs of maximum degree 3, and the fastest known algorithm takes O(n5 log n) time. Whether a faster algorithm exists has been a long-standing open problem in graph drawing. In this paper we present an algorithm that takes only O˜(n17/7) time, which is a significant improvement over the previous state of the art. 1998 ACM Subject Classification F.2.2 Nonnumerical Algorithms and Problems Keywords and phrases Bend minimization, graph drawing, orthogonal drawing, planar graph Digital Object Identifier 10.4230/LIPIcs.SoCG.2017.29 1 Introduction An orthogonal drawing of a graph is a planar drawing where each edge is composed of a sequence of horizontal and vertical line segments with no crossings. Orthogonal drawings appear in many applications such as the automation of VLSI circuit layout and the drawing of diagrams in information systems. Variants of orthogonal drawings have been introduced in the literature to cope with different constraints or to improve the readability and aesthetic feel: smoothing the drawing [2, 1], requiring orthogonal convexity [5], accommodating vertices of more than 4 incident edges [16, 8], and restricting directions of vertices [11, 13].
    [Show full text]
  • Report on the International Work Meeting on Graph Drawing
    Rep ort on the International Work Meeting on Graph Drawing Marino Rome Italy June y Giuseppe Di Battista Roberto Tamassia dibattistaiasirmcnrit rtcsbrownedu Research on graph drawing has received increasing attention in the last years This area combines avors of top ological graph theory graph algorithms and computational geometry and has a wide range of applications including computer aided software engineering pro ject management network design and visual interfaces A work meeting on graph drawing has taken place on June at the Hotel Helio Cabala in Marino near Rome The goals of this meeting have b een bringing together researchers in graph drawing to assess the state of the art in the area by means of survey talks and developing further research activities including workshops scho ols and conferences While the survey talks did not cover all asp ects of graph drawing they identied fundamental combinatorial algorithmic and practical issues of the area Due to the nature of the meeting the numb er of participants was kept small The main nancial supp ort was provided by the Progetto Finalizzato Sistemi Informatici e Calcolo Paral lelo of the Italian National Research Council Additional supp ort came from the Istituto di Analisi dei Sistemi ed Informatica of the Italian National Research Council by the Association pour the Developpement de lInformatique dans le Sciences de lHomme and by the Basic Research Action of the EC ESPRIT I I ALCOM The organizing committee consisted of Giusepp e Di Battista Univ Rome Italy Pe ter Eades Univ
    [Show full text]