activity
20112022
most citedOn balanced 4-holes in bichromatic point sets

9 citations · 22 across the 20 of their papers we have counts for

collaborators
Showing cs.CGShow all

18 papers · 1 filter

cs.CG2022★ 1 cited

Rectilinear Convex Hull of Points in 3D

Pablo Pérez-Lantero, Carlos Seara, Jorge Urrutia

Let be a set of points in in general position, and let be the rectilinear convex hull of . In this paper we obtain an optimal -time a…

cs.CG2019★ 2 cited

Maximum rectilinear convex subsets

Hernán González-Aguilar, David Orden, Pablo Pérez-Lantero +4

Let be a set of points in the plane. We consider a variation of the classical Erdős-Szekeres problem, presenting efficient algorithms with running time and $O(n^2)…

cs.CG2019

Matching points with disks with a common intersection

Clemens Huemer, Pablo Pérez-Lantero, Carlos Seara +1

We consider matchings with diametral disks between two sets of points R and B. More precisely, for each pair of matched points p in R and q in B, we consider the disk through p and…

cs.CG2018

Computing Coverage Kernels Under Restricted Settings

Jérémy Barbay, Pablo Pérez-Lantero, Javiel Rojas-Ledesma

We consider the Minimum Coverage Kernel problem: given a set of -dimensional boxes, find a subset of of minimum size covering the same region as . This problem is $\m…

cs.CG2018

Colored ray configurations

Ruy Fabila-Monroy, Alfredo García, Ferran Hurtado +6

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 a…

cs.CG2017★ 9 cited

On balanced 4-holes in bichromatic point sets

S. Bereg, J. M. Díaz-Báñez, R. Fabila-Monroy +5

Let be a point set in the plane in general position such that each of its elements is colored either red or blue, where and denote the points colored red and th…

cs.CG2017

Depth Distribution in High Dimensions

Jérémy Barbay, Pablo Pérez-Lantero, Javiel Rojas-Ledesma

Motivated by the analysis of range queries in databases, we introduce the computation of the Depth Distribution of a set of axis aligned boxes, whose computation gene…

cs.CG2016

Drawing the Almost Convex Set in an Integer Grid of Minimum Size

Frank Duque, Ruy Fabila-Monroy, Carlos Hidalgo-Toscano +1

In 2001, Károlyi, Pach and Tóth introduced a family of point sets to solve an Erdős-Szekeres type problem; which have been used to solve several other Edős-Szekeres type problems.…

cs.CG2015

Balanced Islands in Two Colored Point Sets in the Plane

Oswin Aichholzer, Nieves Atienza, Ruy Fabila-Monroy +5

Let be a set of points in general position in the plane, of which are red and of which are blue. In this paper we prove that there exist: for every $α\in \left [ 0,…

cs.CG2014

Area and Perimeter of the Convex Hull of Stochastic Points

Pablo Pérez-Lantero

Given a set of points in the plane, we study the computation of the probability distribution function of both the area and perimeter of the convex hull of a random subset $…

cs.CG2013

Independent and Hitting Sets of Rectangles Intersecting a Diagonal Line : Algorithms and Complexity

José R. Correa, Laurent Feuilloley, Pablo Pérez-Lantero +1

Finding a maximum independent set (MIS) of a given fam- ily of axis-parallel rectangles is a basic problem in computational geom- etry and combinatorics. This problem has attracted…

cs.CG2013★ 2 cited

Matching colored points with rectangles

L. E. Caraballo, C. Ochoa, P. Pérez-Lantero +1

Let be a point set in the plane such that each of its elements is colored either red or blue. A matching of with rectangles is any set of pairwise-disjoint axis-aligned rec…

cs.CG2013★ 2 cited

Drawing the double circle on a grid of minimum size

Sergey Bereg, Ruy Fabila-Monroy, David Flores-Peñaloza +2

In 1926, Jarník introduced the problem of drawing a convex -gon with vertices having integer coordinates. He constructed such a drawing in the grid for so…

cs.CG2012

The 1-Center and 1-Highway problem

José Miguel Díaz-Báñez, Matias Korman, Pablo Pérez-Lantero +1

We study a variation of the 1-center problem in which, in addition to a single supply facility, we are allowed to locate a highway. This highway increases the transportation speed…

cs.CG2012

Locating a single facility and a high-speed line

José Miguel Díaz-Báñez, Matias Korman, Pablo Pérez-Lantero +1

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 minimiz…

cs.CG2012★ 1 cited

Adaptive Techniques to find Optimal Planar Boxes

J. Barbay, G. Navarro, P. Pérez-Lantero

Given a set of planar points, two axes and a real-valued score function on subsets of , the Optimal Planar Box problem consists in finding a box (i.e. axis-aligned…

cs.CG2012★ 1 cited

On the number of radial orderings of planar point sets

José M. Díaz-Bañez, Ruy Fabila-Monroy, Pablo Pérez-Lantero

Given a set of points in the plane, a \emph{radial ordering} of with respect to a point (not in ) is a clockwise circular ordering of the elements in by angl…

cs.CG2011

Locating a service facility and a rapid transit line

J. M. Díaz-Bañez, M. Korman, P. Pérez-Lantero +1

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 minimiz…