Some Constrained Notions of Planarity

DOI10.1007/978-3-540-92182-0_2MaRDI QIDQ3596700zbMATH OpenOpenAlexFDO

Authors Peter Eades

Publication date 29 January 2009

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-92182-0_2

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Straight-line drawing algorithms for hierarchical graphs and clustered graphs
• SOFSEM 2004: Theory and Practice of Computer Science
• Straightening Drawings of Clustered Hierarchical Graphs
• Planarity-preserving clustering and embedding for large planar graphs
• scientific article; zbMATH DE number 1500683

Cited in

(10)

• Classification and detection of obstructions to planarity
• Planar Earthmover Is Not in L₁
• ACHIRALITY AND PLANARITY
• Partial and Constrained Level Planarity
• scientific article; zbMATH DE number 3360348 (Why is no real title available?)
• Computer Vision - ECCV 2004
• Planarity, duality and Laplacian congruence
• Synchronized Planarity with Applications to Constrained Planarity Problems
• Constrained planarity in practice: engineering the synchronized planarity algorithm
• Drawing graphs with right angle crossings

This page was built for publication: Some Constrained Notions of Planarity

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