Area, curve complexity, and crossing resolution of non-planar graph drawings

DOI10.1007/s00224-010-9275-6zbMath1252.68210OpenAlexW2057352080WikidataQ62042491 ScholiaQ62042491MaRDI QIDQ649108

Giuseppe Liotta, Walter Didimo, Emilio Di Giacomo, Henk G. Meijer

Publication date: 30 November 2011

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-010-9275-6

zbMATH Keywords

graph drawingLAC drawingsnon-planar drawingsRAC drawings

Mathematics Subject Classification ID

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

Related Items

EVERY OUTER-1-PLANE GRAPH HAS A RIGHT ANGLE CROSSING DRAWING, Unnamed Item, RAC-Drawability is ∃ℝ-complete and Related Results, Right angle crossing graphs and 1-planarity, Vertex angle and crossing angle resolution of leveled tree drawings, A heuristic approach towards drawings of graphs with high crossing resolution, 2-layer right angle crossing drawings, Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area, On RAC drawings of graphs with one bend per edge, On RAC drawings of graphs with one bend per edge, RAC drawings in subcubic area, Right Angle Crossing Drawings of Graphs, Angular Resolutions: Around Vertices and Crossings, Fan-planarity: properties and complexity

Cites Work

• Unnamed Item
• Grid drawings of \(k\)-colourable graphs
• A characterization of complete bipartite RAC graphs
• Note on the Erdős-Szekeres theorem
• Empirical evaluation of aesthetics-based graph layout
• Efficient orthogonal drawings of high degree graphs
• Graphs that Admit Right Angle Crossing Drawings
• Drawing Graphs with Right Angle Crossings
• Area, Curve Complexity, and Crossing Resolution of Non-planar Graph Drawings
• Notes on large angle crossing graphs
• On the Perspectives Opened by Right Angle Crossing Drawings