Point location in fat subdivisions
Information Processing Letters
I-COLLIDE: an interactive and exact collision detection system for large-scale environments
I3D '95 Proceedings of the 1995 symposium on Interactive 3D graphics
A Hierarchical Task Queue Organization for Shared-Memory Multiprocessor Systems
IEEE Transactions on Parallel and Distributed Systems
Managing mutual awareness in collaborative virtual environments
VRST '94 Proceedings of the conference on Virtual reality software and technology
MASSIVE: a collaborative virtual environment for teleconferencing
ACM Transactions on Computer-Human Interaction (TOCHI) - Special issue on virtual reality software and technology
Three-tiered interest management for large-scale virtual environments
VRST '98 Proceedings of the ACM symposium on Virtual reality software and technology
Parallel and Distribution Simulation Systems
Parallel and Distribution Simulation Systems
Extending Locales: Awareness Management in MASSIVE-3
VR '00 Proceedings of the IEEE Virtual Reality 2000 Conference
VRAIS '95 Proceedings of the Virtual Reality Annual International Symposium (VRAIS'95)
Locales and Beacons: Efficient and Precise Support for Large Multi-User Virtual Environments
VRAIS '96 Proceedings of the 1996 Virtual Reality Annual International Symposium (VRAIS 96)
Performance Comparison of Data Distribution Management Strategies
DS-RT '01 Proceedings of the Fifth IEEE International Workshop on Distributed Simulation and Real-Time Applications
A sort-based DDM matching algorithm for HLA
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Concurrency and Computation: Practice & Experience - Distributed Simulation and Real-Time Applications
Scalable interest management for multidimensional routing space
Proceedings of the ACM symposium on Virtual reality software and technology
Lucid platform: applying HLA DDM to multiplayer online game middleware
Computers in Entertainment (CIE) - 3rd anniversary issue
Introducing third party objects into the spatial model of interaction
ECSCW'97 Proceedings of the fifth conference on European Conference on Computer-Supported Cooperative Work
An Efficient Sort-Based DDM Matching Algorithm for HLA Applications with a Large Spatial Environment
Proceedings of the 21st International Workshop on Principles of Advanced and Distributed Simulation
A Continuous Matching Algorithm for Interest Management in Distributed Virtual Environments
PADS '10 Proceedings of the 2010 IEEE Workshop on Principles of Advanced and Distributed Simulation
A Parallel Interest Matching Algorithm for Distributed-Memory Systems
DS-RT '11 Proceedings of the 2011 IEEE/ACM 15th International Symposium on Distributed Simulation and Real Time Applications
An interest management scheme for mobile peer-to-peer systems
Proceedings of the Winter Simulation Conference
A fast parallel matching algorithm for continuous interest management
Proceedings of the Winter Simulation Conference
Optimizing Pairwise Box Intersection Checking on GPUs for Large-Scale Simulations
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Interest management for distributed virtual environments: A survey
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
Interest management is essential for real-time large-scale distributed virtual environments (DVEs) which seeks to filter irrelevant messages on the network. Many existing interest management schemes such as HLA DDM focus on providing precise message filtering mechanisms. However, this leads to a second problem: the computational overhead of the interest matching process. If the CPU cost of interest matching is too high, it would be unsuitable for real-time applications such as multiplayer online games for which runtime performance is important. This paper evaluates the performance of existing interest matching algorithms and proposes a new algorithm based on parallel processing. The new algorithm is expected to have better computational efficiency than existing algorithms and maintain the same accuracy of message filtering as them. Experimental evidence shows that our approach works well in practice.