Optimal-area visibility representations of outer-1-plane graphs
From MaRDI portal
Publication:2151451
DOI10.1007/978-3-030-92931-2_21OpenAlexW3195057260MaRDI QIDQ2151451
Giuseppe Liotta, Fabrizio Montecchiani, Jayson Lynch, Therese C. Biedl
Publication date: 1 July 2022
Full work available at URL: https://arxiv.org/abs/2108.11768
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Outer 1-planar graphs
- Simultaneous visibility representations of plane \(st\)-graphs using L-shapes
- A linear-time algorithm for testing outer-1-planarity
- Small drawings of outerplanar graphs, series-parallel graphs, and other planar graphs
- Ortho-polygon visibility representations of embedded graphs
- Area-efficient static and incremental graph drawings
- L-visibility drawings of IC-planar graphs
- Representing a planar graph by vertical lines joining different levels
- A unified approach to visibility representations of planar graphs
- Rectilinear planar layouts and bipolar orientations of planar graphs
- Visibility representations of boxes in 2.5 dimensions
- \(\mathsf{T}\)-shape visibility representations of 1-planar graphs
- A near-linear area bound for drawing binary trees
- LR-drawings of ordered rooted binary trees and near-linear area drawings of outerplanar graphs
- On 3D visibility representations of graphs with few crossings per edge
- An annotated bibliography on 1-planarity
- A 4-Approximation for the Height of Drawing 2-Connected Outer-Planar Graphs
- 1-Visibility Representations of 1-Planar Graphs
- Complexity of Higher-Degree Orthogonal Graph Embedding in the Kandinsky Model
- Height-Preserving Transformations of Planar Graph Drawings
- Bar 1-Visibility Graphs and their relation to other Nearly Planar Graphs
- A Visibility Representation for Graphs in Three Dimensions
- Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions
- Beyond Planar Graphs: Introduction
- On Layered Fan-Planar Graph Drawings
- On Bar (1,j)-Visibility Graphs
- EVERY OUTER-1-PLANE GRAPH HAS A RIGHT ANGLE CROSSING DRAWING
- Bar k-Visibility Graphs
- Width-Optimal Visibility Representations of Plane Graphs
- Nearly Optimal Visibility Representations of Plane Graphs
- Ortho-polygon visibility representations of 3-connected 1-plane graphs
This page was built for publication: Optimal-area visibility representations of outer-1-plane graphs