pq@fctunl.rccn.pt (Paulo Quaresma) (06/05/90)
Hi, Is there an algorithm (or paper) to layout the nodes of a graph ? Something to avoid cluttering... Please post or email (and I'll resume) -- --- Paulo Quaresma BITNET/Internet: pq@fctunl.rccn.pt +---------------------------------+ UUCP: pq@unl.uucp | Departamento de Informatica +----------------------------------+ | Universidade Nova de Lisboa 2825 Monte Caparica, PORTUGAL | +--------------------------------------------------------------------+
himsolt@trillian-gw.fmi.uni-passau.de (Michael Himsolt) (06/07/90)
There is a bibliography on graph layout by P. Eades and R. Tamassia : P. Eades, R. Tamassia : "Algorithms for Automatic Graph Drawing: An Annotated Bibliography", Technical Report CS-89-09, Dept. of Computer Science, Brown Univ., 1989 It contains short descriptions of the various methods developed for graph layout. Roughly speaking, there are layout algorithms for trees, hierarchies, planar graphs, and general graphs. We are currently implementing some of the algorithms mentioned in this paper and some new ones in our graph editor GraphEd. -- Michael Himsolt -- Michael Himsolt, Universitaet Passau, Innstrasse 33, D-8390 Passau, W GERMANY himsolt@unipas.fmi.uni-passau.de graphed@unipas.fmi.uni-passau.de