Planar Rectilinear Drawings of Outerplanar Graphs in Linear Time
From MaRDI portal
Publication:5014134
DOI10.1007/978-3-030-68766-3_33OpenAlexW3135899633MaRDI QIDQ5014134FDOQ5014134
Authors: Fabrizio Frati
Publication date: 1 December 2021
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2006.06951
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Title not available (Why is that?)
- Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends
- On Embedding a Graph in the Grid with the Minimum Number of Bends
- Orthogonal graph drawing with inflexible edges
- On the computational complexity of upward and rectilinear planarity testing
- Spirality and Optimal Orthogonal Drawings
- Computing and Combinatorics
- Orthogonal Drawings of Plane Graphs Without Bends
- Accelerated bend minimization
- Graph Drawing
- On bend-minimized orthogonal drawings of planar 3-graphs
- Multiple-source multiple-sink maximum flow in directed planar graphs in near-linear time
- Bend-minimum orthogonal drawings in quadratic time
- Title not available (Why is that?)
- Sketched representations and orthogonal planarity of bounded treewidth graphs
- Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time
- No-bend orthogonal drawings and no-bend orthogonally convex drawings of planar graphs (extended abstract)
Cited In (11)
- Orthogonal planarity testing of bounded treewidth graphs
- Re-embedding a 1-Plane Graph into a Straight-Line Drawing in Linear Time
- Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time
- Unit-length rectangular drawings of graphs
- Area-efficient planar straight-line drawings of outerplanar graphs
- Grid straight-line embeddings of trees with a minimum number of bends per path
- Unit-length rectangular drawings of graphs
- Computing β-Drawings of 2-Outerplane Graphs in Linear Time
- Planar rectilinear drawings of outerplanar graphs in linear time
- Untangling circular drawings: algorithms and complexity
- SOFSEM 2005: Theory and Practice of Computer Science
This page was built for publication: Planar Rectilinear Drawings of Outerplanar Graphs in Linear Time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5014134)