Application of Computational Geometry on Multi-region Electoral Districting
Lists
Only you see this
Abstract
Different electoral districting affects the election results. The spirit of democracy is worthwhile that the election system must be fair and square and legitimately practices without the occurrence of that the political party and candidate taking advantages on the electoral districting inducing controversy over manipulating the election strategy. In this study, we developed a computational geometry based partitioning algorithm to solve the multi-region electoral districting problems. The algorithm uses the Geographic Information System as well as the dynamic programming techniques and solves the multi-region districting problems by recursively applying the two-partitioning algorithm. The problem regarding to the huge feasible solutions can be reduced substantially by introducing the concept of "indivisible regions". The contiguity test and the compactness test can be done through the knowledge of computational geometry. The method is implemented on a local county to illustrate the entire mechanism and obtained feasible solutions for further evaluation and analysis. We also used the historical voting results to evaluate our districting results and compared with the results released by CEC (Central Election Commission). The analyses show that our methods can solve the multi-region electoral districting problems successfully and effectively.
BibTeX
@inproceedings{hor2013application,
author = {Maw-Kae Hor and Tzusui Hung and Ying‐Che Hung and Cheng-Yuan Tang and Yifan Peng and Hung-Min Hsu},
title = {{Application of Computational Geometry on Multi-region Electoral Districting}},
booktitle = {Advances},
year = {2013},
doi = {10.2991/mdhss-13.2013.71},
}