-
Notifications
You must be signed in to change notification settings - Fork 0
/
smv.pde
147 lines (124 loc) · 3.52 KB
/
smv.pde
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
import java.util.Random; //<>// //<>//
import java.util.Collections;
Visualizer visualizer;
void setup() {
size(600, 600, P2D);
visualizer = new Visualizer(0.75, 0.008);
}
void draw() {
visualizer.update();
visualizer.display();
}
class Visualizer {
float threshold;
float emptyRatio;
int[] cells;
int[] emptyCellIdxs;
int empty = color(255);
Visualizer(float t, float e) {
threshold = t;
emptyRatio = e;
cells = new int[width*height];
emptyCellIdxs = new int[int(cells.length*emptyRatio)];
for (int i = 0; i < cells.length; ++i) {
if (i < (cells.length*(1-emptyRatio))/2) {
cells[i] = color(255, 0, 0);
} else if (i < cells.length*(1-emptyRatio)) {
cells[i] = color(0, 0, 255);
} else {
cells[i] = empty;
}
}
shuffleArray(cells);
int idx = 0;
for (int i = 0; i < cells.length; ++i) {
if (cells[i] == empty) {
emptyCellIdxs[idx++] = i;
}
}
}
void update() {
ArrayList<Integer> unsatisfiedCellIdxs = new ArrayList<Integer>();
for (int i = 0; i < cells.length; ++i) {
if (isCellSatisfied(i) == false) {
unsatisfiedCellIdxs.add(i);
}
}
Collections.shuffle(unsatisfiedCellIdxs);
Random rnd = new Random();
for (int i = 0; i < unsatisfiedCellIdxs.size(); ++i) {
int unsatisfiedIdx = unsatisfiedCellIdxs.get(i);
int emptyIdx = rnd.nextInt(emptyCellIdxs.length);
int tmp = cells[emptyCellIdxs[emptyIdx]];
cells[emptyCellIdxs[emptyIdx]] = cells[unsatisfiedIdx];
cells[unsatisfiedIdx] = tmp;
emptyCellIdxs[emptyIdx] = unsatisfiedIdx;
}
}
void display() {
loadPixels();
for (int i = 0; i < cells.length; ++i) {
pixels[i] = cells[i];
}
updatePixels();
}
boolean isCellSatisfied(int idx) {
if (cells[idx] == empty) return true;
int numOfNeighboursFromTheSameGroup = 0;
int[] neighbourIdxs = getCellNeighbourIdxs(idx);
for (int i = 0; i < neighbourIdxs.length; ++i) {
if (cells[idx] == cells[neighbourIdxs[i]]) {
++numOfNeighboursFromTheSameGroup;
}
}
return (float(numOfNeighboursFromTheSameGroup) / float(neighbourIdxs.length)) >= threshold;
}
int[] getCellNeighbourIdxs(int idx) {
int left = getCellLeftNeighbourIdx(idx);
int top = getCellTopNeighbourIdx(idx);
int right = getCellRightNeighbourIdx(idx);
int bottom = getCellBottomNeighbourIdx(idx);
int topLeft = getCellLeftNeighbourIdx(top);
int topRight = getCellRightNeighbourIdx(top);
int bottomLeft = getCellLeftNeighbourIdx(bottom);
int bottomRight = getCellRightNeighbourIdx(bottom);
return new int[] { left, topLeft, top, topRight, right, bottomRight, bottom, bottomLeft };
}
int getCellLeftNeighbourIdx(int idx) {
if (idx % width == 0) {
return idx + width - 1;
} else {
return idx - 1;
}
}
int getCellRightNeighbourIdx(int idx) {
if ((idx+1) % width == 0) {
return idx - width + 1;
} else {
return idx + 1;
}
}
int getCellTopNeighbourIdx(int idx) {
if (idx < width) {
return width*height - (width-idx);
} else {
return idx - width;
}
}
int getCellBottomNeighbourIdx(int idx) {
if (idx >= width*(height-1)) {
return idx - width*(height-1);
} else {
return idx + width;
}
}
}
void shuffleArray(int[] array) {
Random rnd = new Random();
for (int i = array.length-1; i > 0; --i) {
int idx = rnd.nextInt(i+1);
int tmp = array[idx];
array[idx] = array[i];
array[i] = tmp;
}
}