Area requirement of graph drawings with few crossings per edge
DOI10.1016/J.COMGEO.2013.03.001zbMATH Open1273.05151DBLPjournals/comgeo/GiacomoDLM13OpenAlexW2089630590WikidataQ62042421 ScholiaQ62042421MaRDI QIDQ2391538FDOQ2391538
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
Recommendations
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)
Cites Work
- Graphs drawn with few crossings per edge
- How to draw a planar graph on a grid
- A note on optimal area algorithms for upward drawings of binary trees
- Small area drawings of outerplanar graphs
- Density of straight-line 1-planar graph drawings
- Fáry's theorem for 1-planar graphs
- Title not available (Why is that?)
- Straight-line drawings of outerplanar graphs in \(O(dn \log n)\) area
- Small drawings of outerplanar graphs, series-parallel graphs, and other planar graphs
- The crossing-angle resolution in graph drawing
- Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
- Right angle crossing graphs and 1-planarity
- \(h\)-quasi planar drawings of bounded treewidth graphs in linear area
- Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions
- On the perspectives opened by right angle crossing drawings
- Computing straight-line 3D grid drawings of graphs in linear volume
- Title not available (Why is that?)
- Grid drawings of \(k\)-colourable graphs
- On point-sets that support planar graphs
- Graph Drawing
- Large angle crossing drawings of planar graphs in subquadratic area
Cited In (13)
- Title not available (Why is that?)
- Large angle crossing drawings of planar graphs in subquadratic area
- Parameterized algorithms for fixed-order book drawing with few crossings per edge
- Title not available (Why is that?)
- 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)
