Graph Drawing by Subspace Optimization
Loading...
Date
2004
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
The Eurographics Association
Abstract
We show a novel approach for accelerating the computation of graph drawing algorithms. The method is based on the notion that we can find a subspace with a relatively low dimensionality that captures the "nice" layouts of the graph. This way each axis of the drawing is a linear combination of a few basis vectors, instead of being an arbitrary vector in Rn (n is the number of nodes). We describe ways of constructing these basis vectors and also algorithms for optimizing the graph drawing in the resulting subspace.
Description
@inproceedings{:10.2312/VisSym/VisSym04/065-074,
booktitle = {Eurographics / IEEE VGTC Symposium on Visualization},
editor = {Oliver Deussen and Charles Hansen and Daniel Keim and Dietmar Saupe},
title = {{Graph Drawing by Subspace Optimization}},
author = {Koren, Yehuda},
year = {2004},
publisher = {The Eurographics Association},
ISSN = {1727-5296},
ISBN = {3-905673-07-X},
DOI = {/10.2312/VisSym/VisSym04/065-074}
}