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

August 30, 2017 Β· Declared Dead Β· πŸ› International Symposium Graph Drawing and Network Visualization

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Niklas Heinsohn, Michael Kaufmann arXiv ID 1708.09250 Category cs.DS: Data Structures & Algorithms Citations 2 Venue International Symposium Graph Drawing and Network Visualization Last Checked 4 months ago
Abstract
Given a straight-line drawing $Ξ“$ of a graph $G=(V,E)$, for every vertex $v$ the ply disk $D_v$ is defined as a disk centered at $v$ where the radius of the disk is half the length of the longest edge incident to $v$. The ply number of a given drawing is defined as the maximum number of overlapping disks at some point in $\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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Data Structures & Algorithms

Died the same way β€” πŸ‘» Ghosted