In this paper we consider the k-clustering problem for n points in the d-dimensional
space, motivated from the problem of computing a color lookup table for frame buffer
display, and that of compressing two-dimensional image data. Using the technique of
computational geometry, this clustering problem is investigated in