Universal slope sets for 1-bend planar drawings
From MaRDI portal
Publication:2414867
DOI10.1007/s00453-018-00542-9zbMath1421.68102arXiv1703.04283OpenAlexW2596061115WikidataQ128631567 ScholiaQ128631567MaRDI QIDQ2414867
Patrizio Angelini, Fabrizio Montecchiani, Michael A. Bekos, Giuseppe Liotta
Publication date: 17 May 2019
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1703.04283
Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
The Stub Resolution of 1-planar Graphs ⋮ Bitonic \(st\)-orderings for upward planar graphs: splits and bends in the variable embedding scenario ⋮ 1-bend upward planar slope number of SP-digraphs ⋮ Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles ⋮ Universal slope sets for upward planar drawings
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The planar slope number of planar partial 3-trees of bounded degree
- Bend-optimal orthogonal graph drawing in the general position model
- Orthogonal graph drawing with flexibility constraints
- Orthogonal graph drawing with inflexible edges
- How to draw a planar graph on a grid
- Drawing orders with few slopes
- Triangulating planar graphs while minimizing the maximum degree
- A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid
- A better heuristic for orthogonal graph drawings
- Drawing subcubic planar graphs with four slopes and optimal angular resolution
- Crooked diagrams with few slopes
- Drawing planar graphs using the canonical ordering
- Drawing trees with perfect angular resolution and polynomial area
- Graph drawings with few slopes
- Drawings of planar graphs with few slopes and segments
- Outerplanar graph drawings with few slopes
- Bounded-degree graphs have arbitrarily large geometric thickness
- Lattice diagrams with few slopes
- On the Computational Complexity of Upward and Rectilinear Planarity Testing
- Graph Drawings with One Bend and Few Slopes
- On Balanced -Contact Representations
- Planar and Plane Slope Number of Partial 2-Trees
- Bitonic st-orderings of Biconnected Planar Graphs
- Trade-Offs in Planar Polyline Drawings
- 1-Bend Upward Planar Drawings of SP-Digraphs
- On the Complexity of the Planar Slope Number Problem
- Drawing Graphs in the Plane with High Resolution
- Drawing Cubic Graphs with the Four Basic Slopes
- Drawability of Complete Graphs Using a Minimal Slope Set
- On Embedding a Graph in the Grid with the Minimum Number of Bends
- On Triangle Contact Graphs
- Optimal Upward Planarity Testing of Single-Source Digraphs
- Polar Coordinate Drawing of Planar Graphs with Good Angular Resolution
- A Note on Rectilinearity and Angular Resolution
- On the Total Number of Bends for Planar Octilinear Drawings
- Drawing Planar Graphs of Bounded Degree with Few Slopes
- Planar Octilinear Drawings with One Bend Per Edge
- Drawing Outer 1-planar Graphs with Few Slopes
