convert GPS latitude longitude to Cartesian X and Y - gps

I found many algorithms to convert (latitude, longitude) into (X, Y)... however, I cannot verify if the results I'm getting are correct.. I found also this link which does the conversion online.. but I couldn't manage to get any algorithm which gives the same results as the one given by the link..
I would be grateful if anyone has encountered the same problem and can help me

iOS solution
If you're looking for some ready to go code in Objective-C you can check out UTM converter. It is also available as a CocoaPod.

There's a very nice Wikipedia article on UTM. It's got formulas, background, explanations of the different zones, etc...

Eric SIBERT has written a handy coordinates converter. You may use it as a validation tool. If you feel like it, you may even delve into the source code for scrutinity.

Related

Beginner wanting to use optaplanner and graphhopper to solver Vehicle Routing Problem

I'm new to VRP solving. I've got optaplanner's demo VRP running.
I have about 400 text addresses as my waypoints. I've geocoded them, so I have lat/long.
I sense that I need to calculate a LOT of distances between waypoints. I've seen the file format for .vrp and as yet haven't found how to generate that format from my list of text addresses.
I sense that graphhopper might help me to do that.
I'm still getting graphopper going. I have downloaded open street map data from https://extract.bbbike.org/ in PBF format. I sense that I need to use that to that data with graphhopper to generate input to optaplanner.
am I on the right track?
can someone point me to a guide? (I realise this is pretty niche, and I might have to find my way a little...)
Thanks and Regards
Here's the code how I generated the VRP file used in optaplanner-examples.

How to change travel mode in Mapquest as like in google as DRIVING ,WALKING?

I have got the code for generating a map and waypoints from Mapquest. But not getting enough idea to change the travel mode as Driving or walking. Please help me find a solution.
Can you provide more detail or a code sample?
If you're using the JavaScript Maps API, this might be helpful. Take a look at the options on this example. To change the travel mode, you'll want to look at the routeType parameter. Your choices are: fastest, shortest, pedestrian, multimodal, and bicycle.
If you're using the Routing Plugin for Leaflet, this might be helpful. You can use the same options for routeType as mentioned above.

How to patch up the pole holes in WhirlyGlobe

Does anybody know how can I patch the pole holes when I'm trying to load Earth surface using addQuadEarthLayerWithRemoteSource method in WhirlyGlobe framework? Any suggestions are very appreciated.
I'll refer you to the discussion here:
https://github.com/mousebird/WhirlyGlobe/issues/2
In any case, it should be resolved within in the next few days.
If you're in a hurry, you could just make up a couple of vectors, mark them as filled and stick them in the right spots.

Constructing Intersections from Google Maps API

Problem:
I am trying to reverse geocode a lat/long into a closest street intersection using Google Maps API V3. Also, for now, this doesn't have to be super accurate-- as I am just trying to anonymize an address as opposed to providing directions.
I have seen that the Geocoding Results data contains an Address Component Type of "Intersection", but this doesn't seem to be consistent at all in the return results-- and is more often that not blank.
I have also done some looking on SO for the best way to construct this barring getting it from Google directly, and the closest I have seen is: How can I find the nearest intersection via the Google Maps API?, which doesn't really resolve my issue. In light of this I have come up with my own solution, and would like some opinions, optimizations, constructive criticism, or other options entirely.
My Tentative Solution:
After playing around with the API, I decided to give the following algorithm a shot (just for context, this is written in C# within a console app):
I take an address and resolve that into a lat/long.
I then add or subtract a certain amount of lat or long from the
coordinate-- on the order of a city block (a distance which is adjusted given your
latitude) and get walking directions between the points. I do this for up to all four directions-- so the first modification would be to keep the latitude the same but subtract some longitude. Then the next modification would be to keep the latitude and add some longitude, etc.
After getting the directions, I parse the results and check the start
and end address. If they are different, I pull out the street names
and treat them as an "intersection" (even though sometimes this
results in parallel streets-- again just trying to get a ballpark).
If I don't find two different streets, I widen the distance of the end destination and repeat the process.
So far this working well enough, but obviously it is an expensive process both in terms of time, and in using up my allotted query limit. Also, I checked the API terms of service, and as long as I include their disclaimer and display the results on a Google Map I think that I am ok.
My questions for the community are:
How can I improve the efficiency of the algorithm? Specifically, in
the number of times I call the API (the implementation code is not a
problem)
Is there another way entirely to do this using the Google Maps API?
In the SO question referred to above, the solution was to loop
over building numbers. I am not sure exactly what that means-- so any
clarification would be great.
As referred to above, I do not believe this is breaking the terms of service-- but am I mistaken?
Is there another web-based API to use that may meet my needs better?
Perhaps Bing, or some other provider?
Thanks a lot for any help.
UPDATE:
I have run into my query limit for the day, so I won't be able to test any suggestions against Google today, but I am also still open to using a different API. Thanks.
Old question, but since the original poster stated they were open to solutions other than Google, Geonames has a web API for this for the U.S. See GeoNames WebServices overview and http://www.geonames.org/maps/us-reverse-geocoder.html#findNearestIntersection

translate dutch sql data to english

i currently have a dutch sql 2005 database and would like to hopefully convert a good portion of it to english if possible. I have scoured google for options however im at a loss. Some sites are suggesting a wordlist database (from TT Solutions) however the most complete one that i could find is $2000. Anybody have any suggestions?
I'm not fluent in any other language but from my experience of automated translation services they will never provide the quality of translation a human can give.
Not that automated translation is all bad, I think it's amazing they can do it, but if you are working on a commercial product you should invest the money in having it translated properly.
If you really are prepared to accept the bizarre output of a word-for-word translation, you can go looking for a free dictionary. for example, there's this one.
However, unless you really have a database of single words, the results of this process are likely to involve many "hovercraft filled with eels."
maybe automate some calls to an online babelfish implementation.