Algorithms Insertion: choose subtree with least radius enlargement Splitting: metric to minimize   Sum of radii   Maximum radius Splitting: choosing routing objects   Old routing object and farthest   Sampling   Random Splitting: distributing objects   To nearest routing object   Routing object grabs nearest neighbors Deletion: mark as deleted