Drawing clustered planar graphs on disk arrangements

DOI10.7155/JGAA.00521MaRDI QIDQ5216285zbMATH OpenOpenAlexFDO

Authors Tamara Mchedlidze, Marcel Radermacher, Ignaz Rutter, Nina Zimbel

Publication date 17 February 2020

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

Copyright license Creative Commons Attribution 4.0 International

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) Graph representations (geometric and intersection representations, etc.) (05C62) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Drawing clustered graphs on disk arrangements
• Clustered Planarity with Pipes
• Clustered planarity with pipes
• Drawing \(c\)-planar biconnected clustered graphs
• Graph Drawing

Cites work

• A new perspective on clustered planarity as a combinatorial embedding problem
• Anchored drawings of planar graphs
• Drawing clustered graphs on disk arrangements
• Fitting planar graphs on planar maps
• Obedient plane drawings for disk intersection graphs
• Optimal binary space partitions for segments in the plane
• Planarity for clustered graphs
• Recognizing weak embeddings of graphs
• Straight-line drawing algorithms for hierarchical graphs and clustered graphs
• Straight-line rectangular drawings of clustered graphs
• The art gallery problem is \(\exists \mathbb{R}\)-complete

Cited in

(2)

• Drawing clustered graphs on disk arrangements
• Clustered planarity with pipes

This page was built for publication: Drawing clustered planar graphs on disk arrangements

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