|
|
|
|
|
by exDM69
521 days ago
|
|
If I understood the algorithm correctly, it is using the standard WFC algorithm to generate blocks that match a constraint. Then it creates a tiling of those blocks, and substitutes parts of the tiling with new blocks generated using WFC. So it's a higher level algorithm, using WFC as its building block. |
|
It is now just a procedural algorithm, which is faster than but loses some of the magic of what makes WFC _so good_.
You can tell by looking at the renders too, the before-and-after of both methods. The difference is incomparable.
That being said, it is cool as a runtime-optimized non-WFC WFC-approximating algorithm.