Collision Detection Algorithm

Collision Detection Algorithm

1. Check the bounding boxes

2. node = Root ( v1 ), center = Center ( node )

3. if Radius ( node ) < Dist_map ( v2, center )

new_p = node.p * Inner ( v2, center )

else

if ( Level ( node ) == BottomLevel )

new_p = CollisionProbability ( v2, node )

else if ( node.p1 < max_p )

Split ( node ) , Goto 3

Previous slide Next slide Back to the first slide View Graphic Version