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.
CITATION STYLE
De Luca, F., Di Giacomo, E., Didimo, W., Kobourov, S., & Liotta, G. (2017). An experimental study on the ply number of straight-line drawings. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10167 LNCS, pp. 135–148). Springer Verlag. https://doi.org/10.1007/978-3-319-53925-6_11
Mendeley helps you to discover research relevant for your work.