DOCSLIB.ORG

Beyond Planarity Drawing Graphs with Crossings

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Beyond Planarity Drawing Graphs with Crossings 1 Visualization of Graphs Lecture 11: Beyond Planarity Drawing Graphs with Crossings Part I: Graph Classes and Drawing Styles Jonathan Klawitter Partially based on slides by Fabrizio Montecchini, Michalis Bekos, and Walter Didimo. 2 - 9 Planar Graphs Planar graphs admit drawings in the plane without crossings. Plane graph is a planar graph with a plane embedding = rotation system. Planarity is recognizable in linear time. Different drawing styles... 6 6 6 6 4 5 4 5 4 5 4 5 1 3 1 3 2 3 2 1 3 2 1 2 straight-line drawing orthogonal drawing grid drawing with circular-arc drawing bends & 3 slopes 3 - 7 And Non-Planar Graphs? We have seen a few drawing styles: force-directed drawing hierarchical drawing orthogonal layouts (via planarization) Maybe not all crossings are equally bad? 1 2 3 4 5 6 7 block crossings Which crossings feel worse? 4 - 9 Eye-Tracking Experiment [Eades, Hong & Huang 2008] Input: A graph drawing and designated path. Task: Trace path and count number of edges. Results: no crossings eye movements smooth and fast large crossing angles eye movements smooth but slightly slower small crossing angles eye movements no longer smooth and very slow (back-and-forth movements at crossing points) 5 - 10 Some Beyond-Planar Graph Classes We define aesthetics for edge crossings and avoid/minimize \bad" crossing configurations. k-planar (k = 1) k-quasi-planar (k = 3) fan-planar RAC right-angle crossing X X X X topological graphs geometric graphs 5 - 15 Some Beyond-Planar Graph Classes We define aesthetics for edge crossings and avoid/minimize \bad" crossing configurations. k-planar (k = 1) k-quasi-planar (k = 3) fan-planar RAC right-angle crossing X X X X There are many more beyond planar graph classes. combinations, . X X X IC (independent crossing) fan-crossing-free skewness-k (k = 2) 6 - 8 Drawing Styles for Crossings RAC orthogonal slanted orthogonal block/bundle crossings right-angle crossing circular layout: 28 invididual vs. 12 bundle crossings X sym. partial cased crossings 1/4-SHPED edge drawing 7 - 13 Geometric Representations c K5 c d e d e b a a b bar 1-visibility thickness rectangle visibility representation (B1VR) two graph representation Every 1-planar graph admits a B1VR. G has at most 6n − 20 edges [Bose et al. 1997] [Brandenburg 2014; Evans et al. 2014; [Shermer 1996] Angelini et al. 2018] Recognition is NP-complete Recognition becomes polynomial if embedding is fixed [Biedl et al. 2018] 8 GD Beyond Planarity: a Taxonomy GD Beyond Planarity Density Recognition Stretchability Relationships Constraints Eng. & Exper. many 1-plan. - RAC &. 1-plan. circ. & layers families simult. - fan-plan. & k-plan. - 2-layer fan & RAC - k-plan. & k-qu.-plan. fixed rot. variable - qu.-pl. system embedding - circ. RAC - out. 1-plan. - RAC - 2-layer RAC Aesthetics - 2-layer fan NP-hard poly-time NP-hard poly-time - book emb. area edge-complexity - 1-plan. - out. 1-plan. - RAC maximal - RAC - 2-layer RAC - fan-plan. 1-plan. - 1-plan. - out. fan-plan. - k-plan. - fan-plan. - opt. 1-plan. slopes - 2-layer RAC - RAC bends - book emb. - 1-plan. - 2-layer fan-plan - quas.-plan. - k-plan. out. 1-plan. - RAC Taken from: G. Liotta, Invited talk at SoCG 2017 "Graph Drawing Beyond Planarity: Some Results and Open Problems", Jul. 2017 9 Visualization of Graphs Lecture 11: Beyond Planarity Drawing Graphs with Crossings Part II: Density & Relationships Jonathan Klawitter 10 GD Beyond Planarity: a Taxonomy GD Beyond Planarity Density Recognition Stretchability Relationships Constraints Eng. & Exper. many 1-plan. - RAC &. 1-plan. circ. & layers families simult. - fan-plan. & k-plan. - 2-layer fan & RAC - k-plan. & k-qu.-plan. fixed rot. variable - qu.-pl. system embedding - circ. RAC - out. 1-plan. - RAC - 2-layer RAC Aesthetics - 2-layer fan NP-hard poly-time NP-hard poly-time - book emb. area edge-complexity - 1-plan. - out. 1-plan. - RAC maximal - RAC - 2-layer RAC - fan-plan. 1-plan. - 1-plan. - out. fan-plan. - k-plan. - fan-plan. - opt. 1-plan. slopes - 2-layer RAC - RAC bends - book emb. - 1-plan. - 2-layer fan-plan - quas.-plan. - k-plan. out. 1-plan. - RAC Taken from: G. Liotta, Invited talk at SoCG 2017 "Graph Drawing Beyond Planarity: Some Results and Open Problems", Jul. 2017 11 - 5 Density of 1-Planar Graphs Theorem. [Ringel 1965, Pach & T´oth1997] A 1-planar graph with n vertices has at most4 n − 8 edges, which is a tight bound. Proof sketch. red edges do not cross each blue edge crosses a green edge 11 - 7 Density of 1-Planar Graphs Theorem. [Ringel 1965, Pach & T´oth1997] A 1-planar graph with n vertices has at most4 n − 8 edges, which is a tight bound. Proof sketch. red edges do not cross each blue edge crosses a green edge red-blue plane graph Grb Grb mrb ≤ 3n − 6 11 - 9 Density of 1-Planar Graphs Theorem. [Ringel 1965, Pach & T´oth1997] A 1-planar graph with n vertices has at most4 n − 8 edges, which is a tight bound. Proof sketch. red edges do not cross each blue edge crosses a green edge red-blue plane graph Grb Gg mrb ≤ 3n − 6 green plane graph Gg mg ≤ 3n − 6 11 - 14 Density of 1-Planar Graphs Theorem. [Ringel 1965, Pach & T´oth1997] A 1-planar graph with n vertices has at most4 n − 8 edges, which is a tight bound. Proof sketch. red edges do not cross each blue edge crosses a green edge red-blue plane graph Grb mrb ≤ 3n − 6 green plane graph Gg mg ≤ 3n − 6 ) m ≤ mrb + mg ≤ 6n − 12 Observe that each green edge joins two faces in Grb. mg ≤ frb=2 ≤ (2n − 4)=2 = n − 2 11 - 17 Density of 1-Planar Graphs Theorem. [Ringel 1965, Pach & T´oth1997] A 1-planar graph with n vertices has at most4 n − 8 edges, which is a tight bound. Proof sketch. red edges do not cross each blue edge crosses a green edge red-blue plane graph Grb Planar structure: mrb ≤ 3n − 6 2n − 4 edges green plane graph Gg n − 2 faces mg ≤ 3n − 6 ) m ≤ mrb + mg ≤ 6n − 12 Observe that each green edge joins two faces in Grb. mg ≤ frb=2 ≤ (2n − 4)=2 = n − 2 ) m = mrb + mg ≤ 3n − 6 + n − 2 = 4n − 8 11 - 19 Density of 1-Planar Graphs Theorem. [Ringel 1965, Pach & T´oth1997] A 1-planar graph with n vertices has at most4 n − 8 edges, which is a tight bound. Proof sketch. red edges do not cross each blue edge crosses a green edge red-blue plane graph Grb Planar structure: mrb ≤ 3n − 6 2n − 4 edges green plane graph Gg n − 2 faces mg ≤ 3n − 6 ) m ≤ mrb + mg ≤ 6n − 12 Edges per face: 2 edges Total: 4n − 8 edges Observe that each green edge joins two faces in Grb. mg ≤ frb=2 ≤ (2n − 4)=2 = n − 2 ) m = mrb + mg ≤ 3n − 6 + n − 2 = 4n − 8 12 - 9 Density of 1-Planar Graphs Theorem. [Ringel 1965, Pach & T´oth1997] A 1-planar graph with n vertices has at most4 n − 8 edges, which is a tight bound. A 1-planar graph with n vertices is called optimal if it has exactly 4n − 8 edges. n = 12; m = 40 A 1-planar graph is called maximal if adding any edge would result in a non-1-planar graph. Theorem. [Brandenburg et al. 2013] There are maximal 1-planar graphs with n vertices and 45=17n − O(1) edges. ≈ 2:65n Theorem. [Didimo 2013] n = 20; m = 48 A 1-planar graph with n vertices that admits a straight-line drawing has at most4 n − 9 edges. 13 - 9 Density of k-Planar Graphs Theorem. A k-planar graph with n vertices has at most: k number of edges 0 3(n − 2) Euler's formula 1 4(n − 2) [Ringel 1965] 2 5(n − 2) [Pach and T´oth1997] optimal 2-planar Planar structure: n − m + f = 2 Edges per face: m = c · f ? Total: 13 - 13 Density of k-Planar Graphs Theorem. A k-planar graph with n vertices has at most: k number of edges 0 3(n − 2) Euler's formula 1 4(n − 2) [Ringel 1965] 2 5(n − 2) [Pach and T´oth1997] optimal 2-planar Planar structure: 5 3 (n − 2) edges 2 3 (n − 2) faces n − m + f = 2 Edges per face: 5edges m = c · f ? Total: 5(n − 2) edges 5 m = 2 f 13 - 16 Density of k-Planar Graphs Theorem. A k-planar graph with n vertices has at most: 7 8 k number of edges 9 1 2 0 3(n − 2) Euler's formula 5 3 4 6 1 4(n − 2) [Ringel 1965] 2 5(n − 2) [Pach and T´oth1997] optimal 3-planar 3 5:5(n − 2) [Pach et al. 2006] 13 - 17 Density of k-Planar Graphs Theorem. A k-planar graph with n vertices has at most: k number of edges 7 8 1 2 0 3(n − 2) Euler's formula 5 3 4 6 1 4(n − 2) [Ringel 1965] 2 5(n − 2) [Pach and T´oth1997] optimal 3-planar 3 5:5(n − 2) [Pach et al. 2006] 13 - 20 Density of k-Planar Graphs Theorem. A k-planar graph with n vertices has at most: k number of edges 0 3(n − 2) Euler's formula 1 4(n − 2) [Ringel 1965] 2 5(n − 2) [Pach and T´oth1997] optimal 3-planar 3 5:5(n − 2) [Pach et al.
Load more

