Non-Euclidean spring embedders

Stephen G Kobourov, Kevin Wampler

Research output: Contribution to journalArticle

19 Citations (Scopus)

Abstract

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.

Original languageEnglish (US)
Pages (from-to)757-767
Number of pages11
JournalIEEE Transactions on Visualization and Computer Graphics
Volume11
Issue number6
DOIs
StatePublished - Nov 2005

Fingerprint

Geometry

Keywords

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

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Software

Cite this

Non-Euclidean spring embedders. / Kobourov, Stephen G; Wampler, Kevin.

In: IEEE Transactions on Visualization and Computer Graphics, Vol. 11, No. 6, 11.2005, p. 757-767.

Research output: Contribution to journalArticle

@article{5b549ad0154944499e7cc2d0ee5e869f,
title = "Non-Euclidean spring embedders",
abstract = "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.",
keywords = "Force-directed algorithms, Graph drawing, Hyperbolic space, Information visualization, Non-Euclidean geometry, Spherical space, Spring embedders",
author = "Kobourov, {Stephen G} and Kevin Wampler",
year = "2005",
month = "11",
doi = "10.1109/TVCG.2005.103",
language = "English (US)",
volume = "11",
pages = "757--767",
journal = "IEEE Transactions on Visualization and Computer Graphics",
issn = "1077-2626",
publisher = "IEEE Computer Society",
number = "6",

}

TY - JOUR

T1 - Non-Euclidean spring embedders

AU - Kobourov, Stephen G

AU - Wampler, Kevin

PY - 2005/11

Y1 - 2005/11

N2 - 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.

AB - 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.

KW - Force-directed algorithms

KW - Graph drawing

KW - Hyperbolic space

KW - Information visualization

KW - Non-Euclidean geometry

KW - Spherical space

KW - Spring embedders

UR - http://www.scopus.com/inward/record.url?scp=27644496169&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=27644496169&partnerID=8YFLogxK

U2 - 10.1109/TVCG.2005.103

DO - 10.1109/TVCG.2005.103

M3 - Article

C2 - 16270867

AN - SCOPUS:27644496169

VL - 11

SP - 757

EP - 767

JO - IEEE Transactions on Visualization and Computer Graphics

JF - IEEE Transactions on Visualization and Computer Graphics

SN - 1077-2626

IS - 6

ER -