"Such an algorithm is useful, because ever since "A Bug’s Life" in 1998, there is usually at least one scene in each Pixar movie that exceeds the capacity of e

"Such an algorithm is useful, because ever since "A Bug’s Life" in 1998, there is usually at least one scene in each Pixar movie that exceeds the capacity of even the most memory-rich node in the render farm. The scene usually appears well after R&D has concluded, so ad hoc solutions must then be employed, e.g., manually trimming the scene until it barely fits in-core." Reminds me of Hofstadter's Law.