2004
DOI: 10.1145/1028523.1028536
|View full text |Cite
|
Sign up to set email alerts
|

Evaluating motion graphs for character navigation

Abstract: Abstract

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
33
0
2

Year Published

2005
2005
2008
2008

Publication Types

Select...
6
3
1

Relationship

0
10

Authors

Journals

citations
Cited by 41 publications
(35 citation statements)
references
References 49 publications
0
33
0
2
Order By: Relevance
“…This result is anticipated as we know that the character's minimum turning radius is quite large. Inspired by the work of Reitsma and Pollard [2004], we used a discrete, brute force method to embed our parametric motion graph in the environment in hopes of better understanding this problem. This embedding made it clear that our character could easily meet location constraints within a reasonable radius but that for most locations, there were only a few orientations that the character could be in when they arrived.…”
Section: Target Directed Controlmentioning
confidence: 99%
“…This result is anticipated as we know that the character's minimum turning radius is quite large. Inspired by the work of Reitsma and Pollard [2004], we used a discrete, brute force method to embed our parametric motion graph in the environment in hopes of better understanding this problem. This embedding made it clear that our character could easily meet location constraints within a reasonable radius but that for most locations, there were only a few orientations that the character could be in when they arrived.…”
Section: Target Directed Controlmentioning
confidence: 99%
“…However, the quality of the results depends largely on the size (Treuille et al, 2007) (only a few minutes (Safonova and Hodgins, 2007)) as well as the quality of the motion database used to construct the motion graph (the appropriateness of the database (Chai and Hodgins, 2007), whereby once again motion capture data is used as a motion prior while matching constraints are specified by the user), together with the "good", and/or automatic, connectivity of the motion graph (Ikemoto et al, 2007). Furthermore, the idea of evaluating motion graphs is outlined by Reitsma and Pollard (Reitsma and Pollard, 2004), in order to identify how much motion data should be included in the motion graph, in addition to assessing the character's capabilities while comparing motion datasets for the improvement of the motion graph.…”
Section: Discussionmentioning
confidence: 99%
“…Directly capturing transitions between behaviors produces higher quality motion data than interpolating motion segments between behaviors. Assessing the final quality of a motion dataset is a difficult problem; Reitsma and Pollard [75] describe an algorithm for embedding motion capture data into a target environment and calculating path quality and environment coverage. In practice, it is possible for an experienced technician to evaluate the dataset by visually observing a synthetic character animated using the data and noting dis continuities in the character's motion.…”
Section: Data Collectionmentioning
confidence: 99%