Gerrymandering and
Computational Redistricting

Olivia Guest , Frank J. Kanayet , and Bradley C. Love


Partisan gerrymandering poses a threat to democracy. One solution is using computers to draw the district lines instead of relying on politicians. To learn more about gerrymandering and our computer-based solution, please read "Gerrymandering and Computational Redistricting" by Olivia Guest, Frank J. Kanayet, and Bradley C. Love. This interactive website accompanies that paper and shows how computers can improve the districting process.

The data and code used for these simulations can be found on the OSF repository and the redistrict github repository.


Below are two interactive maps showing the existing districts (left column) (top map) and the results from our weighted k-means algorithm (right column) (bottom map). The colors used are to facilitate viewing and are randomly assigned to each congressional district — except in the case of states with at-large districts (i.e., a single district), which have no color.

Moving your cursor over a state highlights its border in black. Clicking on a state zooms both maps in, allowing you to see the state's districts close up for both reality and our solution. To find a specific location click on the magnifying glass, on the top left of both maps, to open up a search box.

Existing Solution

Clustering Solution