A Partitioning Algorithm for a Distributed Virtual Environment
分布式虚拟环境中的一种场景动态划分算法—基于竞争的演化算法

With the development of networking technologies and computer graphics, distributed virtual environment (DVE) has become an important research area in computer science. In a DVE system, clients at different places can simultaneously explore a virtual world and interact with each other. How to build an efficient DVE system that can support large number of concurrent users is a challenge. In the paper, we discuss the way of partitioning the DVE world to balance the workload among different servers as well as minimize the inter-server communication. We present the existent mathematics mode and algorithms at first, and then give our algorithm, partitioning algorithm based on competition. Ex- periments are carried out to illustrate the effectiveness of our proposed algorithm.