1. A computer-implemented method for partitioning a set of animation objects using a dependency graph, the method comprising: accessing a dependency graph comprising a plurality of interconnected nodes, wherein a first node of the plurality of interconnected nodes comprises a first partition criterion; accessing a set of animation objects identified by an input of the first node; comparing the set of animation objects to the first partition criterion; when one or more objects in the set of animation objects satisfy the first partition criterion, generating a first subset of those one or more objects that satisfy the first partition criterion; and when one or more objects in the set of animation objects do not satisfy the first partition criterion, generating a second subset of those one or more objects that do not satisfy the first partition criterion.