Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time

DOI10.1137/1.9781611975994.49MaRDI QIDQ5146819zbMATH OpenOpenAlexFDO

Authors Walter Didimo, Giuseppe Liotta, Giacomo Ortali, Maurizio Patrignani

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)

Cited in

(29)

• Rectilinear-upward planarity testing of digraphs
• Ortho-radial drawing in near-linear time
• Orthogonal planarity testing of bounded treewidth graphs
• Rectilinear Planarity of Partial 2-Trees
• On turn-regular orthogonal representations
• An annotated review on graph drawing and its applications
• Linear-time rectilinear drawings of subdivisions of triconnected cubic planar graphs with orthogonally convex faces
• Ranking and unranking of the planar embeddings of a planar graph
• Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time
• Planar Rectilinear Drawings of Outerplanar Graphs in Linear Time
• scientific article; zbMATH DE number 2104042 (Why is no real title available?)
• Sliding column model for t-unit bar visibility representations of graphs
• Extending partial orthogonal drawings
• Unit-length rectangular drawings of graphs
• On the parameterized complexity of bend-minimum orthogonal planarity
• Upward and orthogonal planarity are W[1]-hard parameterized by treewidth
• Quasi-upward planar drawings with minimum curve complexity
• On the parameterized complexity of bend-minimum orthogonal planarity
• Rectilinear-upward planarity testing of digraphs
• Unit-length rectangular drawings of graphs
• Computing bend-minimum orthogonal drawings of plane series-parallel graphs in linear time
• scientific article; zbMATH DE number 1500675 (Why is no real title available?)
• Planar rectilinear drawings of outerplanar graphs in linear time
• Extending Partial Orthogonal Drawings
• Parameterized complexity of graph planarity with restricted cyclic orders
• Rectilinear planarity of partial 2-trees
• Testing upward planarity of partial 2-trees
• Parameterized complexity of graph planarity with restricted cyclic orders
• Relating planar graph drawings to planar satisfiability problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5146819)