Data structures and network algorithms
Data structures and network algorithms
Self-adjusting binary search trees
Journal of the ACM (JACM)
SIAM Journal on Computing
The design and analysis of spatial data structures
The design and analysis of spatial data structures
Interactive solid geometry via partitioning trees
Proceedings of the conference on Graphics interface '92
I-COLLIDE: an interactive and exact collision detection system for large-scale environments
I3D '95 Proceedings of the 1995 symposium on Interactive 3D graphics
OBBTree: a hierarchical structure for rapid interference detection
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
V-COLLIDE: accelerated collision detection for VRML
VRML '97 Proceedings of the second symposium on Virtual reality modeling language
Visibility sorting and compositing without splitting for image layer decompositions
Proceedings of the 25th annual conference on Computer graphics and interactive techniques
Kinetic binary space partitions for intersecting segments and disjoint triangles
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Self-customized BSP trees for collision detection
Computational Geometry: Theory and Applications - special issue on virtual reality
Collision Detection for Interactive Graphics Applications
IEEE Transactions on Visualization and Computer Graphics
Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware
Kinetic vertical decomposition trees
Kinetic vertical decomposition trees
Collision Detection
BD-tree: output-sensitive collision detection for reduced deformable models
ACM SIGGRAPH 2004 Papers
An evaluation of a collision handling system using sphere-trees for plausible rigid body animation
Proceedings of the 2008 ACM symposium on Applied computing
Enhancing Haptic Rendering through Predictive Collision Detection
VMR '09 Proceedings of the 3rd International Conference on Virtual and Mixed Reality: Held as Part of HCI International 2009
A dynamic bounding volume hierarchy for generalized collision detection
Computers and Graphics
Enhanced physically-based animation of deformable bodies using shape-matching
Computers in Entertainment (CIE) - SPECIAL ISSUE: Games
A framework for benchmarking interactive collision detection
Proceedings of the 25th Spring Conference on Computer Graphics
Razor: An architecture for dynamic multiresolution ray tracing
ACM Transactions on Graphics (TOG)
Advanced data driven visualisation for geo-spatial data
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part III
Accelerating physics in large, continuous virtual environments
Concurrency and Computation: Practice & Experience
Adaptive load-balancing for MMOG servers using KD-trees
Computers in Entertainment (CIE) - Theoretical and Practical Computer Applications in Entertainment
| Hi-index | 0.00 |
The broad-phase step of collision detection in scenes composed of n moving objects is a challenging problem because enumerating collision pairs has an inherent O(n2) complexity. Spatial data structures are designed to accelerate this process, but often their static nature makes it difficult to handle dynamic scenes. In this work we propose a new structure called Semi-Adjusting BSP-tree for representing scenes composed of thousands of moving objects. An scheduling algorithm evaluates locations where the BSP-tree becomes unbalanced, uses several strategies to alter cutting planes, and defer updates based on their re-structuring cost. We show that the tree does not require a complete re-structuring even in highly dynamic scenes, but adjusts itself while maintaining desirable balancing and height properties.