Vertex angle and crossing angle resolution of leveled tree drawings

DOI10.1016/j.ipl.2012.05.006zbMath1248.68373OpenAlexW2071162255WikidataQ62042478 ScholiaQ62042478MaRDI QIDQ456065

Giuseppe Liotta, Walter Didimo, Andreas Spillner, Michael Kaufmann, Yoshio Okamoto

Publication date: 23 October 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2012.05.006

zbMATH Keywords

combinatorial problemsgraph drawingangle resolutionleveled tree

Mathematics Subject Classification ID

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

Related Items (3)

The Stub Resolution of 1-planar Graphs ⋮ The QuaSEFE problem ⋮ Angular Resolutions: Around Vertices and Crossings

Cites Work

• Unnamed Item
• Area, curve complexity, and crossing resolution of non-planar graph drawings
• Drawing graphs with right angle crossings
• Bounds on the crossing resolution of complete geometric graphs
• A characterization of complete bipartite RAC graphs
• Characterization of unlabeled level planar trees
• 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
• The Quality Ratio of RAC Drawings and Planar Drawings of Planar Graphs
• The Straight-Line RAC Drawing Problem Is NP-Hard
• 2-Layer Right Angle Crossing Drawings
• Right Angle Crossing Graphs and 1-Planarity
• Notes on large angle crossing graphs
• Characterization of Unlabeled Level Planar Graphs
• On the Perspectives Opened by Right Angle Crossing Drawings

This page was built for publication: Vertex angle and crossing angle resolution of leveled tree drawings