fairfolio
Saved Projects

A Novel Calculation of Localized US Congressional Shortest Split Line Districts and Its Implications

ISEF · 2015 Systems Software

Robbins, Jack

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

Resources

Related projects

Closest projects by meaning, across every fair and year in the corpus.

Browse more like this

Source: Regeneron International Science and Engineering Fair

Save projects to your library

Sign in with Google to keep track of projects you find interesting, organized into folders. An account also raises your daily allowance for “Has this been done?”, and lets you create a key for the MCP server with a much higher limit than anonymous use. Browsing stays public.

Continue with Google