My group is creating an application for our college minor project. In this project we're going to find nearest users to a specified user. To do this, I am thinking of using the OSM data points and use it to populate a graph of the specified user's city and then plot all the users in that location. I dont need tiling as, i dont need to display the map. I am just going to use the OSM data points to calculate who is the nearest and use it. OSM doesn't have any good documentation of using it with C# ASP.NET. All i could find were some libraries with no or very few documentation. I found OSMSharp to be on the wiki page of OSM. As It is already in the headings, i am only considering which users are nearest. I want to use Djikstra Algorithm on the populated graph to calculate shortest path(my consideration is only weight of that path). asked 15 May '16, 11:31  zetaxavier |
One Answer:
Sorry I'm little bit late, but you can use this software answered 08 Jun '17, 13:43  vanhapanda |
Hi zetaxavier, I don’t think that the who’s nearest list is made for external studies, they’re meant for use amongst mappers. So there might be some privacy issues ! I personally will not be glad to find my specs elsewhere; they are just available amongst OSM'rs.
Thanks for your concern. But i am following the privacy guidelines here. Every user is given terms and condition. And then after that we're only taking data of the users who are willing to give data.