In order to solve the problem of CRNN (continuous reverse nearest neighbor) query in an obstacle environment, the visibility was added to the CRNN query by taking obstacles into consideration, and a novel variant of CRNN queries, namely continuous visible reverse nearest neighbor (CVRNN) search, was introduced. The segment visibility judgment method and the corresponding pruning strategy were given. A CVRNN query processing algorithm was proposed. With this algorithm, a candidate set is gotten through a filter step, the wrong candidates were removed by a refinement step, and query results are founded through a splitting step. Experimental results show that the algorithm execution time increases linearly with the length of query line segment, and the proposed algorithm has a high query efficiency.%为了解决障碍物环境中连续反向最近邻的查询问题,考虑到障碍物的存在,将可视性加到连续反向最近邻查询中,提出了一种新的连续反向最近邻查询的变体——连续可视反向最近邻查询.给出了线段可视性判断方法和相应的剪枝策略,提出了连续可视反向最近邻查询算法.该算法通过过滤步骤得到一个候选集,通过精炼步骤去掉错误的候选,通过分裂步骤找到查询结果.实验结果表明,该算法的执行时间与查询线段的长度呈线性关系增长,查询效率较高.
展开▼
