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.
CITATION STYLE
Tal, A. (2002). Algorithm animation systems for constrained domains. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2269, pp. 101–112). Springer Verlag. https://doi.org/10.1007/3-540-45875-1_8
Mendeley helps you to discover research relevant for your work.