Drawing clustered planar graphs on disk arrangements

DOI10.7155/JGAA.00521zbMATH Open1433.05231OpenAlexW3005199669MaRDI QIDQ5216285FDOQ5216285

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)

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

Recommendations

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

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)

Cites Work

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

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)