For a given set of n colored points with k colors in the plane, we study the problem of
computing the smallest color-spanning axis-parallel square. First, for a dynamic set of …

In this paper we study several geometric problems of color-spanning sets: given n points
with m colors in the plane, selecting m points with m distinct colors such that some geometric …

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 …

In this article, we study a wide range of variants for computing the (discrete and continuous)
Fréchet distance between uncertain curves. An uncertain curve is a sequence of uncertainty …

Let R be a set of n colored imprecise points, where each point is colored by one of k colors.
Each imprecise point is specified by a unit disk in which the point lies. We study the problem …

Given a set P={p 1, p 2,…, pn} of n points in Image 1 and each assigned with one of the
given k distinct colors, we study the problem of finding the minimum width color spanning …

There are n points in the plane and each point is painted by one of m colors where m≤ n.
We want to select m different color points such that (1) the total edge length of resulting …

We introduce the exact coloured k-enclosing object problem: given a set P of n points in R 2,
each of which has an associated colour in f 1;:::; tg, and a vec-tor c=(c 1;:::; ct), where ci 2 Z+ …

Given a set of n points on a line, where each point has one of k colors, and given an integer
si≥ 1 for each color i, 1≤ i≤ k, the problem Shortest Color-Spanning t Intervals (SCSI-t) …

Inspired by the applications in on-demand manufacturing, we introduce the online k-color
spanning disk problem, the first online model for color spanning problems to the best of our …