Path: utzoo!attcan!uunet!husc6!rutgers!apple!voder!wlbr!mh
From: mh@wlbr.EATON.COM (Mike Hoegeman)
Newsgroups: comp.graphics
Subject: Re: graph drawing algorithm
Message-ID: <24313@wlbr.EATON.COM>
Date: 6 Nov 88 20:19:09 GMT
References: <gXNq8hy00VQD0O0Gdt@andrew.cmu.edu> <13391@cisunx.UUCP> <1026@psuhcx.psu.edu>
Reply-To: mh@wlbr.eaton.com.UUCP (Mike Hoegeman)
Organization: Eaton IMSD, Westlake Village, CA
Lines: 12

In article <1026@psuhcx.psu.edu> sbj@psuhcx (Sanjay B. Joshi) writes:
   >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.

I'm quite interested in this too. If anyone out there has some info
please post it instead of replying. thanks