Ara es mostren els items 9-12 de 12

    • Recoloring directed graphs 

      Felsner, Stefan; Huemer, Clemens; Saumell Mendiola, Maria (Prensas Universitarias de Zaragoza, 2009)
      Text en actes de congrés
      Accés obert
      Let G be a directed graph and k a positive integer. We define the k-color graph of G (Dk(G) for short) as the directed graph having all k-colorings of G as node set, and where two k-colorings and ' are joined by a ...
    • Some properties of higher order delaunay and gabriel graphs 

      Bose, Prosenjit; Collette, Sébastien; Hurtado Díaz, Fernando Alfredo; Korman, Matias; Langerman, Stefan; Sacristán Adinolfi, Vera; Saumell Mendiola, Maria (2010)
      Text en actes de congrés
      Accés obert
      We consider two classes of higher order proximity graphs defined on a set of points in the plane, namely, the k-Delaunay graph and the k-Gabriel graph. We give bounds on the following combinatorial and geometric properties ...
    • Terrain prickliness: theoretical grounds for high complexity viewsheds 

      Acharyya, Ankush; Jallu, Ramesh; Löffler, M.; Meijer, Geert; Saumell Mendiola, Maria; Silveira, Rodrigo Ignacio; Staals, Frank (2021)
      Text en actes de congrés
      Accés obert
      An important task when working with terrain models is computing viewsheds: the parts of the terrain visible from a given viewpoint. When the terrain is modeled as a polyhedral terrain, the viewshed is composed of the union ...
    • Terrain prickliness: theoretical grounds for low complexity viewsheds 

      Acharyya, Ankush; Jallu, Ramesh; Löffler, M.; Meijer, Geert; Saumell Mendiola, Maria; Silveira, Rodrigo Ignacio; Staals, Frank; Tiwary, Hans Raj (2021)
      Text en actes de congrés
      Accés restringit per política de l'editorial