I have a Google map filled with pin locations across the entire United States. I want to build a program that would automatically split the pins into n # of territories based on these requirements: - A territory should include a # of pins within range [a,b]. - Territories should by default follow state lines as closely as possible while keeping split states to a minimum. - States with more pins than range [a,b] can be split into multiple, somewhat equally distributed territories. - States with fewer pins than range [a,b] can only be combined with neighboring states.
I have some knowledge of Python and C++ but don't know the terminology for how to do the above algorithm. Can someone give me some hints on where to start to do this?
Thanks.
Aucun commentaire:
Enregistrer un commentaire