Path: utzoo!utgpu!jarvis.csri.toronto.edu!rutgers!apple!motcsd!hpda!hpcuhb!hpcllla!hpclisp!hpclada!sridhar
From: sridhar@hpclada.HP.COM (Sridhar Ramakrishnan)
Newsgroups: comp.windows.x
Subject: Graph Layouts?
Message-ID: <3930006@hpclada.HP.COM>
Date: 16 May 89 14:32:11 GMT
Organization: Hewlett-Packard Calif. Language Lab
Lines: 23

I am interested in looking into the problem of good graph-layout algorithms.
While the specific problem I am trying to solve is not important, I thought
that there may be some validity in examining the problem from the perspective
of determining the coordinates of N points that satisfy some constraints. 
Some of the constraints could be:
	a) minimum area occupied by the N points,
	b) minimum path length,
	c) minimum overlap of arcs between nodes,
	d) maximum length of an arc, etc

If you look at the constraints, the problem starts looking a lot like 
circuit layout algorithms, which I KNOW exist.  The question is can someone
give me a pointer to any alogrithms, or even better, existing code that solves
this problem.  Any additional insights are also welcome!

Since I am not a regular notes reader, I would appreciate any responses mailed
to me at:
	sridhar%hpclove@hplabs.hp.com

Thanks.


						Sridhar