route finder

[antonio]

Hi

I would want to realize an application for pocket PC that traces the route
between two points on Shape file.

You know of the library that can help me?

Thank you.
Antonio

 

[Will Chapman]

Hi

I would want to realize an application for pocket PC that traces the route
between two points on Shape file.

You know of the library that can help me?

Take a look at GpsTools on www.franson.com

HTH

Will Chapman

 

[antonio]

Hi Will Chapman, thanks for answered me

I know the Franson's GPSTools, but this doesn't allow me to trace a route.
In fact I have not found any function of the Franson that traces a route
among two points, or I am wrong.

Thank you
Antonio

 

[Will Chapman]

Hi Will Chapman, thanks for answered me

I know the Franson's GPSTools, but this doesn't allow me to trace a route.
In fact I have not found any function of the Franson that traces a route
among two points, or I am wrong.

Antonio

I'm not entirely sure what you mean by 'traces a route (bbetween) two
points'. My understanding of the term 'trace' is to draw a line or dots
(crumbs) between two consecutive points and that is easily accomplished
with GpsTools by drawing a small rectangle at points along the route.

For example I track the progress of a moving object by placing a 1x1
pixel rectangular 'crumb' at the current position each time an OnGpsFix
event fires.

In short, as long as you know a starting and finishing position you can
draw virtually any shape (rectangle, line, circle, ellipse etc) you want
along that route.

HTH

Will Chapman

 

[Paul G. Tobey [eMVP]]

You need algorithmic help, then, and how you do it is going to depend on
what map data you have. You're basically looking for a solution to the
"traveling salesman" problem, which is a commonly posed problem in computer
science classes. You might be able to find some help in a data structures
or algorithms book found in the bookstore at your local university. If you
bought a GPS library from someone that might have the ability to find
shortest or fastest routes for you...

Paul T.

 

[antonio]

Hi Paul, thanks for to answer.

I am serchind just the algorithmic.
Files that I would like to use are of the type shapefile (.shp .shx), but I
don't know if I am wrong in to consider these.
I have to make the thesis on this matter.

Thank for help.
Antonio



"Paul G. Tobey [eMVP]" <p space tobey no spam AT no instrument no spam DOT
com> ha scritto nel messaggio news:[email protected]...

 

[Paul G. Tobey [eMVP]]

I've never heard of that file type, sorry.

Paul T.

Hi Paul, thanks for to answer.

I am serchind just the algorithmic.
Files that I would like to use are of the type shapefile (.shp .shx), but
I don't know if I am wrong in to consider these.
I have to make the thesis on this matter.

Thank for help.
Antonio



"Paul G. Tobey [eMVP]" <p space tobey no spam AT no instrument no spam DOT
com> ha scritto nel messaggio

You need algorithmic help, then, and how you do it is going to depend on
what map data you have. You're basically looking for a solution to the
"traveling salesman" problem, which is a commonly posed problem in
computer science classes. You might be able to find some help in a data
structures or algorithms book found in the bookstore at your local
university. If you bought a GPS library from someone that might have the
ability to find shortest or fastest routes for you...

Paul T.

 

[antonio]

Paul don't worry yourself.
I believe that the only solution is to build alone me the algorithm.
You know a site or book that I use for solve "traveling salesman" problem.

Thank for you kindliness
Antonio



"Paul G. Tobey [eMVP]" <p space tobey no spam AT no instrument no spam DOT
com> ha scritto nel messaggio news:%[email protected]...

I've never heard of that file type, sorry.

Paul T.

Hi Paul, thanks for to answer.

I am serchind just the algorithmic.
Files that I would like to use are of the type shapefile (.shp .shx),
but I don't know if I am wrong in to consider these.
I have to make the thesis on this matter.

Thank for help.
Antonio



"Paul G. Tobey [eMVP]" <p space tobey no spam AT no instrument no spam
DOT com> ha scritto nel messaggio

You need algorithmic help, then, and how you do it is going to depend on
what map data you have. You're basically looking for a solution to the
"traveling salesman" problem, which is a commonly posed problem in
computer science classes. You might be able to find some help in a data
structures or algorithms book found in the bookstore at your local
university. If you bought a GPS library from someone that might have
the ability to find shortest or fastest routes for you...

