Stride scheduling for time-critical collision detection

Authors:
Daniel S. Coming;Oliver G. Staadt
Affiliations:
University of California, Davis;University of California, Davis
Venue:
Proceedings of the 2007 ACM symposium on Virtual reality software and technology
Year:
2007

Citing 6
Cited 0

Approximating polyhedra with spheres for time-critical collision detection

ACM Transactions on Graphics (TOG)
A fast and robust GJK implementation for collision detection of convex objects

Journal of Graphics Tools
Collisions and perception

ACM Transactions on Graphics (TOG)
Collision Detection for Interactive Graphics Applications

IEEE Transactions on Visualization and Computer Graphics
Stride Scheduling: Deterministic Proportional- Share Resource Management

Stride Scheduling: Deterministic Proportional- Share Resource Management
Virtual Reality Interaction and Physical Simu: Kinetic sweep and prune for multi-body continuous motion

Computers and Graphics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an event-based scheduling method for time-critical collision detection that meets time constraints by balancing and prioritizing computation spent on intersection tests without starvation. Our approach tests each potentially colliding pair of objects at a different frequency, with unbounded temporal resolution. We preserve believability by adaptively prioritizing intersection tests to reduce errors in collision detection, using information about the objects and scene. By combining kinetic sweep and prune with stride scheduling we interleave rendering, broad phase collision pruning, narrow phase intersection testing, and collision response. This approach accrues no per-frame overhead and allows interruption at any point in collision detection, including the broad phase.