We present a novel approach to the aesthetic drawing of undirected graphs. The method has two phases: first embed the graph in a very high dimension and then project it into the 2-D plane using principal components analysis. Running time is linear in the graph size, and experiments we have carried out show the ability of the method to draw graphs of 10 5 nodes in few seconds. The new method appears to have several advantages over classical methods, including a significantly better running time, a useful inherent capability to exhibit the graph in various dimensions, and an effective means for interactive exploration of large graphs.
%0 Book Section
%1 springerlink:10.1007/3-540-36151-0_20
%A Harel, David
%A Koren, Yehuda
%B Graph Drawing
%C Berlin / Heidelberg
%D 2002
%E Goodrich, Michael
%E Kobourov, Stephen
%I Springer
%K graph.drawing
%P 299-345
%R 10.1007/3-540-36151-0_20
%T Graph Drawing by High-Dimensional Embedding
%V 2528
%X We present a novel approach to the aesthetic drawing of undirected graphs. The method has two phases: first embed the graph in a very high dimension and then project it into the 2-D plane using principal components analysis. Running time is linear in the graph size, and experiments we have carried out show the ability of the method to draw graphs of 10 5 nodes in few seconds. The new method appears to have several advantages over classical methods, including a significantly better running time, a useful inherent capability to exhibit the graph in various dimensions, and an effective means for interactive exploration of large graphs.
%@ 978-3-540-00158-4
@incollection{springerlink:10.1007/3-540-36151-0_20,
abstract = {We present a novel approach to the aesthetic drawing of undirected graphs. The method has two phases: first embed the graph in a very high dimension and then project it into the 2-D plane using principal components analysis. Running time is linear in the graph size, and experiments we have carried out show the ability of the method to draw graphs of 10 5 nodes in few seconds. The new method appears to have several advantages over classical methods, including a significantly better running time, a useful inherent capability to exhibit the graph in various dimensions, and an effective means for interactive exploration of large graphs.},
added-at = {2012-08-26T21:55:34.000+0200},
address = {Berlin / Heidelberg},
affiliation = {The Weizmann Institute of Science Dept. of Computer Science and Applied Mathematics Rehovot Israel},
author = {Harel, David and Koren, Yehuda},
biburl = {https://www.bibsonomy.org/bibtex/294c2683bff3d3be4197b9ac1835e4d8e/ytyoun},
booktitle = {Graph Drawing},
doi = {10.1007/3-540-36151-0_20},
editor = {Goodrich, Michael and Kobourov, Stephen},
interhash = {08c31b2e7a314b505d342dbce0a155ae},
intrahash = {94c2683bff3d3be4197b9ac1835e4d8e},
isbn = {978-3-540-00158-4},
keyword = {Computer Science},
keywords = {graph.drawing},
pages = {299-345},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
timestamp = {2012-08-26T21:55:34.000+0200},
title = {Graph Drawing by High-Dimensional Embedding},
volume = 2528,
year = 2002
}