Skip to main content
Log in

Some implementation issues relating to data structures for interactive graphics

  • Published:
International Journal of Computer & Information Sciences Aims and scope Submit manuscript

Abstract

This is a tutorial paper describing the relationship between the data structure and the rest of an interactive graphics system. The distinction between data structures and storage structures is emphasized, as is the problem of data structure segmentation. The implementation of typical graphical applications is described, along with analysis of various tradeoff decisions. Finally, some high-level data structure specification languages are discussed.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Marshall D. Abrams, “Data structures for computer graphics,”Proc. Symp. on Data Structures in Programming Languages, Gainesville, Florida, SIGPLAN Notices, February 1971.

  2. P. W. Abrahamset al., “The LISP programming language and system,”Proc. AFIPS 1966 FJCC, Vol. 29 (Spartan Books, New York), pp. 661–676.

  3. W. L. Ash and E. H. Sibley, “TRAMP—An interpretive associative processor with deductive capabilities,”Proc. ACM 23rd Nat. Conf., 1968 (Brandon Systems Press, Princeton, N. J.), pp. 143–156.

    Google Scholar 

  4. R. D. Bergeron, J. D. Gannon, D. P. Shecter, F. W. Tompa, and A. van Dam, “Systems programming languages,”Advances in Computers 12 (Academic Press, New York, 1972).

    Google Scholar 

  5. D. G. Bobrow and D. L. Murphy, “Structure of a LISP system using two-level storage,”Comm. ACM 10 (3): 155–159 (1967).

    Google Scholar 

  6. S. H. Chasen, “Applications of man-computer graphics,”Computer Graphics 70 (Brunei University, April 1970).

  7. D. L. Childs, “Description of a set-theoretic data structure,”Proc. AFIPS 1968 FJCC, Vol. 33 (Thompson Book Co., Washington, D.C.), pp. 557–574.

  8. D. L. Childs, “Development of a set-theoretic data structure,” Technical report, Set-Theoretic Information Systems, December 1970.

  9. E. F. Codd, “A relational model for large shared data banks,”Comm. ACM 13(6): 377–387 (1970).

    Google Scholar 

  10. E. F. Codd, “A relational model for large shared data banks,”Comm. ACM 13(6): 377–387 (1970).

    Google Scholar 

  11. M. F. C. Crick and A. J. Symonds, “A software associative memory for complex data structures,” IBM Cambridge Scientific Center Technical Report G320-2060, August 1970.

  12. P. Denning, “Virtual memory,”Computing Surveys 2: 3 (1970).

    Google Scholar 

  13. M. D'Imperio, “Data structures and their representation in storage,” inAnnual Review in Automatic Programming 5 (Pergamon Press, New York, 1969).

    Google Scholar 

  14. G. G. Dodd, “APL—A language for associative data handling in PL/I,”Proc. AFIPS 1966 FJCC, Vol. 29 (Spartan Books, New York), pp. 677–684.

  15. Evans & Sutherland Computer Corp. sales literature, May 1969.

  16. Jerome A. Feldman, “A formal semantics for computer-oriented languages,” Ph.D. dissertation, Carnegie Institute of Technology, 1964.

  17. C. G. Feldman (ed.), D. T. Ross, J. E. Rodriguez,et al., “AED-Oprogrammers' guide,” Massachusetts Institute of Technology, Cambridge, 1969.

    Google Scholar 

  18. J. C. Gray, “Compound data structure for computer-aided design—A survey,”Proc. ACM 22nd Nat. Conf., 1967 (AFIPS Press, Montvale, N. J.), pp. 355–365.

    Google Scholar 

  19. IBM System/360 PL/I reference manual, form C28-6594.

  20. R. A. Kirsch, “Computer interpretation of English text and picture patterns,”Trans. IEEE Electron. Comput. 13(4): 363–376 (1964).

    Google Scholar 

  21. K. C. Knowlton, “A programmer's description of L6,”Comm. ACM 9(8): 616–625 (1964).

    Google Scholar 

  22. D. E. Knuth,The Art of Computer Programming, Vol. 1 (Addison-Wesley, Reading, Mass.), 1968.

    Google Scholar 

  23. C. A. Lang and J. C. Gray, “ASP—A ring implemented associative structure package,”Comm. ACM 11(8):550–555 (1968).

    Google Scholar 

  24. W. F. Miller and A. C. Shaw, “Linguistic methods in picture processing—A survey,”Proc. AFIPS 1968 FJCC, Vol. 33, part 1 (AFIPS Press, Montvale, N. J.), pp. 279–290.

  25. M. Minsky, “Steps toward artificial intelligence,”Proc. IRE 49(1): 8–30 (1961).

    Google Scholar 

  26. R. Narasimhan, “Syntax-directed interpretation of classes of pictures,”Comm. ACM 9(3):166–173 (1966).

    Google Scholar 

  27. R. Narasimhan, “Labeling schemata and syntactic descriptions of pictures,”Information and Control 7:151–179 (1964).

    Google Scholar 

  28. A. Newell, J. Earley, and F. Haney, “*1 Manual,” Department of Computer Science, Carnegie-Mellon University, 1967.

  29. A. Newell and F. M. Tonge, “An introduction to information processing language-V,”Comm. ACM 3(4):205–211 (1960).

    Google Scholar 

  30. W. M. Newman, “A system for interactive graphical programming,”Proc. AFIPS 1968 SJCC, Vol. 32 (AFIPS Press, Montvale, N. J.), pp. 47–54.

  31. W. H. Ninke, “A satellite display console system for a multiaccess central computer,”Proc. IFIPS (1968), E65–E71.

  32. B. Randell, “A note on storage fragmentation and program segmentation,”Comm. ACM 12(7): (1969).

  33. L. G. Roberts, “Graphical communication and control languages,”Second Congress on the Information System Sciences (Spartan Books, New York, 1965).

    Google Scholar 

  34. P. D. Rovner and J. A. Feldman, “The LEAP language and data structure,”Proc. IFIP Cong. 1968, Vol. 1 (North-Holland, Amsterdam, pp. 579–585).

    Google Scholar 

  35. P. D. Rovner and D. A. Henderson, Jr., “On the implementation of AMBIT/G: A graphical programming language,” AFIPS/ACM Int. Conf. on Artificial Intelligence, Washington, D. C., May 1969.

  36. A. C. Shaw, “Passing of graph-representable pictures,”J. ACM 17(3):453–481 (1970).

    Google Scholar 

  37. C. M. Strauss, “3DPDP—A three-dimensional piping design program,” Ph.D. dissertation, Brown University, 1969.

  38. I. E. Sutherland, “SKETCHPAD: a Man-machine graphical communication system,”Proc. AFIPS 1963 SJCC, Vol. 23 (Spartan Books, New York), pp. 329–346.

  39. I. E. Sutherland, Tech. Rep. No. 296, Lincoln Labs, M.I.T., Lexington, Mass., 1963.

    Google Scholar 

  40. Robert F. Sproull and I. E. Sutherland, “A clipping divider,”AFIPS Proc. FJCC 33, 765 (1968).

    Google Scholar 

  41. C. S. Thorell and W. O. Poteat, Jr., “A basic list-oriented information structures system (BLISS),” MS. dissertation, U. S. Naval Postgraduate School, 1970.

  42. A. van Dam, “Computer graphics and its applications,” Proposal to the National Science Foundation (Office of Computing Activities), August 1970.

  43. A. van Dam and F. Tompa, “Software data paging and segmentation for complex systems,”Information Processing Letters (North-Holland, Amsterdam, 1972).

    Google Scholar 

  44. A. van Dam and R. D. Bergeon, “Software capabilities of the Adage graphics terminals,”Computer Graphics 70 (Brunel University, April 1970).

  45. A. van Dam and D. Evans, “Data structure programming system,” IFIP Congress, Booklet G, 1968.

  46. A. van Dam, “Microprogramming for computer graphics,” ACM, SIGMICRO Bulletin, April 1972.

  47. Vector General, Graphics Display System Reference Manual, Canoga Park, Calif., July 1971.

  48. J. Weizenbaum, “Symmetric List processor,”Comm. ACM 6(9) (1963).

Download references

Author information

Authors and Affiliations

Authors

Additional information

This research was partially sponsored by the National Science Foundation, grant number GJ-28401X.

Rights and permissions

Reprints and permissions

About this article

Cite this article

van Dam, A. Some implementation issues relating to data structures for interactive graphics. International Journal of Computer and Information Sciences 1, 287–314 (1972). https://doi.org/10.1007/BF00987250

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00987250

Keywords

Navigation