Gene S. Lee, Christian Eisenacher, Andy Lin, Noel Villegas
{"title":"Handling scene constraints for pose-based caching","authors":"Gene S. Lee, Christian Eisenacher, Andy Lin, Noel Villegas","doi":"10.1145/3084363.3085047","DOIUrl":null,"url":null,"abstract":"This paper presents a conservative, uniform method for handling scene constraints, such as look at and parent, in a pose-based caching system. The constraints are organized into a dependency graph where nodes represent the control caches of a rig, and directed arcs link the rigs to specific control caches. For any animation update, the dependency graph indicates which cache to clear and which other rigs to subsequently update. This method supports pre-evaluation, avoids expensive state tracking, and is easy to implement. The result is a seamless experience that works with all types of constraints while preserving real-time performance.","PeriodicalId":163368,"journal":{"name":"ACM SIGGRAPH 2017 Talks","volume":"50 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM SIGGRAPH 2017 Talks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3084363.3085047","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
This paper presents a conservative, uniform method for handling scene constraints, such as look at and parent, in a pose-based caching system. The constraints are organized into a dependency graph where nodes represent the control caches of a rig, and directed arcs link the rigs to specific control caches. For any animation update, the dependency graph indicates which cache to clear and which other rigs to subsequently update. This method supports pre-evaluation, avoids expensive state tracking, and is easy to implement. The result is a seamless experience that works with all types of constraints while preserving real-time performance.