Animating Algorithms with XTANG O John Stask o Graphics, Visualization, and Usability Center College of Computing Georgia Institute of Technolog y Atlanta, GA 30332-028 0 Algorithm animation is the process of abstracting a program 's data, operations, and semantics, and then creating a dynamic visualization of those abstractions[3] . Algorithm animations can be helpful for teaching algorithms and as a research test-bed for acquirin g intuition about the fundamental behavior of algorithms . XTANGO is a general purpos e algorithm animation system that I have developed . The system supports the development of color, real-time, 2 & 1/2-dimensional, smooth algorithm animations . The focus of the syste m is on ease-of-use ; programmers need not be graphics experts to develop their own animations . Many students, both undergraduates and graduates, have used XTANGO to create algorith m animations . Information about how to acquire XTANGO free via anonymous ftp is include d later in this article . The basic process of building an algorithm animation consists of implementing the algorithm in C (another language can be used, but it must just produce a trace file whic h is read by a C program driver) and then deciding on
End of preview. The entire article is 5 pages. To view the full-text, please rent this article to continue.
/lp/association-for-computing-machinery/animating-algorithms-with-xtango-EkgZuEKr5Z
Welcome to DeepDyve! Rent Premier Research Articles and Save Up to 90%
Animating algorithms with XTANGO
Stasko, John
Follow ACM SIGACT News
, Volume 23 (2)
Association for Computing Machinery – May 1, 1992
More Info
More Like This Article
View All dataSource[]=actageo&dataSource[]=aspet&dataSource[]=aaos&dataSource[]=aacc&dataSource[]=aacr&dataSource[]=aea&dataSource[]=aip&dataSource[]=ajnr&dataSource[]=ams&dataSource[]=aps_physical&dataSource[]=appi_book&dataSource[]=appi_journal&dataSource[]=apha&dataSource[]=asip&dataSource[]=asm&dataSource[]=asn&dataSource[]=aspb&dataSource[]=avs&dataSource[]=annual_reviews&dataSource[]=arxiv&dataSource[]=acm&dataSource[]=berghahn&dataSource[]=cabi&dataSource[]=clinical_trials&dataSource[]=dailymed&dataSource[]=degruyter&dataSource[]=du_press&dataSource[]=esa&dataSource[]=eu_press&dataSource[]=elsevier&dataSource[]=emerald&dataSource[]=ejtr&dataSource[]=emea&dataSource[]=epo&dataSource[]=faseb&dataSource[]=gsa&dataSource[]=health_affairs&dataSource[]=hindawi&dataSource[]=imanager&dataSource[]=imedpub&dataSource[]=informa_healthcare&dataSource[]=informs&dataSource[]=iop&dataSource[]=iucr&dataSource[]=iospress&dataSource[]=jbjs&dataSource[]=leftcoast&dataSource[]=lu_press&dataSource[]=mesharpe&dataSource[]=mary_ann_liebert&dataSource[]=medline&dataSource[]=mit_press&dataSource[]=nature&dataSource[]=oxford&dataSource[]=pier_professional&dataSource[]=pnas&dataSource[]=portlandpress&dataSource[]=psyc_articles&dataSource[]=psyc_books&dataSource[]=psyc_critiques&dataSource[]=plos_journal&dataSource[]=pubmed_central&dataSource[]=rsna&dataSource[]=rockefeller&dataSource[]=rcn&dataSource[]=ria&dataSource[]=rsc&dataSource[]=sage&dataSource[]=spie&dataSource[]=springer_journal&dataSource[]=springer&dataSource[]=taylor_francis&dataSource[]=aps&dataSource[]=the_scientist&dataSource[]=uc_press&dataSource[]=uspto_abstract&dataSource[]=wiley&dataSource[]=pct
© 2012 DeepDyve, Inc. All rights reserved.
Terms of Service | Privacy Policy