Recommended publications
  • Right Angle Crossing Graphs and 1-Planarity∗
    EuroCG 2011, Morschach, Switzerland, March 28{30, 2011 Right Angle Crossing Graphs and 1-planarity∗ Peter Eadesy Giuseppe Liottaz Abstract This paper studies the interplay between two fam- ilies of non-planar drawings that fit into the above A Right Angle Crossing Graph (also called RAC mentioned research directions. graph for short) is a graph that has a straight-line More formally, a drawing of a graph G maps each drawing where any two crossing edges are orthogonal vertex u of G to a distinct point pu in the plane, each to each other. A 1-planar graph is a graph that has edge (u; v) of G a Jordan arc connecting pu and pv and a drawing where every edge is crossed at most once. not passing through any other vertex, and is such that We study the relationship between RAC graphs and any two edges have at most one point in common. A 1-planar graphs in the extremal case that the RAC 1-planar drawing is a drawing of a graph where an graphs have as many edges as possible. It is known edge can be crossed by at most another edge. A 1- that a maximally dense RAC graph with n > 3 ver- planar graph is a graph that has a 1-planar drawing. tices has 4n−10 edges. We show that every maximally A straight-line drawing is a drawing of a graph such dense RAC graph is 1-planar. Also, we show that for that every edge is a straight-line segment. A Right every integer i such that i ≥ 0, there exists a 1-planar Angle Crossing drawing (or RAC drawing, for short) graph with n = 8 + 4i vertices and 4n − 10 edges that is a straight-line drawing where any two crossing edges is not a RAC graph.
    [Show full text]
  • Lombardi Drawings of Graphs 1 Introduction
    Lombardi Drawings of Graphs Christian A. Duncan1, David Eppstein2, Michael T. Goodrich2, Stephen G. Kobourov3, and Martin Nollenburg¨ 2 1Department of Computer Science, Louisiana Tech. Univ., Ruston, Louisiana, USA 2Department of Computer Science, University of California, Irvine, California, USA 3Department of Computer Science, University of Arizona, Tucson, Arizona, USA Abstract. We introduce the notion of Lombardi graph drawings, named after the American abstract artist Mark Lombardi. In these drawings, edges are represented as circular arcs rather than as line segments or polylines, and the vertices have perfect angular resolution: the edges are equally spaced around each vertex. We describe algorithms for finding Lombardi drawings of regular graphs, graphs of bounded degeneracy, and certain families of planar graphs. 1 Introduction The American artist Mark Lombardi [24] was famous for his drawings of social net- works representing conspiracy theories. Lombardi used curved arcs to represent edges, leading to a strong aesthetic quality and high readability. Inspired by this work, we intro- duce the notion of a Lombardi drawing of a graph, in which edges are drawn as circular arcs with perfect angular resolution: consecutive edges are evenly spaced around each vertex. While not all vertices have perfect angular resolution in Lombardi’s work, the even spacing of edges around vertices is clearly one of his aesthetic criteria; see Fig. 1. Traditional graph drawing methods rarely guarantee perfect angular resolution, but poor edge distribution can nevertheless lead to unreadable drawings. Additionally, while some tools provide options to draw edges as curves, most rely on straight-line edges, and it is known that maintaining good angular resolution can result in exponential draw- ing area for straight-line drawings of planar graphs [17,25].
    [Show full text]
  • Peter Hoek Thesis
    Visual Encoding Approaches for Temporal Social Networks Peter John Hoek BIT (Distinction) CQU, MSc (IT) UNSW A thesis submitted in partial fulfilment of the requirements for the degree of Doctor of Information Technology at the School of Engineering and Information Technology The University of New South Wales at the Australian Defence Force Academy 2013 Abstract Visualisations have become an inseparable part of social network analysis methodologies. However, despite the large amount of work in the field of social network visualisation there are still a number of areas in which current visualisation methods can be improved. The current dynamic network visualisation approaches consisting of aggregation or animated movies suffer from various limitations, such as introducing artefacts that could obscure interesting micro-level patterns or disrupting the users’ internalised mental models. In addition, very few social network tools support the inclusion of semantic and contextual information or provide visual topological representations based on network node attributes. This thesis introduces novel approaches to the visualisation of social networks and assesses their effectiveness through the use of concept demonstrators and prototypes. These are the software artefacts of this thesis, which provide illustrations of complementary visualisation techniques that could be considered for inclusion into social network visualisation and analysis tools. The novel methods for visualising temporal networks introduced in this thesis consist of: i an Attribute-Based
    [Show full text]
  • Local Page Numbers
    Local Page Numbers Bachelor Thesis of Laura Merker At the Department of Informatics Institute of Theoretical Informatics Reviewers: Prof. Dr. Dorothea Wagner Prof. Dr. Peter Sanders Advisor: Dr. Torsten Ueckerdt Time Period: May 22, 2018 – September 21, 2018 KIT – University of the State of Baden-Wuerttemberg and National Laboratory of the Helmholtz Association www.kit.edu Statement of Authorship I hereby declare that this document has been composed by myself and describes my own work, unless otherwise acknowledged in the text. I declare that I have observed the Satzung des KIT zur Sicherung guter wissenschaftlicher Praxis, as amended. Ich versichere wahrheitsgemäß, die Arbeit selbstständig verfasst, alle benutzten Hilfsmittel vollständig und genau angegeben und alles kenntlich gemacht zu haben, was aus Arbeiten anderer unverändert oder mit Abänderungen entnommen wurde, sowie die Satzung des KIT zur Sicherung guter wissenschaftlicher Praxis in der jeweils gültigen Fassung beachtet zu haben. Karlsruhe, September 21, 2018 iii Abstract A k-local book embedding consists of a linear ordering of the vertices of a graph and a partition of its edges into sets of edges, called pages, such that any two edges on the same page do not cross and every vertex has incident edges on at most k pages. Here, two edges cross if their endpoints alternate in the linear ordering. The local page number pl(G) of a graph G is the minimum k such that there exists a k-local book embedding for G. Given a graph G and a vertex ordering, we prove that it is NP-complete to decide whether there exists a k-local book embedding for G with respect to the given vertex ordering for any fixed k ≥ 3.
    [Show full text]
  • Arxiv:1608.08161V2 [Cs.CG] 1 Sep 2016 Heuristics and Provide No Guarantee on the Quality of the Result
    The Bundled Crossing Number Md. Jawaherul Alam1, Martin Fink2, and Sergey Pupyrev3;4 1 Department of Computer Science, University of California, Irvine 2 Department of Computer Science, University of California, Santa Barbara 3 Department of Computer Science, University of Arizona, Tucson 4 Institute of Mathematics and Computer Science, Ural Federal University Abstract. We study the algorithmic aspect of edge bundling. A bundled crossing in a drawing of a graph is a group of crossings between two sets of parallel edges. The bundled crossing number is the minimum number of bundled crossings that group all crossings in a drawing of the graph. We show that the bundled crossing number is closely related to the orientable genus of the graph. If multiple crossings and self-intersections of edges are allowed, the two values are identical; otherwise, the bundled crossing number can be higher than the genus. We then investigate the problem of minimizing the number of bundled crossings. For circular graph layouts with a fixed order of vertices, we present a constant-factor approximation algorithm. When the circular 6c order is not prescribed, we get a c−2 -approximation for a graph with n vertices having at least cn edges for c > 2. For general graph layouts, 6c we develop an algorithm with an approximation factor of c−3 for graphs with at least cn edges for c > 3. 1 Introduction For many real-world networks with substantial numbers of links between objects, traditional graph drawing algorithms produce visually cluttered and confusing drawings. Reducing the number of edge crossings is one way to improve the quality of the drawings.
    [Show full text]
  • Algorithms for Incremental Planar Graph Drawing and Two-Page Book Embeddings
    Algorithms for Incremental Planar Graph Drawing and Two-page Book Embeddings Inaugural-Dissertation zur Erlangung des Doktorgrades der Mathematisch-Naturwissenschaftlichen Fakult¨at der Universit¨at zu Koln¨ vorgelegt von Martin Gronemann aus Unna Koln¨ 2015 Berichterstatter (Gutachter): Prof. Dr. Michael Junger¨ Prof. Dr. Markus Chimani Prof. Dr. Bettina Speckmann Tag der m¨undlichenPr¨ufung: 23. Juni 2015 Zusammenfassung Diese Arbeit besch¨aftigt sich mit zwei Problemen bei denen es um Knoten- ordnungen in planaren Graphen geht. Hierbei werden als erstes Ordnungen betrachtet, die als Grundlage fur¨ inkrementelle Zeichenalgorithmen dienen. Solche Algorithmen erweitern in der Regel eine vorhandene Zeichnung durch schrittweises Hinzufugen¨ von Knoten in der durch die Ordnung gegebene Rei- henfolge. Zu diesem Zweck kommen im Gebiet des Graphenzeichnens verschie- dene Ordnungstypen zum Einsatz. Einigen dieser Ordnungen fehlen allerdings gewunschte¨ oder sogar fur¨ einige Algorithmen notwendige Eigenschaften. Diese Eigenschaften werden genauer untersucht und dabei ein neuer Typ von Ord- nung entwickelt, die sogenannte bitonische st-Ordnung, eine Ordnung, welche Eigenschaften kanonischer Ordnungen mit der Flexibilit¨at herk¨ommlicher st- Ordnungen kombiniert. Die zus¨atzliche Eigenschaft bitonisch zu sein erm¨oglicht es, eine st-Ordnung wie eine kanonische Ordnung zu verwenden. Es wird gezeigt, dass fur¨ jeden zwei-zusammenh¨angenden planaren Graphen eine bitonische st-Ordnung in linearer Zeit berechnet werden kann. Im Ge- gensatz zu kanonischen Ordnungen, k¨onnen st-Ordnungen naturgem¨aß auch fur¨ gerichtete Graphen verwendet werden. Diese F¨ahigkeit ist fur¨ das Zeichnen von aufw¨artsplanaren Graphen von besonderem Interesse, da eine bitonische st-Ordnung unter Umst¨anden es erlauben wurde,¨ vorhandene ungerichtete Zei- chenverfahren fur¨ den gerichteten Fall anzupassen.
    [Show full text]
  • 1-Bend RAC Drawings of 1-Planar Graphs
    1-bend RAC Drawings of 1-Planar Graphs Walter Didimo, Giuseppe Liotta, Saeed Mehrabi, Fabrizio Montecchiani Things to avoid in graph drawing Things to avoid in graph drawing • Too many crossings Things to avoid in graph drawing • Too many crossings • Too many bends A good property A good property • Right angle crossings (RAC)! [Huang, Hong, Eades – 2008] A good property 1-bend 1-planar RAC drawing • Right angle crossings (RAC)! [Huang, Hong, Eades – 2008] Questions • General: Which kind of graphs can be drawn with: . a few crossings per edge, . a few bends per edge, . right angle crossings (RAC)? Questions • General: Which kind of graphs can be drawn with: . a few crossings per edge, . a few bends per edge, . right angle crossings (RAC)? • Specific: Does every 1-planar graph admit a 1-bend RAC drawing? 1-planar RAC drawings • Not all 1-planar graphs have a straight-line RAC drawing [consequence of edge density results] • Not all straight-line RAC drawable graphs are 1-planar [Eades and Liotta - 2013] • Every 1-plane kite-triangulation has a 1-bend RAC drawing [Angelini et al. - 2009] • Every 1-plane graph with independent crossings (IC-planar) has a straight-line RAC drawing [Brandenburg et al. - 2013] Our result • Theorem. Every simple 1-planar graph admits a 1-bend RAC drawing, which can be computed in linear time if an initial 1-planar embedding is given Some definitions 1-plane graph (not necessarily simple) Some definitions kite 1-plane graph (not necessarily simple) Some definitions empty kite 1-plane graph (not necessarily simple)
    [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]
  • A Heuristic Approach Towards Drawings of Graphs with High Crossing Resolution
    A Heuristic Approach towards Drawings of Graphs with High Crossing Resolution Michael A. Bekos, Henry F¨orster,Christian Geckeler, Lukas Holl¨ander, Michael Kaufmann, Amad¨ausM. Spallek, Jan Splett Institut f¨urInformatik, Universit¨atT¨ubingen,T¨ubingen,Germany fbekos,foersth,geckeler,[email protected] fjan-lukas.hollaender,amadaeus.spallek,jan.splettg @student.uni-tuebingen.de Abstract. The crossing resolution of a non-planar drawing of a graph is the value of the minimum angle formed by any pair of crossing edges. Recent experiments have shown that the larger the crossing resolution is, the easier it is to read and interpret a drawing of a graph. However, maximizing the crossing resolution turns out to be an NP-hard problem in general and only heuristic algorithms are known that are mainly based on appropriately adjusting force-directed algorithms. In this paper, we propose a new heuristic algorithm for the crossing reso- lution maximization problem and we experimentally compare it against the known approaches from the literature. Our experimental evaluation indicates that the new heuristic produces drawings with better cross- ing resolution, but this comes at the cost of slightly higher aspect ratio, especially when the input graph is large. 1 Introduction In Graph Drawing, there exists a rich literature and a wide range of techniques for drawing planar graphs; see, e.g., [10,27,33]. However, drawing a non-planar graph, and in particular when it does not have some special structure (e.g., degree restriction), is a difficult and challenging task, mainly due to the edge crossings that negatively affect the drawing's quality [38].
    [Show full text]
  • Drawing Graphs with Circular Arcs and Right-Angle Crossings
    Drawing Graphs with Circular Arcs and Right-Angle Crossings Steven Chaplick Maastricht University, the Netherlands University of Würzburg, Germany [email protected] Henry Förster University of Tübingen, Germany [email protected] Myroslav Kryven University of Würzburg, Germany [email protected] Alexander Wolff University of Würzburg, Germany Abstract In a RAC drawing of a graph, vertices are represented by points in the plane, adjacent vertices are connected by line segments, and crossings must form right angles. Graphs that admit such drawings are RAC graphs. RAC graphs are beyond-planar graphs and have been studied extensively. In particular, it is known that a RAC graph with n vertices has at most 4n − 10 edges. We introduce a superclass of RAC graphs, which we call arc-RAC graphs. A graph is arc-RAC if it admits a drawing where edges are represented by circular arcs and crossings form right angles. We provide a Turán-type result showing that an arc-RAC graph with n vertices has at most 14n − 12 √ edges and that there are n-vertex arc-RAC graphs with 4.5n − O( n) edges. 2012 ACM Subject Classification Mathematics of computing → Graphs and surfaces; Mathematics of computing → Combinatoric problems Keywords and phrases circular arcs, right-angle crossings, edge density, charging argument Funding M. Kryven acknowledges support from DFG grant WO 758/9-1. 1 Introduction A drawing of a graph in the plane is a mapping of its vertices to distinct points and each edge uv to a curve whose endpoints are u and v. Planar graphs, which admit crossing- free drawings, have been studied extensively.
    [Show full text]
  • A Survey on Graph Drawing Beyond Planarity
    A Survey on Graph Drawing Beyond Planarity Walter Didimo1, Giuseppe Liotta1, Fabrizio Montecchiani1 1Dipartimento di Ingegneria, Universit`adegli Studi di Perugia, Italy fwalter.didimo,giuseppe.liotta,[email protected] Abstract Graph Drawing Beyond Planarity is a rapidly growing research area that classifies and studies geometric representations of non-planar graphs in terms of forbidden crossing configurations. Aim of this survey is to describe the main research directions in this area, the most prominent known results, and some of the most challenging open problems. 1 Introduction In the mid 1980s, the early pioneers of graph drawing had the intuition that a drawing with too many edge crossings is harder to read than a drawing of the same graph with fewer edge crossings (see, e.g., [35, 36, 72, 190]). This intuition was later confirmed by a series of cognitive experimental studies (see, e.g., [180, 181, 203]). As a result, a large part of the existing literature on graph drawing showcases elegant algorithms and sophisticated data structures under the assumption that the input graph is planar, i.e., it admits a drawing without edge crossings. When the input graph is non-planar, crossing minimization heuristics are used to insert a small number of dummy vertices in correspondence of the edge crossings, so to obtain a planarization of the input graph. A crossing-free drawing of the planarization can be computed by using one of the algorithms for planar graphs and then the crossings are reinserted by removing the dummy vertices. This approach is commonly adopted and works well for graphs of relatively small size, up to a few hundred vertices and edges (see, e.g., [87, 152]).
    [Show full text]
  • On Compact RAC Drawings
    On Compact RAC Drawings Henry Förster Wilhelm-Schickard-Institut für Informatik, University of Tübingen, Germany [email protected] Michael Kaufmann Wilhelm-Schickard-Institut für Informatik, University of Tübingen, Germany [email protected] Abstract We present new bounds for the required area of Right Angle Crossing (RAC) drawings for complete graphs, i.e. drawings where any two crossing edges are perpendicular to each other. First, we improve upon results by Didimo et al. [15] and Di Giacomo et al. [12] by showing how to compute a RAC drawing with three bends per edge in cubic area. We also show that quadratic area can be achieved when allowing eight bends per edge in general or with three bends per edge for p-partite graphs. As a counterpart, we prove that in general quadratic area is not sufficient for RAC drawings with three bends per edge. 2012 ACM Subject Classification Mathematics of computing → Graphs and surfaces; Theory of computation → Graph algorithms analysis; Mathematics of computing → Graph algorithms; Human-centered computing → Graph drawings Keywords and phrases RAC drawings, visualization of dense graphs, compact drawings Digital Object Identifier 10.4230/LIPIcs.ESA.2020.53 Acknowledgements We thank Patrizio Angelini for useful discussions and proofreading and the anonymous referees of an earlier version for helpful comments. 1 Introduction Graphs that appear in real-world applications are in fact mostly nonplanar. Experiments on the human perception of graph drawings indicate that two important parameters affecting readability are angles formed by two edges at their crossing points (the larger the better) [20, 21] as well as the number of bends along an edge (the fewer the better) [24, 25].
    [Show full text]