Graph Drawing by Weighted Constraint Relaxation

10/12/2017
by   Jonathan X. Zheng, et al.
0

A popular method of force-directed graph drawing is multidimensional scaling using graph-theoretic distances as input. We present an algorithm to minimize its energy function, known as stress, by using a relaxation method that considers a single pair of vertices at a time. Our results show that relaxation can reach lower stress levels faster and more consistently than majorization, without needing help from a good initialization. We then present various real-world applications to show how the unique properties of relaxation make it easier to produce constrained layouts than previous approaches. We also show how relaxation can be directly applied within the sparse stress approximation of Ortmann et al. [1], making the algorithm scalable up to large graphs.

READ FULL TEXT

page 6

page 8

page 9

research
10/12/2017

Graph Drawing by Stochastic Gradient Descent

A popular method of force-directed graph drawing is multidimensional sca...
research
08/30/2022

Shape-Faithful Graph Drawings

Shape-based metrics measure how faithfully a drawing D represents the st...
research
11/03/2017

A Fast Successive Over-Relaxation Algorithm for Force-Directed Network Graph Drawing

Force-directed approach is one of the most widely used methods in graph ...
research
07/20/2023

Manipulating Weights to Improve Stress-Graph Drawings of 3-Connected Planar Graphs

We study methods to manipulate weights in stress-graph embeddings to imp...
research
07/14/2022

Supervising Embedding Algorithms Using the Stress

While classical scaling, just like principal component analysis, is para...
research
08/04/2019

Stress-Plus-X (SPX) Graph Layout

Stress, edge crossings, and crossing angles play an important role in th...
research
09/04/2018

Aesthetic Discrimination of Graph Layouts

This paper addresses the following basic question: given two layouts of ...

Please sign up or login with your details

Forgot password? Click here to reset