A Survey on Graph Drawing Beyond Planarity

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.

References in corpus (19)

• NodeTrix: Hybrid Representation for Analyzing Social Networks
• Diameter and Treewidth in Minor-Closed Graph Families
• An annotated bibliography on 1-planarity
• Characterisations and Examples of Graph Classes with Bounded Expansion
• Recognizing and Drawing IC-planar Graphs
• Layered Separators in Minor-Closed Graph Classes with Applications
• Parameterized Complexity of 1-Planarity
• New bounds on the maximum number of edges in $k$-quasi-planar graphs
• Properties and Complexity of Fan-Planarity
• Recognizing Optimal 1-Planar Graphs in Linear Time
• L-Visibility Drawings of IC-planar Graphs
• Edges and Switches, Tunnels and Bridges
• Simultaneous Visibility Representations of Plane st-graphs Using L-shapes
• Three classes of 1-planar graphs
• Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends
• Upper bound on the number of edges of an almost planar bipartite graph
• On Partitioning the Edges of 1-Plane Graphs
• 1-Fan-Bundle-Planar Drawings of Graphs
• On Visibility Representations of Non-planar Graphs

Cited by in corpus (3)

• Graph Neural Networks for Graph Drawing
• Simple $k$-Planar Graphs are Simple $(k+1)$-Quasiplanar
• 2D Embeddings of Multi-dimensional Partitionings