The Fair and Compact Districts Act
Section 1. Definitions
As used in this act:
(A) "Voting District" means any geographic area established for the purpose of electing a representative to a public office.
(B) "Convex Shape" means a two-dimensional shape for which every straight line segment connecting any two points within the shape lies entirely inside the shape. Conversely, a shape that is not convex is referred to as non-convex or concave and contains at least one pair of points for which the line segment connecting them passes outside the shape's boundary.
Section 4. Requirements for Voting Districts
(A) All voting districts established within this jurisdiction must be contiguous.
(B) All voting districts must have a convex shape as defined in Section 3(B).
(C) The body responsible for drawing district lines shall certify that each district created or redrawn under their authority conforms to the requirements of this act.
ok do maryland
Please Login to reply.
districts have to be ~equal size in terms of population
Super easy, just straighten all these lines first then move then left and right to get the same population size.
🤣
I used to code convex finding algorithms as part of my masters. This is definitely easily solvable with the population in mind. :)
But it is going to be really hard to gerrymander and do convex optimization at the same time.