How to draw a clustered tree

DOI10.1016/j.jda.2008.09.015zbMath1209.05157OpenAlexW2088581621MaRDI QIDQ1044037

Guido Drovandi, Fabrizio Frati, Giuseppe Di Battista

Publication date: 10 December 2009

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2008.09.015

zbMATH Keywords

grid drawingsupward planarityarea requirementsconvex clustersnon-convex clustersrectangular clusters

Mathematics Subject Classification ID

Trees (05C05) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items

Straight-line rectangular drawings of clustered graphs, Clustered planarity = flat clustered planarity

Cites Work

• Unnamed Item
• A note on minimum-area upward drawing of complete and Fibonacci trees
• Area requirement and symmetry display of planar upward drawings
• A note on optimal area algorithms for upward drawings of binary trees
• A near-linear area bound for drawing binary trees
• Optimizing area and aspect ratio in straight-line orthogonal tree drawings
• Straight-line drawing algorithms for hierarchical graphs and clustered graphs
• Straight-line Drawings of Binary Trees with Linear Area and Arbitrary Aspect Ratio
• Universality considerations in VLSI circuits
• Drawing Clustered Graphs on an Orthogonal Grid
• PLANAR UPWARD TREE DRAWINGS WITH OPTIMAL AREA
• Planarity for clustered graphs