A Sparse Stress Model

Force-directed layout methods constitute the most common approach to draw general graphs. Among them, stress minimization produces layouts of comparatively high quality but also imposes comparatively high computational demands. We propose a speed-up method based on the aggregation of terms in the ob...

Full description

Saved in:
Bibliographic Details
Published inGraph Drawing and Network Visualization Vol. 9801; pp. 18 - 32
Main Authors Ortmann, Mark, Klimenta, Mirza, Brandes, Ulrik
Format Book Chapter
LanguageEnglish
Published Switzerland Springer International Publishing AG 2016
Springer International Publishing
SeriesLecture Notes in Computer Science
Subjects
Full Stress
Gabriel Graph
Positional Vote
Procrustes Analysis
Stress Model
Online AccessGet full text
ISBN3319501054
9783319501055
ISSN0302-9743
1611-3349
DOI10.1007/978-3-319-50106-2_2

Cover

More Information
Summary:Force-directed layout methods constitute the most common approach to draw general graphs. Among them, stress minimization produces layouts of comparatively high quality but also imposes 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.
Bibliography:We gratefully acknowledge financial support from Deutsche Forschungsgemeinschaft under grant Br 2158/11-1.
ISBN:3319501054
9783319501055
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-319-50106-2_2