Hierarchical structures for collision checking between virtual characters

Simulating a crowded scene like a busy shopping street requires tight packing of virtual characters. In such cases collisions are likely to occur, and the choice in collision detection shape will influence how characters are allowed to intermingle. Full collision detection is too expensive for crowds, so simplifications are needed. The most common simplification, the fixed-width, pose-independent cylinder, does not allow intermingling of characters, as it will either cause too much empty space between characters or undetected penetrations. As a possible solution to this problem, we introduce the bounding cylinder hierarchy (BCH), a bounding volume hierarchy that uses vertical cylinders as bounde-mail:{s.a.stuvel,j.egges,a.f.vanderstappen}@uu.nl e-mail:{nadiathalmann,danielthalmann}@ntu.edu.sg ing shapes. Since the BCH is a generalization of the single cylinder, we expect that this representation can be easily integrated with existing crowd simulation systems. We compare our BCH with commonly used collision shapes, namely the single cylinder and oriented bounding box tree, in terms of query time, construction time and represented volume. To get an indication of possible crowd densities, we investigate how close characters can be before collision is detected, and finally propose a critical maximum depth for the BCH.