Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area
From MaRDI portal
Publication:4899278
DOI10.1007/978-3-642-34191-5_19zbMath1374.68348OpenAlexW1438552389WikidataQ62042462 ScholiaQ62042462MaRDI QIDQ4899278
Seok-Hee Hong, Giuseppe Di Battista, Walter Didimo, Fabrizio Frati, Patrizio Angelini, Anna Lubiw, Giuseppe Liotta, Michael Kaufmann
Publication date: 7 January 2013
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-34191-5_19
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
Area requirement of graph drawings with few crossings per edge ⋮ The Stub Resolution of 1-planar Graphs ⋮ Unnamed Item ⋮ Right angle crossing graphs and 1-planarity ⋮ A heuristic approach towards drawings of graphs with high crossing resolution ⋮ Right Angle Crossing Drawings of Graphs ⋮ Fan-planarity: properties and complexity
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graphs that admit right angle crossing drawings
- Area, curve complexity, and crossing resolution of non-planar graph drawings
- Grid drawings of \(k\)-colourable graphs
- Drawing graphs with right angle crossings
- How to draw a planar graph on a grid
- A unified approach to visibility representations of planar graphs
- Tree-width, path-width, and cutwidth
- Graphs That Admit Polyline Drawings with Few Crossing Angles
- The Straight-Line RAC Drawing Problem Is NP-Hard
- Drawing Graphs with Right Angle Crossings
- Universality considerations in VLSI circuits
- Edge Separators of Planar and Outerplanar Graphs With Applications
- Notes on large angle crossing graphs
- A Note on Minimum-Area Straight-Line Drawings of Planar Graphs
- On the Perspectives Opened by Right Angle Crossing Drawings
- Drawing graphs. Methods and models