AN EFFICIENT UNDO/REDO-FRAMEWORK FOR THREE-DIMENSIONAL VISUAL SIMULATION OF ALGORITHMS AND DATA STRUCTURES

Ashraf Abu Baker

2009

Abstract

In order to be pedagogically effective, an algorithm visualisation is expected to satisfy a large number of requirements. One of the most essential and useful requirements is its ability to provide support for reversing performed user actions. In this work we will introduce a generic concept for an efficient undo/redo framework for three-dimensional visual simulations of algorithms and data structures. The framework uses the memento design pattern to implement a linear multiple-undo/multiple-action model with an unlimited undo of performed actions. It is straightforward to utilise and supports the automated generation of three-dimensional visual simulations of algorithms and data structures.

References

  1. Baker, A. A. and Kappes, S. (2008). Three-dimensional static animation of computation-intensive 3dalgorithms. IEEE-CITE08.
  2. Baker, A. A. and Milanovic, B. (2008). A universal extensible architecture for algorithm visualisation systems. IEEE-CITE08.
  3. E. Freeman, E. Freeman, K. S. and Bates, B. (2004). Head First Design Patterns. Oreilly.
  4. E. Gamma, R. Helm, R. and Vlissides, J. (1994). Design Patterns: Elements of Reusable Object-Oriented Software. Addison-Wesley.
  5. J. Archer, R. C. and Schneider, F. B. (1984). User recovery and reversal in interactive systems.
  6. Java3D. https://java3d.dev.java.net. Sun Microstems.
  7. Ogre. http://www.ogre3d.org/.
  8. Prakash and Knister, J. (1994). A framework for undoing actions in collaborative systems. ACM.
  9. Roessling, G. (2002). Animal-farm: An extensible framework for algorithm visualization. In Ph.D. Thesis. Universitaet Siegen.
  10. S. Douglas, D. M. and Hundhausen, C. (1996). Exploring human visualization of computer algorithms. Graphics Interface 7896.
  11. Stasko, J. and Badre, A. (1993). Do algorithm animations assist learning? an empirical study and analysis. ACM INTERCHI.
  12. T. Cormen, D. College, C. L. and Rivest, R. (2002). Introduction to Algorithms. McGraw-Hill Higher Education, Massachusetts Institute of Technology, second edition edition.
  13. T. Naps, G. R. and et al. (2003). Exploring the role of visualization and engagement in computer science education. ACM INTERCHI.
Download


Paper Citation


in Harvard Style

Abu Baker A. (2009). AN EFFICIENT UNDO/REDO-FRAMEWORK FOR THREE-DIMENSIONAL VISUAL SIMULATION OF ALGORITHMS AND DATA STRUCTURES . In Proceedings of the Fourth International Conference on Computer Graphics Theory and Applications - Volume 1: GRAPP, (VISIGRAPP 2009) ISBN 978-989-8111-67-8, pages 274-279. DOI: 10.5220/0001770202740279


in Bibtex Style

@conference{grapp09,
author={Ashraf Abu Baker},
title={AN EFFICIENT UNDO/REDO-FRAMEWORK FOR THREE-DIMENSIONAL VISUAL SIMULATION OF ALGORITHMS AND DATA STRUCTURES},
booktitle={Proceedings of the Fourth International Conference on Computer Graphics Theory and Applications - Volume 1: GRAPP, (VISIGRAPP 2009)},
year={2009},
pages={274-279},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001770202740279},
isbn={978-989-8111-67-8},
}


in EndNote Style

TY - CONF
JO - Proceedings of the Fourth International Conference on Computer Graphics Theory and Applications - Volume 1: GRAPP, (VISIGRAPP 2009)
TI - AN EFFICIENT UNDO/REDO-FRAMEWORK FOR THREE-DIMENSIONAL VISUAL SIMULATION OF ALGORITHMS AND DATA STRUCTURES
SN - 978-989-8111-67-8
AU - Abu Baker A.
PY - 2009
SP - 274
EP - 279
DO - 10.5220/0001770202740279