一种基于障碍距离的兴趣管理方法

AN INTEREST MANAGEMENT SCHEME BASED ON OBSTACLE DISTANCE

兴趣管理是提高协同虚拟环境扩展性的一种常用技术。现有的兴趣管理方法大多采用理想欧式距离进行兴趣匹配,没有考虑虚拟空间中存在障碍物的情况。针对现有方法的不足提出一种基于障碍距离的兴趣管理方法。该方法在混合法的基础上,对虚拟环境中的障碍物进行多边形建模。首先采用网格划分虚拟空间,缩小实体的兴趣匹配范围,然后使用障碍距离进行兴趣匹配。实验结果表明,该方法可以进一步减少系统中不必要的网络开销,提高协同虚拟环境的扩展性。

Interest management is a common technology to improve the scalability of collaborative virtual environments. Existing methods mostly use ideal Euclidean distance for interest matching without considering the presence of obstacles in virtual space. Aiming at the shortcomings of existing methods,we propose an obstacle distance-based interest management scheme. On the basis of the hybrid method,this scheme models the obstacles in virtual environment by polygons. First it divides the virtual space by grids to lessen the interest matching area of entities. Then it adopts obstacle distance to match interests. Experimental results show that this scheme can further reduce unnecessary network overhead in the system and improve the scalability of the collaborative virtual environment.