Advertisement

Drawing Planar Cubic 3-Connected Graphs with Few Segments: Algorithms and Experiments

  • Alexander Igamberdiev
  • Wouter Meulemans
  • André Schulz
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9411)

Abstract

A drawing of a graph can be understood as an arrangement of geometric objects. In the most natural setting the arrangement is formed by straight-line segments. Every cubic planar 3-connected graph with n vertices has such a drawing with only \(n/2 + 3\) segments, matching the lower bound. This result is due to Mondal et al. [J. of Comb. Opt., 25], who gave an algorithm for constructing such drawings.

We introduce two new algorithms that also produce drawings with \(n/2 + 3\) segments. One algorithm is based on a sequence of dual edge contractions, the other is based on a recursion of nested cycles. We also show a flaw in the algorithm of Mondal et al. and present a fix for it. We then compare the performance of these three algorithms by measuring angular resolution, edge length and face aspect ratio of the constructed drawings. We observe that the corrected algorithm of Mondal et al. mostly outperforms the other algorithms, especially in terms of angular resolution. However, the new algorithms perform better in terms of edge length and minimal face aspect ratio.

Keywords

Line Segment Cognitive Load Edge Length Angular Resolution Visual Complexity 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Aerts, N., Felsner, S.: Straight line triangle representations. In: Wismath, S., Wolff, A. (eds.) GD 2013. LNCS, vol. 8242, pp. 119–130. Springer, Heidelberg (2013) CrossRefGoogle Scholar
  2. 2.
    Dujmović, V., Eppstein, D., Suderman, M., Wood, D.: Drawings of planar graphs with few slopes and segments. CGTA 38, 194–212 (2007)MATHGoogle Scholar
  3. 3.
    Durocher, S., Mondal, D.: Drawing plane triangulations with few segments. In: Proceedings of 26th CCCG, pp. 40–45 (2014)Google Scholar
  4. 4.
    Durocher, S., Mondal, D., Nishat, R., Whitesides, S.: A note on minimum-segment drawings of planar graphs. J. Graph Algorithm Appl. 17(3), 301–328 (2013)MathSciNetCrossRefMATHGoogle Scholar
  5. 5.
    Grünbaum, B.: Convex Polytopes (Graduate Texts in Math), 2nd edn. Springer-Verlag, New York (2003) CrossRefGoogle Scholar
  6. 6.
    Haas, R., Orden, D., Rote, G., Santos, F., Servatius, B., Servatius, H., Souvaine, D.L., Streinu, I., Whiteley, W.: Planar minimally rigid graphs and pseudo-triangulations. Comput. Geom. 31(1–2), 31–61 (2005)MathSciNetCrossRefMATHGoogle Scholar
  7. 7.
    Mondal, D., Nishat, R., Biswas, S., Rahman, S.: Minimum-segment convex drawings of 3-connected cubic plane graphs. J. Comb. Opt. 25, 460–480 (2013)MathSciNetCrossRefMATHGoogle Scholar
  8. 8.
    Schulz, A.: Drawing graphs with few arcs. In: Brandstädt, A., Jansen, K., Reischuk, R. (eds.) WG 2013. LNCS, vol. 8165, pp. 406–417. Springer, Heidelberg (2013) CrossRefGoogle Scholar
  9. 9.
    Tamassia, R.: Handbook of Graph Drawing and Visualization. CRC Press, Boca Raton (2013)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.LG Theoretische InformatikFernUniversität in HagenHagenGermany
  2. 2.GiCentreCity University LondonLondonUK

Personalised recommendations