Detecting Collisions in Graph-Driven Motion Synthesis
| dc.contributor.author | Sung, Mankyu | en_US |
| dc.contributor.author | Chenney, Stephen | en_US |
| dc.contributor.author | Gleicher, Michael | en_US |
| dc.date.accessioned | 2012-03-15T17:19:09Z | |
| dc.date.available | 2012-03-15T17:19:09Z | |
| dc.date.created | 2005 | en_US |
| dc.date.issued | 2005 | en_US |
| dc.identifier.citation | TR1529 | en_US |
| dc.identifier.uri | http://digital.library.wisc.edu/1793/60442 | |
| dc.description.abstract | 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. | en_US |
| dc.format.mimetype | application/pdf | en_US |
| dc.publisher | University of Wisconsin-Madison Department of Computer Sciences | en_US |
| dc.title | Detecting Collisions in Graph-Driven Motion Synthesis | en_US |
| dc.type | Technical Report | en_US |
Files in this item
This item appears in the following Collection(s)
-
CS Technical Reports
Technical Reports Archive for the Department of Computer Sciences at the University of Wisconsin-Madison