Amazing... learning of the existence/term of polyominoes is a breakthrough for me.
I’ve recently been working on developing a novel statistical test to quantify sensitivity to the modifiable areal unit problem (MAUP). The limiting factor has been the ability to efficiently generate arbitrarily shaped polygons on a lattice at random. In essence, this is needed to stochastically reallocate a spatial characteristic and measure variance.
Apparently, the exact solution I’m looking for is Donald Knuth’s algorithm X [0]. And I also found this interesting application of the algorithm [1].
I simply cannot express how much my curiosity has just peaked. Moreover, I now have reason to cite both Solomon Golomb and Donald Knuth in a paper.
I’ve recently been working on developing a novel statistical test to quantify sensitivity to the modifiable areal unit problem (MAUP). The limiting factor has been the ability to efficiently generate arbitrarily shaped polygons on a lattice at random. In essence, this is needed to stochastically reallocate a spatial characteristic and measure variance.
Apparently, the exact solution I’m looking for is Donald Knuth’s algorithm X [0]. And I also found this interesting application of the algorithm [1].
I simply cannot express how much my curiosity has just peaked. Moreover, I now have reason to cite both Solomon Golomb and Donald Knuth in a paper.
[0] https://en.m.wikipedia.org/wiki/Knuth%27s_Algorithm_X
[1] https://gfredericks.com/blog/99