Consider drawing political districts to minimize the average distance someone has to travel to get to another district. The motivation is to make it easy to move if one is not happy with one's current district. This is the opposite of typical redistricting algorithms which tend to put high density regions in their own district.
Unfortunately, this will probably result in some highly intertwined shapes, perhaps fractals. Need some other constraint. Perhaps convexity.
No comments :
Post a Comment