Store locations

Some time ago I came across an interesting puzzle:

http://www.questers.com/news/quest-wars-win-pass-jprime-2016

In short we have some customers home addresses/locations and we need to place our store where there is the biggest concentration of people.

Here is our solution as an Android application, which uses k-means clustering algorithm. This way the engineers and marketers sent on distant planets can map the location of the population and calculate where is the most convenient location for stores, star ports and other facilities to provide the best customer service :)

Link to the repository at GitHub:
https://github.com/ektodorov/EwokStore

 Initial screen

 We add the population (coordinates are from 0-100), and input the area that the store is going to cover  (size is from 0-100)

 We see the store coverage area (the lighter colored rectangle) and the biggest cluster of population (the darker colored rectangle).