Non-Euclidean Spring Embedders

Authors:
Stephen G. Kobourov;Kevin Wampler
Affiliations:
University of Arizona;University of Arizona
Venue:
INFOVIS '04 Proceedings of the IEEE Symposium on Information Visualization
Year:
2004

Citing 0
Cited 4

Non-Euclidean Spring Embedders

IEEE Transactions on Visualization and Computer Graphics
Visualizing multivariate network on the surface of a sphere

APVis '06 Proceedings of the 2006 Asia-Pacific Symposium on Information Visualisation - Volume 60
Graphael: a system for generalized force-directed layouts

GD'04 Proceedings of the 12th international conference on Graph Drawing
GerbilSphere: Inner sphere network visualization

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a method by which force-directed algorithms for graph layouts can be generalized to calculate the layout of a graph in an arbitrary Riemannian geometry. 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.