Show simple item record

dc.contributor.authorSung, Mankyuen_US
dc.contributor.authorChenney, Stephenen_US
dc.contributor.authorGleicher, Michaelen_US
dc.date.accessioned2012-03-15T17:19:09Z
dc.date.available2012-03-15T17:19:09Z
dc.date.created2005en_US
dc.date.issued2005en_US
dc.identifier.citationTR1529en_US
dc.identifier.urihttp://digital.library.wisc.edu/1793/60442
dc.description.abstractIn 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.mimetypeapplication/pdfen_US
dc.publisherUniversity of Wisconsin-Madison Department of Computer Sciencesen_US
dc.titleDetecting Collisions in Graph-Driven Motion Synthesisen_US
dc.typeTechnical Reporten_US


Files in this item

Thumbnail

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

Show simple item record