Hi Guy, I think you've hit upon one of those 'hard' problems. You need to understand that it is not in general possible to lay out a graph on a plane so that no lines are crossing. Such a graph would be called 'planar' but many graphs are 'non-planar'. Someone's written a nice description of the problem here... http://rocana.aist-nara.ac.jp/~hayashi/E/graph-draw.html Or for a list of links.. http://rocana.aist-nara.ac.jp/~hayashi/links/gd.html Also, a JoshW, has written a nice graph layout applet, that might help you get started playing around with various options, you'll need to ask him for the source code. http://www.wcinet.net/~joshw/graph.html Of course the problem everyone wants to crack one is how to calculate a 'nice' layout of a graph in 3D. Try www.cybergeography.com for some cool inspiration on that, if you are gonna try that. I'd be interested to hear on your progress, good luck. > -----Original Message----- > From: Guy le Mar [SMTP:[EMAIL PROTECTED]] > Sent: Monday, March 22, 1999 11:23 AM > To: Java3D Newsgroup > Subject: [java3d] Fw: Graph layout problem > > � > Hi there, > � > I'm wondering whether anyone can point me in the right direction > to solve the following problem.... > � > In 2-D I want to layout a graph of linked nodes such that there are > no links/lines crossing. ie. I want to organise the nodes so > that the graph is displayed nicely. > � > Does anyone know of an algorithm to do this sort of thing? > � > Thanks in advance, > Guy le Mar > � > [EMAIL PROTECTED] <mailto:[EMAIL PROTECTED]> > � ����������������������� To subscribe/unsubscribe, send mail to [EMAIL PROTECTED] Java 3D Home Page: http://java.sun.com/products/java-media/3D/
