20 citations · 21 across the 6 of their papers we have counts for
7 papers · 1 filter
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…
Separating bichromatic point sets in the plane by restricted orientation convex hulls
Carlos Alegría, David Orden, Carlos Seara +1
We explore the separability of point sets in the plane by a restricted-orientation convex hull, which is an orientation-dependent, possibly disconnected, and non-convex enclosing s…
On Maximum-Sum Matchings of Points
Sergey Bereg, Oscar Chacón-Rivera, David Flores-Peñaloza +3
Huemer et al. (Discrete Mathematics, 2019) proved that for any two point sets and with , the perfect matching that matches points of with points of , and ma…
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…
Capturing points with a rotating polygon (and a 3D extension)
Carlos Alegría-Galicia, David Orden, Leonidas Palios +2
We study the problem of rotating a simple polygon to contain the maximum number of elements from a given point set in the plane. We consider variations of this problem where the ro…
Balanced partitions of 3-colored geometric sets in the plane
Sergey Bereg, Matias Korman, Rodrigo I. Silveira +6
Let be a finite set of geometric objects partitioned into classes or \emph{colors}. A subset is said to be \emph{balanced} if contains the same amount of e…