Here's what I'm working on now... Given a rectangular map m by n projected from a place on earth determine the xy coords on the map given a list latitude and longitude.
Now the tricky part, don't know the type of projection beforehand except that the map has no holes, missing corners or tears and any contiguous points on the map are contiguous on the planet, can query any point on the map for it's latitude and longitude before processing the list, but not during. Reason for the first is to accomodate different mapping software, now and in the future, the no holes will be a requirement for the mapping software, and the last is due to threading issues, when it comes time to display the map the software may be generating a different image. Can anyone come up with an algorithm that uses a minimum # of points and can calculate points minimizes the amount of error? --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
