Upward planar drawings with three and more slopes
From MaRDI portal
Publication:2151439
DOI10.1007/978-3-030-92931-2_11OpenAlexW4205907380MaRDI QIDQ2151439
Jonathan Klawitter, Johannes Zink
Publication date: 1 July 2022
Full work available at URL: https://arxiv.org/abs/2103.06801
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (2)
Cites Work
- Unnamed Item
- The planar slope number of planar partial 3-trees of bounded degree
- Drawing orders with few slopes
- Geometric representation of cubic graphs with four directions
- Upward drawings of triconnected digraphs.
- Drawing polygons given angle sequences
- Algorithms for plane representations of acyclic digraphs
- A note on optimal area algorithms for upward drawings of binary trees
- Drawing subcubic planar graphs with four slopes and optimal angular resolution
- 1-bend upward planar slope number of SP-digraphs
- Graph drawings with few slopes
- Drawings of planar graphs with few slopes and segments
- Outerplanar graph drawings with few slopes
- Bounded-degree graphs can have arbitrarily large slope numbers
- Lattice diagrams with few slopes
- On the Computational Complexity of Upward and Rectilinear Planarity Testing
- Planar and Plane Slope Number of Partial 2-Trees
- Upward Spirality and Upward Planarity Testing
- Drawing Ordered (k − 1)–Ary Trees on k–Grids
- Drawing Cubic Graphs with the Four Basic Slopes
- ON MINIMUM AREA PLANAR UPWARD DRAWINGS OF DIRECTED TREES AND OTHER FAMILIES OF DIRECTED ACYCLIC GRAPHS
- Drawability of Complete Graphs Using a Minimal Slope Set
- Tree Drawings on the Hexagonal Grid
- Optimal Upward Planarity Testing of Single-Source Digraphs
- Drawing Unordered Trees on k-Grids
- Experimental Analysis of the Accessibility of Drawings with Few Segments
- OPTIMAL BINARY SPACE PARTITIONS FOR SEGMENTS IN THE PLANE
- Algorithms – ESA 2004
- TWO FIXED-PARAMETER TRACTABLE ALGORITHMS FOR TESTING UPWARD PLANARITY
- Depth-First Search and Linear Graph Algorithms
- Drawing Planar Graphs of Bounded Degree with Few Slopes
- Drawing Outer 1-planar Graphs with Few Slopes
- Universal slope sets for upward planar drawings
- Level-planar drawings with few slopes
This page was built for publication: Upward planar drawings with three and more slopes