-
-
Notifications
You must be signed in to change notification settings - Fork 256
/
parallelMeshBVH.worker.js
304 lines (220 loc) · 6.85 KB
/
parallelMeshBVH.worker.js
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
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
import { MathUtils, BufferGeometry, BufferAttribute } from 'three';
import { WorkerPool } from './utils/WorkerPool.js';
import { BYTES_PER_NODE } from '../core/Constants.js';
import { buildTree, generateIndirectBuffer } from '../core/build/buildTree.js';
import { countNodes, populateBuffer } from '../core/build/buildUtils.js';
import { computeTriangleBounds } from '../core/build/computeBoundsUtils.js';
import { getFullGeometryRange, getRootIndexRanges, getTriCount } from '../core/build/geometryUtils.js';
import { DEFAULT_OPTIONS } from '../core/MeshBVH.js';
let isRunning = false;
let prevTime = 0;
const workerPool = new WorkerPool( () => new Worker( new URL( './parallelMeshBVH.worker.js', import.meta.url ), { type: 'module' } ) );
onmessage = async ( { data } ) => {
if ( isRunning ) {
throw new Error( 'Worker is already running a task.' );
}
const { operation } = data;
if ( operation === 'BUILD_BVH' ) {
isRunning = true;
const {
maxWorkerCount,
index,
position,
options,
} = data;
// initialize the number of workers balanced for a binary tree
workerPool.setWorkerCount( MathUtils.floorPowerOfTwo( maxWorkerCount ) );
// generate necessary buffers and objects
const geometry = getGeometry( index, position );
const geometryRanges = options.indirect ? getFullGeometryRange( geometry, options.range ) : getRootIndexRanges( geometry, options.range );
const indirectBuffer = options.indirect ? generateIndirectBuffer( geometry, true ) : null;
const triCount = getTriCount( geometry );
const triangleBounds = new Float32Array( new SharedArrayBuffer( triCount * 6 * 4 ) );
// generate portions of the triangle bounds buffer over multiple frames
const boundsPromises = [];
for ( let i = 0, l = workerPool.workerCount; i < l; i ++ ) {
const countPerWorker = Math.ceil( triCount / l );
const offset = i * countPerWorker;
const count = Math.min( countPerWorker, triCount - offset );
boundsPromises.push( workerPool.runSubTask(
i,
{
operation: 'BUILD_TRIANGLE_BOUNDS',
offset,
count,
index,
position,
triangleBounds,
}
) );
}
await Promise.all( boundsPromises );
// create a proxy bvh structure
const proxyBvh = {
_indirectBuffer: indirectBuffer,
geometry: geometry,
};
let totalProgress = 0;
const localOptions = {
...DEFAULT_OPTIONS,
...options,
verbose: false,
maxDepth: Math.round( Math.log2( workerPool.workerCount ) ),
onProgress: options.includedProgressCallback ?
getOnProgressDeltaCallback( delta => {
totalProgress += 0.1 * delta;
triggerOnProgress( totalProgress );
} ) :
null,
};
// generate the ranges for all roots asynchronously
const packedRoots = [];
for ( let i = 0, l = geometryRanges.length; i < l; i ++ ) {
// build the tree down to the necessary depth
const promises = [];
const range = geometryRanges[ i ];
const root = buildTree( proxyBvh, triangleBounds, range.offset, range.count, localOptions );
const flatNodes = flattenNodes( root );
let bufferLengths = 0;
let remainingNodes = 0;
let nextWorker = 0;
// trigger workers for each generated leaf node
for ( let j = 0, l = flatNodes.length; j < l; j ++ ) {
const node = flatNodes[ j ];
const isLeaf = Boolean( node.count );
if ( isLeaf ) {
// adjust the maxDepth to account for the depth we've already traversed
const workerOptions = {
...DEFAULT_OPTIONS,
...options
};
workerOptions.maxDepth = workerOptions.maxDepth - node.depth;
const pr = workerPool.runSubTask(
nextWorker ++,
{
operation: 'BUILD_SUBTREE',
offset: node.offset,
count: node.count,
indirectBuffer,
index,
position,
triangleBounds,
options: workerOptions,
},
getOnProgressDeltaCallback( delta => {
totalProgress += 0.9 * delta / nextWorker;
triggerOnProgress( totalProgress );
} ),
).then( data => {
const buffer = data.buffer;
node.buffer = buffer;
bufferLengths += buffer.byteLength;
} );
promises.push( pr );
} else {
remainingNodes ++;
}
}
// wait for the sub trees to complete
await Promise.all( promises );
const BufferConstructor = options.useSharedArrayBuffer ? SharedArrayBuffer : ArrayBuffer;
const buffer = new BufferConstructor( bufferLengths + remainingNodes * BYTES_PER_NODE );
populateBuffer( 0, root, buffer );
packedRoots.push( buffer );
}
// transfer the data back
postMessage( {
error: null,
serialized: {
roots: packedRoots,
index: index,
indirectBuffer: indirectBuffer,
},
position,
progress: 1,
} );
isRunning = false;
} else if ( operation === 'BUILD_SUBTREE' ) {
const {
offset,
count,
indirectBuffer,
index,
position,
triangleBounds,
options,
} = data;
const proxyBvh = {
_indirectBuffer: indirectBuffer,
geometry: getGeometry( index, position ),
};
const localOptions = {
...DEFAULT_OPTIONS,
...options,
onProgress: options.includedProgressCallback ? triggerOnProgress : null,
};
const root = buildTree( proxyBvh, triangleBounds, offset, count, localOptions );
const nodeCount = countNodes( root );
const buffer = new ArrayBuffer( BYTES_PER_NODE * nodeCount );
populateBuffer( 0, root, buffer );
postMessage( { type: 'result', buffer, progress: 1 }, [ buffer ] );
} else if ( operation === 'BUILD_TRIANGLE_BOUNDS' ) {
const {
index,
position,
triangleBounds,
offset,
count,
} = data;
const geometry = getGeometry( index, position );
computeTriangleBounds( geometry, triangleBounds, offset, count );
postMessage( { type: 'result' } );
} else if ( operation === 'REFIT' ) {
// TODO
} else if ( operation === 'REFIT_SUBTREE' ) {
// TODO
}
};
// Helper functions and utils
function getOnProgressDeltaCallback( cb ) {
let lastProgress = 0;
return function onProgressDeltaCallback( progress ) {
cb( progress - lastProgress );
lastProgress = progress;
};
}
function triggerOnProgress( progress ) {
// account for error
progress = Math.min( progress, 1 );
const currTime = performance.now();
if ( currTime - prevTime >= 10 && progress !== 1.0 ) {
postMessage( {
error: null,
progress,
type: 'progress'
} );
prevTime = currTime;
}
}
function getGeometry( index, position ) {
const geometry = new BufferGeometry();
if ( index ) {
geometry.index = new BufferAttribute( index, 1, false );
}
geometry.setAttribute( 'position', new BufferAttribute( position, 3 ) );
return geometry;
}
function flattenNodes( node ) {
const arr = [];
traverse( node );
return arr;
function traverse( node, depth = 0 ) {
node.depth = depth;
arr.push( node );
const isLeaf = Boolean( node.count );
if ( ! isLeaf ) {
traverse( node.left, depth + 1 );
traverse( node.right, depth + 1 );
}
}
}