Display of Scientific Data Structures for Algorithm Visualization

algorithms as networks of modules. The data flow architecture is popular because of the flexibility of mixing calculation modules with display modules, and because of its easy graphical user interface. However, data flow networks are not generally used for developing detailed algorithms. Current data flow implementations support finite sets of data structures; in order to support algorithm details they would need to support userdefinable, application-specific data structures. We present a technique for defining graphical depictions for all the data types defined in an algorithm. The ability to display arbitrary combinations of an algorithm's data objects in a common frame of reference, coupled with interactive control of algorithm execution, provides a powerful way to understand algorithm behavior. Type definitions are constrained so that all primitive values occurring in data objects are assigned scalar types. A graphical display, including user interaction with the display, is m...

• Type: Conference
• Year: 1992
• Where: VISUALIZATION
• Authors: William L. Hibbard, Charles R. Dyer, Brian E. Paul
• Keywords: Data Flow, Data Objects, Data Types, Visualization, VISUALIZATION 1992