Level-planar drawings with few slopes

DOI10.1007/978-3-030-35802-0_42OpenAlexW2989565734MaRDI QIDQ5918990

Guido Brückner, Tamara Mchedlidze, Nadine Krisam

Publication date: 26 October 2020

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1907.13558

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Upward Planar Drawings with Three and More Slopes ⋮ Upward planar drawings with three and more slopes ⋮ Upward planar drawings with two slopes ⋮ Level-planar drawings with few slopes

Cites Work

• Unnamed Item
• Unnamed Item
• Extending convex partial drawings of graphs
• Drawing subcubic planar graphs with four slopes and optimal angular resolution
• Graph drawings with few slopes
• Drawings of planar graphs with few slopes and segments
• Outerplanar graph drawings with few slopes
• Drawing cubic graphs with at most five slopes
• Bounded-degree graphs have arbitrarily large geometric thickness
• Bounded-degree graphs can have arbitrarily large slope numbers
• Planar and Plane Slope Number of Partial 2-Trees
• Beyond Level Planarity
• Simultaneous Orthogonal Planarity
• On the Complexity of the Planar Slope Number Problem
• The vectorization of ITPACK 2C
• Shortest Paths in Planar Graphs with Real Lengths in O(nlog2 n/loglogn) Time
• Maximum Flow in Planar Networks
• Partial and Constrained Level Planarity
• Experimental Analysis of the Accessibility of Drawings with Few Segments
• ON EXTENDING A PARTIAL STRAIGHT-LINE DRAWING
• Drawing Planar Graphs of Bounded Degree with Few Slopes
• Drawing Outer 1-planar Graphs with Few Slopes
• Faster shortest-path algorithms for planar graphs