Now showing items 1-14 of 14

    • IconCompact Grid Representation of Graphs  [Chapter of Book]

      Cáceres González, José; Grima Ruiz, Clara Isabel; Cortés Parejo, María del Carmen; Hachimori, Masahiro; Márquez Pérez, Alberto; Mukae, Raiji; Nakamoto, Atsuhiro; Negami, Seiya; Robles Arias, Rafael; Valenzuela Muñoz, Jesús (2011)
      A graph G is said to be grid locatable if it admits a representation such that vertices are mapped to grid points and edges to line segments that avoid grid points but the extremes. Additionally G is said to be properly ...
    • IconCover contact graphs  [Article]

      Atienza Martínez, María Nieves; Castro Ochoa, Natalia de; Cortés Parejo, María del Carmen; Garrido Vizuete, María de los Angeles; Grima Ruiz, Clara Isabel; Hernández, Gregorio; Márquez Pérez, Alberto; Moreno González, Auxiliadora; Nöllenburg, Martin; Portillo Fernández, José Ramón; Reyes Colume, Pedro; Valenzuela Muñoz, Jesús; Villar Liñán, María Trinidad; Wolff, Alexander (2012)
      We study problems that arise in the context of covering certain geometric objects called seeds (e.g., points or disks) by a set of other geometric objects called cover (e.g., a set of disks or homothetic triangles). We ...
    • IconCover Contact Graphs  [Chapter of Book]

      Atienza, Nieves; Castro Ochoa, Natalia de; Cortés Parejo, María del Carmen; Garrido Vizuete, María de los Angeles; Grima Ruiz, Clara Isabel; Hernández, Gregorio; Márquez Pérez, Alberto; Moreno, Auxiliadora; Nöllenburg, Martin; Portillo Fernández, José Ramón; Reyes Colume, Pedro; Valenzuela Muñoz, Jesús; Villar Liñán, María Trinidad; Wolff, Alexander (2007)
      We study problems that arise in the context of covering certain geometric objects (so-called seeds, e.g., points or disks) by a set of other geometric objects (a so-called cover, e.g., a set of disks or homothetic triangles). ...
    • IconEuclidean position in Euclidean 2-orbifolds  [Article]

      Cortés Parejo, María del Carmen; Márquez Pérez, Alberto; Valenzuela Muñoz, Jesús (2004)
      Intuitively, a set of sites on a surface is in Euclidean position if points are so close to each other that planar algorithms can be easily adapted in order to solve most of the classical problems in Computational Geometry. ...
    • IconGeometría computacional en superficies de órbitas  [Doctoral Thesis]

      Valenzuela Muñoz, Jesús (2003)
      En los casi treinta años de historia de la Geometría Computacional, sólo recientemente se han comenzado a estudiar problemas en superficies distintas del plano. Estudio que es necesario desde el momento en que surgen ...
    • IconK-Factores en nubes bicromáticas  [Presentation]

      Grima Ruiz, Clara Isabel; Atienza Martínez, María Nieves; Cortés Parejo, María del Carmen; Garijo Royo, Delia; Valenzuela Muñoz, Jesús; Villar Liñán, María Trinidad (2007)
      Consideramos una colección de puntos bicromática y nos preguntamos cuántos puntos adicionales son necesarios considerar para asegurar la existencia de un k {factor. Dos tipos de puntos adicionales serán tratados: puntos ...
    • IconMonochromatic geometric k-factors for bicolored point sets with auxiliary points  [Article]

      Garijo Royo, Delia; Garrido Vizuete, María de los Angeles; Grima Ruiz, Clara Isabel; Márquez Pérez, Alberto; Moreno González, Auxiliadora; Portillo Fernández, José Ramón; Reyes Colume, Pedro; Robles Arias, Rafael; Valenzuela Muñoz, Jesús (2014)
      Given a bicolored point set S, it is not always possible to construct a monochromatic geometric planar k-factor of S. We consider the problem of finding such a k-factor of S by using auxiliary points. Two types are considered: ...
    • IconMonochromatic geometric k-factors in red-blue sets with white and Steiner points  [Article]

      Garijo Royo, Delia; Garrido Vizuete, María de los Angeles; Grima Ruiz, Clara Isabel; Márquez Pérez, Alberto; Moreno González, Auxiliadora; Portillo Fernández, José Ramón; Reyes Colume, Pedro; Robles Arias, Rafael; Valenzuela Muñoz, Jesús (2009)
      We study the existence of monochromatic planar geometric k-factors on sets of red and blue points. When it is not possible to find a k-factor we make use of auxiliary points: white points, whose position is given as a datum ...
    • IconPosición euclídea en superficies de órbitas euclídeas  [Presentation]

      Cortés Parejo, María del Carmen; Márquez Pérez, Alberto; Valenzuela Muñoz, Jesús (Alberto Márquez, 2002)
    • IconQuadrangulations and 2-Colorations  [Presentation]

      Cortés Parejo, María del Carmen; Márquez Pérez, Alberto; Nakamoto, Atsuhiro; Valenzuela Muñoz, Jesús (2005)
      Any metric quadrangulation (made by segments of straight line) of a point set in the plane determines a 2-coloration of the set, such that edges of the quadrangulation can only join points with different colors. In this ...
    • IconReporting Bichromatic Segment Intersections from Point Sets  [Article]

      Cortés Parejo, María del Carmen; Garijo Royo, Delia; Garrido Vizuete, María de los Angeles; Grima Ruiz, Clara Isabel; Márquez Pérez, Alberto; Moreno González, Auxiliadora; Valenzuela Muñoz, Jesús; Villar Liñán, María Trinidad (2012)
      In this paper, we introduce a natural variation of the problem of computing all bichromatic intersections between two sets of segments. Given two sets R and B of n points in the plane defining two sets of segments, say red ...
    • IconTransforming triangulations on non planar-surfaces  [Article]

      Cortés Parejo, María del Carmen; Grima Ruiz, Clara Isabel; Hurtado, Ferrán; Márquez Pérez, Alberto; Santos, F.; Valenzuela Muñoz, Jesús (2003)
      We consider whether any two triangulations of a polygon or a point set on a non-planar surface with a given metric can be transformed into each other by a sequence of edge flips. The answer is negative in general with some ...
    • IconTransforming Triangulations on Nonplanar Surfaces  [Article]

      Cortés Parejo, María del Carmen; Grima Ruiz, Clara Isabel; Hurtado, Ferrán; Márquez Pérez, Alberto; Santos, F.; Valenzuela Muñoz, Jesús (2010)
      We consider whether any two triangulations of a polygon or a point set on a nonplanar surface with a given metric can be transformed into each other by a sequence of edge flips. The answer is negative in general with some ...
    • IconWitness bar visibility  [Presentation]

      Cortés Parejo, María del Carmen; Hurtado Díaz, Ferran; Márquez Pérez, Alberto; Valenzuela Muñoz, Jesús (2013)
      Bar visibility graphs were introduced in the seventies as a model for some VLSI layout problems. They have been also studied since then by the graph drawing community, and recently several generalizations and restricted ...