All Near Neighbor GraphWithout Searching
Given a collection of n objects equipped with a distance function d(·, ·), the Nearest Neighbor Graph (NNG) consists in finding the nearest neighbor of each object in the collection.Without an index the total cost of NNG is quadratic.Using Audio Accessory an index the cost would be sub-quadratic if the search for individual items is sublinear.Unf