[EM] Shortest splitline maps with 2010 (2013) data

[Raph Frank]

I wrote a quick implementation using the Hilbert space.  I think I have the
point comparison correct.  It uses the center of the bounding box of the
district as the middle of the Hilbert curve.

The largest curve goes top left to bottom left to bottom right to top right.

http://raphfrk.com/district/2010/html/index.html

It doesn't actually give contiguous districts, since the curve isn't
restricted to the state boundary.



On Mon, Nov 28, 2016 at 8:01 PM, Kristofer Munsterhjelm <
km_elmet at t-online.de> wrote:

> On 11/27/2016 11:17 PM, Raph Frank wrote:
> > I have improved the population balancing and the html formatting.
> >
> > The new link is at
> >
> > http://raphfrk.com/district/2010/html/index.html
>
> Perhaps you could try a Sierpinski space-filling curve approximation
> next? http://rangevoting.org/SpaceFillCurve.html
>
> In essence, you use a space-filling curve to turn the 2D map into 1D,
> trivially partition the line, then map back. I imagine you'd have to use
> postprocessing to even out the fractal boundaries a little, however, and
> to ensure that the districts are contiguous, but it's conceptually a
> very simple algorithm.
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.electorama.com/pipermail/election-methods-electorama.com/attachments/20161128/2ea7632e/attachment.htm>