Level planarity: transitivity vs. even crossings
From MaRDI portal
Publication:1725729
DOI10.1007/978-3-030-04414-5_3OpenAlexW2888944797MaRDI QIDQ1725729
Guido Brückner, Peter Stumpf, Ignaz Rutter
Publication date: 15 February 2019
Full work available at URL: https://arxiv.org/abs/1808.09931
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (3)
An SPQR-tree-like embedding representation for upward planarity ⋮ Level planarity: transitivity vs. even crossings ⋮ Radial Level Planarity with Fixed Embedding
Cites Work
- Unnamed Item
- Level planarity: transitivity vs. even crossings
- On the Computational Complexity of Upward and Rectilinear Planarity Testing
- Hanani–Tutte, Monotone Drawings, and Level-Planarity
- Hanani-Tutte for Radial Planarity II
- Radial Level Planarity Testing and Embedding in Linear Time
- Towards an implementation of the 3D visibility skeleton
- Partial and Constrained Level Planarity
- Ordered Level Planarity, Geodesic Planarity and Bi-Monotonicity
- Über wesentlich unplättbare Kurven im dreidimensionalen Raume
- Using a Significant Spanning Tree to Draw a Directed Graph
- Toward a theory of crossing numbers
- Hanani-Tutte for Radial Planarity
This page was built for publication: Level planarity: transitivity vs. even crossings
