Corpus ID: 12961735

Balanced power diagrams for redistricting

  title={Balanced power diagrams for redistricting},
  author={V. Cohen-Addad and P. Klein and N. Young},
We propose a method for redistricting, decomposing a geographical area into subareas, called districts, so that the populations of the districts are as close as possible and the districts are compact and contiguous. Each district is the intersection of a polygon with the geographical area. The polygons are convex and the average number of sides per polygon is less than six. The polygons tend to be quite compact. With each polygon is associated a center. The center is the centroid of the… Expand
Balanced centroidal power diagrams for redistricting
The solution is, in a well-defined sense, a locally optimal solution to the problem of choosing centers in the plane and choosing an assignment of people to those 2-d centers so as to minimize the sum of squared distances subject to the assignment being balanced. Expand
The gerrymandering jumble: map projections permute districts’ compactness scores
It is proved mathematically that any map projection from the sphere to the plane reverses the ordering of the scores of some pair of regions for all three of these scores, including the Polsby-Popper score. Expand
Approximation Schemes for Capacitated Clustering in Doubling Metrics
This work provides the first QPTAS for both problems and the first PTAS for the uniform capacitated k-median problem for points in R^2, and arguably the first polynomial-time approximation algorithm for a non-trivial metric. Expand
Automated Congressional Redistricting
This work defines the redistricting problem and analyzes several variations of a new divide and conquer algorithm, comparing the compactness and population deviation of this new algorithm to existing algorithms and the actual districts, and offers a new solution to this challenging real-world problem. Expand
Optimal Transport on Discrete Domains
Advances in numerical optimal transport are discussed that leverage understanding of both discrete and smooth aspects of the problem, and state-of-the-art techniques in discrete optimal transportation combine insight from partial differential equations with convex analysis to reformulate, discretize, and optimize transportation problems. Expand
Redistricting using Blockchain Network
A novel framework of redistricting is proposed to enhance public participation in a redistricting process and bolster transparency in the process outcome to support submitting a redistribution problem in a blockchain network, submitting any number of districting plan for a redistricted problem, and evaluating the plans in the network. Expand
Recombination: A family of Markov chains for redistricting
This paper sets up redistricting as a graph partition problem and introduces a new family of Markov chains called Recombination (or ReCom) on the space of graph partitions and presents evidence that ReCom mixes efficiently, especially in contrast to the slow-mixing Flip, and provides experiments that demonstrate its qualitative behavior. Expand


Optimal Political Districting by Implicit Enumeration Techniques
An algorithm is given which finds all optimal solutions, for a given set of criteria, to political redistricting problems. Using “population units” as indivisible elements, the first phase generatesExpand
Defining Equitable Geographic Districts in Road Networks via Stable Matching
The problem of defining geographic districts in road networks that are equitable, in that every district has the same number of vertices and the assignment is stable in terms of geographic distance, can be solved in O(n √ n log n) time. Expand
Capacity-Constrained Voronoi Diagrams in Finite Spaces
A Voronoi diagram of a set of n sites partitions a finite set of m points into regions of different areas, called the capacities of the sites. In this paper we are interested in Voronoi diagrams inExpand
Minkowski-Type Theorems and Least-Squares Clustering
The concept of a constrained least-squares assignment is extended to continuous distributions of points, thereby obtaining existence results for power diagrams with prescribed region volumes and related to Minkowski's theorem for convex polytopes. Expand
Political redistricting by computer
Results from the use of the algorithm indicate the feasibility of political redistricting with the aid of a computer. Expand
Centroidal Voronoi Tessellations: Applications and Algorithms
Some applications of centroidal Voronoi tessellations to problems in image compression, quadrature, finite difference methods, distribution of resources, cellular biology, statistics, and the territorial behavior of animals are given. Expand
Nonpartisan Political Redistricting by Computer
OR volunteers developed a compart ness measure and a "warehouse-location" heuristic to draw nonpartisan, Constitutional political districts. The heuristic maps compact and contiguous districts ofExpand
The Promise and Perils of Computers in Redistricting
Since the 1960’s, computers have been regularly promoted as both the salvation of redistricting and as a strong corrupting force. On the one hand, computing has been proposed as a way to remove humanExpand
Fast capacity constrained Voronoi tessellation
A fast capacity constrained Voronoi tessellation algorithm which is orders of magnitude faster than the original method proposed by Balzer et al. Expand
Centroidal power diagrams with capacity constraints
This article presents a new method to optimally partition a geometric domain with capacity constraints on the partitioned regions. It is an important problem in many fields, ranging from engineerin...