Motivated by problems from geometry, we prove optimal bounds on the chromatic number of a generalization of the Cartesian product of graphs.