3 papers
cs.DS2026
Fast and Faithful Edge Bundling using Spectral Sparsification
Xingjue Jiang, Seok-Hee Hong, Amyra Meidiana +1
Edge bundling reduces the visual complexity of drawings of large and complex graphs by clustering "compatible" edges. However, it often introduces distortion by bundling "unrelated…
cs.DS2025
BH-tsNET, FIt-tsNET, L-tsNET: Fast tsNET Algorithms for Large Graph Drawing
Amyra Meidiana, Seok-Hee Hong, Kwan-Liu Ma
The tsNET algorithm utilizes t-SNE to compute high-quality graph drawings, preserving the neighborhood and clustering structure. We present three fast algorithms for reducing the t…
cs.DS2025
SS-GUMAP, SL-GUMAP, SSSL-GUMAP: Fast UMAP Algorithms for Large Graph Drawing
Amyra Meidiana, Seok-Hee Hong
UMAP is a popular neighborhood-preserving dimension reduction (DR) algorithm. However, its application for graph drawing has not been evaluated. Moreover, a naive application of UM…