We are given a set of $n$ point sites in the plane and $k\leq n$ colors, each site is associated one color. A region of the plane is called color-spanning if it contains at least one point of each color. We wish to compute the two parallel lines in the plane that contain all colors in between them such that their distance is minimized.