Axis-by-Axis Stress Minimization
Graph drawing algorithms based on minimizing the so-called stress energy strive to place nodes in accordance with target distances. They were first introduced to the graph drawing field by Kamada and Kawai , and they had previously been used to visualize general kinds of data by multidimensional scaling. In this paper we suggest a novel algorithm for the minimization of the Stress energy. Unlike prior stress-minimization algorithms, our algorithm is suitable for a one-dimensional layout, where one axis of the drawing is already given and an additional axis needs to be computed. This 1-D drawing capability of the algorithm is a consequence of replacing the traditional node-by-node optimization with a more global axis-by-axis optimization. Moreover, our algorithm can be used for multidimensional graph drawing, where it has time and space complexity advantages compared with other stress minimization algorithms.
- 2.Carmel, L., Harel, D., Koren, Y.: Combining Hierarchy and Energy for Drawing Directed Graphs. IEEE Transactions on Visualization and Computer Graphics, IEEE (in press)Google Scholar
- 8.Koren, Y., Carmel, L., Harel, D.: ACE: A Fast Multiscale Eigenvectors Computation for Drawing Huge Graphs. In: Proc. IEEE Information Visualization (InfoVis 2002), pp. 137–144. IEEE, Los Alamitos (2002)Google Scholar
- 9.Koren, Y., Harel, D.: One-Dimensional Graph Drawing: Part I — Drawing Graphs by Axis Separation. Technical report MCS03-08, Faculty of Math. and Computer Science, The Weizmann Institute of Science (2003)Google Scholar
- 10.Koren, Y.: Graph Drawing by Subspace Optimization (to be published)Google Scholar