There are dozens of measures of compactness. This vignette introduces
some of the most common and most important measures of compactness. See
the vignette “Using redistmetrics” for the bare-bones of
the package.
We first load the redistmetrics package and data from
New Hampshire. For any function, the shp argument can be
swapped out for your data and the plans argument can be
swapped out for your redistricting plans (be it a single plan, a matrix
of plans, or a redist_plans object).
The New Hampshire proposed Republican plan looks like:
Polsby-Popper is proportional to the ratio of a districts area (\(A_D\)) and its perimeter (\(P_D\)). Formally, it can be written as:
\[ \textrm{Polsby-Popper} = 4\pi\frac{A_D}{P_D^2}\] Scores range from 0 to 1, where 0 is the least compact and 1 is the most compact.
Polsby-Popper compactness can be computed with:
Schwartzberg Compactness is similar to Polsby-Popper compactness and is also based on the comparison of a district’s perimeter (\(P_D\)) to its area (\(A_D\)). Formally, it can be written as:
\[ \textrm{Schwartzberg} = \frac{1}{\frac{P_D}{2\pi\sqrt{A_D/\pi}}}\]
Scores range from 0 to 1, where 0 is the least compact and 1 is the most compact.
Schwartzberg compactness can be computed with:
Reock compactness compares the area of the district (\(A_D\)) to the area of the minimum bounding circle (\(A_{MBC}\)).
Formally, it can be written as:
\[ \textrm{Reock} = \frac{A_D}{A_{MBC}} \] Scores range from 0 to 1, where 0 is the least compact and 1 is the most compact.
Reock compactness can be computed with:
Box Reock compactness compares the area of the district (\(A_D\)) to the area of the minimum bounding rectangle (\(A_{MBR}\)).
Formally, it can be written as:
\[ \textrm{Box Reock} = \frac{A_D}{A_{MBR}} \]
Scores range from 0 to 1, where 0 is the least compact and 1 is the most compact.
Box Reock compactness can be computed with:
Convex Hull compactness compares the area of the district (\(A_D\)) to the area of the convex hull (\(A_{CV}\)).
Formally, it can be written as:
\[ \textrm{Convex Hull} = \frac{A_D}{A_{CV}} \] Scores range from 0 to 1, where 0 is the least compact and 1 is the most compact.
Convex Hull compactness can be computed with:
Skew compactness compares the area of the maximum inscribed circle (\(A_{MIC}\)) to the area of the minimum bounding circle (\(A_{MBC}\)).
Formally, it can be written as:
\[ \textrm{Skew} = \frac{A_{MIC}}{A_{MBC}} \] Scores range from 0 to 1, where 0 is the least compact and 1 is the most compact.
Skew compactness can be computed with:
X-Symmetry compactness compares the area of the intersection of a district reflected over its x-axis (\(A(I(D, D^{X}))\)) to the area of the district (\(A_D\)).
Formally, it can be written as:
\[ \textrm{X-Symmetry} = \frac{A(I(D, D^{X}))}{A_D} \] Scores range from 0 to 1, where 0 is the least compact and 1 is the most compact.
X-Symmetry compactness can be computed with:
Y-Symmetry compactness compares the area of the intersection of a district reflected over its y-axis (\(A(I(D, D^{Y}))\)) to the area of the district (\(A_D\)).
Formally, it can be written as:
\[ \textrm{Y-Symmetry} = \frac{A(I(D, D^{Y}))}{A_D} \] Scores range from 0 to 1, where 0 is the least compact and 1 is the most compact.
Y-Symmetry compactness can be computed with:
Length-Width compactness compares the width and the length of a district. Given a bounding box for a district (the rectangle which surrounds a district, with top and bottom parallel to the equator and sides orthogonal to the equator), the width (\(W\)) is defined as the shorter side of that box and the length (\(L\)) as the longer side of that box.
Formally, it can be written as:
\[ \textrm{Length-Width} = \frac{Width}{Length} \] Scores range from 0 to 1, where 0 is the least compact and 1 is the most compact.
Length-Width compactness can be computed with:
Boyce-Clark compactness looks at the distance from the interior
center of the shape to 16 evenly spaced radials. The interior center of
the shape is defined as the centroid if that is within the shape. If it
is not within the shape, we define it using a central point on its
surface (using geos::geos_point_on_surface()). With those
radials, we compute the distances \(d_{r_i}\) for each of the \(i = 1:16\) (for the recommended \(n = 16\)) radials and look at the mean
absolute deviation.
Formally, it can be written as:
\[\textrm{Boyce-Clark} = \sum_{i=1}^{16}\big|\frac{r_{i}}{\sum_{i=1}^{16} r_i} * 100 - \frac{100}{n}\big|\] Scores range from 0 to \(\infty\), where 0 is the most compact and \(\infty\) is the least compact.
Boyce-Clark compactness can be computed with:
Fryer-Holden describes the person-distance achieved by the plan. Individual scores do not carry much meaning and are intended to be normalized by the minimal possible score, which can be difficult to compute. Given the population of each redistricting unit \(P_i\) and the distance between two units \(D_{ij}\), then for any district \(k\), we compute the score as the squared distance between the people in unit \(i\) and \(j\).
Formally, the numerator can be written as:
\[\sum_{k = 1}^{n_d} = \sum_{i \in k} \sum{j \in k} P_iP_jD_{ij}^2\] Smaller scores are more compact. When used with a denominator, a score of 1 is most compact and higher scores are less compact.
Fryer-Holden compactness can be computed with:
Edges Removed compactness describes the number of edges that have to be removed from an adjacency graph to draw a district. Inuitively, the edges between redistricting units which are in districts are removed. This correlates to Polsby-Popper compactness. For a given adjacency graph \(a\), we can write out the number of edges as \(E(a)\) and consider the edges removed for a plan \(\pi\).
Formally, this is then written as:
\[ \textrm{Edges Removed} = E(a) - E_\pi(a)\] Larger scores are less compact.
Edges-Removed compactness can be computed with:
Fraction Kept compactness describes the fraction of edges that have to be kept when an adjacency graph is cut to form a district. This is rescaling of Edges Removed Compactness for more consistent interpretation. For a given adjacency graph \(a\), we can write out the number of edges as \(E(a)\) and consider the edges removed for a plan \(\pi\).
Formally, this is then written as:
\[ \textrm{Fraction Kept} = \frac{E(a) - E_\pi(a)}{E(a)}\] Scores range from 0 to 1 where 0 is least compact and 1 is most compact.
Fraction Kept compactness can be computed with:
For a given adjacency graph, we can consider some set of spanning trees that can be drawn from it. The number of such spanning trees \(n_st\) can be constrained more meaningfully by first drawing spanning trees within districts, which describes the compactness component of the Sequential Monte Carlo (McCartan and Imai 2020) algorithm.
Formally, it can be written as:
\[ \textrm{Log Spanning Tree} = \textrm{log}(n_st)\]
A larger number of log spanning trees is more compact.
Log Spanning Tree compactness can be computed with:
Compactness scores can be slow to compute, especially when comparing 1000s of plans with thousands of geographic units. Some basic recommendations:
rmapshaper::ms_simplify() to simplify if a small
degree of accuracy loss is acceptableprep_perims() once and save the output if
relying on Polsby-Popper for more than a single plan.A rough ordering of speeds to compute:
useRcpp = TRUE
(Polsby-Popper, Schwartzberg)