Improved Scheduling of Morphing Edge Drawing
August 24, 2022 Β· Declared Dead Β· π International Symposium Graph Drawing and Network Visualization
"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 Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β Data Structures & Algorithms
π
π
The Cartographer
R.I.P.
π»
Ghosted
Route Planning in Transportation Networks
R.I.P.
π»
Ghosted
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration
R.I.P.
π»
Ghosted
Hierarchical Clustering: Objective Functions and Algorithms
R.I.P.
π»
Ghosted
Graph Isomorphism in Quasipolynomial Time
π
π
The Cartographer
Simulation optimization: A review of algorithms and applications
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted