Abstract
The difference between displaying networks with 100–1000 nodes and displaying ones with 10,000–100,000 nodes is not merely quantitative, it is qualitative. Layout algorithms suitable for the former are too slow for the latter, requiring new algorithms or modified (often relaxed) versions of existing algorithms to be invented. The density of nodes and edges displayed per inch of screen real estate requires special visual techniques to filter the graphs and focus attention. A system for investigating and exploring such large, complex data sets needs to be able to display both graph structure and node and edge attributes so that patterns and information hidden in the data can be seen. We describe a tool that addresses these needs, the NicheWorks tool. We describe and comment on the available layout algorithms and the linked views system, and detail an example of the use of NicheWorks for analyzing web sites.
Chapter PDF
Similar content being viewed by others
Keywords
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.
References
Ba94 Di Battista, G., Eades, P., Tamassia, R. and Tollis, I. (1994) Algorithms For Drawing Graphs: An Annotated Bibliography Computational Geometry (1994) 235–282
Be83 Bertin, J. (1983) Semiology of Graphics University of Wisconsin Press
BuFa85 Burden, R. and Faires, J.D. (1985) Numerical Analysis (3rd ed.) PWS publishers, Duxbury Press, Boston MA 02116
CIMc84 Cleveland, W. S. and 79 pp 531–554
CIMc88 Cleveland, W. S. and McGill, R., eds. (1988) Dynamic Graphics for Statistics Wadsworth & Brooks, California
Co96 Coleman, M. K. (1996) Aesthetics-Based Graph Layout For Human Consumption Software Practice And Experience, 1996, Vol 26(12), Pp 1415–1438
DaHa96 Davidson, R. and Harel, D. (1996) Drawing Graphs Nicely Using Simulated Annealing ACM Transactions On Graphics, Vol 15, No. 4, 1996, Pp 301–331
EiWi95 Eick, S. G. and Wills, G. (1995) High Interaction Graphics European Journal of Operations Research #81 (1995) pp. 445–459
Ei94 Eick, S.G. (1994) Graphically displaying text Journal of Computational and Graphical Statistics, 3(2), pp. 127–142
EiWi93 Eick, S. and Wills, G. (93) Navigating Large Networks with Hierarchies Proceedings of IEEE Visualization '93
Fi94 Fielding, R. (1994) Maintaining Distributed Hypertext Infostructures: Welcome to MOMspider's Web Proceedings of 1st intl. conf. on the World-Wide-Web, Geneva
NiHi93 Nievergelt, J. and Hirichs, K. (1993) Algorithms and Data Structures with Applications to Graphics and Geometry Prentice Hall, Englewood Cliffs, NJ 07632
Ro91 Robertson, G. G., Mackinlay J. D., and Card, S. K. Cone Trees: Animated 3D Visualizations of Hierarchical Information. In Proceedings of the ACM Conference on Human Factors in Computing Systems (CHI'91), pp. 189–194. ACM Press, 1991.
Tu83 Tufte, E.R. (1983) The Visual Display of Quantitative Information Graphics Press, PO Box 430, Cheshire, Connecticut 06410
Tu90 Tufte, E.R. (1990) Envisaging Information Graphics Press, PO Box 430, Cheshire, Connecticut 06410
Wi97 Wills (1997) Visual Exploration of Large Structured data Sets New Techniques and Technologies for Statistics II, IOS Press, Washington DC
Wi96 Wills, G. J. (1996) Selection: 524,288 Ways to say “This is Interesting” Proceedings of IEEE InfoVis '96, pp 54–60
Wi90 Wills, G. Unwin, A., Haslett, J. and Craig, P. (1990) Dynamic Interactive Graphics For Spatially Referenced Data Softstat '89 Fortschritte Der Statistik-Software 2, Gustav Fischer Verlag, Stuttgart, Pp 278–287
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wills, G.J. (1997). NicheWorks — Interactive visualization of very large graphs. In: DiBattista, G. (eds) Graph Drawing. GD 1997. Lecture Notes in Computer Science, vol 1353. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63938-1_85
Download citation
DOI: https://doi.org/10.1007/3-540-63938-1_85
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63938-1
Online ISBN: 978-3-540-69674-2
eBook Packages: Springer Book Archive