home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!usc!news
- From: mitzel@caldera.usc.edu (Danny Mitzel)
- Newsgroups: comp.graphics
- Subject: Looking for algorithm for automated graph layout
- Date: 1 Sep 1992 12:09:45 -0700
- Organization: University of Southern California, Los Angeles, CA
- Lines: 20
- Sender: mitzel@caldera.usc.edu (Danny Mitzel)
- Message-ID: <la7fvpINNl9q@caldera.usc.edu>
- NNTP-Posting-Host: caldera.usc.edu
-
- I'm using a program that generates different network topologies, that
- I'm feeding into a computer network simulator. The network topology
- consists of a set of switching nodes and links, with the nodes
- organized into a small number of hierarchical levels [typically 1 -
- 3].
-
- The simulator can display a representation of the network in an X
- window if given coordinate information. I'm interested in any
- info/algorithms/papers that suggest methods on how to automatically lay
- out the nodes within a rectangular coordinate system, the idea being
- that related nodes [connected to the same higher level node] are
- clustered together, and the whole thing is layed out to present some
- level of readability.
-
- I would imagine that some type of work has been done in this area for
- simple undirected graphs, which should give me a good starting point.
- Can anyone help me out?
-
- thanks,
- danny (mitzel@usc.edu)
-