Fetching the paper…
Reading the bibliography…
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.
Nonpartisan political redistricting by computer
S. W. Hess, J. B. Weaver, H. J. Siegfeldt, J. N. Whelan, and P. A. Zitlau · 1965
Earlier work this paper cites.
Optimal political districting by implicit enumeration techniques
R. S. Garfinkel and G. L. Nemhauser · 1970
Earlier work this paper cites.
Political redistricting by computer
Robert E Helbig, Patrick K Orr, and Robert R Roediger · 1972
Earlier work this paper cites.
Power diagrams: Properties, algorithms and applications
Franz Aurenhammer · 1987
Earlier work this paper cites.
An efficient implementation of a scaling minimum-cost flow algorithm
Andrew V. Goldberg · 1997
Earlier work this paper cites.
Minkowski-type theorems and least-squares clustering
Franz Aurenhammer, Friedrich Hoffmann, and Boris Aronov · 1998
Earlier work this paper cites.
Centroidal Voronoi tessellations: Applications and algorithms
Qiang Du, Vance Faber, and Max Gunzburger · 1999
Earlier work this paper cites.
k k -means++: the advantages of careful seeding
David Arthur and Sergei Vassilvitskii · 2007
Earlier work this paper cites.
The problem of redistricting: The use of centroidal Voronoi diagrams to build unbiased congressional districts
Stacy Miller · 2007
Cited alongside, same era.
Electoral redistricting with moment of inertia and diminishing halves models
Andrew Spann, Daniel Kane, and Dan Gulotta · 2007
Cited alongside, same era.
Capacity-constrained Voronoi diagrams in finite spaces
Michael Balzer and Daniel Heck · 2008
Cited alongside, same era.
Capacity-constrained point distributions: A variant of Lloyd’s method
Michael Balzer, Thomas Schlömer, and Oliver Deussen · 2009
Cited alongside, same era.
The planar k k -means problem is NP-hard
Meena Mahajan, Prajakta Nimbhorkar, and Kasturi Varadarajan · 2009
Cited alongside, same era.
The promise and perils of computers in redistricting
Micah Altman and Michael McDonald · 2010
A political redistricting tool for the rest of us — other approaches to redistricting
Evan Kleiner and Albert Schueller · 2013
Later among the works it cites.
Centroidal power diagrams with capacity constraints: Computation, applications, and extension
Shi-Qing Xin, Bruno Lévy, Zhonggui Chen, Lei Chu, Yaohui Yu, Changhe Tu, and Wenping Wang · 2016
Later among the works it cites.
Cartographic boundary shapefiles –states
United States Census Bureau · 2017
Closest in time.
Tiger/line with selected demographic and economic data; population % housing unit counts — blocks
United States Census Bureau · 2017
Closest in time.
Defining equitable geographic districts in road networks via stable matching
David Eppstein, Michael Goodrich, Doruk Korkmaz, and Nil Mamano · 2017
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Fast capacity constrained Voronoi tessellation
Hongwei Li, Diego Nehab, Li-Yi Wei, Pedro V. Sander, and Chi-Wing Fu · 2010
Cited alongside, same era.
Blue noise through optimal transport
Fernando De Goes, Katherine Breeden, Victor Ostromoukhov, and Mathieu Desbrun · 2012
Cited alongside, same era.
All about redistricting: Professor justin levitt’s guide to drawing the electoral lines
Justin Levitt · 2017
Closest in time.
RangeVoting.org - Theoretical Issues in Districting Algorithms
Brian Olson and Warren D. Smith · 2017
Closest in time.