  In online unit clustering a set of n points of a metric space that arrive one
by one, partition the points into clusters of diameter at most one, so that
number of clusters is minimized. This paper gives linear upper and lower bounds
for the advice complexity of 1-competitive online unit clustering algorithms in
terms of number of points in $\mathbb{R}^d$ and $\mathbb{Z}^d$.
