First of all, apologies if this is in the incorrect forum - I really could't decide what this problem falls under. I am a Computer Scientist and by no stretch of the imagination a competent mathematician, so if I could have some guidance with my mathematical dilemma I would greatly appreciate any help! Here is my problem:
I have an application with a google map view that shows many thousands of pin locations. This data is retrieved over an Internet connection from our servers and displayed to the user. If the user zooms out to show a large portion of the world, then there is a large volume of geolocation data requested from the server. I need to be able to find an evenly distributed, representative subset of map pins so as to not overload the network while the user zooms in and out. Basically, I need to return x amount of map pins regardless of the zoom level, even though at zoom level 0 (zoomed fully out) there may be many many more results than at zoom level 10 (a city-wide view, for instance).
The evenly distributed portion of this problem is what I have issues with - how do I retrieve a small subset of geolocations from thousands that best represents the spread over the map.
I hope this is making sense - many thanks for any help!