Merging BSP trees yields polyhedral set operations
SIGGRAPH '90 Proceedings of the 17th annual conference on Computer graphics and interactive techniques
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
MASSIVE: a collaborative virtual environment for teleconferencing
ACM Transactions on Computer-Human Interaction (TOCHI) - Special issue on virtual reality software and technology
OBBTree: a hierarchical structure for rapid interference detection
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Parallel and Distribution Simulation Systems
Parallel and Distribution Simulation Systems
Efficient Collision Detection Using Bounding Volume Hierarchies of k-DOPs
IEEE Transactions on Visualization and Computer Graphics
VRAIS '95 Proceedings of the Virtual Reality Annual International Symposium (VRAIS'95)
Concurrency and Computation: Practice & Experience - Distributed Simulation and Real-Time Applications
Multi-user Gaming on the Grid Using a Service Oriented HLA RTI
DS-RT '09 Proceedings of the 2009 13th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications
An Approach for Parallel Interest Matching in Distributed Virtual Environments
DS-RT '09 Proceedings of the 2009 13th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications
A dynamic sort-based DDM matching algorithm for HLA applications
ACM Transactions on Modeling and Computer Simulation (TOMACS)
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
A fast parallel matching algorithm for continuous interest management
Proceedings of the Winter Simulation Conference
Interest management for distributed virtual environments: A survey
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
Interest management is essential for scalable collaborative virtual environments (CVEs) which sought to reduce bandwidth consumption on the network. Most of the interest management systems such as Data Distribution Management (DDM) service of the High Level Architecture (HLA) concentrate on providing precise message filtering mechanisms. However, in doing so a second problem is introduced: the CPU cycle overheads of filtering process. If the cost in terms of computational resources of interest management itself is too high, it would be unsuitable for real time applications such as multiplayer online games (MOGs) for which runtime performance is important. In this paper we present a scalable interest management algorithm which is suitable for HLA DDM. Our approach employs the collision detection method of I-COLLIDE for fast interest matching. Furthermore, the algorithm has been implemented in our commercialized MOG middleware - Lucid Platform. Experimental evidence demonstrates that it works well in practice.