Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time

DOI10.1137/1.9781611975994.49OpenAlexW2998897772MaRDI QIDQ5146819

Walter Didimo, Giuseppe Liotta, Maurizio Patrignani, Giacomo Ortali

Publication date: 2 February 2021

Published in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1910.11782

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (19)

Planar rectilinear drawings of outerplanar graphs in linear time ⋮ On Turn-Regular Orthogonal Representations ⋮ Quasi-upward planar drawings with minimum curve complexity ⋮ Extending Partial Orthogonal Drawings ⋮ Computing bend-minimum orthogonal drawings of plane series-parallel graphs in linear time ⋮ Unit-length rectangular drawings of graphs ⋮ Rectilinear planarity of partial 2-trees ⋮ Testing upward planarity of partial 2-trees ⋮ Relating planar graph drawings to planar satisfiability problems ⋮ Rectilinear Planarity of Partial 2-Trees ⋮ An annotated review on graph drawing and its applications ⋮ Sliding column model for t-unit bar visibility representations of graphs ⋮ Parameterized complexity of graph planarity with restricted cyclic orders ⋮ Unnamed Item ⋮ Parameterized complexity of graph planarity with restricted cyclic orders ⋮ Orthogonal planarity testing of bounded treewidth graphs ⋮ Extending Partial Orthogonal Drawings ⋮ Planar Rectilinear Drawings of Outerplanar Graphs in Linear Time ⋮ Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time

This page was built for publication: Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time