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
|
// Geometric Tools, LLC
// Copyright (c) 1998-2014
// Distributed under the Boost Software License, Version 1.0.
// http://www.boost.org/LICENSE_1_0.txt
// http://www.geometrictools.com/License/Boost/LICENSE_1_0.txt
//
// File Version: 5.0.2 (2010/04/30)
#include "Wm5ImagicsPCH.h"
#include "Wm5Binary3D.h"
using namespace Wm5;
//----------------------------------------------------------------------------
void Binary3D::GetComponents26 (ImageInt3D& image, bool storeZeros,
std::vector<IndexArray>& components)
{
// Incremental 1D offsets for 26-connected neighbors. Store +1 and -1
// first, the xy-offsets second, to be cache friendly during the
// depth-first search.
const int bound0 = image.GetBound(0);
const int bound01 = bound0*image.GetBound(1);
const int delta[26] =
{
+1,
-1,
-1 - bound0,
0 - bound0,
+1 - bound0,
-1 + bound0,
0 + bound0,
+1 + bound0,
0 + bound01,
+1 + bound01,
-1 + bound01,
-1 - bound0 + bound01,
0 - bound0 + bound01,
+1 - bound0 + bound01,
-1 + bound0 + bound01,
0 + bound0 + bound01,
+1 + bound0 + bound01,
0 - bound01,
+1 - bound01,
-1 - bound01,
-1 - bound0 - bound01,
0 - bound0 - bound01,
+1 - bound0 - bound01,
-1 + bound0 - bound01,
0 + bound0 - bound01,
+1 + bound0 - bound01
};
GetComponents(26, delta, storeZeros, image, components);
}
//----------------------------------------------------------------------------
void Binary3D::GetComponents18 (ImageInt3D& image, bool storeZeros,
std::vector<IndexArray>& components)
{
// Incremental 1D offsets for 18-connected neighbors. Store +1 and -1
// first, the xy-offsets second, to be cache friendly during the
// depth-first search.
const int bound0 = image.GetBound(0);
const int bound01 = bound0*image.GetBound(1);
const int delta[18] =
{
+1,
-1,
-1 - bound0,
0 - bound0,
+1 - bound0,
-1 + bound0,
0 + bound0,
+1 + bound0,
0 + bound01,
+1 + bound01,
-1 + bound01,
0 - bound0 + bound01,
0 + bound0 + bound01,
0 - bound01,
+1 - bound01,
-1 - bound01,
0 - bound0 - bound01,
0 + bound0 - bound01
};
GetComponents(18, delta, storeZeros, image, components);
}
//----------------------------------------------------------------------------
void Binary3D::GetComponents6 (ImageInt3D& image, bool storeZeros,
std::vector<IndexArray>& components)
{
// Incremental 1D offsets for 6-connected neighbors. Store +1 and -1
// first to be cache friendly during the depth-first search.
const int bound0 = image.GetBound(0);
const int bound01 = bound0*image.GetBound(1);
const int delta[6] =
{
+1,
-1,
-bound0,
+bound0,
+bound01,
-bound01
};
GetComponents(6, delta, storeZeros, image, components);
}
//----------------------------------------------------------------------------
void Binary3D::GetComponents (const int numNeighbors, const int delta[],
bool storeZeros, ImageInt3D& image, std::vector<IndexArray>& components)
{
const int numVoxels = image.GetQuantity();
int* numElements = new1<int>(numVoxels);
int i, numComponents = 0, label = 2;
int* vstack = new1<int>(numVoxels);
for (i = 0; i < numVoxels; ++i)
{
if (image[i] == 1)
{
int top = -1;
vstack[++top] = i;
int& count = numElements[numComponents + 1];
count = 0;
while (top >= 0)
{
int v = vstack[top];
image[v] = -1;
int j;
for (j = 0; j < numNeighbors; ++j)
{
int adj = v + delta[j];
if (image[adj] == 1)
{
vstack[++top] = adj;
break;
}
}
if (j == numNeighbors)
{
image[v] = label;
++count;
--top;
}
}
++numComponents;
++label;
}
}
delete1(vstack);
if (storeZeros)
{
if (numComponents > 0)
{
int numZeros = numVoxels;
components.resize(numComponents + 1);
for (i = 1; i <= numComponents; ++i)
{
int count = numElements[i];
components[i].resize(count);
numZeros -= count;
numElements[i] = 0;
}
components[0].resize(numZeros);
numZeros = 0;
int* zeros = &components[0][0];
for (i = 0; i < numVoxels; ++i)
{
int value = image[i];
if (value != 0)
{
// Labels started at 2 to support the depth-first search,
// so they need to be decremented for the correct labels.
image[i] = --value;
components[value][numElements[value]] = i;
++numElements[value];
}
else
{
zeros[numZeros++] = i;
}
}
}
else
{
components.resize(1);
components[0].resize(numVoxels);
int* zeros = &components[0][0];
for (i = 0; i < numVoxels; ++i)
{
zeros[i] = i;
}
}
}
else
{
if (numComponents > 0)
{
components.resize(numComponents + 1);
for (i = 1; i <= numComponents; ++i)
{
components[i].resize(numElements[i]);
numElements[i] = 0;
}
for (i = 0; i < numVoxels; ++i)
{
int value = image[i];
if (value != 0)
{
// Labels started at 2 to support the depth-first search,
// so they need to be decremented for the correct labels.
image[i] = --value;
components[value][numElements[value]] = i;
++numElements[value];
}
}
}
}
delete1(numElements);
}
//----------------------------------------------------------------------------
|
