Drawing subcubic 1-planar graphs with few bends, few slopes, and large angles
From MaRDI portal
Publication:1725748
DOI10.1007/978-3-030-04414-5_11OpenAlexW2888394699MaRDI QIDQ1725748
André Schulz, Philipp Kindermann, Fabrizio Montecchiani, Lena Schlipf
Publication date: 15 February 2019
Full work available at URL: https://arxiv.org/abs/1808.08496
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (5)
Upward planar drawings with two slopes ⋮ Drawing partial 2-trees with few slopes ⋮ Drawing subcubic 1-planar graphs with few bends, few slopes, and large angles ⋮ Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles ⋮ On RAC drawings of graphs with one bend per edge
Cites Work
- Unnamed Item
- Unnamed Item
- The planar slope number of planar partial 3-trees of bounded degree
- Ortho-polygon visibility representations of embedded graphs
- The structure of 1-planar graphs
- Algorithms for plane representations of acyclic digraphs
- 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
- \(\mathsf{T}\)-shape visibility representations of 1-planar graphs
- Drawing subcubic 1-planar graphs with few bends, few slopes, and large angles
- Drawing planar graphs using the canonical ordering
- Right angle crossing graphs and 1-planarity
- Drawings of planar graphs with few slopes and segments
- Ein Sechsfarbenproblem auf der Kugel
- On RAC drawings of 1-planar graphs
- An annotated bibliography on 1-planarity
- Outerplanar graph drawings with few slopes
- Bounded-degree graphs have arbitrarily large geometric thickness
- Bounded-degree graphs can have arbitrarily large slope numbers
- Straight-Line Grid Drawings of 3-Connected 1-Planar Graphs
- Planar and Plane Slope Number of Partial 2-Trees
- Drawing Graphs in the Plane with High Resolution
- Drawing Cubic Graphs with the Four Basic Slopes
- On the Angular Resolution of Planar Graphs
- A universal slope set for 1-bend planar drawings
- Polar Coordinate Drawing of Planar Graphs with Good Angular Resolution
- 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
- Compact drawings of 1-planar graphs with right-angle crossings and few bends
This page was built for publication: Drawing subcubic 1-planar graphs with few bends, few slopes, and large angles