Xref: utzoo sci.math:7877 comp.graphics:7511
Path: utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!uwm.edu!cs.utexas.edu!uunet!ncis.tis.llnl.gov!lance.tis.llnl.gov!carlson
From: carlson@lance.tis.llnl.gov (John Carlson)
Newsgroups: sci.math,comp.graphics
Subject: Re: A graph theory question
Message-ID: <471@ncis.tis.llnl.gov>
Date: 15 Sep 89 23:32:48 GMT
References: <45600@bbn.COM>
Sender: news@ncis.tis.llnl.gov
Organization: LLNL
Lines: 23

In article <45600@bbn.COM> ischick@bbn.com (Irvin C. Schick) writes:

>I would like to know if it is possible to construct a 2-D
>representation such that the distance between pairs of
>nodes is somehow related to the values given by the matrix.
>For instance, in the example above, node pairs that are
>linked might be exactly one unit length appart. (Nodes that
>are not linked could be unconstrained.)

I have been reviewing the literature recently and have two good
references:

"An Algorithm for Drawing General Undirected Graphs", Tomihisa Kamada &
Satoru Kawai, Information Processing Letters 31, pp 7-15, 1989.

-- discusses treating a graph as a dynamic system.  The nodes are linked
with "springs."

"Automatic Graph Drawing and Readability Diagrams", Roberto Tamassia,
Giuseppe di Battista and Carlo Batini, IEEE Transactions on Systems,
Man and Cybernetics, Vol 18 #1, Jan/Feb 1988, p 61-79.

-- reviews methods, creates a taxonomy, great reference list.