ACM Home Page
Please provide us with feedback. Feedback
Algorithm animation over the World Wide Web
Full text PdfPdf (5.52 MB)
Source AVI archive
Proceedings of the workshop on Advanced visual interfaces table of contents
Gubbio, Italy
SESSION: Empowering the interface table of contents
Pages: 203 - 212  
Year of Publication: 1996
ISBN:0-89791-834-7
Authors
James E. Baker  Brown University, Providence, RI
Isabel F. Cruz  Tufts University, Medford, MA
Giuseppe Liotta  Brown University, Providence, RI
Roberto Tamassia  Brown University, Providence, RI
Sponsor
SIGMULTIMEDIA: ACM Special Interest Group on Multimedia
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 25,   Citation Count: 9
Additional Information:

abstract   references   cited by   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/948449.948480
What is a DOI?

ABSTRACT

In this paper we propose a new model, called Mocha, for providing algorithm animation over the World Wide Web. Mocha is a distributed model with a client-server architecture that optimally partitions the software components of a typical algorithm animation system, and leverages the power of the Java language, an emerging standard for distributing interactive platform-independent applications across the Web.Mocha provides high levels of security, protects the algorithm code, places a light communication load on the Internet, and allows users with limited computing resources to access animations of computationally expensive algorithms. The user interface combines fast responsiveness and user friendliness with the powerful authoring capabilities of hypertext narratives.We describe the architecture of Mocha and show its advantages over previous methods for algorithm animation over the Internet. We also present a prototype of an animation system for geometric algorithms that can be accessed by any user with a WWW browser supporting Java (currently Netscape 2.0 and HotJava) at URL http://www.cs.brown.edu/people/jib/Mocha.html.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Hotjava, 1995. http://www.javasoft.com/hotjava.html.
 
2
Netscape, 1995. http://home.netscape.com/comprod/products/navigator/version_2.0/.
3
4
 
5
 
6
P. Bose, W. Lenhart, and G. Liotta. Characterizing proximity trees. Algorithmica. (special issue on Graph Drawing, edited by G. Di Battista and R. Tamassia, to appear).
7
 
8
M. H. Brown. Algorithm Animation. MIT Press, Cambridge, 1988.
 
9
M. H. Brown. ZEUS: A System for Algorithm Animation and Multi-View Editing. In IEEE Symposium on Visual Languages (VL '91), pages 4--9, 1992. Also available from http://gatekeeper.dec.com/pub/DEC/SRC/research-reports/abstracts/src-rr-075.html.
 
10
11
 
12
M. H. Brown and R. Sedgewick. Techniques for algorithm animation. IEEE Software, 2(1):28--39, 1985.
 
13
 
14
 
15
 
16
K. R. Gabriel and R. R. Sokal. A new statistical approach to geographic variation analysis. Systematic Zoology, 18:259--278, 1969.
 
17
E. Gamma, R. Helm, R. Johnson, and J. Vlissides. Design Patterns. Addison Wesley, 1995.
 
18
S. C. Glassman. A Turbo Environment for Producing Algorithm Animation. In IEEE Symposium on Visual Languages (VL '93), pages 32--36, 1993.
 
19
J. Gosling and H. McGilton. The Java language environment: a white paper, 1995. http://www.javasoft.com/whitePaper/java-whitepaper-1.html.
 
20
21
 
22
J. W. Jaromczyk and G. T. Toussaint. Relative neighborhood graphs and their relatives. Proc. IEEE, 80(9):1502--1517, Sept. 1992.
 
23
D. G. Kirkpatrick and J. D. Radke. A framework for computational morphology. In G. T. Toussaint, editor, Computational Geometry, pages 217--248. North-Holland, 1985.
 
24
F. Manola. MetaObject protocol concepts for a RISC object model. Technical Report 0244-12-93-165, GTE Laboratories, Inc., December 1993.
25
 
26
J. Muthukumarasamy and J. T. Stasko. Visualizing Program Executions on Large Data Sets Using Semantic Zooming. Technical Report GIT-GVU-95-02, Georgia Institute of Technology, 1995.
 
27
B. Myers. Taxonomies of visual programming and program visualization. J. of Visual Languages and Computating, 1(1):97--123, March 1990.
 
28
 
29
 
30
S. P. Reiss. A Framework for Abstract 3D Visualizations. In IEEE Symposium on Visual Languages (VL '93), pages 100--107, 1993.
 
31
S. P. Reiss and I. F. Cruz. Practical Software Visualization. In CHI '94 Workshop on Software Visualization, 1994.
32
33
34
 
35
J. T. Stasko. The path-transition paradigm: a practical methodology for adding animation to program interfaces. J. of Visual Languages and Computing, 1(3):213--236, 1990.
 
36
J. T. Stasko. Simplifying algorithm animation with tango. In Proc. IEEE Workshop on Visual Languages, pages 1--6, 1990.
 
37
38
 
39
 
40
G. T. Toussaint. The relative neighbourhood graph of a finite planar set. Pattern Recogn., 12:261--268, 1980.
 
41

CITED BY  9
 
 
 
 
Collaborative Colleagues:
James E. Baker: colleagues
Isabel F. Cruz: colleagues
Giuseppe Liotta: colleagues
Roberto Tamassia: colleagues

Peer to Peer - Readers of this Article have also read: