Animating Algorithms Live and Post Mortem

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2269)


We first give an overview of the features of the GANIMAL Framework introducing several new concepts not present in any previous algorithm animation system. Then we focus on its mechanisms for mixing live and post mortem visualization which are in particular very useful for algorithms which restructure graphs.


Control Object Interesting Event Parallel Execution Graphical Output Runtime System 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    B. Braune, S. Diehl, A. Kerren, and R. Wilhelm. Animation of the Generation and Computation of Finite Automata for Learning Software. In Proceedings of Workshop on Implementing Automata, volume Springer LNCS 2214, Potsdam, 2001.Google Scholar
  2. 2.
    M. Brown. Exploring Algorithms with Balsa-II. Computer, 21(5), 1988.Google Scholar
  3. 3.
    M. Brown and R. Sedgewick. A system for Algorithm Animation. In Proceedings of ACM SIGGRAPH’84, Minneapolis, MN, 1984.Google Scholar
  4. 4.
    M. H. Brown. Zeus: A System for Algorithm Animation and Multiview Editing. In IEEE Workshop on Visual Languages, pages 4–9, 1991.Google Scholar
  5. 5.
    Camil Demetrescu, Irene Finocchi, and John Stasko. Specifying Algorithm Visualizations: Interesting Events or State Mapping? In Proceedings of Dagstuhl Seminar on Software Visualization, 2001.Google Scholar
  6. 6.
    Eds.: S. Diehl and A. Kerren. Proceedings of the GI-Workshop “Software Visualization” SV2000. Technical Report A/01/2000, FR 6.2-Informatik, University of Saarland, May 2000.
  7. 7.
    S. Diehl, C. Görg, and A. Kerren. Preserving the Mental Map using Foresighted Layout. In Proceedings of Joint Eurographics-IEEE TCVG Symposium on Visualization VisSym’01, 2001.Google Scholar
  8. 8.
    S. Diehl and A. Kerren. Increasing Explorativity by Generation. In Proceedings of World Conference on Educational Multimedia, Hypermedia and Telecommunications, EDMEDIA-2000. AACE, 2000.Google Scholar
  9. 9.
    S. Diehl and A. Kerren. Levels of Exploration. In Proceedings of the 32nd Technical Symposium on Computer Science Education, SIGCSE 2001. ACM, 2001.Google Scholar
  10. 10.
    S. Diehl and T. Kunze. Visualizing Principles of Abstract Machines by Generating Interactive Animations. Future Generation Computer Systems, 16(7), 2000.Google Scholar
  11. 11.
    Erich Gamma, Richard Helm, and Ralph Johnson. Design Patterns. Elements of Reusable Object-Oriented Software. Addison-Wesley Professional Computing Series. Addison-Wesley, Reading, Massachusetts, 1995.Google Scholar
  12. 13.
    A. Kerren. Animation of the Semantical Analysis. In Proceedings of 8. GIFachtagung Informatik und Schule INFOS99 (in German), Informatik aktuell. Springer, 1999.Google Scholar
  13. 14.
    D. E. Knuth. Literate Programming. Center of the Study of Language and Information-Lecture Notes, No. 27. CSLI Publications, Stanford, California, 1992.Google Scholar
  14. 15.
    J. Stasko. TANGO: A Framework and System for Algorithm Animation. Computer, 23(9), 1990.Google Scholar
  15. 16.
    J. Stasko. Using Student-Built Algorithm Animations as Learning Aids. In Proceedings of the 1998 ACM SIGCSEConfer ence, San Jose, CA, 1997.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  1. 1.University of SaarlandSaarbrückenGermany

Personalised recommendations