Path: utzoo!utgpu!attcan!uunet!husc6!psuvax1!psuhcx!sbj
From: sbj@psuhcx.psu.edu (Sanjay B. Joshi)
Newsgroups: comp.graphics
Subject: graph drawing algorithm
Message-ID: <1026@psuhcx.psu.edu>
Date: 3 Nov 88 14:08:04 GMT
References: <gXNq8hy00VQD0O0Gdt@andrew.cmu.edu> <13391@cisunx.UUCP>
Reply-To: sbj@psuhcx (Sanjay B. Joshi)
Organization: Penn State University
Lines: 10



I'm looking for an algorithm that takes as input a generalized
graph, determines the space requirements of a display image of the 
graph, and finally displays the graph with a minimum of intersecting arcs.
If any one knows of any such algorithm or references please let me know.

Thanks

sanjay.