Non-euclidean spring embedders

Proceedings - IEEE Symposium on Information Visualization, INFO VIS

Volumn , Issue , 2004, Pages 207-214

  Kobourov, Stephen G ^a   Wampler, Kevin ^a  

^a UNIVERSITY OF ARIZONA   (United States)

Author keywords

Force directed algorithms; Graph drawing; Hyperbolic space; Information visualization; Non Euclidean geometry; Spherical space; Spring embedders

Indexed keywords

FORCE-DIRECTED ALGORITHMS; GRAPH DRAWING; HYPERBOLIC SPACE; INFORMATION VISUALIZATION; NON-EUCLEAN GEOMETRY; SPHERICAL SPACE; SPRING EMBEDDERS;

ALGORITHMS; COMPUTATIONAL METHODS; CONSTRAINT THEORY; FUNCTIONS; GEOMETRY; INFORMATION ANALYSIS; VISUALIZATION;

GRAPH THEORY;

EID: 16244398871     PISSN: 1522404X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFVIS.2004.49     Document Type: Conference Paper

References (16)

1. P. Eades. A heuristic for graph drawing. Congressus Numerantium, 42:149-160, 1984.
2. D. Eppstein. Hyperbolic geometry, Möbius transformations, and geometric optimization. In MSRI Introductory Workshop on Discrete and Computational Geometry, 2003.
3. C. Erten, P. J. Harding, S. G. Kobourov, K. Wampler, and G. Yee. GraphAEL: Graph animations with evolving layouts. In 11th Symposium on Graph Drawing, pages 98-110, 2003.
4. T. M. J. Fruchterman and E. M. Reingold. Graph drawing by force-directed placement. Software - Practice and Experience, 21(11):1129-1164, 1991.
5. P. Gajer, M. T. Goodrich, and S. G. Kobourov. A multi-dimensional approach to force-directed layouts of large graphs. Computational Geometry: Theory and Applications, 29(1):3-18, 2004.
6. C. Gotsman, X. Gu, and A. Sheffer. Fundamentals of spherical parameterization for 3D meshes. In ACM Transactions on Graphics, 28, pages 358-363, 2003.
7. D. Harel and Y. Koren. A fast multi-scale method for drawing large graphs. Journal of graph algorithms and applications, 6:179-202, 2002.
8. T. Kamada and S. Kawai. An algorithm for drawing general undirected graphs. Information Processing Letters, 31(1):7-15, Apr. 1989.
9. Y. Koren, L. Carmel, and D. Harel. ACE: A fast multiscale eigenvector computation for drawing huge graphs. In Proceedings of IEEE Symposium on Information Visualization, pages 123-144, 2002.
10. J. Lamping, R. Rao, and P. Pirolli. A focus+context technique based on hyperbolic geometry for visualizing large hierarchies. In Proceedings of Computer Human Interaction, pages 401-408. ACM, 1995.
11. T. Munzner. H3: Laying out large directed graphs in 3D hyperbolic space. In L. Lavagno and W. Reisig, editors, Proceedings of IEEE Symposium on Information Visualization, pages 2-10, 1997.
12. T. Munzner. Drawing large graphs with h3viewer and site manager. In 6th Symposium on Graph Drawing, pages 384-393, 1998.
13. T. Munzner and P. Burchard. Visualizing the structure of the World Wide Web in 3D hyperbolic space. In Symposium on the Virtual Reality Modeling Language, pages 33-38, 1996.
14. J. Ontrup and H. Ritter. Hyperbolic self-organizing maps for semantic navigation. In Advances in Neural Information Processing Systems 14, pages 1417-1424, 2001.
15. D. I. Ostry. Some three-dimensional graph drawing algorithms. Master's thesis, University of Newcastle, Australia, 1996.
16. H. Ritter. Self-organizing maps on non-euclidean spaces. In S. Oja, E. & Kaski, editor, Kohonen Maps, pages 97-110. Elsevier, Amsterdam, 1999.