Animation and visualization of geometric algorithms
Ayellet Tal · 1994
This thesis investigates the animation and visualization of algorithms in a well-defined domain. As a case-study it focuses on computational geometry. Algorithm animation and visualization can help researchers to explore new algorithms, assist programmers in the implementation phase, and aid students in experimenting with and understanding computer algorithms. Despite their great potential, algorithm animations are not as common as they should be. This is because even though a picture is worth a thousand words, the difficulty of creating pictures, let alone a whole animation, is often too great. In this thesis we discuss limiting the domain makes it possible to create an animation system that enables others to use it easily. Knowledge about the domain can be very helpful in building an animation system which automates large parts of the user's task. A system can be designed to isolate the user from any concern about graphics is done. The application need only specify what happens and need not be concerned with how to make it happen on the screen. We develop a conceptual model and a framework for experimenting with it. This thesis also presents a system, GASP (Geometric Animation System, Princeton), which implements this model. GASP is designed for creating animations for one specific domain, computational geometry. GASP allows quick generation of three-dimensional geometric algorithm visualizations, even for highly complex algorithms. It also provides a visual debugging facility for geometric computing. We show the utility of GASP by presenting excerpts from a videotape.