Vertex angle and crossing angle resolution of leveled tree drawings

DOI10.1016/J.IPL.2012.05.006zbMATH Open1248.68373OpenAlexW2071162255WikidataQ62042478 ScholiaQ62042478MaRDI QIDQ456065FDOQ456065

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

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)

Recommendations

• The crossing-angle resolution in graph drawing
• Angle and Distance Constraints on Tree Drawings
• Angular Resolutions: Around Vertices and Crossings
• Drawing Trees with Perfect Angular Resolution and Polynomial Area
• Drawing trees with perfect angular resolution and polynomial area
• Straight-Line Orthogonal Drawings of Binary and Ternary Trees
• Optimizing area and aspect ratio in straight-line orthogonal tree drawings
• Trees through specified vertices
• Crossing angles of geometric graphs
• Crossing angles of geometric graphs

Cites work

• scientific article; zbMATH DE number 2123123 (Why is no real title available?)
• 2-layer right angle crossing drawings
• A characterization of complete bipartite RAC graphs
• Area, curve complexity, and crossing resolution of non-planar graph drawings
• Bounds on the crossing resolution of complete geometric graphs
• Characterization of Unlabeled Level Planar Graphs
• Characterization of unlabeled level planar trees
• Drawing graphs with right angle crossings
• Graphs that admit right angle crossing drawings
• Maximizing the total resolution of graphs
• Notes on large angle crossing graphs
• On the perspectives opened by right angle crossing drawings
• On the size of graphs that admit polyline drawings with few bends and crossing angles
• Right angle crossing graphs and 1-planarity
• The quality ratio of RAC drawings and planar drawings of planar graphs
• The straight-line RAC drawing problem is NP-hard

Cited in

(3)

• Angular Resolutions: Around Vertices and Crossings
• The QuaSEFE problem
• The stub resolution of 1-planar graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q456065)