Bidirectional Search for Interactive Motion Synthesis

We 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 bi...

Full description

Saved in:
Bibliographic Details
Published inComputer graphics forum Vol. 29; no. 2; pp. 563 - 573
Main Authors Lo, Wan-Yen, Zwicker, Matthias
Format Journal Article
LanguageEnglish
Published Oxford, UK Blackwell Publishing Ltd 01.05.2010
Subjects
Bidirectional
C (programming language)
Computer animation
Graphs
I.3.7 [Computer Graphics]: Three-Dimensional Graphics and Realism-Animation
Image processing systems
Interactive
Mathematical models
Motion control
Optimization
Searches
Searching
Synthesis
Online AccessGet full text

Cover

More Information
Summary:We 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.
Bibliography:ark:/67375/WNG-313F73RT-B
ArticleID:CGF1626
istex:33300665D7DA1D2FDA48779119AA990580C371BB
walo@ucsd.edu
ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0167-7055
1467-8659
DOI:10.1111/j.1467-8659.2009.01626.x