Encoding presentation emphasis algorithms for graphs

  • Emanuel G. Noik
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 894)


While graphs can effectively visualize one or more relations on a set of elements, drawings of large graphs can be difficult to understand. As such, many presentation emphasis techniques for visualizing graphs such as fisheye views have been proposed. A recent survey paper [9] described an abstract space of techniques and identified common shortcomings. Here we outline a high-level language that addresses several of these limitations; the language is used to: 1) select subsets of graph elements; 2) compute a real-valued priority for each element; and, 3) encode presentation strategies that automatically emphasize elements based on subset membership and priority.


Relational Algebra Graphical Attribute Graph Layout Line Style Containment Relation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    M.P. Consens, F. Ch. Eigler, M.Z. Hasan, A.O. Mendelzon, E.G. Noik, A.G. Ryman, and D. Vista. Architecture and applications of the Hy+ visualization system. IBM Systems Journal, 33(3):458–476, Aug. 1994.Google Scholar
  2. 2.
    G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Algorithms for drawing graphs: an annotated bibliography. Comput. Geom. Theory Appl., to appear. Preprint avail. by anon. ftp from Scholar
  3. 3.
    K.M. Fairchild, S.E. Poltrock, and G.W. Furnas. Semnet: Three-dimensional graphic representations of large knowledge bases. In R. Guindon, editor, Cognitive Science and its Applications for Human-Computer Interaction, pages 201–233. Lawrence Erlbaum Associates, 1988.Google Scholar
  4. 4.
    R.W. Floyd. Algorithm 97: Shortestpath. Communications of the ACM, 5(6):345, 1962.Google Scholar
  5. 5.
    G.W. Furnas. Generalized fisheye views. In ACM CHI '86, pages 16–23, Boston, MA, Apr. 1986. ACM.Google Scholar
  6. 6.
    T.R. Henry and S.E. Hudson. Interactive graph layout In ACM UIST '91, pages 55–64. ACM, 1991.Google Scholar
  7. 7.
    B. Johnson and B. Shneiderman. Tree-maps: A space-filling approach to the visualization of hierarchical information structures. In IEEE Visualization '91, pages 284–291, San Diego, CA, Oct. 1991.Google Scholar
  8. 8.
    E.G. Noik. Graphite: A suite of hygraph visualization utilities. In A. O. Mendelzon, editor, Declarative database visualization: recent papers from the Hy+/GraphLog project, pages 108–126. Tech. rep. CSRI-285, U. of Toronto, Jul. 1993.Google Scholar
  9. 9.
    E.G. Noik. A space of presentation emphasis techniques for visualizing graphs. In GI '94: Graphics Interface 1994, pages 225–234, Banff, AL, Canada, May. 1994.Google Scholar
  10. 10.
    E.G. Noik. Encoding Presentation Emphasis Algorithms for Graphs. PhD thesis, Dept. of Comp. Sci., U. of Toronto, in preparation.Google Scholar
  11. 11.
    S.P. Reiss. A framework for abstract 3d visualization. In VL '93: IEEE Symposium on Visual Languages, pages 108–115, Bergen, Norway, Aug. 1993.Google Scholar
  12. 12.
    D. Schaffer, Z. Zuo, L. Bartram, J. Dill, S. Dubs, S. Greenberg, and M. Roseman. Comparing fisheye and full-zoom techniques for navigation of hierarchically clustered networks. In Graphics Interface '93, pages 87–96, May. 1993.Google Scholar
  13. 13.
    E.R. Tufte. Envisioning Information. Graphics Press, P.O. Box 430, Cheshire, Connecticut, 06410, 1990.Google Scholar
  14. 14.
    J.D. Ullman. Principles of Database and Knowledge-base Systems, volume 1. Computer Science Press, 1803 Research Boulevard, Rockville, MD, 20850, 1988.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Emanuel G. Noik
    • 1
  1. 1.CSRIUniversity of TorontoTorontoCanada

Personalised recommendations