Mend the Gap: A Smart Repair Algorithm for Noisy Polygonal Tilings

Abstract Let $$T^* = \{P^*_1, \ldots , P^*_N\}$$ T ∗ = { P 1 ∗ , … , P N ∗ } be a polygonal tiling of a simply connected region $$R^*$$ R ∗ in the plane, and let $$T = \{P_1, \ldots , P_N\}$$ T = { P 1 , … , P N } be a noisy version of $$T^*$$ T ∗ obtained by making small perturbations to the coordinates of the vertices of the polygons in $$T^*$$ T ∗ . In general, T will only be an approximate tiling of a simply connected region R that closely approximates $$R^*$$ R ∗ , due to the presence of gaps and overlaps between the perturbed polygons in T . The areas of these gaps and overlaps are typically small relative to the areas of the polygons themselves. Suppose that we are given the approximate tiling T and we wish to recover the tiling $$T^*$$ T ∗ . To address this problem, we introduce a new algorithm, called , to modify the polygons in T to produce a tiling $$\widetilde{T} = \{\widetilde{P}_1, \ldots , \widetilde{P}_N\}$$ T ~ = { P ~ 1 , … , P ~ N } of R that closely approximates $$T^*$$ T ∗ , with special attention given to reproducing the adjacency relations between the polygons in $$T^*$$ T ∗ as closely as possible. The motivation for this algorithm comes from computational redistricting, where algorithms are used to build districts from smaller geographic units (e.g., voting precincts). Because districts in most U.S. states are required to be contiguous, these algorithms are fundamentally based on adjacency relations between units. Unfortunately, the best available map data for unit boundaries is often noisy, containing gaps and overlaps between units that can lead to sub