邻近搜索

用线性四叉树成熟的Morton编码作为关键字来标识菱形块，发展了具有固定方向（fixedorientation）的块层次编码技术及邻近搜索算法。

The quadtree Morton code is used as the index for addressing the Diamonds and a hierarchical coding scheme of Diamonds is developed based on its fixed orientation .

结果表明，分解算法的平均时间耗时量约是Bartholdi邻近搜索算法的23.66%。

The result is that average consumed time of this decomposing algorithm is about 23.66 % of Bartholdi 's.

分析了球面Quaternary编码的特点，给出了三角格网方向判断的规则，并对该算法与Bartholdi邻近搜索算法的时间复杂度进行了对比。

The rule of distinguishing triangle direction is given out . The algorithm of neighbor finding from back to front with decomposing Quaternary code is presented . The analysis of time complexity between this decomposing algorithm and bartholdi 's algorithm is approached .

基于简单最邻近搜索算法的高维特征索引

The Indexing of High-Dimensional Features Using Simple Nearest Neighbor Search Algorithm

球面退化四叉树格网单元的邻近搜索算法

An Adjacent Searching Algorithm of Degenerate Quadtree Grid on Spherical Facet

无结构码的快速最邻近模式搜索

Fast Nearest Neighbor Pattern Search for Nonstructured Codes