Drawing subcubic 1-planar graphs with few bends, few slopes, and large angles
type: Item
instance of: scholarly article
title: Drawing subcubic 1-planar graphs with few bends, few slopes, and large angles
DOI: 10.1007/978-3-030-04414-5_11
author: Philipp Kindermann
author: Fabrizio Montecchiani
author: Lena Schlipf
author: André Schulz
publication date: 2019-02-15T00:00:00Z
full work available at URL: https://arxiv.org/abs/1808.08496
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 7023822
MaRDI profile type: Publication
OpenAlex ID: W2888394699
cites work: Straight-Line Grid Drawings of 3-Connected 1-Planar Graphs
cites work: A universal slope set for 1-bend planar drawings
cites work: Bounded-degree graphs have arbitrarily large geometric thickness
cites work: On RAC drawings of 1-planar graphs
cites work: Planar Octilinear Drawings with One Bend Per Edge
cites work: A better heuristic for orthogonal graph drawings
cites work: \(\mathsf{T}\)-shape visibility representations of 1-planar graphs
cites work: Compact drawings of 1-planar graphs with right-angle crossings and few bends
cites work: Q3651735
cites work: Algorithms for plane representations of acyclic digraphs
cites work: Ortho-polygon visibility representations of embedded graphs
cites work: Drawing Outer 1-planar Graphs with Few Slopes
cites work: Drawing subcubic planar graphs with four slopes and optimal angular resolution
cites work: Drawings of planar graphs with few slopes and segments
cites work: Polar Coordinate Drawing of Planar Graphs with Good Angular Resolution
cites work: Right angle crossing graphs and 1-planarity
cites work: The structure of 1-planar graphs
cites work: Drawing Graphs in the Plane with High Resolution
cites work: The planar slope number of planar partial 3-trees of bounded degree
cites work: Q4281651
cites work: Drawing planar graphs using the canonical ordering
cites work: Drawing planar graphs of bounded degree with few slopes
cites work: Outerplanar graph drawings with few slopes
cites work: An annotated bibliography on 1-planarity
cites work: Planar and Plane Slope Number of Partial 2-Trees
cites work: A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid
cites work: On the Angular Resolution of Planar Graphs
cites work: Drawing Cubic Graphs with the Four Basic Slopes
cites work: Bounded-degree graphs can have arbitrarily large slope numbers
cites work: Ein Sechsfarbenproblem auf der Kugel
description: scientific article; zbMATH DE number 7023822