[svg-developers] Re: Need algorithm ideas for mapping graph vertices onto 2-D SVG canvas

2006-01-06 Thread run2bmi21
One non-requirement: I don't care if the vertices partially cover the edges. The edges will be painted first, and will run from vertex to vertex as straight as the crow flys. Then the vertices will be painted on top of them. Any hints or guidance appreciated. Thanks. --- In svg-developers@y

[svg-developers] Re: Need algorithm ideas for mapping graph vertices onto 2-D SVG canvas

2006-01-09 Thread Alastair Fettes
Take a look at the following foaf example from Jim Ley. http://jibbering.com/foaf/foafnaut.svg Are you doing avoidance client side or static generation side? Static collision avoidance is a much more complicated issue, especially if you don't have the use of a nice SVG DOM. Alastair --- In s

[svg-developers] Re: Need algorithm ideas for mapping graph vertices onto 2-D SVG canvas

2006-01-10 Thread run2bmi21
Thanks Alastair for the very interesting link. The kind of mapping I'd be interested in though is "static generation side" I think. I'm not interested in dragging objects or creating new vertices or edges dynamically on the SVG canvas. I'm interested in creating a huge static picture (a graph) o

[svg-developers] Re: Need algorithm ideas for mapping graph vertices onto 2-D SVG canvas

2006-01-10 Thread syraq
It sounds to me like it's close to the labeling problem. Hava a look at the Java Topology Suit (http://www.vividsolutions.com/jts/JTSHome.htm) and see if that can give any directions. It's open source and pretty well documented. /Roger --- In svg-developers@yahoogroups.com, "run2bmi21" <[EMAIL PR

[svg-developers] Re: Need algorithm ideas for mapping graph vertices onto 2-D SVG canvas

2006-01-10 Thread skatethere
--- In svg-developers@yahoogroups.com, "run2bmi21" <[EMAIL PROTECTED]> wrote: > > I'm interested in > creating a huge static picture (a graph) of a client-server universe > that contains about 1,500 vertices and about 5,000 edges, with none of > the vertices hiding or overlapping each other The m

Re: [svg-developers] Re: Need algorithm ideas for mapping graph vertices onto 2-D SVG canvas

2006-01-10 Thread Omar Abo-Namous
Hi, Did you look into these sites? http://directory.google.com/Top/Science/Math/Combinatorics/Software/Graph_Drawing/ i think this one sounds good: http://aragorn.ads.tuwien.ac.at/AGD/ please keep us informed, i'm also looking into this sort of thing. cya. Omar run2bmi21 schrieb: > Thanks A

Re: [svg-developers] Re: Need algorithm ideas for mapping graph vertices onto 2-D SVG canvas

2006-01-10 Thread Omar Abo-Namous
And if it helps: http://www.cs.brown.edu/people/rt/papers/gd-tutorial/gd-constraints.pdf Omar Abo-Namous schrieb: > Hi, > > Did you look into these sites? > > http://directory.google.com/Top/Science/Math/Combinatorics/Software/Graph_Drawing/ > > i think this one sounds good: > > http://arago

Re: [svg-developers] Re: Need algorithm ideas for mapping graph vertices onto 2-D SVG canvas

2006-01-10 Thread Omar Abo-Namous
Hi, please look at this article http://www.toomuchcookies.net/archives/498/dynamic-visualization-of-network-graphs.htm and this example: http://www.toomuchcookies.net/xslt/nodes1.svg and tell me what you think. cya and good night. Omar run2bmi21 schrieb: > Thanks Alastair for the very inter