(Enter summary)
Abstract: Perhaps the most popular approach to animating algorithms
consists of identifying interesting events in the implementation code, corresponding
to relevant actions in the underlying algorithm, and turning
them into graphical events by inserting calls to suitable visualization
routines. Another natural approach conceives algorithm animation as a
graphical interpretation of the state of the computation of a program,
letting graphical objects in a visualization depend on a program's... (Update)
Cited by: More
The Fundamental Design Issues of Jeliot 3 - Myller (2004)
(Correct)
Specifying Algorithm Visualizations in Terms of Data Flow - Jarosl Aw Francik (2002)
(Correct)
Similar documents (at the sentence level):
5.6%: Visualization in Algorithm Engineering: Tools and.. - Demetrescu, Finocchi..
(Correct)
Active bibliography (related documents): More All
0.5: Algorithm Animation for Teaching - Fleischer, Kucera
(Correct)
0.3: Visualizing Algorithms over the Web with the.. - Demetrescu, Finocchi, .. (2000)
(Correct)
0.3: What Do We Learn from Experimental Algorithmics? - Demetrescu, Italiano (2000)
(Correct)
Similar documents based on text: More All
0.6: Smooth Animation of Algorithms in a Declarative Framework - Demetrescu, Finocchi (2001)
(Correct)
0.6: A Technique for Generating Graphical Abstractions of.. - Demetrescu, Finocchi (1999)
(Correct)
0.5: Break the "Right" Cycles and Get the "Best" Drawing - Demetrescu, Finocchi (2000)
(Correct)
Related documents from co-citation: More All
2: Reversible execution and visualization of programs with Leonardo
- Crescenzi, Demetrescu et al. - 2000
2: Program Visualization: The Art of Mapping Programs to Pictures
- Roman, Cox - 1992
BibTeX entry: (Update)
C. Demetrescu, I. Finocchi, J. T. Stasko, "Specifying Algorithm Visualizations: Interesting Events or State Mapping? ". In: Software Visualization, State-of-the-Art Survey, Stephan Diehl (ed.), Lecture Notes in Computer Science (LNCS 2269), Springer Verlag, Berlin -- Heidelberg -- New York 2002 (in press). http://citeseer.ist.psu.edu/demetrescu02specifying.html More
@inproceedings{ demetrescu01specifying,
author = "Camil Demetrescu and Irene Finocchi and John T. Stasko",
title = "Specifying Algorithm Visualizations: Interesting Events or State Mapping?",
booktitle = "Software Visualization",
pages = "16-30",
year = "2001",
url = "citeseer.ist.psu.edu/demetrescu02specifying.html" }
Citations (may not include all citations):
375
LEDA: A Platform of Combinatorial and Geometric Computing
- Mehlhorn, Naher - 1999
174
TANGO: A Framework and System for Algorithm Animation (context) - Stasko - 1990
151
Algorithms and Applications (context) - Ahuja, Magnanti et al. - 1993
132
Zeus: a System for Algorithm Animation and Multi-View Editin..
- Brown - 1991
98
Algorithm Animation (context) - Brown - 1988
95
A Principled Taxonomy of Software Visualization (context) - Price, Baecker et al. - 1993
94
Taxonomies of Visual Programming and Program Visualization (context) - Myers - 1990
70
A Methodology for Building Application-Specific Visualizatio..
- Stasko - 1993
60
PAVANE: a System for Declarative Visualization of Concurrent..
- Roman, Cox et al. - 1992
50
Software Visualization: Programming as a Multimedia Experien.. (context) - Stasko, Domingue et al. - 1997
42
A Taxonomy of Program Visualization Systems
- Roman, Cox - 1993
33
A Declarative Approach to Visualizing Concurrent Computation.. (context) - Roman, Cox - 1989
31
Perspectives on Algorithm Animation (context) - Brown - 1988
25
Animating Algorithms with X-TANGO (context) - Stasko - 1992
24
Collaborative Active Textbooks: a Web-Based Algorithm Animat..
- Brown, Najork - 1996
24
Reversible Execution and Visualization of Programs with LEON..
- Crescenzi, Demetrescu et al. - 2000
9
A System for Algorithm Animation: Tutorial and User Manual
- Bentley, Kernighan - 1991
7
Visualizing algorithms over the Web with the publication-dri..
- Demetrescu, Finocchi et al. - 2000
4
Cooperative Algorithm and Data Types Animation over the Net (context) - Cattaneo, Ferraro et al. - 1998
1
Developing gato and catbox with python: Teaching graph algor..
- Schliep, Hochstattler - 2000
Documents on the same site (http://www.dis.uniroma1.it/pub/demetres/papers/): More
Maintaining Shortest Paths in Digraphs with.. - Demetrescu.. (2000)
(Correct)
Removing Cycles for Minimizing Crossings - Demetrescu, Finocchi (2001)
(Correct)
Visualization in Algorithm Engineering: Tools and.. - Demetrescu, Finocchi..
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC