Efficient Large-Scale Sweep and Prune Methods with AABB Insertion and Removal

We introduce new features for the broad phase algorithm sweep and prune that increase scalability for large virtual reality environments and allow for efficient AABB (axis-aligned bounding boxes) insertion and removal to support dynamic object creation and destruction. We introduce a novel segmented...

Full description

Saved in:
Bibliographic Details
Published in2009 IEEE Virtual Reality Conference pp. 191 - 198
Main Authors Tracy, Daniel J., Buss, Samuel R., Woods, Bryan M.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.03.2009
Subjects
Acceleration
Cognitive science
Computer graphics
Geometry
I.3.6 [Computer Graphics]: Methodology and Techniques-Graphics data structures and data types
I.3.7 [Computer Graphics]: Three-Dimensional Graphics and Realism-Virtual Reality
Large-scale systems
Mathematics
Performance evaluation
Scalability
Testing
Virtual reality
Online AccessGet full text

Cover

More Information
Summary:We introduce new features for the broad phase algorithm sweep and prune that increase scalability for large virtual reality environments and allow for efficient AABB (axis-aligned bounding boxes) insertion and removal to support dynamic object creation and destruction. We introduce a novel segmented interval list structure that allows AABB insertion and removal without requiring a full sort of the axes. This algorithm is well-suited to large environments in which many objects are not moving at once. We analyze and test implementations of sweep and prune that include subdivision, batch insertion and removal, and segmented interval lists. Our tests show these techniques provide higher performance than previous sweep and prune methods, and perform better than octrees in temporally coherent environments.
ISBN:9781424439430
1424439434
ISSN:1087-8270
DOI:10.1109/VR.2009.4811022