better handle multiple stops at a single address

[calvinmetcalf]

currently the rtree algorithm gives the most compact partitions compared to the space filling curve, but it really doesn't handle stops of varying sizes very well, is there a better algorithm we could use, or combination of algorithms.