An algorithm for drawing general undirected graphs
Information Processing Letters
Graph drawing by force-directed placement
Software—Practice & Experience
Visualizing the structure of the World Wide Web in 3D hyperbolic space
VRML '95 Proceedings of the first symposium on Virtual reality modeling language
A focus+context technique based on hyperbolic geometry for visualizing large hierarchies
CHI '95 Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
Drawing graphs: methods and models
Drawing graphs: methods and models
Graph Drawing: Algorithms for the Visualization of Graphs
Graph Drawing: Algorithms for the Visualization of Graphs
Graph Visualization and Navigation in Information Visualization: A Survey
IEEE Transactions on Visualization and Computer Graphics
Drawing Large Graphs with H3Viewer and Site Manager
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
H3: laying out large directed graphs in 3D hyperbolic space
INFOVIS '97 Proceedings of the 1997 IEEE Symposium on Information Visualization (InfoVis '97)
ACE: A Fast Multiscale Eigenvectors Computation for Drawing Huge Graphs
INFOVIS '02 Proceedings of the IEEE Symposium on Information Visualization (InfoVis'02)
Fundamentals of spherical parameterization for 3D meshes
ACM SIGGRAPH 2003 Papers
A multi-dimensional approach to force-directed layouts of large graphs
Computational Geometry: Theory and Applications - Special issue on the 10th fall workshop on computational geometry
Non-Euclidean Spring Embedders
INFOVIS '04 Proceedings of the IEEE Symposium on Information Visualization
A model for smooth viewing and navigation of large 2D information spaces
IEEE Transactions on Visualization and Computer Graphics
A new force-directed graph drawing method based on edge-edge repulsion
Journal of Visual Languages and Computing
GerbilSphere: Inner sphere network visualization
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
We present a conceptually simple approach to generalizing force-directed methods for graph layout from Euclidean geometry to Riemannian geometries. Unlike previous work on non-Euclidean force-directed methods, ours is not limited to special classes of graphs, but can be applied to arbitrary graphs. The method relies on extending the Euclidean notions of distance, angle, and force-interactions to smooth non-Euclidean geometries via projections to and from appropriately chosen tangent spaces. In particular, we formally describe the calculations needed to extend such algorithms to hyperbolic and spherical geometries. We also study the theoretical and practical considerations that arise when working with non-Euclidean geometries.