Measuring Symmetry in Drawings of Graphs

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

Layout symmetry is an important and desired feature in graph drawing. While there is a substantial body of work in computer vision around the detection and measurement of symmetry in images, there has been little effort to define and validate meaningful measures of the symmetry of graph drawings. In this paper, we evaluate two algorithms that have been proposed for measuring graph drawing symmetry, comparing their judgments to those of human subjects, and investigating the use of stress as an alternative measure of symmetry. We discuss advantages and disadvantages of these measures, possible ways to improve them, and implications for the design of algorithms that optimize the symmetry in the layout.

Original languageEnglish (US)
Pages (from-to)341-351
Number of pages11
JournalComputer Graphics Forum
Volume36
Issue number3
DOIs
StatePublished - Jun 1 2017

Fingerprint

Computer vision

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

Measuring Symmetry in Drawings of Graphs. / Welch, E.; Kobourov, Stephen G.

In: Computer Graphics Forum, Vol. 36, No. 3, 01.06.2017, p. 341-351.

Research output: Contribution to journalArticle

@article{88587c9ae779487b88845d8c91825be0,
title = "Measuring Symmetry in Drawings of Graphs",
abstract = "Layout symmetry is an important and desired feature in graph drawing. While there is a substantial body of work in computer vision around the detection and measurement of symmetry in images, there has been little effort to define and validate meaningful measures of the symmetry of graph drawings. In this paper, we evaluate two algorithms that have been proposed for measuring graph drawing symmetry, comparing their judgments to those of human subjects, and investigating the use of stress as an alternative measure of symmetry. We discuss advantages and disadvantages of these measures, possible ways to improve them, and implications for the design of algorithms that optimize the symmetry in the layout.",
author = "E. Welch and Kobourov, {Stephen G}",
year = "2017",
month = "6",
day = "1",
doi = "10.1111/cgf.13192",
language = "English (US)",
volume = "36",
pages = "341--351",
journal = "Computer Graphics Forum",
issn = "0167-7055",
publisher = "Wiley-Blackwell",
number = "3",

}

TY - JOUR

T1 - Measuring Symmetry in Drawings of Graphs

AU - Welch, E.

AU - Kobourov, Stephen G

PY - 2017/6/1

Y1 - 2017/6/1

N2 - Layout symmetry is an important and desired feature in graph drawing. While there is a substantial body of work in computer vision around the detection and measurement of symmetry in images, there has been little effort to define and validate meaningful measures of the symmetry of graph drawings. In this paper, we evaluate two algorithms that have been proposed for measuring graph drawing symmetry, comparing their judgments to those of human subjects, and investigating the use of stress as an alternative measure of symmetry. We discuss advantages and disadvantages of these measures, possible ways to improve them, and implications for the design of algorithms that optimize the symmetry in the layout.

AB - Layout symmetry is an important and desired feature in graph drawing. While there is a substantial body of work in computer vision around the detection and measurement of symmetry in images, there has been little effort to define and validate meaningful measures of the symmetry of graph drawings. In this paper, we evaluate two algorithms that have been proposed for measuring graph drawing symmetry, comparing their judgments to those of human subjects, and investigating the use of stress as an alternative measure of symmetry. We discuss advantages and disadvantages of these measures, possible ways to improve them, and implications for the design of algorithms that optimize the symmetry in the layout.

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

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

U2 - 10.1111/cgf.13192

DO - 10.1111/cgf.13192

M3 - Article

AN - SCOPUS:85022186822

VL - 36

SP - 341

EP - 351

JO - Computer Graphics Forum

JF - Computer Graphics Forum

SN - 0167-7055

IS - 3

ER -