Skip to main content

Algorithm Animation Systems for Constrained Domains

  • Conference paper
  • First Online:
Software Visualization

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

  • 1001 Accesses

Abstract

This paper presents a conceptual model for designing an algorithm animation system for constrained domains. We define a hierarchy of users and a model for supporting each type of users. The hierarchy includes naive programmers, advance programmers, end users, and groups of end users. This paper also describes a few systems that realize the conceptual model within two domains: the domain of computational geometry and the domain of distributed algorithms.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. N. Amenta, S. Levy, T. Munzner, and M. Phillips, Geomview: A system for geometric visualization. Proc. 11th Ann. ACM Symp. on Computational Geometry, C12–C13, 1995.

    Google Scholar 

  2. T. Bemmerl and P. Braun. Visualization of message passing parallel programs with the TOPSYS parallel programming environment. Journal of Parallel and Distributed Computing, 18:118–128, 1993.

    Article  Google Scholar 

  3. M.H. Brown. Algorithm Animation. MIT Press, 1988.

    Google Scholar 

  4. M.H. Brown. Zeus: A system for algorithm animation and multi-view editing. Computer Graphics, 18(3):177–186, May 1992.

    Article  Google Scholar 

  5. M.H. Brown, M.A. Najork. Collaborative Active Textbooks: A Web-Based Algorithm. Animation System for An Electronic Classroom. Proceedings of the IEEE Symposium on Visual Languages, 266–275, 1996.

    Google Scholar 

  6. M.H. Brown, M.A. Najork, and R. Raisamo. A Java-Based Implementation of Collaborative Active Textbooks. Proceedings of the IEEE Symposium on Visual Languages, 23–26, 1997.

    Google Scholar 

  7. A. Hausner and D.P. Dobkin. GAWAIN: Visualizing geometric algorithms with Web-based animation., The Fourteenth Annual Symposium on Computational Geometry, pages 411–412, 1998.

    Google Scholar 

  8. E. Kraemer and J.T. Stasko. The visualization of parallel systems: an overview. Journal of Parallel and Distributed Computing, 18:105–117, 1993.

    Article  Google Scholar 

  9. E. Kraemer and J.T. Stasko. Toward flexible control of the temporal mapping from concurrent program events to animations Proceedings of the 8th International Parallel Processing Symposium, 902–908, 1994.

    Google Scholar 

  10. E. Kraemer and J.T. Stasko. Creating an accurate portrayal of concurrent executions. IEEE Concurrency, 6(1), 36–46, 1998.

    Article  Google Scholar 

  11. L. Lamport. Time, clocks and the ordering of events in a distributed system. Communication of the ACM, 21(7):558–565, 1978.

    Article  MATH  Google Scholar 

  12. Y. Moses, Z. Polunsky, A. Tal and L. Ulitsky. Algorithm Visualization for Distributed Environments, IEEE Symposium on Information Visualization’ 98, October 1998.

    Google Scholar 

  13. G.-C. Roman, K.C. Cox, D. Wilcox and J.Y. Plun. Pavane: a system for declarative visualization of concurrent computations. J. Visual Languages Comput., 3(2): 161–193, 1992.

    Article  Google Scholar 

  14. P. Schorn. The XYZ GeoBench: a programming environment for geometric algorithms, Lecture Notes in Computer Science 553 (Springer-Verlag, Berlin, 1991), pp. 187–202

    Google Scholar 

  15. A. Shapiro and A. Tal. Polyhedron Realization for Shape Transformation. The Visual Computer, 14 (8–9): 429–444, 1998.

    Article  Google Scholar 

  16. M. Shneerson, A. Shapiro and A. Tal. Polyhedron Realization and its Application to Metamorphosis. Fifteenth Annual ACM Symposium on Computational Geometry, June 1999.

    Google Scholar 

  17. M. Shneerson and A. Tal. Interactive Collaborative Visualization Environment for Geometric Computing, Journal of Visual Languages and Computing, Vol 6, Num 6, December 2000, 615–637

    Article  Google Scholar 

  18. J. Stasko. The path-transition paradigm: a practical methodology for adding animation to program interface. Journal of Visual Languages and Computing, pages 213–236, 1990.

    Google Scholar 

  19. J. Stasko. Tango: A framework and system for algorithm animation. IEEE Computer, September 1990.

    Google Scholar 

  20. J. Stasko and E. Kraemer A methodology for building application-specific visualizations of parallel programs. J. Parallel Dist. Comut. 18(1):258–264, 1993.

    Article  Google Scholar 

  21. A. Tal and D.P. Dobkin. Visualization of Geometric Algorithms, IEEE Transactions on Visualization and Computer Graphics, 1(2): 194–204, 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tal, A. (2002). Algorithm Animation Systems for Constrained Domains. In: Diehl, S. (eds) Software Visualization. Lecture Notes in Computer Science, vol 2269. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45875-1_8

Download citation

  • DOI: https://doi.org/10.1007/3-540-45875-1_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43323-1

  • Online ISBN: 978-3-540-45875-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics