Area, Curve Complexity, and Crossing Resolution of Non-planar Graph Drawings

DOI10.1007/978-3-642-11805-0_4zbMath1284.68454OpenAlexW1772951445WikidataQ62042509 ScholiaQ62042509MaRDI QIDQ3557870

Giuseppe Liotta, Walter Didimo, Emilio Di Giacomo, Henk G. Meijer

Publication date: 27 April 2010

Published in: Graph Drawing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-11805-0_4

Mathematics Subject Classification ID

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

Related Items (8)

Quasi-upward planar drawings with minimum curve complexity ⋮ Graphs that admit right angle crossing drawings ⋮ Area, curve complexity, and crossing resolution of non-planar graph drawings ⋮ Drawing graphs with right angle crossings ⋮ Graphs that Admit Right Angle Crossing Drawings ⋮ The Straight-Line RAC Drawing Problem Is NP-Hard ⋮ Bounds on the crossing resolution of complete geometric graphs ⋮ A characterization of complete bipartite RAC graphs

This page was built for publication: Area, Curve Complexity, and Crossing Resolution of Non-planar Graph Drawings