Political redistricting by computer

Authors:
Robert E. Helbig;Patrick K. Orr;Robert R. Roediger
Affiliations:
Washington Univ., St. Louis, MO;Washington Univ., St. Louis, MO;Washington Univ., St. Louis, MO
Venue:
Communications of the ACM
Year:
1972

Citing 0
Cited 3

Expert systems in government: a look at the redistricting problem

ACM SIGAPP Applied Computing Review
Heuristic search and information visualization methods for school redistricting

IAAI'06 Proceedings of the 18th conference on Innovative applications of artificial intelligence - Volume 2
Automatic Dwelling Segmentation of the Buenos Aires Province for the 2010 Argentinian Census

Interfaces

Quantified Score

Hi-index	48.22

Visualization

Abstract

The problems of political redistricting are considered and a computer method for redistricting is presented. Criteria for acceptable redistricting are discussed, including population equality, compactness, contiguity, and preservation of natural and/or political boundaries. Only nonpartisan criteria are considered. Using 1970 Bureau of Census population data, specific results are given for the ten Congressional Districts in the state of Missouri and for the seven St. Louis County Council seats. Results from the use of the algorithm indicate the feasibility of political redistricting with the aid of a computer.