Given a set S of n points in the Euclidean plane, the two-center problem is to find two
congruent disks of smallest radius whose union covers all points of S. Previously, Eppstein …

Abstract Let P={C_1, C_2, ..., C_n\} be a set of color classes, where each color class C_i
consists of a pair of objects. We focus on two problems in which the objects are points on the …

In the context of computational supervised learning, the primary objective is the classification
of data. Especially, the goal is to provide the system with “training” data and design a …

Stabbing a set S of n segments in the plane by a line is a well-known problem. In this paper
we consider the variation where the stabbing object is a circle instead of a line. We show …

We study a fundamental problem in computational geometry, the planar twocenter problem.
In this problem, the input is a set 𝑆 of 𝑛 points in the plane and the goal is to find two …

Abstract Let P={C1, C2,..., Cn} be a set of color classes, where each color class Ci consists
of a set of points. In this paper, we address a family of covering problems, in which one is …

Let U be a set of colored objects, where the color of an object is an integer between 1 and n.
Let P={C 1,…, C n} be the partition of U into color classes, ie, the set C i consists of all …

The farthest-color Voronoi diagram (FCVD) is a farthest-site Voronoi structure defined on a
family PP of m point-clusters in the plane, where the total number of points is n. The FCVD …

The input for the Geometric Coverage problem consists of a pair\varSigma=(P, R) Σ=(P, R),
where P is a set of points in R^ d R d and RR is a set of subsets of P defined by the …

In this paper, we propose to study a new geometric optimization problem called" geometric
prototype" in Euclidean space. Given a set of patterns, where each pattern is represented by …