J Appl Crystallogr. 2016 Apr 12;49:756-761. doi: 10.1107/S1600576716004039. eCollection 2016 Jun 01.
Journal of applied crystallography
Lawrence C Andrews, Herbert J Bernstein
PMID: 27275134 PMCID: PMC4886977 DOI: 10.1107/S1600576716004039
Many problems in crystallography and other fields can be treated as nearest-neighbor problems. The neartree data structure provides a flexible way to organize and retrieve metric data. In some cases, it can provide near-optimal performance.
Keywords: nearest-neighbor search; neartree data structure; post office problem