1 research outputs found

    An Interactive Tool to Explore and Improve the Ply Number of Drawings

    Full text link
    Given a straight-line drawing Γ\Gamma of a graph G=(V,E)G=(V,E), for every vertex vv the ply disk DvD_v is defined as a disk centered at vv where the radius of the disk is half the length of the longest edge incident to vv. The ply number of a given drawing is defined as the maximum number of overlapping disks at some point in R2\mathbb{R}^2. Here we present a tool to explore and evaluate the ply number for graphs with instant visual feedback for the user. We evaluate our methods in comparison to an existing ply computation by De Luca et al. [WALCOM'17]. We are able to reduce the computation time from seconds to milliseconds for given drawings and thereby contribute to further research on the ply topic by providing an efficient tool to examine graphs extensively by user interaction as well as some automatic features to reduce the ply number.Comment: Appears in the Proceedings of the 25th International Symposium on Graph Drawing and Network Visualization (GD 2017
    corecore