Bidirectional Search for Interactive Motion Synthesis

Simple item page
dc.contributor.authorLo, Wan-Yenen_US
dc.contributor.authorZwicker, Matthiasen_US
dc.date.accessioned2015-02-23T16:41:03Z
dc.date.available2015-02-23T16:41:03Z
dc.date.issued2010en_US
dc.description.abstractWe present an approach to improve the search efficiency for near-optimal motion synthesis using motion graphs. An optimal or near-optimal path through a motion graph often leads to the most intuitive result. However, finding such a path can be computationally expensive. Our main contribution is a bidirectional search algorithm. We dynamically divide the search space evenly and merge two search trees to obtain the final solution. This cuts the maximum search depth almost in half and leads to significant speedup. To illustrate the benefits of our approach, we present an interactive sketching interface that allows users to specify complex motions quickly and intuitively.en_US
dc.description.number2en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume29en_US
dc.identifier.doi10.1111/j.1467-8659.2009.01626.xen_US
dc.identifier.issn1467-8659en_US
dc.identifier.pages563-573en_US
dc.identifier.urihttps://doi.org/10.1111/j.1467-8659.2009.01626.xen_US
dc.publisherThe Eurographics Association and Blackwell Publishing Ltden_US
dc.titleBidirectional Search for Interactive Motion Synthesisen_US
Files
Collections
29-Issue 2
Full Papers 2010 - CGF 29-Issue 2