1) dual way nearest neighbor
双向最近邻
2) bichromatic reverse nearest neighbor query
双色反向最近邻查询
1.
In view of this situation,this paper proposed a bichromatic reverse nearest neighbor query algorithm using half-space trimming strategy.
反向最近邻又分为双色反向最近邻查询和单色反向最近邻查询。
3) reverse nearest neighbor
反向最近邻
1.
To effectively solve reverse nearest neighbor queries in a dataset,the properties of the Voronoi diagram and space-dividing regions were used to evaluate the reverse nearest neighbors of the given query points.
为了解决数据集中数据点的反向最近邻问题,利用Voronoi图及空间分割区域的性质计算查询点的反向最近邻,通过Voronoi图的特性可免去每次都计算数据集中给定查询点的最近邻的步骤,每次查询可过滤出少数的几个数据点并对其进行反向最近邻的判断。
2.
With the rapid development of wireless communications,the applications of reverse nearest neighbor for moving objects are more wide.
针对现有的算法,很多观点都是基于静态对象的,提出以TPR-tree为索引结构,用现有的半平面修剪策略进行改进的,利用剩余MBR的对角线判断是否保留MBR的方法,使原修剪策略性能优化,并采用过滤提纯的方法来获取移动查询点的反向最近邻,实现了移动对象的动态反向最近邻查询。
3.
Nowadays,many reverse nearest neighbor search methods are based on static objects.
针对现有反向最近邻算法很多都是基于静态对象的情况,提出了一种新的基于移动对象的反向最近邻的算法——以TPR-tree为索引结构,对原有的半平面修剪策略进行了改进,使其性能优化,并采用过滤验证这两个处理步骤来获取移动查询点的反向最近邻,实现了移动对象的动态反向最近邻的查询。
4) reverse nearest neighbor queries
反向最近邻查询
1.
The algorithm efficiently solves reverse nearest neighbor queries for continuously moving points in the plane.
为研究动态环境下解决反向最近邻查询的算法,采用TPR-树索引结构给出了解决动态环境下的最近邻查询算法,并提出反向最近邻查询算法。
5) dynamic reverse nearest neighbors
动态反向最近邻
1.
To solve the dynamic reverse nearest neighbor queries for the moving objects,the definition and the primary properties of the reverse nearest neighbors are proposed and the theorems and arithmetics for computing the dynamic reverse nearest neighbors using the conceptions of the distance-function and delimitation-regions are developed.
为了处理移动对象的动态反向最近邻,对时空动态反向最近邻查询问题进行形式化的定义,利用时空距离函数及限界区域等概念给出计算移动对象的动态反向最近邻的定理与算法,提出移动查询点的动态最近邻的全域查询及局域查询的方法,利用动态检测圆及时
6) reverse nearest neighbor query
反向最近邻查询
1.
The reverse nearest neighbor query of the moving points
移动点的反向最近邻查询
2.
One of the most important algorithms in spatial database is reverse nearest neighbor query.
反向最近邻查询是空间数据库中最重要的算法之一。
补充资料：Nearestneighbor(近邻取样)
nearest neighbor (近邻取样)
又被称为point sampling(点取样)，是一种较简单材质影像插补的处理方式。会使用包含像素最多部分的图素来贴图。换句话说就是哪一个图素占到最多的像素，就用那个图素来贴图。这种处理方式因为速度比较快，常被用于早期3d游戏开发，不过材质的品质较差。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条