Ecient Algorithms for Variance-based K-clustering


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 bu er display, and that of compressing two-dimensional image data. Using the technique of computational geometry, this clustering problem is investigated in a uni ed manner.

Cite this paper

@inproceedings{Hasegawa1993EcientAF, title={Ecient Algorithms for Variance-based K-clustering}, author={Susumu Hasegawa and Hiroshi Imai and Mary Inaba and Naoki Katoh and Jun Nakano}, year={1993} }