Marc H. Brown and Robert Sedgewick. Techniques for algorithm animation. IEEE Software, (1):28-39, 1985.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... HP s Softbench, and SGI s CodeVision, in visual approaches to reengineering such as the Rigi system [16] in data structure display [17] and in abstract displays such as Seesoft [5] or execution murals [9] The various efforts at algorithm animation represent a second approach to this problem [2,3,12,25,32]. These approaches are generally useful for small scale examples, but do not scale up. FIGURE 1. Defining the information to visualize. Another category of software visualizations deal with understanding performance. These include displays for sequential programs such as that provided by Purify ....

Marc H. Brown and Robert Sedgewick, "Techniques for algorithm animation," IEEE Software Vol. 2(1) pp. 28-39 (1985).

....been realized so far, where a tool is said to be live when run time and visualization time are considered synonymous, i.e. the user may interact with the visualization as the program is running. In the following we will briefly describe three of them. ZEus [2] the latest evolution of B LS [5, 6, 1], is constructed on the idea of interesting events that must be annotated by the visualizer in the code. This implies that the visualizer must know very well the code, but, at the same time, it allows to customize the visualization according to the effective necessities of the user. The two most ....

Brown, M.H. and Sedgewick, R. (1985), "Techniques for Algorithm Animation", IEEE S'oftwarc, 2:28 39.

....is running. In our summary we do not consider algorithm animation systems over the WEB although, in the last few years, the interest in this topic has grown a lot. We refer the interested reader to the corresponding bibliographical items [1, 2, 7, 14, 16] Zeus [4] the latest evolution of Balsa [3, 8, 9], is constructed according to the imperative style (see Section 4) and is based on the idea of interesting events that must be annotated by the visualizer in the code. This allows the user to customize the visualization according to his her effective necessities. At the same time, however, the ....

M.H. Brown and R. Sedgewick. Techniques for Algorithm Animation. IEEE 5'oftware, 2:28 39, 1985.

....execution, and controlling the visualization display. These techniques help in exploring the data and computations, possibly identifying patterns, trends, or errors. 2. Previous Work Extensive research has already been done in developing techniques for visually representing data on serial (Balsa [Brown85]) and concurrent systems (Maritxu [Zabal92] IVE [Fried92] Prism [Sista92] Viscon [Erbac97] Interaction issues have been given almost no attention. This is particularly true when considering advanced interaction techniques such as steering. Interactive computational steering is a technique ....

M. H. Brown and R. Sedgewick, "Techniques for Algorithm Animation," IEEE Software, Vol. 2, No. 1, 1985, pp. 28-39.

....produce an effect that is reliable enough to detect. However, the results of this experiment would appear to have important practical implications. Using conventional ( high fidelity ) AV technology to prepare visualizations for classroom use is notoriously difficult and timeconsuming (see, e.g. [3]) In contrast, having students construct their own low fidelity visualizations using art supplies is cheap, easy, and requires a relatively small investment of time on the part of instructors. Thus, instructors looking for a low overhead way to incorporate AV technology into their curricula can ....

Brown, M. H., & Sedgewick, R. "Techniques for algorithm animation," IEEE Software, vol. 2, 1985, pp. 28-39.

.... the Brown University Algorithm Simulator and Animator (BALSA) Brown84] BALSA was more than a research prototype, it 5 evolved from a principled design and was in production use for years both as a teaching tool used by hundreds of undergraduates and as an aid to algorithm design and analysis [Brown85]. BALSA itself was written in C but the algorithms that it animated were usually coded in Pascal. It supported multiple simultaneous views of each running algorithm and it was the first system that could show algorithms racing with each other on the same display. The contents of each view window ....

Brown M.H., Sedgewick R., Techniques for Algorithm Animation, IEEE Software, Vol. 2(1), pp. 28-39

....the standard motivation behind algorithm animation systems. The algorithm animation in Grrr is entirely restricted to graph highlighting and movement, whereas many dedicated animation systems have facilities for more abstract representation, using extra graphics and shading to aid visualisation [2,3,12,20]. This type of animation is not easy to define with the graph rewriting described in this paper. However, we note that several systems allow similar types of animation to the graph oriented approach provided in Grrr, e.g. 6,9,10,13] so we feel we are justified in restricting our system. We must ....

Brown M.H and Sedgewick R.: Techniques for Algorithm Animation. IEEE Software 2,1 (1985) 28-39.

....for program expression, but it demonstrated some of the ambitions of equal opportunity through its interactive connections between program elements and documentation. It was intended that facilities for dynamically animating the connections would be implemented in further work. Balsa 3 [2] supported multiple views of program execution, but not of the program itself. Animated graphics revealed the execution of algorithms, and multiple algorithms could be 3 Brown University Algorithm Simulator and Animator. 14 run concurrently to reveal their comparative performance. Balsa was an ....

MH Brown and R Sedgewick. Techniques for algorithm animation. IEEE Computer, 2(1):28--39, 1985.

....can use to test and build their understanding. There are three types of active educational systems. Firstly, interactive simulation and exploration environments let students explore the effects of changing properties within an interactive space. For example, animations of algorithm execution (see Brown and Sedgewick (1985) for an early example) allow students to explore the algorithm s behaviour by changing data and parameter values and observing the resultant behaviour. Secondly, intelligent tutoring systems (Sleeman and Brown 1982) attempt to model the student s understanding of a problem domain, and then tailor ....

