･We developed three scheduling methods to shorten the morphing cycle in MED.
･The effective performances of these methods are demonstrated through experimental evaluations.
･MED using these methods has the potential to open up new possibilities for the visual representation of networks.
Abstract
Morphing edge drawing (MED), a graph drawing technique is a dynamic extension of partial edge drawing (PED), where partially drawn edges (stubs) are repeatedly stretched and shrunk by morphing. Previous experimental evaluations have shown that the reading time with MED may be shorter than that with PED. The morphing scheduling method limits visual clutter by avoiding crossings between stubs. However, as the number of intersections increases, the overall morphing cycle tends to lengthen in this method, which is likely to have a negative effect on the reading time. In this paper, improved scheduling methods are presented to address this issue. The first method shortens a cycle by overlapping the end of the current cycle with the succeeding one. The second method shortens the average duration of a cycle by duplicating every morph by the allowable number of times in one cycle. The third method aims at shortening the cycle length by allowing a certain number of crossings at each edge. We incorporated these developed methods into a program and conducted evaluation experiments on complete graphs laid out on a circle to confirm the effectiveness of each method.
Benefit
Three new scheduling methods were presented to shorten the morphing cycle in MED, and the effectiveness of each scheduling method is demonstrated experimentally.
Market Application
Three new scheduling methods were presented to shorten the morphing cycle in MED, and the effectiveness of each scheduling method is demonstrated experimentally.
Publications
https://arxiv.org/abs/2208.11305
https://link.springer.com/chapter/10.1007/978-3-031-22203-0_24
