forked from mxgmn/WaveFunctionCollapse
-
Notifications
You must be signed in to change notification settings - Fork 0
/
OverlappingModel.cs
286 lines (238 loc) · 7.83 KB
/
OverlappingModel.cs
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
/*
The MIT License(MIT)
Copyright(c) mxgmn 2016.
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
The software is provided "as is", without warranty of any kind, express or implied, including but not limited to the warranties of merchantability, fitness for a particular purpose and noninfringement. In no event shall the authors or copyright holders be liable for any claim, damages or other liability, whether in an action of contract, tort or otherwise, arising from, out of or in connection with the software or the use or other dealings in the software.
*/
using System;
using System.Drawing;
using System.Drawing.Imaging;
using System.Collections.Generic;
class OverlappingModel : Model
{
int[][][][] propagator;
int N;
byte[][] patterns;
List<Color> colors;
int ground;
public OverlappingModel(string name, int N, int width, int height, bool periodicInput, bool periodicOutput, int symmetry, int ground)
: base(width, height)
{
this.N = N;
periodic = periodicOutput;
var bitmap = new Bitmap($"samples/{name}.png");
int SMX = bitmap.Width, SMY = bitmap.Height;
byte[,] sample = new byte[SMX, SMY];
colors = new List<Color>();
for (int y = 0; y < SMY; y++) for (int x = 0; x < SMX; x++)
{
Color color = bitmap.GetPixel(x, y);
int i = 0;
foreach (var c in colors)
{
if (c == color) break;
i++;
}
if (i == colors.Count) colors.Add(color);
sample[x, y] = (byte)i;
}
int C = colors.Count;
long W = Stuff.Power(C, N * N);
Func<Func<int, int, byte>, byte[]> pattern = f =>
{
byte[] result = new byte[N * N];
for (int y = 0; y < N; y++) for (int x = 0; x < N; x++) result[x + y * N] = f(x, y);
return result;
};
Func<int, int, byte[]> patternFromSample = (x, y) => pattern((dx, dy) => sample[(x + dx) % SMX, (y + dy) % SMY]);
Func<byte[], byte[]> rotate = p => pattern((x, y) => p[N - 1 - y + x * N]);
Func<byte[], byte[]> reflect = p => pattern((x, y) => p[N - 1 - x + y * N]);
Func<byte[], long> index = p =>
{
long result = 0, power = 1;
for (int i = 0; i < p.Length; i++)
{
result += p[p.Length - 1 - i] * power;
power *= C;
}
return result;
};
Func<long, byte[]> patternFromIndex = ind =>
{
long residue = ind, power = W;
byte[] result = new byte[N * N];
for (int i = 0; i < result.Length; i++)
{
power /= C;
int count = 0;
while (residue >= power)
{
residue -= power;
count++;
}
result[i] = (byte)count;
}
return result;
};
Dictionary<long, int> weights = new Dictionary<long, int>();
List<long> ordering = new List<long>();
for (int y = 0; y < (periodicInput ? SMY : SMY - N + 1); y++) for (int x = 0; x < (periodicInput ? SMX : SMX - N + 1); x++)
{
byte[][] ps = new byte[8][];
ps[0] = patternFromSample(x, y);
ps[1] = reflect(ps[0]);
ps[2] = rotate(ps[0]);
ps[3] = reflect(ps[2]);
ps[4] = rotate(ps[2]);
ps[5] = reflect(ps[4]);
ps[6] = rotate(ps[4]);
ps[7] = reflect(ps[6]);
for (int k = 0; k < symmetry; k++)
{
long ind = index(ps[k]);
if (weights.ContainsKey(ind)) weights[ind]++;
else
{
weights.Add(ind, 1);
ordering.Add(ind);
}
}
}
T = weights.Count;
this.ground = (ground + T) % T;
patterns = new byte[T][];
stationary = new double[T];
propagator = new int[2 * N - 1][][][];
int counter = 0;
foreach (long w in ordering)
{
patterns[counter] = patternFromIndex(w);
stationary[counter] = weights[w];
counter++;
}
for (int x = 0; x < FMX; x++) for (int y = 0; y < FMY; y++) wave[x][y] = new bool[T];
Func<byte[], byte[], int, int, bool> agrees = (p1, p2, dx, dy) =>
{
int xmin = dx < 0 ? 0 : dx, xmax = dx < 0 ? dx + N : N, ymin = dy < 0 ? 0 : dy, ymax = dy < 0 ? dy + N : N;
for (int y = ymin; y < ymax; y++) for (int x = xmin; x < xmax; x++) if (p1[x + N * y] != p2[x - dx + N * (y - dy)]) return false;
return true;
};
for (int x = 0; x < 2 * N - 1; x++)
{
propagator[x] = new int[2 * N - 1][][];
for (int y = 0; y < 2 * N - 1; y++)
{
propagator[x][y] = new int[T][];
for (int t = 0; t < T; t++)
{
List<int> list = new List<int>();
for (int t2 = 0; t2 < T; t2++) if (agrees(patterns[t], patterns[t2], x - N + 1, y - N + 1)) list.Add(t2);
propagator[x][y][t] = new int[list.Count];
for (int c = 0; c < list.Count; c++) propagator[x][y][t][c] = list[c];
}
}
}
}
protected override bool OnBoundary(int x, int y) => !periodic && (x + N > FMX || y + N > FMY);
override protected bool Propagate()
{
bool change = false, b;
int x2, y2;
for (int x1 = 0; x1 < FMX; x1++) for (int y1 = 0; y1 < FMY; y1++) if (changes[x1][y1])
{
changes[x1][y1] = false;
for (int dx = -N + 1; dx < N; dx++) for (int dy = -N + 1; dy < N; dy++)
{
x2 = x1 + dx;
if (x2 < 0) x2 += FMX;
else if (x2 >= FMX) x2 -= FMX;
y2 = y1 + dy;
if (y2 < 0) y2 += FMY;
else if (y2 >= FMY) y2 -= FMY;
if (!periodic && (x2 + N > FMX || y2 + N > FMY)) continue;
bool[] w1 = wave[x1][y1];
bool[] w2 = wave[x2][y2];
int[][] p = propagator[N - 1 - dx][N - 1 - dy];
for (int t2 = 0; t2 < T; t2++)
{
if (!w2[t2]) continue;
b = false;
int[] prop = p[t2];
for (int i1 = 0; i1 < prop.Length && !b; i1++) b = w1[prop[i1]];
if (!b)
{
changes[x2][y2] = true;
change = true;
w2[t2] = false;
}
}
}
}
return change;
}
public override Bitmap Graphics()
{
Bitmap result = new Bitmap(FMX, FMY);
int[] bitmapData = new int[result.Height * result.Width];
if (observed != null)
{
for (int y = 0; y < FMY; y++)
{
int dy = y < FMY - N + 1 ? 0 : N - 1;
for (int x = 0; x < FMX; x++)
{
int dx = x < FMX - N + 1 ? 0 : N - 1;
Color c = colors[patterns[observed[x - dx][y - dy]][dx + dy * N]];
bitmapData[x + y * FMX] = unchecked((int)0xff000000 | (c.R << 16) | (c.G << 8) | c.B);
}
}
}
else
{
for (int y = 0; y < FMY; y++) for (int x = 0; x < FMX; x++)
{
int contributors = 0, r = 0, g = 0, b = 0;
for (int dy = 0; dy < N; dy++) for (int dx = 0; dx < N; dx++)
{
int sx = x - dx;
if (sx < 0) sx += FMX;
int sy = y - dy;
if (sy < 0) sy += FMY;
if (OnBoundary(sx, sy)) continue;
for (int t = 0; t < T; t++) if (wave[sx][sy][t])
{
contributors++;
Color color = colors[patterns[t][dx + dy * N]];
r += color.R;
g += color.G;
b += color.B;
}
}
bitmapData[x + y * FMX] = unchecked((int)0xff000000 | ((r / contributors) << 16) | ((g / contributors) << 8) | b / contributors);
}
}
var bits = result.LockBits(new Rectangle(0, 0, result.Width, result.Height), ImageLockMode.WriteOnly, PixelFormat.Format32bppArgb);
System.Runtime.InteropServices.Marshal.Copy(bitmapData, 0, bits.Scan0, bitmapData.Length);
result.UnlockBits(bits);
return result;
}
protected override void Clear()
{
base.Clear();
if (ground != 0)
{
for (int x = 0; x < FMX; x++)
{
for (int t = 0; t < T; t++) if (t != ground) wave[x][FMY - 1][t] = false;
changes[x][FMY - 1] = true;
for (int y = 0; y < FMY - 1; y++)
{
wave[x][y][ground] = false;
changes[x][y] = true;
}
}
while (Propagate()) ;
}
}
}