Paul T.

Hi Will, excuse for my inaccurate English.

My intention to plan a navigator for car, therefore I have necessity
to
find the route (the minimal way between two points).
I enclose the image.

Thanks for the help

 

[Paul G. Tobey [eMVP]]

No, I'm afraid that my college days were 20 years ago, nearly, too, so
everything that I might have would be out of print my now (and in English,
of course). I would guess, though, that most second- or third-year computer
science data structures course books would mention the problem. One thing
about it is that it is (or was thought to be, in those days), an NP-complete
problem, takes more than linear time to solve for the general case of
multiple destinations and multiple 'streets', so it might be mentioned in
that context.

Paul T.

Paul don't worry yourself.
I believe that the only solution is to build alone me the algorithm.
You know a site or book that I use for solve "traveling salesman" problem.

Thank for you kindliness
Antonio



"Paul G. Tobey [eMVP]" <p space tobey no spam AT no instrument no spam DOT
com> ha scritto nel messaggio

I've never heard of that file type, sorry.

Paul T.

Hi Paul, thanks for to answer.

I am serchind just the algorithmic.
Files that I would like to use are of the type shapefile (.shp .shx),
but I don't know if I am wrong in to consider these.
I have to make the thesis on this matter.

Thank for help.
Antonio



"Paul G. Tobey [eMVP]" <p space tobey no spam AT no instrument no spam
DOT com> ha scritto nel messaggio
You need algorithmic help, then, and how you do it is going to depend
on what map data you have. You're basically looking for a solution to
the "traveling salesman" problem, which is a commonly posed problem in
computer science classes. You might be able to find some help in a
data structures or algorithms book found in the bookstore at your local
university. If you bought a GPS library from someone that might have
the ability to find shortest or fastest routes for you...

Paul T.

Hi Will, excuse for my inaccurate English.

My intention to plan a navigator for car, therefore I have necessity
to
find the route (the minimal way between two points).
I enclose the image.

Thanks for the help

 

[antonio]

Paul don't worry yourself.
I think that the good solution is to build the algorithm by myself.
Do you know any site or book that I can use for solve "traveling salesman"
problem.

Thank for you kindliness
Antonio

"Paul G. Tobey [eMVP]" <p space tobey no spam AT no instrument no spam DOT
com> ha scritto nel messaggio

I've never heard of that file type, sorry.

Paul T.

Hi Paul, thanks for to answer.

I am serchind just the algorithmic.
Files that I would like to use are of the type shapefile (.shp .shx),
but I don't know if I am wrong in to consider these.
I have to make the thesis on this matter.

Thank for help.
Antonio



"Paul G. Tobey [eMVP]" <p space tobey no spam AT no instrument no spam
DOT com> ha scritto nel messaggio
You need algorithmic help, then, and how you do it is going to depend
on what map data you have. You're basically looking for a solution to
the "traveling salesman" problem, which is a commonly posed problem in
computer science classes. You might be able to find some help in a
data structures or algorithms book found in the bookstore at your local
university. If you bought a GPS library from someone that might have
the ability to find shortest or fastest routes for you...

Paul T.

Hi Will, excuse for my inaccurate English.

My intention to plan a navigator for car, therefore I have necessity
to
find the route (the minimal way between two points).
I enclose the image.

Thanks for the help

 

[antonio]

