Diel, StepahnGörg, CarstenKerren, AndreasDavid S. Ebert and Jean M. Favre and Ronald Peikert2014-01-302014-01-3020013-211-83674-81727-5296https://doi.org/10.2312/VisSym/VisSym01/175-184First we introduce the concept of graph animations as a sequence of evolving graphs and a generic algorithm which computes a Foresighted Layout for dynamically drawing these graphs while preserving the mental map. The algorithm is generic in the sense that it takes a static graph drawing algorithm as a parameter. In other words, trees can be animated with a static tree layouter, graphs with a static Sugiyama-style layouter or a spring embedder, etc. Second we discuss applications of Foresighted Layout in algorithm animation and visualization of navigation behaviour.