Towards image realism with interactive update rates in complex virtual building environments
I3D '90 Proceedings of the 1990 symposium on Interactive 3D graphics
Visibility preprocessing for interactive walkthroughs
Proceedings of the 18th annual conference on Computer graphics and interactive techniques
RING: a client-server system for multi-user virtual environments
I3D '95 Proceedings of the 1995 symposium on Interactive 3D graphics
Geometric algorithms for message filtering in decentralized virtual environments
I3D '99 Proceedings of the 1999 symposium on Interactive 3D graphics
Real-time acoustic modeling for distributed virtual environments
Proceedings of the 26th annual conference on Computer graphics and interactive techniques
Networked virtual environments: design and implementation
Networked virtual environments: design and implementation
Latency and User Behaviour on a Multiplayer Game Server
NGC '01 Proceedings of the Third International COST264 Workshop on Networked Group Communication
Network Topologies for Scalable Multi-User Virtual Environments
VRAIS '96 Proceedings of the 1996 Virtual Reality Annual International Symposium (VRAIS 96)
Low latency and cheat-proof event ordering for peer-to-peer games
NOSSDAV '04 Proceedings of the 14th international workshop on Network and operating systems support for digital audio and video
Geometric message-filtering protocols for distributed multiagent environments
Presence: Teleoperators and Virtual Environments - Special issue: Advances in collaborative virtual environments
Supporting Scalable Peer to Peer Virtual Environments Using Frontier Sets
VR '05 Proceedings of the 2005 IEEE Conference 2005 on Virtual Reality
Interest Management in Large-Scale Virtual Environments
Presence: Teleoperators and Virtual Environments
A survey of visibility for walkthrough applications
IEEE Transactions on Visualization and Computer Graphics
A distributed architecture for multiplayer interactive applications on the Internet
IEEE Network: The Magazine of Global Internetworking
Effective compression techniques for precomputed visibility
EGWR'99 Proceedings of the 10th Eurographics conference on Rendering
Networked Graphics: Building Networked Games and Virtual Environments
Networked Graphics: Building Networked Games and Virtual Environments
| Hi-index | 0.00 |
We present a class of partitioning scheme that we have called frontier sets. Frontier sets build on the notion of a potentially visible set (PVS). In a PVS, a world is subdivided into cells and for each cell all the other cells that can be seen are computed. In contrast, a frontier set considers pairs of cells, A and B. For each pair, it lists two sets of cells (two frontiers), FAB and FBA, By definition, from no cell in FAB iS any cell in FBA visible and vice versa.Our initial use of frontier sets has been to enable scalability in distributed networking. This is possible because, for example, if at time t0 Playerl is in cell A and Play- er2 is in cell B, as long as they stay in their respective frontiers, they do not need to send update information to each other.In this paper we describe two strategies for building frontier sets. Both strategies are dynamic and compute frontiers only as necessary at runtime. The first is distance-based frontiers. This strategy requires precomputation of an enhanced potentially visible set. The second is greedy frontiers. This strategy is more expensive to compute at runtime, however it leads to larger and thus more efficient frontiers.Network simulations using code based on the Quake II engine show that frontiers have significant promise and may allow a new class of scalable peer-to-peer game infrastructures to emerge.