Area requirement of graph drawings with few crossings per edge

DOI10.1016/J.COMGEO.2013.03.001MaRDI QIDQ2391538zbMATH OpenOpenAlexDBLPWikidataFDO

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

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

graph drawingarea requirementouterplanar graphsseries-parallel graphs

Mathematics Subject Classification ID

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

Recommendations

• Small drawings of outerplanar graphs, series-parallel graphs, and other planar graphs
• scientific article; zbMATH DE number 1974107
• Graph Drawing
• Area-efficient planar straight-line drawings of outerplanar graphs
• Straight-line drawings of outerplanar graphs in \(O(dn \log n)\) area

Cites work

• scientific article; zbMATH DE number 432759 (Why is no real title available?)
• scientific article; zbMATH DE number 6254006 (Why is no real title available?)
• A note on optimal area algorithms for upward drawings of binary trees
• Computing straight-line 3D grid drawings of graphs in linear volume
• Density of straight-line 1-planar graph drawings
• Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
• Fáry's theorem for 1-planar graphs
• Graph Drawing
• Graphs drawn with few crossings per edge
• Grid drawings of \(k\)-colourable graphs
• How to draw a planar graph on a grid
• Large angle crossing drawings of planar graphs in subquadratic area
• On point-sets that support planar graphs
• On the perspectives opened by right angle crossing drawings
• Right angle crossing graphs and 1-planarity
• Small area drawings of outerplanar graphs
• Small drawings of outerplanar graphs, series-parallel graphs, and other planar graphs
• Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions
• Straight-line drawings of outerplanar graphs in \(O(dn \log n)\) area
• The crossing-angle resolution in graph drawing
• \(h\)-quasi planar drawings of bounded treewidth graphs in linear area

Cited in

(13)

• Large angle crossing drawings of planar graphs in subquadratic area
• scientific article; zbMATH DE number 7651192 (Why is no real title available?)
• Parameterized algorithms for fixed-order book drawing with few crossings per edge
• scientific article; zbMATH DE number 1990778 (Why is no real title available?)
• Area, curve complexity, and crossing resolution of non-planar graph drawings
• \(h\)-quasi planar drawings of bounded treewidth graphs in linear area
• Small drawings of series-parallel graphs and other subclasses of planar graphs
• Fixed-parameter tractability for book drawing with bounded number of crossings per edge
• Area, curve complexity, and crossing resolution of non-planar graph drawings
• 1-page and 2-page drawings with bounded number of crossings per edge
• Fan-planarity: properties and complexity
• Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs
• Drawing partial 2-trees with few slopes

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

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