All Near Neighbor GraphWithout Searching
Edgar Chávez, Verónica Ludueña, Nora Reyes, Fernando Kasián • Journal of Computer Science and Technology
(2018)
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. Usin...
DOAJ
Open Access (DOAJ)
DOI:
10.24215/16666038.18.e07