Brown, M. and Sedgewick, R. 1985, `Techniques for algorithm animation', IEEE Computer 2(1), 28--39.

....diagrams are one way of communicating the flow of control through computer programs. These have been automated and animated within GUIs to display the inner workings of programs and are useful as both a software design tool and a documentation device (Nievergelt 1980; Clark and Robinson 1983; Brown and Sedgewick1984, 1985; Reiss 1985; Reiss, Golin, and Rubin 1986; Levien 1986; Hughs and Moshell 1986; London and Duisberg 1985) The data flow diagram has been referred to in GIS as the Cartographic Model (Tomlin and Berry 1979) and Graphic Map Algebra (Kirby and Pazner 1990) Lanter (1989, 1991) implemented ....

Brown, M.H. and R. Sedgewick 1985. "Techniques for Algorithm Animation", IEEE Software 2(l), pp.28-39.

....tuned to provide the types of graphics and animation one usually encounters in software visualization and algorithm animation systems. Over time these toolkits have evolved to be quite sophisticated graphics systems. The early Balsa environments provided black and white images in multiple views (Brown Sedgewick 1985); Animus provided temporal constraints in a Smalltalk based environment (Duisberg 1986) Tango added color and smooth animation primitives (Stasko 1990) Zeus added sound in a general object oriented framework (Brown Hershberger 1992) Polka 3D examined the use of 3D for software visualization ....

Brown, M. H. & Sedgewick, R. (1985), `Techniques for algorithm animation', IEEE Software 2(1), 28--39.

....is most appropriate for the programmer. He can specify this for each interaction between (virtual) processes by associating during program development a visualisation tag with each graphical connection. This way, complex or huge data sets can be examined easily. Similar capabilities are offered by [14][15] 16] 17] Our data visualisation tool differs from these however by its open approach and its ease of use. It offers a skeleton in which commercial or third party visualisation packages can be incorporated (see figure 5.b) TERMINAL shape . color red (term = waiting ) ....

M.H.Brown, R.Sedgewick, "Techniques for Algorithm Animation", IEEE SOFTWARE, Januari 1985, pp. 28-39.

....such that the available space is always completely covered. The program visualization system BALSA and the generic programming environments Pecan and Garden added then the important idea of multiple views for the same logical data structure to the concept of window based user interfaces. BALSA [9] gives its users extensive support for the construction of rather different types of graphical read only views for monitoring the execution of programs. Pecan [83] on the other hand, was probably the first programming environment which supported visualization and editing of programs via multiple ....

M. H. Brown and R. Sedgewick. Techniques for algorithm animation. IEEE Software, 2(1):28--39, 1985.

....of the algorithm. The end user can understand algorithms by following visually their step by step execution, otherwise a complex task if relying on the textual program alone. Extensive work has been done on algorithm animation and program visualization. See, e.g. the survey by Myers [34] and [7, 8, 9, 10, 13, 17, 20, 23, 39, 44, 45]. Algorithm animation is also a powerful tool to demonstrate new algorithms to others in a intuitive, often appealing fashion. Therefore, there is a strong pedagogical interest associated with interactive algorithm visualization, which can be used by students individually or in class ....

M. H. Brown and R. Sedgewick. Techniques for algorithm animation. IEEE Software, 2(1):28--39, 1985.

No context found.

Brown, M. H. & Sedgewick, R. (1985). "Techniques for Algorithm Animation." IEEE Software, 2(1):28-39.

....work looks at dynamic visualization of object oriented programs [10] This work uses a 2D visualization similar to our TimeMaps but provides compression techniques to allow browsing at different levels of detail. The various efforts at algorithm animation are a second approach to this problem [3,4,12,24,31]. Here the implementor crafts detailed displays that describe the underlying behavior of a specific program and its data. These systems generally let the user customize the display (with varying degrees of difficulty) and tie the display to the underlying algorithm. For example, Balsa and Tango ....

Marc H. Brown and Robert Sedgewick, "Techniques for algorithm animation," IEEE Software Vol. 2(1) pp. 28-39 (1985).

....proofs we present are new, to the best of our knowledge, while others are known but possibly under utilized. 1. 1 Related Work The trend towards visual ways to presenting important topics of DS A finds its inspiration in the work of Brown and Sedgwick on algorithm animation and visualization [4, 5, 11, 12], as well as that of Stasko [13] and others [2, 3] This work illustrates the power of visualization for communicating how algorithms work and how they transform their inputs. In addition, the authors include several additional visual ways of presenting ideas in DS A in their recent book [7] ....

M. H. Brown and R. Sedgewick. Techniques for algorithm animation. IEEE Software, 2(1):28--39, Jan. 1985.

No context found.

Marc H. Brown and Robert Sedgewick. Techniques for algorithm animation. IEEE Software, (1):28-39, 1985.

No context found.

M.H. Brown and R. Sedgewick, Techniques for Algorithm Animation, IEEE Software, Volume 2, Number 1, January 1985, pp. 28-39. Reprinted in [15].

No context found.

Brown, M. and Sedgewick, R., "Techniques for Algorithm Animation", IEEE Software, Vol. 2, No. 1, January 1985, pp. 28-39.

No context found.

Brown, M. H., and Sedgewick, R. Techniques for algorithm animation. IEEE Software 2, (January 1985), 28-39.

No context found.

M. H. Brown and R. Sedgewick, Techniques for Algorithm Animation,IEEE Software, Vol. 2, No. 1, 1985, pp. 28-39.

No context found.

M. H. Brown and R. Sedgewick, "Techniques for Algorithm Animation," IEEE Software, Vol. 2, No. 1, 1985, pp. 28-39.

No context found.

Brown, M. H. & Sedgewick, R. (1985). Techniques for Algorithm Animation. IEEE Software, 2(1): 28-39.

No context found.

Brown 85 Brown, M. and Sedgewick, R. Techniques for Algorithm Animation. IEEE Software, vol 2., no. 1, January 1985, pp 28-39.

First 50 documents  Next 50

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