NearTree, a data structure and a software toolkit for the nearest-neighbor problem

被引：6
作者：
Andrews, Lawrence C. [1 ]
Bernstein, Herbert J. [2 ]
机构：
[1] 9515 NE 137th St, Kirkland, WA 98034 USA
[2] Rochester Inst Technol, Sch Chem & Mat Sci, Rochester, NY 14623 USA
来源：
JOURNAL OF APPLIED CRYSTALLOGRAPHY | 2016年 / 49卷
关键词：
nearest-neighbor search; neartree data structure; post office problem; NIGGLI REDUCTION; GEOMETRY; SEARCH;
D O I：
10.1107/S1600576716004039
中图分类号：
O6 [化学];
学科分类号：
0703 ;
摘要：
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. NearTree is a software tool that constructs neartrees and provides a number of different query tools.
引用
收藏
页码：756 / 761
页数：6
相关论文
共 25 条
  • [1] Andrews L., 2001, C/C++ Users Journal, V19, P40
  • [2] Andrews L. C., 1984, COMMUNICATION
  • [3] The geometry of Niggli reduction: BGAOL - embedding Niggli reduction and analysis of boundaries
    Andrews, Lawrence C.
    Bernstein, Herbert J.
    [J]. JOURNAL OF APPLIED CRYSTALLOGRAPHY, 2014, 47 : 346 - 359
  • [4] [Anonymous], 2006, P IEEE C COMPUTER VI, DOI DOI 10.1109/CVPR.2006.301
  • [5] [Anonymous], 1961, Adaptive Control Processes: a Guided Tour, DOI DOI 10.1515/9781400874668
  • [6] [Anonymous], 2009, P 26 ANN INT C MACH, DOI DOI 10.1145/1553374.1553494
  • [7] BALLARD DH, 1976, IEEE T COMPUT, V25, P503, DOI 10.1109/TC.1976.1674638
  • [8] Bayer R., 2002, Organization and maintenance of large ordered indexes
  • [9] MULTIDIMENSIONAL BINARY SEARCH TREES USED FOR ASSOCIATIVE SEARCHING
    BENTLEY, JL
    [J]. COMMUNICATIONS OF THE ACM, 1975, 18 (09) : 509 - 517
  • [10] Bernstein H. J., 2016, J APPL CRYST UNPUB, V49
123