Data structure for graphic information processing

The data structure requirements peculiar to the design of graphic data handling systems are discussed. The development is outlined as far as the ring structure, and explained in greater detail with an example from display programming. List, ring and branching structures (e.g. CORAL, ASP, APL) or contents-addressable structures (e.g. LEAP, DATAS), as examples of the various implementation possibilities are briefly described.