Area requirement of graph drawings with few crossings per edge

DOI10.1016/j.comgeo.2013.03.001zbMath1273.05151OpenAlexW2089630590WikidataQ62042421 ScholiaQ62042421MaRDI QIDQ2391538

Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani, Walter Didimo

Publication date: 31 July 2013

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0925772113000217

zbMATH Keywords

outerplanar graphsgraph drawingseries-parallel graphsarea requirement

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (8)

Recognizing and drawing IC-planar graphs ⋮ Fixed-parameter tractability for book drawing with bounded number of crossings per edge ⋮ On RAC drawings of 1-planar graphs ⋮ 1-page and 2-page drawings with bounded number of crossings per edge ⋮ Unnamed Item ⋮ Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs ⋮ Drawing partial 2-trees with few slopes ⋮ Fan-planarity: properties and complexity

Cites Work

• Unnamed Item
• Unnamed Item
• Straight-line drawings of outerplanar graphs in \(O(dn \log n)\) area
• Small drawings of outerplanar graphs, series-parallel graphs, and other planar graphs
• Grid drawings of \(k\)-colourable graphs
• On point-sets that support planar graphs
• How to draw a planar graph on a grid
• Small area drawings of outerplanar graphs
• A note on optimal area algorithms for upward drawings of binary trees
• Graphs drawn with few crossings per edge
• Density of straight-line 1-planar graph drawings
• Computing straight-line 3D grid drawings of graphs in linear volume
• The Crossing-Angle Resolution in Graph Drawing
• Fáry’s Theorem for 1-Planar Graphs
• Right Angle Crossing Graphs and 1-Planarity
• Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions
• Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
• Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area
• Graph Drawing
• h-Quasi Planar Drawings of Bounded Treewidth Graphs in Linear Area
• On the Perspectives Opened by Right Angle Crossing Drawings

This page was built for publication: Area requirement of graph drawings with few crossings per edge