This is a program to meanshift cluster Google My Maps placemark
Google My Maps is a very useful service to sharing your place point to other. But when there are too many placemarks in one map, it is wasting time to move from layer to layer. With this tool, you can cluster placemarks to make it easier to move.
python 3.2+ (due to using iter() in ElementTree) sklearn and numpy
- Export GoogleMyMaps data to KML (not KMZ)
- Change KML file name as "input.kml" (There is 2 example)
- Execute "clusterGoogleMyMapsKml.py"
- It should generate "output.kml"
- Import "output.kml" into GoogleMyMaps
- If the input places is too few, the meanshift algorithm may not work. So I set a lower bound to apply clusting (MINIMUM_NUM_OF_POINTS_TO_APPLY_CLUSTER_ALGO = 10)