An area organized data structure for interactive graphics

  • Authors:
  • J. F. Jarvis

  • Affiliations:
  • Bell Laboratories, Holmdel, New Jersey

  • Venue:
  • SIGGRAPH '75 Proceedings of the 2nd annual conference on Computer graphics and interactive techniques
  • Year:
  • 1975

Quantified Score

Hi-index 0.00

Visualization

Abstract

A problem common to many applications of interactive graphics is the response time of the system to a user input. This response time increases in severity as the quantity of data being manipulated increases. Programs for the design of integrated circuit masks are good examples of graphics systems where large quantities of data are processed. This response time problem is particularly severe for the windowing operation and other algorithms that must iteratively search the graphical data base.