Logo

Login | Create Account

Encoding Presentation Emphasis Algorithms for Graphs

Noik, Emanuel G. (1995) Encoding Presentation Emphasis Algorithms for Graphs. [Conference Paper]

Full text not available from this repository.

Abstract

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 described an abstract space of techniques and identified common shortcomings. Here we outline a highlevel 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 memebership and priority.

Item Type:Conference Paper
Classifications:M Methods > M.999 Others
S Software and Systems > S.999 Others
ID Code:254
Deposited By:Selbach, Anna
Deposited On:02 Dec 2004
Last Modified:18 Sep 2008 13:08

Repository Staff Only: item control page

References

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.

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 ftp. cs. brown. edu:pub/papers/compgeo/.

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.

R.W. Floyd. Algorithm 97: Shortest path. Communications of the ACM, 5(6):345, 1962.

G.W. Furnas. Generalized fisheye views. In ACM CHI '86, pages 16-23, Boston, MA, Apr. 1986. ACM.

T.R. Henry and S.E. Hudson. Interactive graph layout. In ACM UIST '91, pages 55-64. ACM, 1991.

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.

E.G. Noik. Graphite: A suite of hygraph visualization utilies. 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.

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.

E.G. Noik. Encoding Presentation Emphasis Algorithms for Graphs. PhD thesis, Dept. of Comp. Sci., U. of Toronto, in preparation.

S.P. Reiss. A framework for abstarct 3d visualization. In VL '93: IEEE Symposium on Visual Languages, pages 108-115, Bergen, Norway, Aug. 1993.

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.

E.R. Tufte. Envisioning Information. Graphics Press, P.O. Box 430, Cheshire, Connecticut, 06410, 1990.

J.D. Ullman. Principles of Database and Knowledge-base Sysrems, volume 1. Computer Science Press, 1803 Research Boulevard, Rockville, MD, 20850, 1988.

GDEA is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.