Graph Drawing in Motion II-Reference-Cited by-同舟云学术

Graph Drawing in Motion II

Published:2002 Issue: Volume: Page:220-231
ISSN:0302-9743
Container-title:Graph Drawing
language:
Short-container-title:

Author:

Friedrich Carsten,Houle Michael E.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-45848-4_18

Reference14 articles.

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.

Cited by 15 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Inverse Markov Process Based Constrained Dynamic Graph Layout;Journal of Computer Science and Technology;2021-05-31

2. A Taxonomy and Survey of Dynamic Graph Visualization;Computer Graphics Forum;2016-01-25

3. Fast filtering and animation of large dynamic networks;EPJ Data Science;2014-10-25

4. Morphing orthogonal planar graph drawings;ACM Transactions on Algorithms;2013-09

5. How Do You Connect Moving Dots? Insights from User Studies on Dynamic Network Visualizations;Handbook of Human Centric Visualization;2013-06-25