Now showing items 1-3 of 3

    • Colored anchored visibility representations in 2D and 3D space 

      Binucci, Carla; Di Giacomo, Emilio; Hong, Seok-Hee; Liotta, Giuseppe; Meijer, Henk; Sacristán Adinolfi, Vera; Wismath, Stephen (2020-08)
      Article
      Open Access
      In a visibility representation of a graph G, the vertices are represented by nonoverlapping geometric objects, while the edges are represented as segments that only intersect the geometric objects associated with their ...
    • Proximity graphs inside large weighted graphs 

      Ábrego, Bernardo M.; Fabila Monroy, Ruy; Fernández-Merchant, Silvia; Flores Peñaloza, David; Hurtado Díaz, Fernando Alfredo; Meijer, Henk; Sacristán Adinolfi, Vera; Saumell Mendiola, Maria (2010)
      Conference report
      Open Access
      Given a large weighted graph G = (V;E) and a subset U of V , we de¯ne several graphs with vertex set U in which two vertices are adjacent if they satisfy some prescribed proximity rule. These rules use the shortest path ...
    • Universal point subsets for planar graphs 

      Angelini, Patrizio; Binucci, Carla; Evans, William; Hurtado Díaz, Fernando Alfredo; Liotta, Giuseppe; Mchedlidze, Tamara; Meijer, Henk; Okamoto, Yoshio (Springer, 2012)
      Conference report
      Open Access
      A set S of k points in the plane is a universal point subset for a class G of planar graphs if every graph belonging to G admits a planar straight-line drawing such that k of its vertices are represented by the points of ...