In real-time update algorithm of nearest neighbor query of moving objects, safe area is always an irregular convex polygon which is difficult to solve. To address the problem, this paper designs safe area as a circular area, proposes a real-time update algorithm for nearest neighbor query of moving object, and takes it run on Nearest Neighbor Management System(NNMS) which works on fixed base station and Client Management System(ClientMS) which works on moving object. Experimental results show that the algorithm reduces storage costs of the system and improves data processing performance of the system.%在移动对象最近邻查询实时更新算法中,安全区一般是难以求解的不规则凸多边形.针对该问题,将安全区设计为圆形,在此基础上提出一种效率更高的移动对象最近邻查询更新算法.将算法分别运行于基站上的最近邻管理系统和移动对象上的Client管理系统,实验结果表明,该算法可以降低系统的存储代价,提高其数据处理性能.
展开▼
