Title :
Visualization of geometric algorithms
Author :
Tal, Ayellet ; Dobkin, David
Author_Institution :
Dept. of Appl. Math. & Comput. Sci., Weizmann Inst. of Sci., Rehovot, Israel
fDate :
6/1/1995 12:00:00 AM
Abstract :
Investigates the visualization of geometric algorithms. We discuss how limiting the domain makes it possible to create a system that enables others to use it easily. Knowledge about the domain can be very helpful in building a system which automates large parts of the user´s task. A system can be designed to isolate the user from any concern about how 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. We also present a system, GASP (Geometric Animation System, Princeton), which implements this model. GASP allows quick generation of 3D 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 a variety of examples
Keywords :
computational geometry; computer animation; data visualisation; program debugging; visual programming; 3D geometric algorithm visualization; GASP; Geometric Animation System, Princeton; algorithm animation; computational geometry; domain knowledge; graphics; visual debugging facility; Animation; Buildings; Computational geometry; Computer science; Debugging; Graphics; Hardware; Helium; Videos; Visualization;
Journal_Title :
Visualization and Computer Graphics, IEEE Transactions on
DOI :
10.1109/2945.468401