New Quality Metrics for Dynamic Graph Drawing

08/18/2020
by   Amyra Meidiana, et al.
0

In this paper, we present new quality metrics for dynamic graph drawings. Namely, we present a new framework for change faithfulness metrics for dynamic graph drawings, which compare the ground truth change in dynamic graphs and the geometric change in drawings. More specifically, we present two specific instances, cluster change faithfulness metrics and distance change faithfulness metrics. We first validate the effectiveness of our new metrics using deformation experiments. Then we compare various graph drawing algorithms using our metrics. Our experiments confirm that the best cluster (resp. distance) faithful graph drawing algorithms are also cluster (resp. distance) change faithful.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/11/2019

A Quality Metric for Symmetric Graph Drawings

Symmetry is an important aesthetic criteria in graph drawing and network...
research
08/21/2019

A Quality Metric for Visualization of Clusters in Graphs

Traditionally, graph quality metrics focus on readability, but recent st...
research
08/30/2022

Shape-Faithful Graph Drawings

Shape-based metrics measure how faithfully a drawing D represents the st...
research
08/24/2020

Layered Drawing of Undirected Graphs with Generalized Port Constraints

The aim of this research is a practical method to draw cable plans of co...
research
09/04/2018

Aesthetic Discrimination of Graph Layouts

This paper addresses the following basic question: given two layouts of ...
research
09/04/2023

A Simple Pipeline for Orthogonal Graph Drawing

Orthogonal graph drawing has many applications, e.g., for laying out UML...
research
10/11/2021

Reeb Graph Metrics from the Ground Up

The Reeb graph has been utilized in various applications including the a...

Please sign up or login with your details

Forgot password? Click here to reset