Rectilinear planarity of partial 2-trees
From MaRDI portal
Publication:6117043
DOI10.1007/978-3-031-22203-0_12arXiv2208.12558OpenAlexW4317393908MaRDI QIDQ6117043
Giacomo Ortali, Giuseppe Liotta, Michael Kaufmann, Walter Didimo
Publication date: 16 August 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2208.12558
series-parallel graphspartial 2-treesorthogonal drawingsvariable embeddingrectilinear planarity testing
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Orthogonal planarity testing of bounded treewidth graphs
- Planar rectilinear drawings of outerplanar graphs in linear time
- No-bend orthogonal drawings and no-bend orthogonally convex drawings of planar graphs (extended abstract)
- On the Computational Complexity of Upward and Rectilinear Planarity Testing
- Mining Graph Data
- Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends
- On Embedding a Graph in the Grid with the Minimum Number of Bends
- Spirality and Optimal Orthogonal Drawings
- Orthogonal Drawings of Plane Graphs Without Bends
- Dividing a Graph into Triconnected Components
- Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time
- Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time
- Accelerated Bend Minimization
- Graph Drawing
- Drawing graphs. Methods and models
This page was built for publication: Rectilinear planarity of partial 2-trees
