Advertisement

Drawing Trees with Perfect Angular Resolution and Polynomial Area

  • Christian A. Duncan
  • David Eppstein
  • Michael T. Goodrich
  • Stephen G. Kobourov
  • Martin Nöllenburg
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6502)

Abstract

We study methods for drawing trees with perfect angular resolution, i.e., with angles at each vertex, v, equal to 2π/d(v). We show:

  1. 1

    Any unordered tree has a crossing-free straight-line drawing with perfect angular resolution and polynomial area.

     
  2. 2

    There are ordered trees that require exponential area for any crossing-free straight-line drawing having perfect angular resolution.

     
  3. 3

    Any ordered tree has a crossing-free Lombardi-style drawing (where each edge is represented by a circular arc) with perfect angular resolution and polynomial area.

     

Thus, our results explore what is achievable with straight-line drawings and what more is achievable with Lombardi-style drawings, with respect to drawings of trees with perfect angular resolution.

Keywords

Intersection Angle Large Zone Outer Annulus Unordered Tree Heavy Edge 
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.
    Brandes, U., Wagner, D.: Using graph layout to visualize train interconnection data. J. Graph Algorithms Appl. 4(3), 135–155 (2000), http://jgaa.info/accepted/00/BrandesWagner00.4.3.pdf CrossRefzbMATHGoogle Scholar
  2. 2.
    Buchheim, C., Jünger, M., Leipert, S.: Improving Walker’s algorithm to run in linear time. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol. 2528, pp. 344–353. Springer, Heidelberg (2002), doi:10.1007/3-540-36151-0_32CrossRefGoogle Scholar
  3. 3.
    Cappos, J., Estrella-Balderrama, A., Fowler, J.J., Kobourov, S.G.: Simultaneous graph embedding with bends and circular arcs. Computational Geometry 42(2), 173–182 (2009), doi:10.1016/j.comgeo.2008.05.003MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Carlson, J., Eppstein, D.: Trees with convex faces and optimal angles. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol. 4372, pp. 77–88. Springer, Heidelberg (2007), doi:10.1007/978-3-540-70904-6_9CrossRefGoogle Scholar
  5. 5.
    Chan, T., Goodrich, M.T., Kosaraju, S.R., Tamassia, R.: Optimizing area and aspect ratio in straight-line orthogonal tree drawings. Computational Geometry 23(2), 153–162 (2002), doi:10.1016/S0925-7721(01)00066-9MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Cheng, C.C., Duncan, C.A., Goodrich, M.T., Kobourov, S.G.: Drawing planar graphs with circular arcs. Discrete Comput. Geom. 25(3), 405–418 (2001), doi:10.1007/s004540010080MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Dickerson, M., Eppstein, D., Goodrich, M.T., Meng, J.: Confluent drawings: visualizing non-planar diagrams in a planar way. In: Liotta, G. (ed.) GD 2003. LNCS, vol. 2912, pp. 1–12. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  8. 8.
    Duncan, C.A., Efrat, A., Kobourov, S.G., Wenk, C.: Drawing with fat edges. Int. J. Found. Comput. Sci. 17(5), 1143–1164 (2006), doi:10.1142/S0129054106004315MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Duncan, C.A., Eppstein, D., Goodrich, M.T., Kobourov, S.G., Nöllenburg, M.: Drawing Trees with Perfect Angular Resolution and Polynomial Area, (September 2010) ArXiv e-prints, arXiv:1009.0581Google Scholar
  10. 10.
    Duncan, C.A., Eppstein, D., Goodrich, M.T., Kobourov, S.G., Nöllenburg, M.: Lombardi drawings of graphs. In: Proc. 18th Int. Symp. on Graph Drawing (GD 2010), Springer, Heidelberg (2010), http://arxiv.org/abs/1009.0579 Google Scholar
  11. 11.
    Eades, P.: Drawing free trees. Bull. Inst. Combinatorics and Its Applications 5, 10–36 (1992)MathSciNetzbMATHGoogle Scholar
  12. 12.
    Finkel, B., Tamassia, R.: Curvilinear graph drawing using the force-directed method. In: Pach, J. (ed.) GD 2004. LNCS, vol. 3383, pp. 448–453. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  13. 13.
    Garg, A., Goodrich, M.T., Tamassia, R.: Planar upward tree drawings with optimal area. Int. J. Comput. Geom. Appl. 6(3), 333–356 (1996), http://www.cs.brown.edu/cgc/papers/ggt-aoutd-96.ps.gz MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    Garg, A., Rusu, A.: Area-efficient order-preserving planar straight-line drawings of ordered trees. Int. J. Comput. Geom. Appl. 13(6), 487–505 (2003), doi:10.1142/S021819590300130XMathSciNetCrossRefzbMATHGoogle Scholar
  15. 15.
    Garg, A., Rusu, A.: Straight-line drawings of binary trees with linear area and arbitrary aspect ratio. J. Graph Algorithms Appl. 8(2), 135–160 (2004), http://jgaa.info/accepted/2004/GargRusu2004.8.2.pdf MathSciNetCrossRefzbMATHGoogle Scholar
  16. 16.
    Grivet, S., Auber, D., Domenger, J.P., Melançon, G.: Bubble tree drawing algorithm. In: Proc. Int. Conf. Computer Vision and Graphics, pp. 633–641. Springer, Heidelberg (2004), http://www.labri.fr/publications/is/2004/GADM04 Google Scholar
  17. 17.
    Harel, D., Tarjan, R.E.: Fast algorithms for finding nearest common ancestors. SIAM J. Comput. 13(2), 338–355 (1984), doi:10.1137/0213024MathSciNetCrossRefzbMATHGoogle Scholar
  18. 18.
    Hobbs, R., Lombardi, M.: Mark Lombardi: Global Networks. Independent Curators International, New York (2003)Google Scholar
  19. 19.
    Lin, C.-C., Yen, H.-C.: On balloon drawings of rooted trees. J. Graph Algorithms Appl. 11(2), 431–452 (2007), http://jgaa.info/accepted/2007/LinYen2007.11.2.pdf MathSciNetCrossRefzbMATHGoogle Scholar
  20. 20.
    Melançon, G., Herman, I.: Circular Drawings of Rooted Trees. Tech. Rep. INS-R9817, CWI Amsterdam (1998)Google Scholar
  21. 21.
    Reingold, E.M., Tilford, J.S.: Tidier drawings of trees. IEEE Trans. Software Engineering 7(2), 223–228 (1981)CrossRefGoogle Scholar
  22. 22.
    Shin, C.-S., Kim, S.K., Chwa, K.-Y.: Area-efficient algorithms for straight-line tree drawings. Computational Geometry 15(4), 175–202 (2000), doi:10.1016/S0925-7721(99)00053-XGoogle Scholar
  23. 23.
    Walker, J.: A node-positioning algorithm for general trees. Software Practice and Experience 20(7), 685–705 (1990), doi:10.1002/spe.4380200705CrossRefGoogle Scholar
  24. 24.
    Wetherell, C., Shannon, A.: Tidy drawings of trees. IEEE Trans. Software Engineering 5(5), 514–520 (1979)CrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Christian A. Duncan
    • 1
  • David Eppstein
    • 2
  • Michael T. Goodrich
    • 2
  • Stephen G. Kobourov
    • 3
  • Martin Nöllenburg
    • 2
  1. 1.Department of Computer ScienceLouisiana Tech. Univ.RustonUSA
  2. 2.Department of Computer ScienceUniversity of CaliforniaIrvineUSA
  3. 3.Department of Computer ScienceUniversity of ArizonaTucsonUSA

Personalised recommendations