Drawing graphs with right angle crossings

DOI10.1016/j.tcs.2011.05.025zbMath1225.68134OpenAlexW4205588752WikidataQ62042493 ScholiaQ62042493MaRDI QIDQ719252

Giuseppe Liotta, Walter Didimo, Peter Eades

Publication date: 10 October 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.05.025

zbMATH Keywords

graph visualization

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (61)

The density of fan-planar graphs ⋮ Simplifying Non-Simple Fan-Planar Drawings ⋮ Recognizing and drawing IC-planar graphs ⋮ Circular right-angle crossing drawings in linear time ⋮ EVERY OUTER-1-PLANE GRAPH HAS A RIGHT ANGLE CROSSING DRAWING ⋮ Simplifying non-simple fan-planar drawings ⋮ RAC-drawability is \(\exists \mathbb{R} \)-complete ⋮ Recognizing and embedding simple optimal 2-planar graphs ⋮ Arrangements of orthogonal circles with many intersections ⋮ Limitations on realistic hyperbolic graph drawing ⋮ On fan-crossing and fan-crossing free graphs ⋮ On RAC drawings of 1-planar graphs ⋮ The Stub Resolution of 1-planar Graphs ⋮ Crossing Numbers of Beyond-Planar Graphs Revisited ⋮ Fan-crossing free graphs and their relationship to other beyond-planar graphs ⋮ An annotated bibliography on 1-planarity ⋮ On the recognition of fan-planar and maximal outer-fan-planar graphs ⋮ \(\mathsf{NIC}\)-planar graphs ⋮ Combinatorial properties and recognition of unit square visibility graphs ⋮ A note on 1-planar graphs ⋮ The family of fan-planar graphs ⋮ Shallow Minors, Graph Products, and Beyond-Planar Graphs ⋮ Unnamed Item ⋮ On the Density of Non-simple 3-Planar Graphs ⋮ L-visibility drawings of IC-planar graphs ⋮ RAC-Drawability is ∃ℝ-complete and Related Results ⋮ Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs ⋮ \(\mathsf{T}\)-shape visibility representations of 1-planar graphs ⋮ Right angle crossing graphs and 1-planarity ⋮ Colored anchored visibility representations in 2D and 3D space ⋮ Efficient generation of different topological representations of graphs beyond-planarity ⋮ 1-fan-bundle-planar drawings of graphs ⋮ Vertex angle and crossing angle resolution of leveled tree drawings ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A heuristic approach towards drawings of graphs with high crossing resolution ⋮ A greedy heuristic for crossing-angle maximization ⋮ A linear-time algorithm for testing full outer-2-planarity ⋮ 2-layer right angle crossing drawings ⋮ Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity ⋮ Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area ⋮ Re-embedding a 1-plane graph for a straight-line drawing in linear time ⋮ Arrangements of orthogonal circles with many intersections ⋮ Unnamed Item ⋮ On RAC drawings of graphs with one bend per edge ⋮ Compact drawings of 1-planar graphs with right-angle crossings and few bends ⋮ On RAC drawings of graphs with one bend per edge ⋮ Unnamed Item ⋮ Graphs with large total angular resolution ⋮ Graphs with large total angular resolution ⋮ Testing Full Outer-2-planarity in Linear Time ⋮ RAC drawings in subcubic area ⋮ Beyond Planar Graphs: Introduction ⋮ Quasi-planar Graphs ⋮ Right Angle Crossing Drawings of Graphs ⋮ Angular Resolutions: Around Vertices and Crossings ⋮ Crossing Layout in Non-planar Graph Drawings ⋮ 1-planarity testing and embedding: an experimental study ⋮ 2-Layer k-Planar Graphs ⋮ Fan-planarity: properties and complexity ⋮ On the Number of Edges of Fan-Crossing Free Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• 2-layer right angle crossing drawings
• A characterization of complete bipartite RAC graphs
• 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
• Graphs that Admit Right Angle Crossing Drawings
• On the Size of Graphs That Admit Polyline Drawings with Few Bends and Crossing Angles
• Maximizing the Total Resolution of Graphs
• Topology-Driven Force-Directed Algorithms
• The Quality Ratio of RAC Drawings and Planar Drawings of Planar Graphs
• The Straight-Line RAC Drawing Problem Is NP-Hard
• Drawing Graphs with Right Angle Crossings
• Right Angle Crossing Graphs and 1-Planarity
• Area, Curve Complexity, and Crossing Resolution of Non-planar Graph Drawings
• Some Constrained Notions of Planarity
• Representations of Planar Graphs
• Discrete and Computational Geometry
• On the Perspectives Opened by Right Angle Crossing Drawings
• Drawing graphs. Methods and models

This page was built for publication: Drawing graphs with right angle crossings