Now showing items 1-3 of 3

    • Compatible Paths on Labelled Point Sets 

      Arseneva, Elena; Bahoo, Yeganeh; Biniaz, Ahmad; Cano Vila, María del Pilar; Chanchary, Farah; Iacono, John; Jain, Kshitij; Lubiw, Anna; Mondal, Debajyoti; Sheikhan, Khadijeh; D. Thót, Csaba (2019)
      Conference report
      Open Access
      Let P and Q be finite point sets of the same cardinality in R 2 , each labelled from 1 to n. Two noncrossing geometric graphs GP and GQ spanning P and Q, respectively, are called compatible if for every face f in GP , there ...
    • Flips in higher order Delaunay triangulations 

      Arseneva, Elena; Bose, Prosenjit; Cano Vila, María del Pilar; Silveira, Rodrigo Ignacio (2021)
      Conference report
      Restricted access - publisher's policy
      We study the flip graph of higher order Delaunay triangulations. A triangulation of a set S of n points in the plane is order-k Delaunay if for every triangle its circumcircle encloses at most k points of S. The flip graph ...
    • Pole Dancing: 3D Morphs for Tree Drawings 

      Arseneva, Elena; Bose, Prosenjit; Cano Vila, María del Pilar; D'Angelo, Anthony; Dujmovic, Vida; Frati, Fabrizio; Langerman, Stefan; Tappini, Alessandra (Springer, 2018)
      Conference report
      Restricted access - publisher's policy
      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 ...