Planar Rectilinear Drawings of Outerplanar Graphs in Linear Time

DOI10.1007/978-3-030-68766-3_33OpenAlexW3135899633MaRDI QIDQ5014134

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

Mathematics Subject Classification ID

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

Related Items

Untangling circular drawings: algorithms and complexity, Unit-length rectangular drawings of graphs, Grid straight-line embeddings of trees with a minimum number of bends per path, Orthogonal planarity testing of bounded treewidth graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Orthogonal graph drawing with inflexible edges
• Bend-minimum orthogonal drawings in quadratic time
• Sketched representations and orthogonal planarity of bounded treewidth graphs
• 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
• 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
• Computing and Combinatorics
• Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time
• Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time
• Accelerated Bend Minimization
• Graph Drawing