A Sparse Stress Model
DOI:
https://doi.org/10.7155/jgaa.00440Keywords:
graph drawing , multidimensional scaling , stress minimization , sparsificationAbstract
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.Downloads
Download data is not yet available.
Downloads
Published
2017-10-01
How to Cite
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
Issue
Section
Articles
Categories
License
Copyright (c) 2017 Mark Ortmann, Mirza Klimenta, Ulrik Brandes
This work is licensed under a Creative Commons Attribution 4.0 International License.