The Crossing-Angle Resolution in Graph Drawing
From MaRDI portal
Publication:2849803
DOI10.1007/978-1-4614-0110-0_10zbMath1272.05128OpenAlexW192589467WikidataQ62042407 ScholiaQ62042407MaRDI QIDQ2849803
Walter Didimo, Giuseppe Liotta
Publication date: 25 September 2013
Published in: Thirty Essays on Geometric Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4614-0110-0_10
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (22)
Recognizing and drawing IC-planar graphs ⋮ Simultaneous visibility representations of plane \(st\)-graphs using L-shapes ⋮ Area requirement of graph drawings with few crossings per edge ⋮ On RAC drawings of 1-planar graphs ⋮ A note on 1-planar graphs ⋮ Drawing subcubic planar graphs with four slopes and optimal angular resolution ⋮ L-visibility drawings of IC-planar graphs ⋮ RAC-Drawability is ∃ℝ-complete and Related Results ⋮ Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs ⋮ Right angle crossing graphs and 1-planarity ⋮ Efficient generation of different topological representations of graphs beyond-planarity ⋮ A greedy heuristic for crossing-angle maximization ⋮ 2-layer right angle crossing drawings ⋮ Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity ⋮ Embedding-preserving rectangle visibility representations of nonplanar graphs ⋮ Gap-planar graphs ⋮ Simultaneous Visibility Representations of Plane st-graphs Using L-shapes ⋮ RAC drawings in subcubic area ⋮ Right Angle Crossing Drawings of Graphs ⋮ 2-Layer k-Planar Graphs ⋮ Fan-planarity: properties and complexity ⋮ A Linear-Time Algorithm for Finding Induced Planar Subgraphs
This page was built for publication: The Crossing-Angle Resolution in Graph Drawing
