  We consider the problem of finding a large color space that can be generated
by all units in multi-projector tiled display systems. Viewing the problem
geometrically as one of finding a large parallelepiped within the intersection
of multiple parallelepipeds, and using colorimetric principles to define a
volume-based objective function for comparing feasible solutions, we develop an
algorithm for finding the optimal gamut in time O(n^3), where n denotes the
number of projectors in the system. We also discuss more efficient quasiconvex
programming algorithms for alternative objective functions based on maximizing
the quality of the color space extrema.
