An experimental study on the ply number of straight-line drawings

Felice De Luca, Emilio Di Giacomo, Walter Didimo, Stephen G Kobourov, Giuseppe Liotta

Research output: Contribution to journalArticle

Abstract

The ply number of a drawing is a new criterion of interest for graph drawing. Informally, the ply number of a straight-line drawing of a graph is defined as the maximum number of overlapping disks, where each disk is associated with a vertex and has a radius that is half the length of the longest edge incident to that vertex. This paper reports the results of an extensive experimental study that attempts to estimate correlations between the ply number and other aesthetic quality metrics for a graph layout, such as stress, edge-length uniformity, and edge crossings. We also investigate the performance of several graph drawing algorithms in terms of ply number, and provide new insights into the theoretical gap between lower and upper bounds on the ply number of k-ary trees.

Original languageEnglish (US)
Pages (from-to)71-91
Number of pages21
JournalJournal of Graph Algorithms and Applications
Volume23
Issue number1
DOIs
StatePublished - Jan 1 2019

Fingerprint

Line Drawing
Straight Line
Experimental Study
Graph Drawing
Graph Layout
Vertex of a graph
Uniformity
Overlapping
Upper and Lower Bounds
Radius
Metric
Graph in graph theory
Estimate

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)
  • Computer Science Applications
  • Geometry and Topology
  • Computational Theory and Mathematics

Cite this

An experimental study on the ply number of straight-line drawings. / De Luca, Felice; Di Giacomo, Emilio; Didimo, Walter; Kobourov, Stephen G; Liotta, Giuseppe.

In: Journal of Graph Algorithms and Applications, Vol. 23, No. 1, 01.01.2019, p. 71-91.

Research output: Contribution to journalArticle

De Luca, Felice ; Di Giacomo, Emilio ; Didimo, Walter ; Kobourov, Stephen G ; Liotta, Giuseppe. / An experimental study on the ply number of straight-line drawings. In: Journal of Graph Algorithms and Applications. 2019 ; Vol. 23, No. 1. pp. 71-91.
@article{821f218384c14a52810ea391d5e4771d,
title = "An experimental study on the ply number of straight-line drawings",
abstract = "The ply number of a drawing is a new criterion of interest for graph drawing. Informally, the ply number of a straight-line drawing of a graph is defined as the maximum number of overlapping disks, where each disk is associated with a vertex and has a radius that is half the length of the longest edge incident to that vertex. This paper reports the results of an extensive experimental study that attempts to estimate correlations between the ply number and other aesthetic quality metrics for a graph layout, such as stress, edge-length uniformity, and edge crossings. We also investigate the performance of several graph drawing algorithms in terms of ply number, and provide new insights into the theoretical gap between lower and upper bounds on the ply number of k-ary trees.",
author = "{De Luca}, Felice and {Di Giacomo}, Emilio and Walter Didimo and Kobourov, {Stephen G} and Giuseppe Liotta",
year = "2019",
month = "1",
day = "1",
doi = "10.7155/JGAA.00484",
language = "English (US)",
volume = "23",
pages = "71--91",
journal = "Journal of Graph Algorithms and Applications",
issn = "1526-1719",
publisher = "Brown University",
number = "1",

}

TY - JOUR

T1 - An experimental study on the ply number of straight-line drawings

AU - De Luca, Felice

AU - Di Giacomo, Emilio

AU - Didimo, Walter

AU - Kobourov, Stephen G

AU - Liotta, Giuseppe

PY - 2019/1/1

Y1 - 2019/1/1

N2 - The ply number of a drawing is a new criterion of interest for graph drawing. Informally, the ply number of a straight-line drawing of a graph is defined as the maximum number of overlapping disks, where each disk is associated with a vertex and has a radius that is half the length of the longest edge incident to that vertex. This paper reports the results of an extensive experimental study that attempts to estimate correlations between the ply number and other aesthetic quality metrics for a graph layout, such as stress, edge-length uniformity, and edge crossings. We also investigate the performance of several graph drawing algorithms in terms of ply number, and provide new insights into the theoretical gap between lower and upper bounds on the ply number of k-ary trees.

AB - The ply number of a drawing is a new criterion of interest for graph drawing. Informally, the ply number of a straight-line drawing of a graph is defined as the maximum number of overlapping disks, where each disk is associated with a vertex and has a radius that is half the length of the longest edge incident to that vertex. This paper reports the results of an extensive experimental study that attempts to estimate correlations between the ply number and other aesthetic quality metrics for a graph layout, such as stress, edge-length uniformity, and edge crossings. We also investigate the performance of several graph drawing algorithms in terms of ply number, and provide new insights into the theoretical gap between lower and upper bounds on the ply number of k-ary trees.

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

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

U2 - 10.7155/JGAA.00484

DO - 10.7155/JGAA.00484

M3 - Article

AN - SCOPUS:85069510831

VL - 23

SP - 71

EP - 91

JO - Journal of Graph Algorithms and Applications

JF - Journal of Graph Algorithms and Applications

SN - 1526-1719

IS - 1

ER -