Now showing items 1-12 of 12

  • 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 ...
  • K-1,K-3-covering red and blue points in the plane 

    Ábrego, Bernardo M.; Fernández Merchant, Silvia; Kano, Mikio; Orden, David; Pérez Lantero, Pablo; Seara Ojea, Carlos; Tejel Altarriba, Francisco Javier (Chapman & Hall/CRC, 2019-01-31)
    Article
    Open Access
    We say that a finite set of red and blue points in the plane in general position can be K1,3-covered if the set can be partitioned into subsets of size 4, with 3 points of one color and 1 point of the other color, in such ...
  • Locating a service facility and a rapid transit line 

    Díaz Bañez, José Miguel; Korman Cozzetti, Matías; Pérez Lantero, Pablo; Ventura, Immaculada (Springer, 2011)
    Conference report
    Restricted access - publisher's policy
    In this paper we study a facility location problem in the plane in which a single point (facility) and a rapid transit line (highway) are simultaneously located in order to minimize the total travel time of the clients to ...
  • Matching points with disks with a common intersection 

    Huemer, Clemens; Pérez Lantero, Pablo; Seara Ojea, Carlos; Silveira, Rodrigo Ignacio (2019-07-01)
    Article
    Restricted access - publisher's policy
    We consider matchings with diametral disks between two sets of points R and B. More precisely, for each pair of matched points p ¿ R and q ¿ B, we consider the disk through p and q with the smallest diameter. We prove that ...
  • Matching random colored points with rectangles 

    Corujo, Josué; Flores Peñazola, David; Huemer, Clemens; Pérez Lantero, Pablo; Seara Ojea, Carlos (Universitat de Girona, 2019)
    Conference lecture
    Open Access
    Let S ¿ [0, 1]2 be a set of n points, randomly and uniformly selected. Let R ¿ B be a random partition, or coloring, of S in which each point of S is included in R uniformly at random with probability 1/2. We study the ...
  • New results on stabbing segments with a polygon 

    Díaz Bañez, José Miguel; Korman Cozzetti, Matías; Pérez Lantero, Pablo; Pilz, Alexander; Seara Ojea, Carlos; Silveira, Rodrigo Ignacio (2015-01-01)
    Article
    Open Access
    We consider a natural variation of the concept of stabbing a set of segments with a simple polygon: a segment s is stabbed by a simple polygon P if at least one endpoint of s is contained in P, and a segment set S is stabbed ...
  • New results on stabbing segments with a polygon 

    Díaz Bañez, José Miguel; Korman Cozzetti, Matías; Pérez Lantero, Pablo; Pilz, Alexander; Seara Ojea, Carlos; Silveira, Rodrigo Ignacio (Springer, 2013)
    Conference report
    Restricted access - publisher's policy
    We consider a natural variation of the concept of stabbing a segment by a simple polygon: a segment is stabbed by a simple polygon P if at least one of its two endpoints is contained in P. A segment set S is stabbed by P ...
  • Order types and cross-sections of line arrangements in R^3 

    Aichholzer, Oswin; Fabila-Monroy, Ruy; Hurtado Díaz, Fernando Alfredo; Pérez Lantero, Pablo; Ruiz Vargas, Andrés; Urrutia Galicia, Jorge; Vogtenhuber, Birgit (2014)
    Conference report
    Restricted access - publisher's policy
    We consider sets L = {l1,...., ln} of n labeled lines in general position in R3, and study the order types of point sets fp1; : : : ; png that stem from the intersections of the lines in L with (directed) planes II, not ...
  • The 1-Center and 1-Highway Problem 

    Díaz Bañez, José Miguel; Korman Cozzetti, Matías; Pérez Lantero, Pablo; Ventura, Immaculada (Springer, 2011)
    Conference report
    Restricted access - publisher's policy
    In this paper we extend the Rectilinear 1-center as follows: Given a set S of n points in the plane, we are interested in locating a facility point f and a rapid transit line (highway) H that together minimize the expression ...
  • The 1-median and 1-highway problem 

    Díaz Bañez, José Miguel; Korman Cozzetti, Matías; Pérez Lantero, Pablo; Ventura, Inmaculada (Elsevier, 2013-03-16)
    Article
    Restricted access - publisher's policy
    In this paper we study a facility location problem in the plane in which a single point (median) and a rapid transit line (highway) are simultaneously located in order to minimize the total travel time of the clients to ...
  • The intersection graph of the disks with diameters the sides of a convex n-gon 

    Huemer, Clemens; Pérez Lantero, Pablo (2019-09-26)
    Article
    Restricted access - publisher's policy
    Given a convex polygon of sides, one can draw disks (called side disks) where each disk has a different side of the polygon as diameter and the midpoint of the side as its center. The intersection graph of such disks is ...