Improved Scheduling of Morphing Edge Drawing

August 24, 2022 Β· 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 Kazuo Misue arXiv ID 2208.11305 Category cs.DS: Data Structures & Algorithms Cross-listed cs.HC Citations 1 Venue International Symposium Graph Drawing and Network Visualization Last Checked 4 months ago
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 the duration of a single cycle by overlapping a part of the current cycle with the succeeding one. The second method duplicates every morph by the allowable number of times in one cycle. The third method permits a specific number of simultaneous crossings per edge. The effective performances of these methods are demonstrated through experimental evaluations.
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