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