- In graph theory (Operational Research in french), there is route

finder algorithms in graphs. I know this is not a simple problem (NP-

complex).

I haven't my old "OR" course, but it may be findable.

Thank you.

Mathias

--- In svg-developers@yahoogroups.com, "neumannandreas"

<neumann@k...> wrote:> > There are example of bus trajetctory with svg on the internet,

sorry

> > i don't have the url, but you should find it.

SQL

>

> Mathias, you probably refer to

> http://www.carto.net/papers/svg/samples/animated_bustrack.shtml

>

> which is a derived example of Michel Hirtzlers original idea to

> animate the dash-offset of a line.

>

> As to your previous post:

>

> A route-finding algorithm is certainly not a standard feature of a

> database. So what he needs, if he doesn't have any routing-algorithm

freeway

> already, is a commercial GIS or source-code or a clever idea of a

> route-finding algorithm. This is not a trivial thing, even more that

> you usually have to put weights on your line-segments (e.g. a

> is faster than a regular road, etc.). And with huge datasets (which

is

> usually the case in GIS) you end up with lot's of possible

it

> combinations, intially.

>

> So a route-finding algorithm is not a trivial thing todo in a day or

> so (unless you are very clever). Neither is it cheap to buy, nor is

> available in Standard SQL databases.

expensive

>

> And: you need the corresponding data, which can be even more

> than the software itself ...

>

> Well, if anyone knows a cheap or free routing algorithm (there might

> be solutions out there), I'd be interesting to hear as well ...

>

> Andreas - You can take a look at :

http://www.opengis.org/docs/99-049.pdf : link between SQL databases and

GIS

http://www.opengis.org/specs/?page=baseline : docs on the specs.

for algorithms, i found a thesis with a lot of algorithms, but don't know if

it will help (see for example Ch. 4).

http://www.fing.edu.uy/~gutierre/publications/hasta1997/these/these_index.ht

ml

I haven't an exact answer because i've never worked with that.

Mathias

-----Message d'origine-----

De : mfatene [mailto:mathias.fatene@...]

Envoyé : dimanche 2 novembre 2003 20:00

À : svg-developers@yahoogroups.com

Objet : [svg-developers] Re: I need help!

In graph theory (Operational Research in french), there is route

finder algorithms in graphs. I know this is not a simple problem (NP-

complex).

I haven't my old "OR" course, but it may be findable.

Thank you.

Mathias

--- In svg-developers@yahoogroups.com, "neumannandreas"

<neumann@k...> wrote:> > There are example of bus trajetctory with svg on the internet,

sorry

> > i don't have the url, but you should find it.

SQL

>

> Mathias, you probably refer to

> http://www.carto.net/papers/svg/samples/animated_bustrack.shtml

>

> which is a derived example of Michel Hirtzlers original idea to

> animate the dash-offset of a line.

>

> As to your previous post:

>

> A route-finding algorithm is certainly not a standard feature of a

> database. So what he needs, if he doesn't have any routing-algorithm

freeway

> already, is a commercial GIS or source-code or a clever idea of a

> route-finding algorithm. This is not a trivial thing, even more that

> you usually have to put weights on your line-segments (e.g. a

> is faster than a regular road, etc.). And with huge datasets (which

is

> usually the case in GIS) you end up with lot's of possible

it

> combinations, intially.

>

> So a route-finding algorithm is not a trivial thing todo in a day or

> so (unless you are very clever). Neither is it cheap to buy, nor is

> available in Standard SQL databases.

expensive

>

> And: you need the corresponding data, which can be even more

> than the software itself ...

-----

>

> Well, if anyone knows a cheap or free routing algorithm (there might

> be solutions out there), I'd be interesting to hear as well ...

>

> Andreas

To unsubscribe send a message to: svg-developers-unsubscribe@yahoogroups.com

-or-

visit http://groups.yahoo.com/group/svg-developers and click "edit my

membership"

----

Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/ - You could have a look at the 'Data Structures Library in Java'. Besides

other algorithms it deals with graph problems and countains an implementation of

Dijkstra's shortest-path. However the license seems to be only for

noncommercial projects.

http://www.jdsl.org

Regards,

Martin

-----Ursprüngliche Nachricht-----

Von: mfatene [mailto:mathias.fatene@...]

Gesendet: Sonntag, 2. November 2003 20:00

An: svg-developers@yahoogroups.com

Betreff: [svg-developers] Re: I need help!

In graph theory (Operational Research in french), there is route

finder algorithms in graphs. I know this is not a simple problem (NP-

complex).

I haven't my old "OR" course, but it may be findable.

Thank you.

Mathias

--- In svg-developers@yahoogroups.com, "neumannandreas"

