Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles

DOI10.7155/jgaa.00547zbMath1452.05179OpenAlexW3119768476MaRDI QIDQ5144877

Fabrizio Montecchiani, Philipp Kindermann, Lena Schlipf, André Schulz

Publication date: 19 January 2021

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7155/jgaa.00547

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Quasi-upward planar drawings with minimum curve complexity ⋮ Drawing partial 2-trees with few slopes

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
• Embedding-preserving rectangle visibility representations of nonplanar graphs
• 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
• Universal slope sets for 1-bend planar drawings
• Outerplanar graph drawings with few slopes
• Bounded-degree graphs have arbitrarily large geometric thickness
• Bounded-degree graphs can have arbitrarily large slope numbers
• Graph Drawings with One Bend and Few Slopes
• Straight-Line Grid Drawings of 3-Connected 1-Planar Graphs
• Planar and Plane Slope Number of Partial 2-Trees
• Fáry’s Theorem for 1-Planar Graphs
• Drawing Graphs in the Plane with High Resolution
• Drawing Cubic Graphs with the Four Basic Slopes
• On the Angular Resolution of Planar Graphs
• Guest Editors' Foreword and Overview
• Polar Coordinate Drawing of Planar Graphs with Good Angular Resolution
• On the Density of Maximal 1-Planar Graphs
• 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