Skip to main content
SpringerLink
Log in

How to Morph a Tree on a Small Grid

  • Conference paper
  • First Online:
Book cover Algorithms and Data Structures (WADS 2019)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 11646))

Included in the following conference series:

Abstract

In this paper we study planar morphs between straight-line planar grid drawings of trees. A morph consists of a sequence of morphing steps, where in a morphing step vertices move along straight-line trajectories at constant speed. We show how to construct planar morphs that simultaneously achieve a reduced number of morphing steps and a polynomially-bounded resolution. We assume that both the initial and final drawings lie on the grid and we ensure that each morphing step produces a grid drawing; further, we consider both upward drawings of rooted trees and drawings of arbitrary trees.

This research was supported in part by MIUR Project “MODE” under PRIN 20157EFM5C, by MIUR Project “AHeAD” under PRIN 20174LF3T8, by H2020-MSCA-RISE project 734922 – “CONNECT”, and by MIUR-DAAD JMP N\(^\circ \) 34120.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Alamdari, S., et al.: How to morph planar graph drawings. SIAM J. Comput. 46(2), 824–852 (2017). https://doi.org/10.1137/16M1069171

    Article  MathSciNet  MATH  Google Scholar 

  2. Alamdari, S., et al.: Morphing planar graph drawings with a polynomial number of steps. In: Khanna, S. (ed.) Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, Louisiana, USA, 6–8 January 2013, pp. 1656–1667. SIAM (2013). https://doi.org/10.1137/1.9781611973105.119

  3. Angelini, P., Da Lozzo, G., Di Battista, G., Frati, F., Patrignani, M., Roselli, V.: Morphing planar graph drawings optimally. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8572, pp. 126–137. Springer, Heidelberg (2014). https://doi.org/10.1007/978-3-662-43948-7_11

    Chapter  Google Scholar 

  4. Angelini, P., Da Lozzo, G., Frati, F., Lubiw, A., Patrignani, M., Roselli, V.: Optimal morphs of convex drawings. In: Symposium on Computational Geometry. LIPIcs, vol. 34, pp. 126–140. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2015)

    Google Scholar 

  5. Angelini, P., Frati, F., Patrignani, M., Roselli, V.: Morphing planar graph drawings efficiently. In: Wismath, S., Wolff, A. (eds.) GD 2013. LNCS, vol. 8242, pp. 49–60. Springer, Cham (2013). https://doi.org/10.1007/978-3-319-03841-4_5

    Chapter  MATH  Google Scholar 

  6. Barrera-Cruz, F., Haxell, P., Lubiw, A.: Morphing schnyder drawings of planar triangulations. In: Duncan, C., Symvonis, A. (eds.) GD 2014. LNCS, vol. 8871, pp. 294–305. Springer, Heidelberg (2014). https://doi.org/10.1007/978-3-662-45803-7_25

    Chapter  Google Scholar 

  7. Biedl, T.C., Lubiw, A., Petrick, M., Spriggs, M.J.: Morphing orthogonal planar graph drawings. ACM Trans. Algorithms 9(4), 29:1–29:24 (2013)

    Article  MathSciNet  Google Scholar 

  8. Cairns, S.S.: Deformations of plane rectilinear complexes. Am. Math. Monthly 51(5), 247–252 (1944)

    Article  MathSciNet  Google Scholar 

  9. Chambers, E.W., Eppstein, D., Goodrich, M.T., Löffler, M.: Drawing graphs in the plane with a prescribed outer face and polynomial area. J. Graph Algorithms Appl. 16(2), 243–259 (2012). https://doi.org/10.7155/jgaa.00257

    Article  MathSciNet  MATH  Google Scholar 

  10. Da Lozzo, G., Di Battista, G., Frati, F., Patrignani, M., Roselli, V.: Upward planar morphs. In: Biedl, T., Kerren, A. (eds.) GD 2018. LNCS, vol. 11282, pp. 92–105. Springer, Cham (2018). https://doi.org/10.1007/978-3-030-04414-5_7

    Chapter  Google Scholar 

  11. Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall, Upper Saddle River (1999)

    MATH  Google Scholar 

  12. van Goethem, A., Verbeek, K.: Optimal morphs of planar orthogonal drawings. In: Speckmann, B., Tóth, C.D. (eds.) 34th International Symposium on Computational Geometry, SoCG 2018, 11–14 June 2018, Budapest, Hungary. LIPIcs, vol. 99, pp. 42:1–42:14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2018). https://doi.org/10.4230/LIPIcs.SoCG.2018.42

  13. Thomassen, C.: Deformations of plane graphs. J. Combin. Theory Ser. B 34(3), 244–257 (1983)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sunnyvale, CA, USA

    Fidel Barrera-Cruz

  2. Roma Tre University, Rome, Italy

    Manuel Borrazzo, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani & Vincenzo Roselli

Authors
  1. Fidel Barrera-Cruz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Manuel Borrazzo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Giordano Da Lozzo
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Giuseppe Di Battista
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Fabrizio Frati
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Maurizio Patrignani
    View author publications

    You can also search for this author in PubMed Google Scholar

  7. Vincenzo Roselli
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Giordano Da Lozzo .

Editor information

Editors and Affiliations

  1. Department of Computing Science, University of Alberta, Edmonton, AB, Canada

    Zachary Friggstad

  2. School of Computer Science, Carleton University, Manotick, ON, Canada

    Jörg-Rüdiger Sack

  3. Department of Computing Science, University of Alberta, Edmonton, AB, Canada

    Mohammad R Salavatipour

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Barrera-Cruz, F. et al. (2019). How to Morph a Tree on a Small Grid. In: Friggstad, Z., Sack, JR., Salavatipour, M. (eds) Algorithms and Data Structures. WADS 2019. Lecture Notes in Computer Science(), vol 11646. Springer, Cham. https://doi.org/10.1007/978-3-030-24766-9_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-24766-9_5

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-24765-2

  • Online ISBN: 978-3-030-24766-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation