@inproceedings{dd1dfb1d91c148ba8a35ae0cf57e7763,
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 numbers and other aesthetic quality metrics for a graph layout, such as stress, edge-length uniformity, and edge crossings. We also investigate the performances of several graph drawing algorithms in terms of ply number, and provides new insights on 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 Stephen Kobourov and Giuseppe Liotta",
note = "Publisher Copyright: {\textcopyright} Springer International Publishing AG 2017.; 11th International Conference and Workshops on Algorithms and Computation, WALCOM 2017 ; Conference date: 29-03-2017 Through 31-03-2017",
year = "2017",
doi = "10.1007/978-3-319-53925-6_11",
language = "English (US)",
isbn = "9783319539249",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer-Verlag",
pages = "135--148",
editor = "Rahman, {Md. Saidur} and Hsu-Chun Yen and Sheung-Hung Poon",
booktitle = "WALCOM",
}