Figure 1From: ADaM: augmenting existing approximate fast matching algorithms with efficient and exact range queriesRange search in a 2-D euclidean space. A and B represent queries with radius r. I and O represent subspaces that roughly separate half the points based on their distance to the pivot point, p.Back to article page