Browsing by Author "Pérez Lantero, Pablo"
Now showing items 1-20 of 22
-
Center of maximum-sum matchings of bichromatic points
(Elsevier, 2024-03-01)
Article
Restricted access - publisher's policyLet R and B be two point sets in the plane with . Let be a perfect matching that matches points of R with points of B and maximizes , the total Euclidean distance of the matched pairs. In this paper, we prove that there ... -
Colored Ray configurations
(2014)
Conference report
Open AccessWe 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
(2018-05)
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 ... -
Computing the coarseness measure of a bicolored point set over guillotine partitions
(Elsevier, 2024-11)
Article
Open AccessThe coarseness of a set of points in the plane colored red and blue is a measure of how well the points are mixed together. It has appealing theoretical properties, including a connection to the set of points tendency to ... -
K-1,K-3-covering red and blue points in the plane
(Chapman & Hall/CRC, 2019-01-31)
Article
Open AccessWe 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
(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
(2019-07-01)
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
(Springer, 2023-03-14)
Article
Open AccessGiven n > 0, let S ¿ [0,1]2 be a set of n points, chosen uniformly at random. 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 ... -
Matching random colored points with rectangles
(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 ... -
Matching random colored points with rectangles
(Springer, 2020)
Conference report
Open AccessLet S[0,1]2 be a set of n points, randomly and uniformly selected. Let RB 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 random ... -
Maximum box problem on stochastic points
(Springer Nature, 2021-10-28)
Article
Open AccessGiven a finite set of weighted points in Rd (where there can be negative weights), the maximum box problem asks for an axis-aligned rectangle (i.e., box) such that the sum of the weights of the points that it contains is ... -
New results on stabbing segments with a polygon
(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
(2015-01-01)
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 ... -
On (a, k)-sets and (a, k)-hulls in the plane
(2021)
Conference report
Open AccessThis abstract reports first the study of upper and lower bounds for the maximum number of all the combinatorially different (a, k)-sets of an n-point set P in the plane, 0 < a = p and 0 < 2k < n, depending on the ... -
On maximum-sum matchings of points
(Springer Nature, 2022-06-21)
Article
Open AccessHuemer et al. (Discrete Mathematics, 2019) proved that for any two point sets R and B with |R|=|B| , the perfect matching that matches points of R with points of B, and maximizes the total squared Euclidean distance of the ... -
On maximum-sum matchings of points
(2021)
Conference report
Restricted access - publisher's policyHuemer et al. (Discrete Math., 2019) proved that for any two point sets R and B with |R| = |B|, the perfect matching that matches points of R with points of B, and maximizes the total squared Euclidean distance of the ... -
On weighted sums of numbers of convex polygons in point sets
(2022-06-07)
Article
Open AccessLet S be a set of n points in general position in the plane, and let Xk,(S) be the number of convex k-gons with vertices in S that have exactly points of S in their interior. We prove several equalities for the numbers ... -
Order types and cross-sections of line arrangements in R^3
(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 ... -
Rectilinear convex hull of points in 3D and applications
(Springer, 2024-05-04)
Article
Open AccessLet P be a set of n points in R3 in general position, and let RCH(P) be the rectilinear convex hull of P. In this paper we obtain an optimal O(n log n) time and O(n) space algorithm to compute RCH(P). We also obtain an ... -
The 1-Center and 1-Highway Problem
(Springer, 2011)
Conference report
Restricted access - publisher's policyIn 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 ...
