Hierarchical structures for collision checking between virtual characters. (May 2014)

• Record Type: Journal Article
• Authors: Stüvel, Sybren A.; Magnenat‐Thalmann, Nadia; Thalmann, Daniel; Egges, Arjan; van der Stappen, A. Frank
• Is Part Of: Computer animation and virtual worlds. Volume 25:Number 3/4(2014)
• Page Start: 333
• Page End: 342
• Publication Date: 2014-05
• Subjects: Computer animation -- Periodicals; Visualization -- Periodicals; 006.6
• DOI: 10.1002/cav.1592
• Languages: English
• ISSNs: 1546-4261

Abstract

<abstract abstract-type="main" id="cav1592-abs-0001"> <title>ABSTRACT</title> <p>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 <italic>bounding cylinder hierarchy</italic> (BCH), a bounding volume hierarchy that uses vertical cylinders as bounding shapes. Because 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. Copyright © 2014 John Wiley &amp; Sons, Ltd.</p> </abstract>