Abstract

In this thesis, we study the chromatic k-nearest neighbors problem in one and two dimension(s), under the L_1, L_2 and L_∞ metrics. In this problem, we wish to preprocess a set of n colored points, such that given a query point q and integer k, the most frequently occurring color
... read more