par Arseneva, Elena;Bose, Prosenjit ;Cano, Pilar;D’Angelo, Anthony;Dujmović, Vida V.;Frati, Fabrizio;Langerman, Stefan ;Tappini, Alessandra
Référence Journal of graph algorithms and applications, 23, 3, page (579-602)
Publication Publié, 2019-02-01
Article révisé par les pairs
Résumé : We study the question whether a crossing-free 3D morph between two straight-line drawings of an n-vertex tree can be constructed consisting of a small number of linear morphing steps. We look both at the case in which the two given drawings are two-dimensional and at the one in which they are three-dimensional. In the former setting we prove that a crossing-free 3D morph always exists with O(rpw(T)) ⊆ O(log n) steps, while for where rpw(T) is the rooted pathwidth or Strahler number of T, while for the latter setting Θ(n) steps are always sufficient and sometimes necessary.

Documents en relation

DI-fusion

  • Tight bound for the Erdős-Pósa property of tree minors
    par Dujmović, Vida V. , Joret, Gwenaël , Micek, Piotr , Morin, Pat
    Publication 2025-07-01
  • The grid-minor theorem revisited
    par Dujmović, Vida V. , Hickingbotham, Robert , Hodor, Jędrzej , Joret, Gwenaël , La, Hoang , Micek, Piotr , Morin, Pat , Rambaud, Clément , Wood, David R.
    Publication 2025-08-01
  • Planar Graphs in Blowups of Fans
    par Dujmović, Vida V. , Joret, Gwenaël , Micek, Piotr , Morin, Pat P. , Wood, David
    Publication 2025-07-01
  • An Improved Bound for Plane Covering Paths
    par Akitaya, Hugo Alves , Aloupis, Greg , Biniaz, Ahmad , Bose, Prosenjit , De Carufel, Jean Lou , Gavoille, Cyril , Iacono, John , Kleist, Linda , Smid, Michiel M. , Souvaine, Diane D.L. , Theocharous, Leonidas
    Publication 2025-07-08
  • An Improved Bound for Plane Covering Paths
    par Akitaya, Hugo Alves , Biniaz, Ahmad , De Carufel, Jean Lou , Iacono, John , Smid, Michiel M. , Theocharous, Leonidas , Aloupis, Greg , Bose, Prosenjit , Gavoille, Cyril , Kleist, Linda , Souvaine, Diane D.L.
    Publication 2025-10-01