Notes on large angle crossing graphs

DOI10.4086/cjtcs.2011.004zbMath1286.05034OpenAlexW1855112105MaRDI QIDQ5414593

Thomas Wolle, Vida Dujmović, Pat Morin, Joachim Gudmundsson

Publication date: 6 May 2014

Published in: Chicago Journal of Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4086/cjtcs.2011.004

zbMATH Keywords

upper and lower boundsgeometric graphsnumber of edgesedge crossing angle

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items

A note on 1-planar graphs ⋮ Unnamed Item ⋮ On the Density of Non-simple 3-Planar Graphs ⋮ RAC-Drawability is ∃ℝ-complete and Related Results ⋮ Right angle crossing graphs and 1-planarity ⋮ Vertex angle and crossing angle resolution of leveled tree drawings ⋮ Area, curve complexity, and crossing resolution of non-planar graph drawings ⋮ A heuristic approach towards drawings of graphs with high crossing resolution ⋮ A greedy heuristic for crossing-angle maximization ⋮ 2-layer right angle crossing drawings ⋮ Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area ⋮ Graphs that Admit Right Angle Crossing Drawings ⋮ Graphs with large total angular resolution ⋮ Graphs with large total angular resolution ⋮ Right Angle Crossing Drawings of Graphs ⋮ Angular Resolutions: Around Vertices and Crossings ⋮ Crossing Layout in Non-planar Graph Drawings ⋮ Fan-planarity: properties and complexity