Path: utzoo!utgpu!attcan!uunet!tank!ncar!mailrus!ulowell!hawk!mschedlb From: mschedlb@hawk.ulowell.edu (Martin Schedlbauer) Newsgroups: comp.graphics Subject: Re: graph drawing algorithm Message-ID: <10091@swan.ulowell.edu> Date: 8 Nov 88 02:46:54 GMT References: <13391@cisunx.UUCP> <1026@psuhcx.psu.edu> <24313@wlbr.EATON.COM> Sender: news@swan.ulowell.edu Reply-To: mschedlb@hawk.ulowell.edu (Martin Schedlbauer) Distribution: comp.graphics Organization: University of Lowell, CS Dept. Lines: 34 In article <24313@wlbr.EATON.COM> mh@wlbr.eaton.com.UUCP (Mike Hoegeman) writes: >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 > I probably won't be of too much help right now, but I'll check my sources as soon as get them back. Anyway, I think there is some interesting stuff on that subject (in terms of references) in the Proceedings for the 1988 IEEE International Workshop on Visual Languages held October 10-12 in Pitts- burgh, PA (hosted by University of Pittsburgh.). A paper by Frances Newbery presented at the conference was concerned with that subject. Maybe that'll help some. As I said I'll try to get my proceedings back and post more exact references. From what I remember , there are several 'standard' algorithms for displaying graphs and minimizing arc crossings. She implemented some as part of her doctoral work at the University of Karlsruhe, Germany. ...Martin ============================================================================== Martin J. Schedlbauer Dept. of Computer Science University of Lowell Lowell, MA 01854