Search research articles

Search research articles

Related Experiment Videos

Non-Euclidean spring embedders.

Stephen G Kobourov¹, Kevin Wampler

¹Department of Computer Science, University of Arizona, Tucson, AZ 85721, USA. kobourov@cs.arizona.edu

IEEE Transactions on Visualization and Computer Graphics

|November 8, 2005

Summary

This summary is machine-generated.

Related Concept Videos

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by

Same author

Visualizing graphs and clusters as maps.

IEEE computer graphics and applications·2014

Same author

Visualizing Dynamic Data with Maps.

IEEE transactions on visualization and computer graphics·2011

Same journal

Two-phase Impulse Fluid on Particle Flow Map.

IEEE transactions on visualization and computer graphics·2026

Same journal

FGO-SLAM++: Real-time Geometry-Aware Gaussian SLAM with Continuous Opacity Field.

IEEE transactions on visualization and computer graphics·2026

Same journal

Blue Noise Dithering for Reservoir-based Spatio-temporal Importance Resampling.

IEEE transactions on visualization and computer graphics·2026

Same journal

ROS-GS: Relightable Outdoor Scenes With Gaussian Splatting.

IEEE transactions on visualization and computer graphics·2026

Same journal

MesoSplats: Texture Synthesis with Gaussian Splatting.

IEEE transactions on visualization and computer graphics·2026

Same journal

GLLA: A Unified Force-Directed Graph Layout Framework Supporting Local Adjustments.

IEEE transactions on visualization and computer graphics·2026

See all related articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

This study introduces a new method for graph layout that works in complex non-Euclidean spaces, unlike prior methods limited to specific graph types. It enables broader applications for visualizing complex data structures.

Area of Science:

Computational Geometry
Graph Theory
Data Visualization

Background:

Force-directed graph layout algorithms are widely used for data visualization.
Existing methods are primarily designed for Euclidean geometry.
Generalizing these methods to non-Euclidean spaces remains a challenge.

Purpose of the Study:

To develop a generalizable force-directed graph layout method for Riemannian geometries.
To extend graph layout techniques beyond Euclidean constraints.
To enable visualization of complex data structures in non-Euclidean spaces.

Main Methods:

Extending Euclidean concepts of distance, angle, and force to non-Euclidean geometries.
Utilizing projections to and from tangent spaces for calculations.

Related Experiment Videos

Formally describing algorithms for hyperbolic and spherical geometries.

Main Results:

A conceptually simple and broadly applicable approach to non-Euclidean force-directed graph layout.
Demonstration of applicability to arbitrary graphs, not limited to special classes.
Formalization of calculations for hyperbolic and spherical geometry extensions.

Conclusions:

The proposed method offers a unified framework for graph layout in diverse non-Euclidean geometries.
This work opens new possibilities for visualizing complex network data in curved spaces.
Theoretical and practical considerations for non-Euclidean graph layout are addressed.