Path: utzoo!censor!geac!torsqnt!news-server.csri.toronto.edu!cs.utexas.edu!uunet!ns-mx!ccad.uiowa.edu!yiannis
From: yiannis@ccad.uiowa.edu (Yiannis Papelis)
Newsgroups: comp.graphics
Subject: Re: Layout for graph
Message-ID: <1990Dec19.141620.28876@ccad.uiowa.edu>
Date: 19 Dec 90 14:16:20 GMT
References: <24@esacs.UUCP>
Organization: CAD-Research, U. of Iowa, Iowa City, Iowa
Lines: 23

In article <24@esacs.UUCP> replay.EU.net!i2unix!esacs!ferrara (Giancarlo Ferrara) writes:
>I need to find algorithms (better if code) to do automatic layout for graph;
>
>What I have is a lot of nodes connected and i must display this information
>in rectangular box or ellypses; The program must position this informations
>node on the screen trying to minimize intersections and waste space;

Try this reference:

	``Pretty-printing networks'' in the proceedings of the International
conference on Systems, Man and Cybernetics, 1987, pages 831-836.

The abstract reads:
	This paper describes a technique for automatically arranging and
displaying, in a pleasing layout, networks in the limited space
of a CRT.  The rules and procedures for automatically arranging 
a restricted class of networks is presented.
The paper contains algorithms for placing 

Hope it helps.
-- 
Yiannis E. Papelis      --------      Electrical & Computer Engineering
yiannis@eng.uiowa.edu   --------      University of Iowa