新虚拟场景模型下智能漫游算法设计与实现

Design and Implementation of Intelligent Roaming Algorithms Based on New Virtual Scene Model

基于对相关智能预测算法的分析,发现现有算法并未考虑到虚拟场景节点间存在的潜在关联关系,降低了算法的预测准确率。针对此问题,在一种新的立方体虚拟场景模型的基础上,提出了一种智能漫游算法,通过为每个节点建立一个以当前节点为根结点的完全二叉树结构,利用节点间潜在的关联关系判断下一步可能被操作的对象,对预测对象提前进行绘制并调入内存,有效弥补了相关算法存在的缺陷,从而提高了虚拟场景漫游的效率和实时性,算法具有较高的准确性。

Based on the analysis of the relevant intelligent prediction algorithm, it is found that existing algorithms don＇t consider the potential relevance of the relationship among the virtual scene node, and they reduce the prediction accuracy of the algorithm. To tackle this problem, based on a new cube virtual scene model, an intelligent roaming algorithm is proposed. The algorithm establishes complete BiTree structure for each node, uses the potential association between the nodes to predict the object which may be operated next, protracts the predicted object in advance and then transfers it into the memory. This algorithm effectively compensates for the shortcomings of the related algorithm, thereby imptoves the efficiency and real time of roaming virtual scene. The algorithm is highy accurate.