Before revision:  We empirically demonstrate that all of our algorithms efficiently produce high-quality contiguous partitions . We combine concepts from high-performance computing and computational geometry. We extend existing load balancing algorithms to optimize arbitrary nonuniform monotonic increasing or decreasing cost functions. We reduce evaluation of our communication model to planar dominance counting. We specialize Chazelle's dominance counting algorithm to points in the bounded integer plane and generalize it to trade reduced construction time for increased query time, resulting in an overall linear runtime .
After revision:  We empirically demonstrate that all of our algorithms efficiently produce high-quality contiguous partitions .