Birn, M. and Holtgrewe, M. and Sanders, P. and Singler, J. (2010) Simple and Fast Nearest Neighbor Search. 2010 Proceedings of the Twelfth Workshop on Algorithm Engineering and Experiments (ALENEX) . pp. 43-54.
Full text not available from this repository.
Official URL: http://www.siam.org/proceedings/alenex/2010/alenex...
Abstract
We present a simple randomized data structure for two-dimensional point sets that allows fast nearest neighbor queries in many cases. An implementation outperforms several previous implementations for commonly used benchmarks.
| Item Type: | Article |
|---|---|
| Subjects: | Mathematical and Computer Sciences > Computer Science |
| Divisions: | Department of Mathematics and Computer Science > Institute of Computer Science > Algorithmic Bioinformatics Group |
| ID Code: | 926 |
| Deposited By: | Dipl. Inform. Manuel Holtgrewe |
| Deposited On: | 23 Aug 2010 12:48 |
| Last Modified: | 01 Sep 2010 13:33 |
Repository Staff Only: item control page
