| Algorithms for connection routing [message #14758] |
Mon, 22 July 2002 14:17  |
Eclipse User |
|
|
|
Originally posted by: g.wagenknecht.intershop.de
Hi!
I'm looking for public available algorithms for intelligent connection
routing (orthogonal, minizing crossings ...). Any ideas where I can found
such algorithms and/or Java implementations? I found only full graph drawing
software but I'm look for something to build a ConnectionRouter.
Cu, Gunnar
PS: Algorithms for intelligent graph layout are also welcome ;)
|
|
|
| Re: Algorithms for connection routing [message #14819 is a reply to message #14758] |
Mon, 22 July 2002 15:14  |
| Eclipse User |
|
|
|
Originally posted by: forster.fmi.uni.passau.de
Hi,
> I'm looking for public available algorithms for intelligent connection
> routing (orthogonal, minizing crossings ...). [...] Algorithms for
intelligent
> graph layout are also welcome ;)
For algorithms:
The canonical source for recent graph drawing algorithms is the yearly Graph
Drawing Conference [http://www.cs.uci.edu/~gd2002/]. Its proceedings have
been published in the Springer LNCS Series
[http://www.springer.de/comp/lncs/], Volumes 894, 1027, 1190, 1353, 1547,
1731, 1984, 2265.
The canonical introductory literature is the following book:
http://www.cs.brown.edu/people/rt/gdbook.html
Another source for information is the CiteSeer
[http://citeseer.nj.nec.com/cs], an online database for journal and
conference articles. Search for "edge routing".
Mike
|
|
|
|
|
Powered by
FUDForum. Page generated in 0.03636 seconds
] 
Search
Help
Register
Login
Home
