Hi John,
Actually, question #2 is the most important one to answer. Do you
have a data set that represents the geography you want to ask
questions about? Do you want to know the routes over roads, or
trails, etc, and can you find a data set that has the resolution you
need to give meaningful answers.
The answer to your first question is yes, OpenMap can help you do
this, given the data. There's a com.bbn.openmap.tools.roads package
that does routing given a road network, and there are two layer
implementations that use that package, one for VPF data and one for
Shape data. The com.bbn.openmap.dataAccess.dted package will give
you access to elevation values if you have DTED data, and there are a
couple of other projection utility classes that can do the distance
math for you. So, the pieces are there, you'll have to work them
together.
But the data set problem is the hard one. You can look for Shape
file data on the web, or check out VPF VMAP data available via the
http://geoengine.nima.mil to see if you can get the resolution you
need. You might want to check out the TIGER dataset (US Census
street level data), it's available in Shape file format, but it can
get pretty large for the Nation. Using that data, you could do the
address decoding, although there are a couple of geocoding services
available on the web already that you may want to tap into. Those
site have been working on the address format problems when dealing
with the TIGER data, and probably can provide accurate starting and
ending coordinates. A google search should let you find these sites,
I can't remember them off the top of my head.
Hope this helps,
Don
On May 31, 2006, at 12:16 AM, John Didion wrote:
> With all the tools/data available today, it seems like it should be
> possible to write an application to do the following:
>
>
>
> Given a starting and ending address, generate the N shortest routes
> between the two points
> For each route, get the latitude/longitude coordinates for each
> point along the route at M meter intervals
> Get the elevation E of each point
> Calculate the actual surface distance of each route by summing the
> distance between each set of consecutive points: sqrt(M^2 + (E –
> Eprevious)^2)
> Calculate the time to travel each route using some calculation I
> haven’t figured out yet
>
>
> I’m confident I can figure out how to do it given the right tool(s)
> and dataset(s). My questions for the group: 1) is OpenMap the right
> tool for this? 2) what datasets should I use?
>
>
--
[To unsubscribe to this list send an email to "majdart_at_bbn.com"
with the following text in the BODY of the message "unsubscribe openmap-users"]
Received on Thu Jun 01 2006 - 01:00:25 EDT