Document Open Access Logo

On Bend-Minimized Orthogonal Drawings of Planar 3-Graphs

Authors Yi-Jun Chang, Hsu-Chun Yen

PDF
Thumbnail PDF

File

LIPIcs.SoCG.2017.29.pdf
  • Filesize: 1.95 MB
  • 15 pages

Document Identifiers

Author Details

Yi-Jun Chang
Hsu-Chun Yen

Cite As Get BibTex

Yi-Jun Chang and Hsu-Chun Yen. On Bend-Minimized Orthogonal Drawings of Planar 3-Graphs. In 33rd International Symposium on Computational Geometry (SoCG 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 77, pp. 29:1-29:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017) https://doi.org/10.4230/LIPIcs.SoCG.2017.29

Abstract

An orthogonal drawing of a graph is a planar drawing where each edge is drawn as a sequence of horizontal and vertical line segments. Finding a bend-minimized orthogonal drawing of a planar graph of maximum degree 4 is NP-hard. The problem becomes tractable for planar graphs of maximum degree 3, and the fastest known algorithm takes O(n^5 log n) time. Whether a faster algorithm exists has been a long-standing open problem in graph drawing. In this paper we present an algorithm that takes only O~(n^{17/7}) time, which is a significant improvement over the previous state of the art.

Subject Classification

Keywords
  • Bend minimization
  • graph drawing
  • orthogonal drawing
  • planar graph

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

References

  1. Michael A. Bekos, Michael Kaufmann, Stephen G. Kobourov, and Antonios Symvonis. Smooth orthogonal layouts. JGAA, 17(5):575-595, 2013. Google Scholar
  2. Michael A. Bekos, Michael Kaufmann, Robert Krug, Thorsten Ludwig, Stefan Näher, and Vincenzo Roselli. Slanted orthogonal drawings: Model, algorithms and evaluations. JGAA, 18(3):459-489, 2014. Google Scholar
  3. Thomas Bläsius, Ignaz Rutter, and Dorothea Wagner. Optimal orthogonal graph drawing with convex bend costs. ACM Trans. Algorithms, 12(3):33:1-33:32, 2016. Google Scholar
  4. Franz Brandenburg, David Eppstein, Michael T. Goodrich, Stephen Kobourov, Giuseppe Liotta, and Petra Mutzel. Selected open problems in graph drawing. In Proceedings of the 11th International Symposium on Graph Drawing (GD'03), pages 515-539. Springer Berlin Heidelberg, 2004. Google Scholar
  5. Yi-Jun Chang and Hsu-Chun Yen. On orthogonally convex drawings of plane graphs. Computational Geometry, 62:34-51, 2017. Google Scholar
  6. Michael B. Cohen, Aleksander Mądry, Piotr Sankowski, and Adrian Vladu. Negative-weight shortest paths and unit capacity minimum cost flow in Õ(m^10/7log W) time. In Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'17), pages 752-771. Society for Industrial and Applied Mathematics, 2017. Google Scholar
  7. Sabine Cornelsen and Andreas Karrenbauer. Accelerated bend minimization. JGAA, 16(3):635-650, 2012. Google Scholar
  8. Giuseppe Di Battista, Walter Didimo, Maurizio Patrignani, and Maurizio Pizzonia. Orthogonal and quasi-upward drawings with vertices of prescribed size. In Proceedings of the 7th International Symposium on Graph Drawing (GD'99), pages 297-310. Springer Berlin Heidelberg, 1999. Google Scholar
  9. Giuseppe Di Battista, Giuseppe Liotta, and Francesco Vargiu. Spirality and optimal orthogonal drawings. SIAM Journal on Computing, 27(6):1764-1811, 1998. Google Scholar
  10. Giuseppe Di Battista and Roberto Tamassia. On-line planarity testing. SIAM Journal on Computing, 25(5):956-997, 1996. Google Scholar
  11. Walter Didimo, Giuseppe Liotta, and Maurizio Patrignani. On the complexity of hv-rectilinear planarity testing. In Proceedings of the 22nd International Symposium on Graph Drawing (GD'14), pages 343-354. Springer Berlin Heidelberg, 2014. Google Scholar
  12. Christian A. Duncan and Michael T. Goodrich. Planar orthogonal and polyline drawing algorithms. In Roberto Tamassia, editor, Handbook of Graph Drawing and Visualization, chapter 8. CRC Press, 2013. Google Scholar
  13. Stephane Durocher, Stefan Felsner, Saeed Mehrabi, and Debajyoti Mondal. Drawing hv-restricted planar graphs. In Proceedings of the 11th Latin American Theoretical Informatics Symposium (LATIN'14), pages 156-167. Springer Berlin Heidelberg, 2014. Google Scholar
  14. Ashim Garg and Roberto Tamassia. A new minimum cost flow algorithm with applications to graph drawing. In Proceedings of the Symposium on Graph Drawing (GD'96), pages 201-216. Springer Berlin Heidelberg, 1997. Google Scholar
  15. Ashim Garg and Roberto Tamassia. On the computational complexity of upward and rectilinear planarity testing. SIAM Journal on Computing, 31(2):601-625, 2001. Google Scholar
  16. Gunnar W. Klau and Petra Mutzel. Quasi-orthogonal drawing of planar graphs. Technical Report MPI-I-98-1-013, Max-Planck-Institut für Informatik, Saarbrücken, 1998. Google Scholar
  17. Md. Saidur Rahman, Shin-ichi Nakano, and Takao Nishizeki. A linear algorithm for bend-optimal orthogonal drawings of triconnected cubic plane graphs. JGAA, 3(4):31-62, 1999. Google Scholar
  18. Md. Saidur Rahman and Takao Nishizeki. Bend-minimum orthogonal drawings of plane 3-graphs. In Proceedings of the 28th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'02), pages 367-378. Springer Berlin Heidelberg, 2002. Google Scholar
  19. Md. Saidur Rahman, Takao Nishizeki, and Mahmuda Naznin. Orthogonal drawings of plane graphs without bends. JGAA, 7(4):335-362, 2003. Google Scholar
  20. Roberto Tamassia. On embedding a graph in the grid with the minimum number of bends. SIAM Journal on Computing, 16(3):421-444, 1987. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact