Posted by aron novak on July 4, 2006 at 4:57pm
Currently my problem is to find a good algorithm to visualize a tree. The problem is:
- determine each point's coordinates - find a layout
- draw the layout
This tree is not weighted, directed one - breadth-first search output for example. The second point is very obvious. The first one is not easy, especially for very big trees (~3000 points)
Comments
This is a great question..
And a project within itself. I hope u consider using xmlrpc (which allows you to exec a binary on the server correct?) so that you can construct a program in any language.
Anyway...
So solutions in litature that i found:
http://citeseer.ist.psu.edu/cache/papers/cs/3200/ftp:zSzzSzftp.cs.uni-sb...
http://gvf.sourceforge.net/GVF.pdf -- resulted in a sourceforge project: http://gvf.sourceforge.net/
Theres more, but citeseer is down, and i dont feel like filtering through google searches. Try google scholar. Theres lots of stuff to look at. That sourceforge project is pretty interesting.
I have more papers printed out (not with links) laying around from my research in peer to peer computing.
Of course the big question is, what type of heustic to use...
A possible solution
I found a general graph visualization tool here: http://www.cs.ubc.ca/~sfingram/cs533C/small_world.html .
This is a JAVA applet so the resource consuming part of the stuff is at the visitor's side. The visitor's computer compute the layout of the graph. I think this is the usable solution.