Non-euclidean spring embedders

Stephen G. Kobourov, Kevin Wampler

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Scopus citations

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.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE Symposium on Information Visualization, INFO VIS 2004
EditorsM. Ward, T. Munzner
Pages207-214
Number of pages8
DOIs
StatePublished - Dec 1 2004
EventProceedings - IEEE Symposium on Information Visualization, INFO VIS - Austin, TX, United States
Duration: Oct 10 2004Oct 12 2004

Publication series

NameProceedings - IEEE Symposium on Information Visualization, INFO VIS
ISSN (Print)1522-404X

Other

OtherProceedings - IEEE Symposium on Information Visualization, INFO VIS
CountryUnited States
CityAustin, TX
Period10/10/0410/12/04

Keywords

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

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'Non-euclidean spring embedders'. Together they form a unique fingerprint.

  • Cite this

    Kobourov, S. G., & Wampler, K. (2004). Non-euclidean spring embedders. In M. Ward, & T. Munzner (Eds.), Proceedings - IEEE Symposium on Information Visualization, INFO VIS 2004 (pp. 207-214). (Proceedings - IEEE Symposium on Information Visualization, INFO VIS). https://doi.org/10.1109/INFVIS.2004.49