Now showing items 1-11 of 11

    • A faster algorithm to compute the visibility map of a 1.5D terrain 

      Löffler, Maarten; Saumell, Maria; Silveira, Rodrigo Ignacio (2014)
      Conference report
      Open Access
      Given a 1.5D terrain, i.e., an x -monotone polygonal line in R 2 with n vertices, and 1 m n viewpoints placed on some of the terrain vertices, we study the problem of computing the parts of the terrain that are visible ...
    • Colored Ray configurations 

      Fabila Monroy, Ruy; Garcia Olaverri, Alfredo Martin; Hurtado Díaz, Fernando Alfredo; Jaume, Rafel; Pérez Lantero, Pablo; Saumell, Maria; Silveira, Rodrigo Ignacio; Tejel Altarriba, Francisco Javier; Urrutia Galicia, Jorge (2014)
      Conference report
      Open Access
      We study the cyclic sequences induced at in nity by pairwise-disjoint colored rays with apices on a given bal- anced bichromatic point set, where the color of a ray is inherited from the color of its apex. We derive a lower ...
    • Colored ray configurations 

      Fabila Monroy, Ruy; Garcia Olaverri, Alfredo Martin; Hurtado Díaz, Fernando Alfredo; Jaume, Rafel; Pérez Lantero, Pablo; Saumell, Maria; Silveira, Rodrigo Ignacio; Tejel Altarriba, Francisco Javier; Urrutia Galicia, Jorge (2018-05)
      Article
      Open Access
      We study the cyclic color sequences induced at infinity by colored rays with apices being a given balanced finite bichromatic point set. We first study the case in which the rays are required to be pairwise disjoint. We ...
    • Geometric biplane graphs I: maximal graphs 

      Hurtado Díaz, Fernando Alfredo; Garcia Olaverri, Alfredo Martin; Korman Cozzetti, Matías; Matos, Inés P.; Saumell, Maria; Silveira, Rodrigo Ignacio; Tejel Altarriba, Francisco Javier; Tóth, Csaba D. (2013)
      Conference report
      Open Access
    • Geometric biplane graphs I: maximal graphs 

      Garcia Olaverri, Alfredo Martin; Hurtado Díaz, Fernando Alfredo; Korman Cozzetti, Matías; Matos, Inés P.; Saumell, Maria; Silveira, Rodrigo Ignacio; Tejel Altarriba, Francisco Javier; Tóth, Csaba D. (2015-03-01)
      Article
      Open Access
      We study biplane graphs drawn on a finite planar point set in general position. This is the family of geometric graphs whose vertex set is and can be decomposed into two plane graphs. We show that two maximal biplane ...
    • Geometric biplane graphs II: graph augmentation 

      Garcia Olaverri, Alfredo Martin; Hurtado Díaz, Fernando Alfredo; Korman Cozzetti, Matías; Matos, Inés P.; Saumell, Maria; Silveira, Rodrigo Ignacio; Tejel Altarriba, Francisco Javier; Tóth, Csaba D. (2015-03-01)
      Article
      Open Access
      We study biplane graphs drawn on a finite point set in the plane in general position. This is the family of geometric graphs whose vertex set is and which can be decomposed into two plane graphs. We show that every ...
    • Geometric Biplane Graphs II: Graph Augmentation 

      Hurtado Díaz, Fernando Alfredo; Garcia Olaverri, Alfredo Martin; Korman Cozzetti, Matías; Matos, Inés P.; Saumell, Maria; Silveira, Rodrigo Ignacio; Tejel Altarriba, Francisco Javier; Tóth, Csaba D. (2013)
      Conference report
      Open Access
      We study biplane graphs drawn on a nite point set S in the plane in general position. This is the family of geometric graphs whose vertex set is S and which can be decomposed into two plane graphs. We show that every ...
    • Stabbing circles for sets of segments in the plane 

      Claverol Aguas, Mercè; Khramtcova, Elena; Papadopoulou, Evanthia; Saumell, Maria; Seara Ojea, Carlos (2016)
      Conference report
      Restricted access - publisher's policy
      Stabbing a set S of n segments in the plane by a line is a well-known problem. In this paper we consider the variation where the stabbing object is a circle instead of a line. We show that the problem is tightly connected ...
    • Stabbing circles for sets of segments in the plane 

      Claverol Aguas, Mercè; Khramtcova, Elena; Papadopoulou, Evanthia; Saumell, Maria; Seara Ojea, Carlos (2017-03-13)
      Article
      Open Access
      Stabbing a set S of n segments in the plane by a line is a well-known problem. In this paper we consider the variation where the stabbing object is a circle instead of a line. We show that the problem is tightly connected ...
    • Stabbing circles for some sets of Delaunay segments 

      Claverol Aguas, Mercè; Khramtcova, Elena; Papadopoulou, Evanthia; Saumell, Maria; Seara Ojea, Carlos (2016)
      Conference report
      Open Access
      Let S be a set of n segments in the plane such that, for every segment, its two endpoints are adjacent in the Delaunay triangulation of the set of endpoints of all segments in S. Our goal is to compute all the combinatorially ...
    • Terrain visibility with multiple viewpoints 

      Hurtado Díaz, Fernando Alfredo; Löffler, Maarten; Matos, Inés P.; Sacristán Adinolfi, Vera; Saumell, Maria; Silveira, Rodrigo Ignacio; Staals, Frank (Springer, 2013)
      Conference report
      Open Access
      We study the problem of visibility in polyhedral terrains in the presence of multiple viewpoints. We consider three fundamental visibility structures: the visibility map, the colored visibility map, and the Voronoi visibility ...