Drawing Clustered Planar Graphs on Disk Arrangements

DOI10.7155/jgaa.00521zbMath1433.05231OpenAlexW3005199669MaRDI QIDQ5216285

Nina Zimbel, Tamara Mchedlidze, Ignaz Rutter, Marcel Radermacher

Publication date: 17 February 2020

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7155/jgaa.00521

zbMATH Keywords

clustersstraight-line drawing

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Unnamed Item
• Straight-line rectangular drawings of clustered graphs
• A new perspective on clustered planarity as a combinatorial embedding problem
• Obedient plane drawings for disk intersection graphs
• Straight-line drawing algorithms for hierarchical graphs and clustered graphs
• Anchored Drawings of Planar Graphs
• The art gallery problem is ∃ ℝ-complete
• Drawing Clustered Graphs on Disk Arrangements
• OPTIMAL BINARY SPACE PARTITIONS FOR SEGMENTS IN THE PLANE
• Fitting Planar Graphs on Planar Maps
• Planarity for clustered graphs

This page was built for publication: Drawing Clustered Planar Graphs on Disk Arrangements