A simple algorithm for drawing large graphs on small screens

13Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Viewing a large graph in limited display space has traditionally been accomplished using either reduced scale rendering of the graph or by attaching scrollbars to a view window which shows only a small portion of the entire graph. Recent work, however, has concentrated on integrating a locally detailed view with a globally scaled view. We present an algorithm for constructing a view which smoothly integrates local detail and global context in a single view window and describe user interaction with such a display.

Cite

CITATION STYLE

APA

Kaugars, K., Reinfelds, J., & Brazma, A. (1995). A simple algorithm for drawing large graphs on small screens. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 894, pp. 278–281). Springer Verlag. https://doi.org/10.1007/3-540-58950-3_382

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free