A Survey of Data Structures for Interactive Graphics.
Compares methods of organizing data within a computer to permit many interactive computer graphic applications. A data structure is a collection of blocks of machine words (beads) within a subset of the computer's memory. A program for processing such a structure must be able to create and destroy beads and to reference data items (bit strings). The first ability is provided by LEAP'S associative-memory storage allocation system. The referencing ability furnished by several procedural languages enables the programmer to design structures. However, several predesigned ring structures are useful in interactive graphics--e.g., Sketchpad or CORAL. 53 pp. Ref. (LC)