  Let P be a set of n points and each of the points is colored with one of the
k possible colors. We present efficient algorithms to pre-process P such that
for a given query point q, we can quickly identify the smallest color spanning
object of the desired type containing q. In this paper, we focus on (i)
intervals, (ii) axis-parallel square, (iii) axis-parallel rectangle, (iv)
equilateral triangle of fixed orientation and (v) circle, as our desired type
of objects.
