The VIS-AD data model: Integrating metadata and polymorphic display with a scientific programming language

  • William L. Hibbard
  • Charles R. Dyer
  • Brian E. Paul
Papers: Data Models
Part of the Lecture Notes in Computer Science book series (LNCS, volume 871)


The VIS-AD data model integrates metadata about the precision of values, including missing data indicators and the way that arrays sample continuous functions, with the data objects of a scientific programming language. The data objects of this data model form a lattice, ordered by the precision with which they approximate mathematical objects. We define a similar lattice of displays and study visualization processes as functions from data lattices to display lattices. Such functions can be applied to visualize data objects of all data types and are thus polymorphic.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Bertin, J., 1983; Semiology of Graphics. W. J. Berg, Jr. University of Wisconsin Press.Google Scholar
  2. [2]
    Davey, B. A. and H. A. Priestly, 1990; Introduction to Lattices and Order. Cambridge University Press.Google Scholar
  3. [3]
    Gorlen, K. E., S. M. Orlow and P. S. Plexico, 1990; Data Abstraction and Object-Oriented Programming in C++. John Wiley & Sons.Google Scholar
  4. [4]
    Gunter, C. A. and Scott, D. S., 1990; Semantic domains. In the Handbook of Theoretical Computer Science, Vol. B., J. van Leeuwen ed., The MIT Press/Elsevier, 633–674.Google Scholar
  5. [5]
    Hibbard, W., C. Dyer and B. Paul, 1992; Display of scientific data structures for algorithm visualization. Visualization '92, Boston, IEEE, 139–146.Google Scholar
  6. [6]
    Hibbard, W., C. Dyer and B. Paul, 1993; A lattice theory of data display. Submitted to IEEE Visualization '94.Google Scholar
  7. [7]
    Hibbard, W. L., and C. R. Dyer, 1994; A lattice theory of data display. Tech. Rep. # 1226, Computer Sciences Department, University of Wisconsin-Madison. Also available as compressed postscript files by anonymous ftp from ( in the pub/lattice directory.Google Scholar
  8. [8]
    Mackinlay, J., 1986; Automating the design of graphical presentations of relational information; ACM Transactions on Graphics, 5(2), 110–141.Google Scholar
  9. [9]
    Mitchell, R., 1992; Abstract Data Types and Modula-2: a Worked Example of Design Using Data Abstraction. Prentice Hall.Google Scholar
  10. [10]
    Moore, R. E., 1966; Interval Analysis. Prentice Hall.Google Scholar
  11. [11]
    Robertson, P. K., R. A. Earnshaw, D. Thalman, M. Grave, J. Gallup and E.M. De Jong, 1994; Research issues in the foundations of visualization. Computer Graphics and Applications 14(2), 73–76.Google Scholar
  12. [12]
    Schmidt, D. A., 1986; Denotational Semantics. Wm.C.Brown.Google Scholar
  13. [13]
    Scott, D. S., 1971; The lattice of flow diagrams. In Symposium on Semantics of Algorithmic Languages, E. Engler. ed. Springer-Verlag, 311–366.Google Scholar
  14. [14]
    Scott, D. S., 1976; Data types as lattices. Siam J. Comput., 5(3), 522–587.Google Scholar
  15. [15]
    Scott, D. S., 1982; Lectures on a mathematical theory of computation, in: M. Broy and G. Schmidt, eds., Theoretical Foundations of Programming Methodology, NATO Advanced Study Institutes Series (Reidel, Dordrecht, 1982) 145–292.Google Scholar
  16. [16]
    Treinish, L. A., 1991; SIGGRAPH '90 workshop report: data structure and access software for scientific visualization. Computer Graphics 25(2), 104–118.Google Scholar
  17. [17]
    Wirsig, M., 1990; Algebraic specification. In the Handbook of Theoretical Computer Science, Vol. B., J. van Leeuwen ed., The MIT Press/Elsevier, 675–788.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • William L. Hibbard
    • 1
    • 2
  • Charles R. Dyer
    • 2
  • Brian E. Paul
    • 1
  1. 1.Space Science and Engineering CenterUniversity of WisconsinMadison
  2. 2.Computer Sciences DepartmentUniversity of WisconsinMadison

Personalised recommendations