Frontier Sets: A Partitioning Scheme to Enable Scalable Virtual Environments
| dc.contributor.author | Steed, Anthony | en_US |
| dc.contributor.author | Angus, Cameron | en_US |
| dc.contributor.editor | M. Alexa and E. Galin | en_US |
| dc.date.accessioned | 2015-07-20T09:40:50Z | |
| dc.date.available | 2015-07-20T09:40:50Z | |
| dc.date.issued | 2004 | en_US |
| dc.description.abstract | We present a new spatial partitioning scheme called frontier sets. Frontier sets build on the notion of a potentially visible set (PVS) [ARB90, TS91]. In a PVS a world is sub-divided into cells and for each cell all the other cells that can be seen are computed. Frontier sets represent regions of mutual invisibility. One frontier in a frontier set considers pairs of cells, A and B. It lists two sets of cells, FAB and FBA. From no cell in FAB is any cell in FBA visible and vice-versa. We have used frontier sets to investigate peer-to-peer networking schemes for networked virtual environments. Preliminary investigation of simulations within the Quake II game engine shows that frontiers have significant promise and may allow a new class of scalable peer-to-peer game infrastructures to emerge. | en_US |
| dc.description.seriesinformation | Eurographics 2004 - Short Presentations | en_US |
| dc.identifier.doi | 10.2312/egs.20041019 | en_US |
| dc.identifier.issn | 1017-4656 | en_US |
| dc.identifier.uri | https://doi.org/10.2312/egs.20041019 | en_US |
| dc.publisher | Eurographics Association | en_US |
| dc.title | Frontier Sets: A Partitioning Scheme to Enable Scalable Virtual Environments | en_US |
Files
Original bundle
1 - 1 of 1