Graph drawing in motion II

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2265 LNCS, Issue , 2002, Pages 220-231

  Friedrich, Carsten ^a   Houle, Michael E ^b  

^a UNIVERSITY OF SYDNEY   (Australia)

^b IBM RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ANIMATION; COGNITIVE SYSTEMS;

GRAPH DRAWING; MENTAL MAPS;

DRAWING (GRAPHICS);

EID: 84867483720     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45848-4_18     Document Type: Conference Paper

References (15)

1. M. S. Aldenderfer and R. K. Blashfield. Cluster Analysis. Sage Publications, Beverly Hills, USA, 1984.
2. Giuseppe Di Battista, Peter Eades, Roberto Tamassia, and Ioannis G. Tollis. Graph drawing: algorithms for the visualization of graphs. Prentice-Hall Inc., 1999.
3. F. Bertault. A force-directed algorithm that preserves edge-crossing properties. Information Processing Letters, 74(1-2):7-13, 2000.
4. Mark de Berg, Marc van Kreveld, and Mark Overmars. Computational Geometry: Algorithms and Applications, chapter 9, pages 188-200. Springer Verlag, 2nd edition, 1998.
5. C. Friedrich. The ffGraph library. Technical Report 9520, Universität Passau, Dezember 1995.
6. Carsten Friedrich and Peter Eades. The marey graph animation tool demo. In Proc. of the 8th Internat. Symposium on Graph Drawing (GD'2000), pages 396-406, 2000.
7. Carsten Friedrich and Peter Eades. Graph drawing in motion. Submitted to Journal of Graph Algorithms and Applications, 2001.
8. R. P. Haining. Spatial Data Analysis in the Social and Enviromental Sciences. Cambridge University Press, UK, 1990.
9. http://www.mpisb.mpg.de/AGD/. The AGD-Library User Manual Version 1.1.2. Max-Planck-Institut für Informatik.
10. Mao Lin Huang and Peter Eades. A fully animated interactive system for clustering and navigating huge graphs. In Sue H. Whitesides, editor, Proc. of the 6th Internat. Symposium on Graph Drawing (GD'98), pages 374-383, 1998.
11. L. Kaufman and P. J. Rousseeuw. Finding Groups in Data: An Introduction to Cluster Analysis. John Wiley & Sons, NY, USA, 1990.
12. J. MacQueen. Some methods for classification and analysis of multivariate observations. In L. Le Cam, and J. Neyman, editor, 5th Berkley Symposium on Mathematical Statistics and Probability, pages 281-297, 1967.
13. G. A. Miller. The magical number seven, plus or minus two: some limits on our capacity for processing information. The Psychological Review, pages 63:81-97, 1956.
14. U. Fayyad P. S. Bradley and C. Reina. Scaling clustering algorithms to large databases. In R. Agrawal and P. Stolorz, editor, Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining, pages 9-15, 1998.
15. C. Reina U. Fayyad and P. S. Bradley. Initialization of iterative refinement clustering algorithms. In R. Agrawal and P. Stolorz, editor, Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining, pages 194-198, 1998.