GVU Technical Report Number:
GIT-GVU-92-11
Title:
Tidy Animations of Tree Algorithms
Authors:
John T. Stasko
Carlton Reid Turner
Abstract:
In software visualization and algorithm animation it is important
that advances in system technologies are accompanied by
corresponding advances in animation presentations. In this paper
we describe methods for animating tree manipulation algorithms,
one of the most challenging algorithm animation domains. In
particular, we animate operations on pairing heap data structures
which are used to implement priority queues. Our animations use
tree layout heuristics and and smooth transitions for illustrating
intermediate algorithm states to promote viewer understanding.
This paper describes the visual techniques and methodologies used
to display the pairing heap operations. The paper also details the
implementation requirements and how our particular support
platform, the XTango system, facilitates meeting these requirements.
Keywords:
Algorithm animation, tree manipulation algorithms, visualization, XTango
system
You can access this technical report via:
PDF
Postscript
|
