University of Wisconsin Computer Sciences Header Map (repeated with textual links if page includes departmental footer) Useful ResourcesResearch at UW-Madison CS DeptUW-Madison CS Undergraduate ProgramUW-Madison CS Graduate ProgramUW-Madison CS PeopleUseful InformationCurrent Seminars in the CS DepartmentSearch Our SiteUW-Madison CS Computer Systems LaboratoryUW-Madison Computer Sciences Department Home PageUW-Madison Home Page

Collision Detection Using MOBB trees

In this paper we consider detecting collisions between characters whose motion is specified by motion capture data. We consider rough collisions, modeling the characters as a disk in the floor plane. To provide efficient collision detection, we introduce a hierarchical bounding volume, the Motion Oriented Bounding Box tree (MOBB tree). A MOBBtree stores space-time bounds of a motion clip. In crowd animation tests, MOBB trees performance improvements ranging between two and an order of magnitude. Keywords: collision detection, motion graphs, OBB tree, swept volumes

Mankyu Sung, Stephen Chenney and Michael Gleicher, Detecting Collisions in Graph-Driven Motion Synthesis , Computer Sciences Technical Report CS-2005-1529.

Video for crowd

Questions/Comments: mksung@cs.wisc.edu