Recognition of Minimum Width Color-Spanning Corridor and Minimum Area Color-Spanning Rectangle.

Given a set of n colored points with a total of m (≥ 3) colors in 2D, the problem of identifying the smallest color-spanning object is studied. We have considered two different shapes: (i) corridor, and (ii) rectangle of arbitrary orientation. Our proposed algorithms for the problems (i) and (ii) run in time O(n2logn) and O(n3logm) respectively. [ABSTRACT FROM AUTHOR]