A Sparse Stress Model
Journal of Graph Algorithms and Applications · 01.10.2017 · 21 (5) · 791-821
DOI: 10.7155/jgaa.00440 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Graph Algorithms and Applications, online erschienen am 01.10.2017. Verfasst von Mark Ortmann und 2 weiteren Autor:innen. Die Arbeit wurde bisher 14-mal zitiert (Crossref). Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
Force-directed layout methods are among the most common approaches for drawing general graphs. Among them, stress minimization produces layouts of comparatively high quality while also imposing comparatively high computational demands. We propose a speed-up method based on the aggregation of terms in the objective function. It is akin to aggregate repulsion from far-away nodes during spring embedding but transfers the idea from the layout space into a preprocessing phase. An initial experimental study informs a method to select representatives, and subsequent more extensive experiments indicate that our method yields better approximations of minimum-stress layouts in less time than related methods.
Zitieren
APA
Ortmann, M., Klimenta, M., & Brandes, U. (2017). A Sparse Stress Model. Journal of Graph Algorithms and Applications, 21(5), 791-821. https://doi.org/10.7155/jgaa.00440
Vancouver
Ortmann M, Klimenta M, Brandes U. A Sparse Stress Model. Journal of Graph Algorithms and Applications. 2017;21(5):791-821. doi:10.7155/jgaa.00440
BibTeX
@article{Ortmann2017,
author = {Ortmann, Mark and Klimenta, Mirza and Brandes, Ulrik},
title = {A Sparse Stress Model},
journal = {Journal of Graph Algorithms and Applications},
year = {2017},
volume = {21},
number = {5},
pages = {791--821},
doi = {10.7155/jgaa.00440}
}
EUVIMED