A Novel Calculation of Localized US Congressional Shortest Split Line Districts and Its Implications
ISEF · 2015 Systems Software
Overview
The accurate representation of voter preference is a question in current U.S. Congressional elections. Shortest split line algorithms were used to test whether or not gerrymandering was the cause of this dilemma. A method was devised to localize these split lines to calculate the change in Congressional representation when gerrymandering was factored out using these algorithms. Data from New Hampshire suggests that gerrymandering is undermining Republican representation in that state. Overall, quantitative and analytical analysis of the shortest split line algorithm points toward the conclusion that the algorithm could feasibly alleviate gerrymandering.
Competition history
- ISEF 2015
Resources
Related projects
ISEF · 2023
Using Mathematical Modeling to Create Non-Gerrymandered Congressional Voting Maps
ISEF · 2026
GerrySim: A Markov Chain Monte Carlo Framework for Reducing Partisan and Racial Gerrymandering
ISEF · 2026
A Comparison of Precinct and District Voting Data Using Persistent Homology to Quantify Gerrymandering in Texas & California
ISEF · 2026
Identifying and Preserving Communities-of-Interest in PA Congressional Maps via Graph Theory and Markov Chain Algorithms
Closest projects by meaning, across every fair and year in the corpus.
Source: Regeneron International Science and Engineering Fair