<neumann@k...> wrote:> > There are example of bus trajetctory with svg on the internet,

sorry

> > i don't have the url, but you should find it.

SQL

>

> Mathias, you probably refer to

> http://www.carto.net/papers/svg/samples/animated_bustrack.shtml

>

> which is a derived example of Michel Hirtzlers original idea to

> animate the dash-offset of a line.

>

> As to your previous post:

>

> A route-finding algorithm is certainly not a standard feature of a

> database. So what he needs, if he doesn't have any routing-algorithm

freeway

> already, is a commercial GIS or source-code or a clever idea of a

> route-finding algorithm. This is not a trivial thing, even more that

> you usually have to put weights on your line-segments (e.g. a

> is faster than a regular road, etc.). And with huge datasets (which

is

> usually the case in GIS) you end up with lot's of possible

it

> combinations, intially.

>

> So a route-finding algorithm is not a trivial thing todo in a day or

> so (unless you are very clever). Neither is it cheap to buy, nor is

> available in Standard SQL databases.

expensive

>

> And: you need the corresponding data, which can be even more

> than the software itself ...

-----

>

> Well, if anyone knows a cheap or free routing algorithm (there might

> be solutions out there), I'd be interesting to hear as well ...

>

> Andreas

To unsubscribe send a message to: svg-developers-unsubscribe@yahoogroups.com

-or-

visit http://groups.yahoo.com/group/svg-developers and click "edit my

membership"

----

Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/

--

NEU FÜR ALLE - GMX MediaCenter - für Fotos, Musik, Dateien...

Fotoalbum, File Sharing, MMS, Multimedia-Gruß, GMX FotoService

Jetzt kostenlos anmelden unter http://www.gmx.net

+++ GMX - die erste Adresse für Mail, Message, More! +++ - Jus t want to thanks you all for getting back so soon, and for your

advice.

Thanks

Pete!

--- In svg-developers@yahoogroups.com, "Mathias FATENE"

<mathias.fatene@w...> wrote:> You can take a look at :

databases and

> http://www.opengis.org/docs/99-049.pdf : link between SQL

> GIS

don't know if

> http://www.opengis.org/specs/?page=baseline : docs on the specs.

>

> for algorithms, i found a thesis with a lot of algorithms, but

> it will help (see for example Ch. 4).

http://www.fing.edu.uy/~gutierre/publications/hasta1997/these/these_i

>

ndex.ht> ml

(NP-

>

>

> I haven't an exact answer because i've never worked with that.

> Mathias

>

> -----Message d'origine-----

> De : mfatene [mailto:mathias.fatene@w...]

> Envoyé : dimanche 2 novembre 2003 20:00

> À : svg-developers@yahoogroups.com

> Objet : [svg-developers] Re: I need help!

>

>

> In graph theory (Operational Research in french), there is route

> finder algorithms in graphs. I know this is not a simple problem

> complex).

a

>

> I haven't my old "OR" course, but it may be findable.

>

> Thank you.

> Mathias

>

> --- In svg-developers@yahoogroups.com, "neumannandreas"

> <neumann@k...> wrote:

> > > There are example of bus trajetctory with svg on the internet,

> sorry

> > > i don't have the url, but you should find it.

> >

> > Mathias, you probably refer to

> > http://www.carto.net/papers/svg/samples/animated_bustrack.shtml

> >

> > which is a derived example of Michel Hirtzlers original idea to

> > animate the dash-offset of a line.

> >

> > As to your previous post:

> >

> > A route-finding algorithm is certainly not a standard feature of

> SQL

algorithm

> > database. So what he needs, if he doesn't have any routing-

> > already, is a commercial GIS or source-code or a clever idea of a

that

> > route-finding algorithm. This is not a trivial thing, even more

> > you usually have to put weights on your line-segments (e.g. a

(which

> freeway

> > is faster than a regular road, etc.). And with huge datasets

> is

day or

> > usually the case in GIS) you end up with lot's of possible

> > combinations, intially.

> >

> > So a route-finding algorithm is not a trivial thing todo in a

> > so (unless you are very clever). Neither is it cheap to buy, nor

is

> it

might

> > available in Standard SQL databases.

> >

> > And: you need the corresponding data, which can be even more

> expensive

> > than the software itself ...

> >

> > Well, if anyone knows a cheap or free routing algorithm (there

> > be solutions out there), I'd be interesting to hear as well ...

unsubscribe@yahoogroups.com

> >

> > Andreas

>

>

>

> -----

> To unsubscribe send a message to: svg-developers-

> -or-

my

> visit http://groups.yahoo.com/group/svg-developers and click "edit

> membership"

http://docs.yahoo.com/info/terms/

> ----

>

> Your use of Yahoo! Groups is subject to