Paul,
I have to apply this problem to a pocket Pc, therefore I don't have a big
cpu (pocketpc's cpu is 400mhz).
Do you think I could solve my problem through an NP-complete ?


"Paul G. Tobey [eMVP]" <p space tobey no spam AT no instrument no spam DOT
com> ha scritto nel messaggio news:[email protected]...

No, I'm afraid that my college days were 20 years ago, nearly, too, so
everything that I might have would be out of print my now (and in English,
of course). I would guess, though, that most second- or third-year
computer science data structures course books would mention the problem.
One thing about it is that it is (or was thought to be, in those days), an
NP-complete problem, takes more than linear time to solve for the general
case of multiple destinations and multiple 'streets', so it might be
mentioned in that context.

Paul T.

Paul don't worry yourself.
I believe that the only solution is to build alone me the algorithm.
You know a site or book that I use for solve "traveling salesman"
problem.

Thank for you kindliness
Antonio



"Paul G. Tobey [eMVP]" <p space tobey no spam AT no instrument no spam
DOT com> ha scritto nel messaggio

I've never heard of that file type, sorry.

Paul T.

Hi Paul, thanks for to answer.

I am serchind just the algorithmic.
Files that I would like to use are of the type shapefile (.shp .shx),
but I don't know if I am wrong in to consider these.
I have to make the thesis on this matter.

Thank for help.
Antonio



"Paul G. Tobey [eMVP]" <p space tobey no spam AT no instrument no spam
DOT com> ha scritto nel messaggio
You need algorithmic help, then, and how you do it is going to depend
on what map data you have. You're basically looking for a solution to
the "traveling salesman" problem, which is a commonly posed problem in
computer science classes. You might be able to find some help in a
data structures or algorithms book found in the bookstore at your
local university. If you bought a GPS library from someone that might
have the ability to find shortest or fastest routes for you...

Paul T.

Hi Will, excuse for my inaccurate English.

My intention to plan a navigator for car, therefore I have necessity
to
find the route (the minimal way between two points).
I enclose the image.

Thanks for the help

 

[Paul G. Tobey [eMVP]]

How many streets? How many possible locations? The fact that it's not
linear-time doesn't mean it's not solvable. It just means that, if you're
inputting all street maps in the world and would allow the 'salesman' to fly
from Rome to China, drive around Shanghi for a while, then fly back to Rome
in order to go from the Coliseum to Vatican City, then it will take a long
time (that is, some routes from one place to another are ridiculous, but, if
you can't eliminate them, the routing is a big problem). Obviously, there
are maps and mapping programs for the Pocket PC, so it's not impossible.

You can download Mapopolis (software is free; maps, other than demos, cost
money), and some demo maps for various counties in the world from
www.mapopolis.com. It will allow you to find an address, landmark, etc. and
then find a route to another point in the same county pretty fast (seconds).
If your start or destination point might be in the next county, then it
might take a little longer (still seconds), to find the route, and it will
use more memory to load two maps instead of one.

Paul T.

Paul,
I have to apply this problem to a pocket Pc, therefore I don't have a big
cpu (pocketpc's cpu is 400mhz).
Do you think I could solve my problem through an NP-complete ?


"Paul G. Tobey [eMVP]" <p space tobey no spam AT no instrument no spam DOT
com> ha scritto nel messaggio

No, I'm afraid that my college days were 20 years ago, nearly, too, so
everything that I might have would be out of print my now (and in
English, of course). I would guess, though, that most second- or
third-year computer science data structures course books would mention
the problem. One thing about it is that it is (or was thought to be, in
those days), an NP-complete problem, takes more than linear time to solve
for the general case of multiple destinations and multiple 'streets', so
it might be mentioned in that context.

Paul T.

Paul don't worry yourself.
I believe that the only solution is to build alone me the algorithm.
You know a site or book that I use for solve "traveling salesman"
problem.

Thank for you kindliness
Antonio



"Paul G. Tobey [eMVP]" <p space tobey no spam AT no instrument no spam
DOT com> ha scritto nel messaggio
I've never heard of that file type, sorry.

Paul T.

Hi Paul, thanks for to answer.

I am serchind just the algorithmic.
Files that I would like to use are of the type shapefile (.shp .shx),
but I don't know if I am wrong in to consider these.
I have to make the thesis on this matter.

Thank for help.
Antonio



"Paul G. Tobey [eMVP]" <p space tobey no spam AT no instrument no spam
DOT com> ha scritto nel messaggio
You need algorithmic help, then, and how you do it is going to depend
on what map data you have. You're basically looking for a solution
to the "traveling salesman" problem, which is a commonly posed
problem in computer science classes. You might be able to find some
help in a data structures or algorithms book found in the bookstore
at your local university. If you bought a GPS library from someone
that might have the ability to find shortest or fastest routes for
you...

Paul T.

Hi Will, excuse for my inaccurate English.

My intention to plan a navigator for car, therefore I have
necessity to
find the route (the minimal way between two points).
I enclose the image.

Thanks for the help

 

[antonio]

Paul I have just visited the web site, it is very interesting.
But I want to know how to build a little application for my thesis at
university ( I have to use visual basic compact fremawork).
It is sufficient for me a application that uses a small map with 500 streets
and 3 or 4 locations.


"Paul G. Tobey [eMVP]" <p space tobey no spam AT no instrument no spam DOT
com> ha scritto nel messaggio
news:%[email protected]...

 

[Paul G. Tobey [eMVP]]

I can't help you write your thesis (that's your job). All I'm saying is
that, yes, it's possible.

Paul T.

Paul I have just visited the web site, it is very interesting.
But I want to know how to build a little application for my thesis at
university ( I have to use visual basic compact fremawork).
It is sufficient for me a application that uses a small map with 500
streets and 3 or 4 locations.


"Paul G. Tobey [eMVP]" <p space tobey no spam AT no instrument no spam DOT
com> ha scritto nel messaggio

How many streets? How many possible locations? The fact that it's not
linear-time doesn't mean it's not solvable. It just means that, if
you're inputting all street maps in the world and would allow the
'salesman' to fly from Rome to China, drive around Shanghi for a while,
then fly back to Rome in order to go from the Coliseum to Vatican City,
then it will take a long time (that is, some routes from one place to
another are ridiculous, but, if you can't eliminate them, the routing is
a big problem). Obviously, there are maps and mapping programs for the
Pocket PC, so it's not impossible.

You can download Mapopolis (software is free; maps, other than demos,
cost money), and some demo maps for various counties in the world from
www.mapopolis.com. It will allow you to find an address, landmark, etc.
and then find a route to another point in the same county pretty fast
(seconds). If your start or destination point might be in the next
county, then it might take a little longer (still seconds), to find the
route, and it will use more memory to load two maps instead of one.

Paul T.

 

[antonio]

Paul thanks of everything
Goodbye.
Antonio

"Paul G. Tobey [eMVP]" <p space tobey no spam AT no instrument no spam DOT
com> ha scritto nel messaggio news:[email protected]...

I can't help you write your thesis (that's your job). All I'm saying is
that, yes, it's possible.

Paul T.

Paul I have just visited the web site, it is very interesting.
But I want to know how to build a little application for my thesis at
university ( I have to use visual basic compact fremawork).
It is sufficient for me a application that uses a small map with 500
streets and 3 or 4 locations.


"Paul G. Tobey [eMVP]" <p space tobey no spam AT no instrument no spam
DOT com> ha scritto nel messaggio

How many streets? How many possible locations? The fact that it's not
linear-time doesn't mean it's not solvable. It just means that, if
you're inputting all street maps in the world and would allow the
'salesman' to fly from Rome to China, drive around Shanghi for a while,
then fly back to Rome in order to go from the Coliseum to Vatican City,
then it will take a long time (that is, some routes from one place to
another are ridiculous, but, if you can't eliminate them, the routing is
a big problem). Obviously, there are maps and mapping programs for the
Pocket PC, so it's not impossible.

You can download Mapopolis (software is free; maps, other than demos,
cost money), and some demo maps for various counties in the world from
www.mapopolis.com. It will allow you to find an address, landmark, etc.
and then find a route to another point in the same county pretty fast
(seconds). If your start or destination point might be in the next
county, then it might take a little longer (still seconds), to find the
route, and it will use more memory to load two maps instead of one.

Paul T.

 

[Guest]

I've got the TSP pretty much done in C# for the device here:
http://blog.opennetcf.org/ctacke/PermaLink,guid,36da22ab-af6f-433e-a2e5-2a54bd63e606.aspx

And even with 1000 waypoints, perf is fine on a PPC.

-Chris

Paul don't worry yourself.
I believe that the only solution is to build alone me the algorithm.
You know a site or book that I use for solve "traveling salesman" problem.

Thank for you kindliness
Antonio



"Paul G. Tobey [eMVP]" <p space tobey no spam AT no instrument no spam DOT
com> ha scritto nel messaggio

I've never heard of that file type, sorry.

Paul T.

Hi Paul, thanks for to answer.

I am serchind just the algorithmic.
Files that I would like to use are of the type shapefile (.shp .shx),
but I don't know if I am wrong in to consider these.
I have to make the thesis on this matter.

Thank for help.
Antonio



"Paul G. Tobey [eMVP]" <p space tobey no spam AT no instrument no spam
DOT com> ha scritto nel messaggio
You need algorithmic help, then, and how you do it is going to depend
on what map data you have. You're basically looking for a solution to
the "traveling salesman" problem, which is a commonly posed problem in
computer science classes. You might be able to find some help in a
data structures or algorithms book found in the bookstore at your local
university. If you bought a GPS library from someone that might have
the ability to find shortest or fastest routes for you...

Paul T.

Hi Will, excuse for my inaccurate English.

My intention to plan a navigator for car, therefore I have necessity
to
find the route (the minimal way between two points).
I enclose the image.

Thanks for the help

 

[Paul G. Tobey [eMVP]]

You get a free PhD with that...

Paul T.

I've got the TSP pretty much done in C# for the device here:
http://blog.opennetcf.org/ctacke/PermaLink,guid,36da22ab-af6f-433e-a2e5-2a54bd63e606.aspx

And even with 1000 waypoints, perf is fine on a PPC.

-Chris

Paul don't worry yourself.
I believe that the only solution is to build alone me the algorithm.
You know a site or book that I use for solve "traveling salesman"
problem.

Thank for you kindliness
Antonio



"Paul G. Tobey [eMVP]" <p space tobey no spam AT no instrument no spam
DOT com> ha scritto nel messaggio

I've never heard of that file type, sorry.

Paul T.

Hi Paul, thanks for to answer.

I am serchind just the algorithmic.
Files that I would like to use are of the type shapefile (.shp .shx),
but I don't know if I am wrong in to consider these.
I have to make the thesis on this matter.

Thank for help.
Antonio



"Paul G. Tobey [eMVP]" <p space tobey no spam AT no instrument no spam
DOT com> ha scritto nel messaggio
You need algorithmic help, then, and how you do it is going to depend
on what map data you have. You're basically looking for a solution to
the "traveling salesman" problem, which is a commonly posed problem in
computer science classes. You might be able to find some help in a
data structures or algorithms book found in the bookstore at your
local university. If you bought a GPS library from someone that might
have the ability to find shortest or fastest routes for you...

Paul T.

Hi Will, excuse for my inaccurate English.

My intention to plan a navigator for car, therefore I have necessity
to
find the route (the minimal way between two points).
I enclose the image.

Thanks for the help

 

[Guest]

Sweet! And to think I did it "just because I could."

Where do I send the check? Can I get a degree in Legal Assistant,
Locksmith, Home Care provider or 30 other valuable professions?

-Chris


"Paul G. Tobey [eMVP]" <p space tobey no spam AT no instrument no spam DOT
com> wrote in message news:[email protected]...

You get a free PhD with that...

Paul T.

I've got the TSP pretty much done in C# for the device here:
http://blog.opennetcf.org/ctacke/PermaLink,guid,36da22ab-af6f-433e-a2e5-2a54bd63e606.aspx

And even with 1000 waypoints, perf is fine on a PPC.

-Chris

Paul don't worry yourself.
I believe that the only solution is to build alone me the algorithm.
You know a site or book that I use for solve "traveling salesman"
problem.

Thank for you kindliness
Antonio



"Paul G. Tobey [eMVP]" <p space tobey no spam AT no instrument no spam
DOT com> ha scritto nel messaggio
I've never heard of that file type, sorry.

Paul T.

Hi Paul, thanks for to answer.

I am serchind just the algorithmic.
Files that I would like to use are of the type shapefile (.shp .shx),
but I don't know if I am wrong in to consider these.
I have to make the thesis on this matter.

Thank for help.
Antonio



"Paul G. Tobey [eMVP]" <p space tobey no spam AT no instrument no spam
DOT com> ha scritto nel messaggio
You need algorithmic help, then, and how you do it is going to depend
on what map data you have. You're basically looking for a solution
to the "traveling salesman" problem, which is a commonly posed
problem in computer science classes. You might be able to find some
help in a data structures or algorithms book found in the bookstore
at your local university. If you bought a GPS library from someone
that might have the ability to find shortest or fastest routes for
you...

Paul T.

Hi Will, excuse for my inaccurate English.

My intention to plan a navigator for car, therefore I have
necessity to
find the route (the minimal way between two points).
I enclose the image.

Thanks for the help

 

[antonio]

Hi Chis, thanks for first suggestion
excuse me but I don't understand what you have written to Paul, I can't
answer immediately to you because of the jet lag.
I wanted to specify that being student I don't have commercial affairs in to
realize the application, I didn't think that a problem to help a student.
Bye Antonio

I've got the TSP pretty much done in C# for the device here:
http://blog.opennetcf.org/ctacke/PermaLink,guid,36da22ab-af6f-433e-a2e5-2a54bd63e606.aspx

And even with 1000 waypoints, perf is fine on a PPC.

-Chris

Paul don't worry yourself.
I believe that the only solution is to build alone me the algorithm.
You know a site or book that I use for solve "traveling salesman"
problem.

Thank for you kindliness
Antonio



"Paul G. Tobey [eMVP]" <p space tobey no spam AT no instrument no spam
DOT com> ha scritto nel messaggio

I've never heard of that file type, sorry.

Paul T.

Hi Paul, thanks for to answer.

I am serchind just the algorithmic.
Files that I would like to use are of the type shapefile (.shp .shx),
but I don't know if I am wrong in to consider these.
I have to make the thesis on this matter.

Thank for help.
Antonio



"Paul G. Tobey [eMVP]" <p space tobey no spam AT no instrument no spam
DOT com> ha scritto nel messaggio
You need algorithmic help, then, and how you do it is going to depend
on what map data you have. You're basically looking for a solution to
the "traveling salesman" problem, which is a commonly posed problem in
computer science classes. You might be able to find some help in a
data structures or algorithms book found in the bookstore at your
local university. If you bought a GPS library from someone that might
have the ability to find shortest or fastest routes for you...

Paul T.

Hi Will, excuse for my inaccurate English.

My intention to plan a navigator for car, therefore I have necessity
to
find the route (the minimal way between two points).
I enclose the image.

Thanks for the help

 

[Guest]

What I wrote to Paul was a joke that probably only works in English. Thje
blog entry I posted on the TSP should get you a ways toward your goal. It's
not complete and completing it will be pretty easy once you understand the
TSP and GAs in general. Basically it takes some work to understand GAs, but
once you've done that, my code will make sense, and what needs to be done to
complete it becomes pretty obvious.

-Chris

Hi Chis, thanks for first suggestion
excuse me but I don't understand what you have written to Paul, I can't
answer immediately to you because of the jet lag.
I wanted to specify that being student I don't have commercial affairs in
to realize the application, I didn't think that a problem to help a
student.
Bye Antonio

I've got the TSP pretty much done in C# for the device here:
http://blog.opennetcf.org/ctacke/PermaLink,guid,36da22ab-af6f-433e-a2e5-2a54bd63e606.aspx

And even with 1000 waypoints, perf is fine on a PPC.

-Chris

Paul don't worry yourself.
I believe that the only solution is to build alone me the algorithm.
You know a site or book that I use for solve "traveling salesman"
problem.

Thank for you kindliness
Antonio



"Paul G. Tobey [eMVP]" <p space tobey no spam AT no instrument no spam
DOT com> ha scritto nel messaggio
I've never heard of that file type, sorry.

Paul T.

Hi Paul, thanks for to answer.

I am serchind just the algorithmic.
Files that I would like to use are of the type shapefile (.shp .shx),
but I don't know if I am wrong in to consider these.
I have to make the thesis on this matter.

Thank for help.
Antonio



"Paul G. Tobey [eMVP]" <p space tobey no spam AT no instrument no spam
DOT com> ha scritto nel messaggio
You need algorithmic help, then, and how you do it is going to depend
on what map data you have. You're basically looking for a solution
to the "traveling salesman" problem, which is a commonly posed
problem in computer science classes. You might be able to find some
help in a data structures or algorithms book found in the bookstore
at your local university. If you bought a GPS library from someone
that might have the ability to find shortest or fastest routes for
you...

Paul T.

Hi Will, excuse for my inaccurate English.

My intention to plan a navigator for car, therefore I have
necessity to
find the route (the minimal way between two points).
I enclose the image.

Thanks for the help