Planar Rectilinear Drawings of Outerplanar Graphs in Linear Time

DOI10.1007/978-3-030-68766-3_33MaRDI QIDQ5014134zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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

Cites work

• Accelerated bend minimization
• Bend-minimum orthogonal drawings in quadratic time
• Computing and Combinatorics
• Graph Drawing
• scientific article; zbMATH DE number 1953108 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• Multiple-source multiple-sink maximum flow in directed planar graphs in near-linear time
• No-bend orthogonal drawings and no-bend orthogonally convex drawings of planar graphs (extended abstract)
• On bend-minimized orthogonal drawings of planar 3-graphs
• On Embedding a Graph in the Grid with the Minimum Number of Bends
• On the computational complexity of upward and rectilinear planarity testing
• Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time
• Orthogonal Drawings of Plane Graphs Without Bends
• Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends
• Orthogonal graph drawing with inflexible edges
• Sketched representations and orthogonal planarity of bounded treewidth graphs
• Spirality and Optimal Orthogonal Drawings

Cited in

(11)

• Grid straight-line embeddings of trees with a minimum number of bends per path
• Orthogonal planarity testing of bounded treewidth graphs
• Planar rectilinear drawings of outerplanar graphs in linear time
• 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
• Computing β-Drawings of 2-Outerplane Graphs in Linear Time
• SOFSEM 2005: Theory and Practice of Computer Science
• Untangling circular drawings: algorithms and complexity
• Unit-length rectangular drawings of graphs
• Unit-length rectangular drawings of graphs
• Area-efficient planar straight-line drawings of outerplanar graphs

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)