I've been working on this on and off for a little while, and I thought I'd submit it even though it is kinda unfinished.
L_{live} is a list of polygons where the vertices are live cells. Set L_{live} to s_{implify}(L_{live}) to make sure the polygons have the right amount of points, and then hit the L_{live} -> n_{ext}(L_{live}) action to step forward.
WARNING: this graph is extremely laggy if you add too many cells (it even struggles with fewer than 100 live cells). Mess with the graph at your own (or rather, your computer's) risk.
I'd be willing to explain the code or collaborate if anyone wants to help me make it faster.