NetNews Usenet Archive 1992 #26/NN_1992_26.iso/spool/comp/misc/4283

Internet Message Format | 1992-11-10 | 1.5 KB

Xref: sparky comp.misc:4283 comp.graphics:11719
Path: sparky!uunet!hela.iti.org!usc!chaph.usc.edu!ericjohn
From: [e-mail] (Eric Johnson)
Newsgroups: comp.misc,comp.graphics
Subject: Wanted: graph graphing algorithm
Date: 10 Nov 1992 19:46:44 -0800
Organization: University of Southern California, Los Angeles, CA
Lines: 22
Distribution: world
Message-ID: <[e-mail]>
NNTP-Posting-Host: sal-sun107.usc.edu
Keywords: Golly, my first post... I wonder how many flames I'll get...


Here's what I need: A general algorithm for graphical layout of
graphs (nodes and arcs) which minimizes arc intersection, minimizes
total arc lengths (under the constraints of minimum distance between
nodes and minimum individual arc lengths), and gives a visually
appealing layout. I'm sure that there are all sorts of other
interesting features which would be nice (variable size nodes, a
concept of 'gravity' which would allow this algorithm to be used to
create standard graphs of tree structures (among other uses)), but
those would be gravy. I've been confronted with this same problem a
few times in the past, but before always managed to side-step it;
not this time. I'm sure someone has already done this sort of thing,
and I'd really appreciate it if I could stand on the shoulders of
giants :-). Thanks in advance...



--
Eric Johnson        Remember, It's good to keep an open mind,
ISX Corp.        but not so open that your brains fall out...
[phone]
[e-mail]