Visualizing graphs using virtual physical models is probably the most heavily used technique for drawing graphs in practice. There are many algorithms that are efficient and produce high-quality layouts. If one requires that the layout also respect a given set of non-uniform edge lengths, however, force-based approaches become problematic while energy-based layouts become intractable. In this paper, we propose a reformulation of the stress function into a two-part convex objective function to which we can apply semi-definite programming (SDP). We avoid the high computational cost associated with SDP by a novel, compact re-parameterization of the objective function using the eigenvectors of the graph Laplacian. This sparse representation makes our approach scalable. We provide experimental results to show that this method scales well and produces reasonable layouts while dealing with the edge length constraints. © 2013 Springer International Publishing Switzerland.
CITATION STYLE
Gansner, E. R., Hu, Y., & Krishnan, S. (2013). COAST: A convex optimization approach to stress-based embedding. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8242 LNCS, pp. 268–279). Springer Verlag. https://doi.org/10.1007/978-3-319-03841-4_24
Mendeley helps you to discover research relevant for your work.