-- Geoffrey S. Knauth | http://knauth.org/gsk On May 31, 2006, at 00:16, 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 Wed May 31 2006 - 17:25:26 EDT
This archive was generated by hypermail 2.3.0 : Tue Mar 28 2017 - 23:25:07 EDT