Drawing Graphs with Right Angle Crossings

DOI10.1007/978-3-642-03367-4_19zbMath1253.68332OpenAlexW1594340659WikidataQ59702316 ScholiaQ59702316MaRDI QIDQ3183456

Giuseppe Liotta, Peter Eades, Walter Didimo

Publication date: 20 October 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03367-4_19

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (16)

Circular right-angle crossing drawings in linear time ⋮ Right Angle Crossing Graphs and 1-Planarity ⋮ Drawing Cubic Graphs with the Four Basic Slopes ⋮ Combining Problems on RAC Drawings and Simultaneous Graph Drawings ⋮ Crossing edge minimization in radial outerplanar layered graphs using segment paths ⋮ Graphs that admit right angle crossing drawings ⋮ Area, curve complexity, and crossing resolution of non-planar graph drawings ⋮ 2-layer right angle crossing drawings ⋮ Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area ⋮ Drawing graphs with right angle crossings ⋮ Graphs that Admit Right Angle Crossing Drawings ⋮ The Straight-Line RAC Drawing Problem Is NP-Hard ⋮ Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles ⋮ Bounds on the crossing resolution of complete geometric graphs ⋮ A characterization of complete bipartite RAC graphs ⋮ Right Angle Crossing Drawings of Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Improving the crossing lemma by finding more crossings in sparse graphs
• On the maximum number of edges in quasi-planar graphs
• Quasi-planar graphs have a linear number of edges
• Graph drawing software
• Triangles in Euclidean arrangements
• Empirical evaluation of aesthetics-based graph layout
• The maximum number of triangles in arrangements of pseudolines
• Efficient orthogonal drawings of high degree graphs
• Representations of Planar Graphs
• Discrete and Computational Geometry
• Drawing graphs. Methods and models

This page was built for publication: Drawing Graphs with Right Angle Crossings