A SURVEY OF DATA STRUCTURES FOR INTERACTIVE GRAPHICS

Abstract

The paper 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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Apr 01, 1970
Accession Number
AD0706706

Entities

People

  • J. A. Hamilton

Organizations

  • RAND Corporation

Tags

Communities of Interest

  • C4I

DTIC Thesaurus Topics

  • Application Software
  • Associative Processing
  • Computer Graphics
  • Computer Programming
  • Computers
  • Content Addressable Memory
  • Efficiency
  • Graphics
  • Information Processing
  • Information Retrieval
  • Information Systems
  • Instructions
  • Interactive Graphics
  • Language
  • Management Information Systems
  • Programming Languages

Fields of Study

  • Computer science

Readers

  • Computational Linguistics
  • Computer Science.