Browsing by Author "Pérez Lantero, Pablo"
Now showing items 112 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 AccessWe study the cyclic sequences induced at in nity by pairwisedisjoint 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 (201805)
Article
Open AccessWe 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 ... 
K1,K3covering 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, 20190131)
Article
Open AccessWe say that a finite set of red and blue points in the plane in general position can be K1,3covered 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 policyIn 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 (20190701)
Article
Open AccessWe 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 AccessLet 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 (Springer, 2013)
Conference report
Restricted access  publisher's policyWe 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 ... 
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 (20150101)
Article
Open AccessWe 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 ... 
Order types and crosssections of line arrangements in R^3
Aichholzer, Oswin; FabilaMonroy, 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 policyWe 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 1Center and 1Highway 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 policyIn this paper we extend the Rectilinear 1center 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 1median and 1highway problem
Díaz Bañez, José Miguel; Korman Cozzetti, Matías; Pérez Lantero, Pablo; Ventura, Inmaculada (Elsevier, 20130316)
Article
Restricted access  publisher's policyIn 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 ngon
Huemer, Clemens; Pérez Lantero, Pablo (20190926)
Article
Open AccessGiven 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 ...