Hi there,
I got another crazy idea and I need some help
. On the part that I have left to do, I want to do a none uniform 2D partitionning of a shape :
- The shape is store in a 2D array : int t = new int[SIZE][SIZE];
- Where 0 mean outside the shape and 1 inside. This shape is one block but can have holes in it.
- I want to slice/divide/partition this shape in a number of other shapes of more or less the same surface.
- The more I get awide rang of shape, the better it is.
I have give some tries with a 2D perlin noise without good résults.
Anyone have an idea where I can start ?
