-
Notifications
You must be signed in to change notification settings - Fork 3.4k
/
PolygonPipeline.js
429 lines (365 loc) · 17.4 KB
/
PolygonPipeline.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
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
define([
'../ThirdParty/earcut-2.1.1',
'./Cartesian2',
'./Cartesian3',
'./Cartographic',
'./Check',
'./ComponentDatatype',
'./defaultValue',
'./defined',
'./Ellipsoid',
'./EllipsoidRhumbLine',
'./Geometry',
'./GeometryAttribute',
'./Math',
'./PrimitiveType',
'./WindingOrder'
], function(
earcut,
Cartesian2,
Cartesian3,
Cartographic,
Check,
ComponentDatatype,
defaultValue,
defined,
Ellipsoid,
EllipsoidRhumbLine,
Geometry,
GeometryAttribute,
CesiumMath,
PrimitiveType,
WindingOrder) {
'use strict';
var scaleToGeodeticHeightN = new Cartesian3();
var scaleToGeodeticHeightP = new Cartesian3();
/**
* @private
*/
var PolygonPipeline = {};
/**
* @exception {DeveloperError} At least three positions are required.
*/
PolygonPipeline.computeArea2D = function(positions) {
//>>includeStart('debug', pragmas.debug);
Check.defined('positions', positions);
Check.typeOf.number.greaterThanOrEquals('positions.length', positions.length, 3);
//>>includeEnd('debug');
var length = positions.length;
var area = 0.0;
for ( var i0 = length - 1, i1 = 0; i1 < length; i0 = i1++) {
var v0 = positions[i0];
var v1 = positions[i1];
area += (v0.x * v1.y) - (v1.x * v0.y);
}
return area * 0.5;
};
/**
* @returns {WindingOrder} The winding order.
*
* @exception {DeveloperError} At least three positions are required.
*/
PolygonPipeline.computeWindingOrder2D = function(positions) {
var area = PolygonPipeline.computeArea2D(positions);
return (area > 0.0) ? WindingOrder.COUNTER_CLOCKWISE : WindingOrder.CLOCKWISE;
};
/**
* Triangulate a polygon.
*
* @param {Cartesian2[]} positions Cartesian2 array containing the vertices of the polygon
* @param {Number[]} [holes] An array of the staring indices of the holes.
* @returns {Number[]} Index array representing triangles that fill the polygon
*/
PolygonPipeline.triangulate = function(positions, holes) {
//>>includeStart('debug', pragmas.debug);
Check.defined('positions', positions);
//>>includeEnd('debug');
var flattenedPositions = Cartesian2.packArray(positions);
return earcut(flattenedPositions, holes, 2);
};
var subdivisionV0Scratch = new Cartesian3();
var subdivisionV1Scratch = new Cartesian3();
var subdivisionV2Scratch = new Cartesian3();
var subdivisionS0Scratch = new Cartesian3();
var subdivisionS1Scratch = new Cartesian3();
var subdivisionS2Scratch = new Cartesian3();
var subdivisionMidScratch = new Cartesian3();
/**
* Subdivides positions and raises points to the surface of the ellipsoid.
*
* @param {Ellipsoid} ellipsoid The ellipsoid the polygon in on.
* @param {Cartesian3[]} positions An array of {@link Cartesian3} positions of the polygon.
* @param {Number[]} indices An array of indices that determines the triangles in the polygon.
* @param {Number} [granularity=CesiumMath.RADIANS_PER_DEGREE] The distance, in radians, between each latitude and longitude. Determines the number of positions in the buffer.
*
* @exception {DeveloperError} At least three indices are required.
* @exception {DeveloperError} The number of indices must be divisable by three.
* @exception {DeveloperError} Granularity must be greater than zero.
*/
PolygonPipeline.computeSubdivision = function(ellipsoid, positions, indices, granularity) {
granularity = defaultValue(granularity, CesiumMath.RADIANS_PER_DEGREE);
//>>includeStart('debug', pragmas.debug);
Check.typeOf.object('ellipsoid', ellipsoid);
Check.defined('positions', positions);
Check.defined('indices', indices);
Check.typeOf.number.greaterThanOrEquals('indices.length', indices.length, 3);
Check.typeOf.number.equals('indices.length % 3', '0', indices.length % 3, 0);
Check.typeOf.number.greaterThan('granularity', granularity, 0.0);
//>>includeEnd('debug');
// triangles that need (or might need) to be subdivided.
var triangles = indices.slice(0);
// New positions due to edge splits are appended to the positions list.
var i;
var length = positions.length;
var subdividedPositions = new Array(length * 3);
var q = 0;
for (i = 0; i < length; i++) {
var item = positions[i];
subdividedPositions[q++] = item.x;
subdividedPositions[q++] = item.y;
subdividedPositions[q++] = item.z;
}
var subdividedIndices = [];
// Used to make sure shared edges are not split more than once.
var edges = {};
var radius = ellipsoid.maximumRadius;
var minDistance = CesiumMath.chordLength(granularity, radius);
var minDistanceSqrd = minDistance * minDistance;
while (triangles.length > 0) {
var i2 = triangles.pop();
var i1 = triangles.pop();
var i0 = triangles.pop();
var v0 = Cartesian3.fromArray(subdividedPositions, i0 * 3, subdivisionV0Scratch);
var v1 = Cartesian3.fromArray(subdividedPositions, i1 * 3, subdivisionV1Scratch);
var v2 = Cartesian3.fromArray(subdividedPositions, i2 * 3, subdivisionV2Scratch);
var s0 = Cartesian3.multiplyByScalar(Cartesian3.normalize(v0, subdivisionS0Scratch), radius, subdivisionS0Scratch);
var s1 = Cartesian3.multiplyByScalar(Cartesian3.normalize(v1, subdivisionS1Scratch), radius, subdivisionS1Scratch);
var s2 = Cartesian3.multiplyByScalar(Cartesian3.normalize(v2, subdivisionS2Scratch), radius, subdivisionS2Scratch);
var g0 = Cartesian3.magnitudeSquared(Cartesian3.subtract(s0, s1, subdivisionMidScratch));
var g1 = Cartesian3.magnitudeSquared(Cartesian3.subtract(s1, s2, subdivisionMidScratch));
var g2 = Cartesian3.magnitudeSquared(Cartesian3.subtract(s2, s0, subdivisionMidScratch));
var max = Math.max(g0, g1, g2);
var edge;
var mid;
// if the max length squared of a triangle edge is greater than the chord length of squared
// of the granularity, subdivide the triangle
if (max > minDistanceSqrd) {
if (g0 === max) {
edge = Math.min(i0, i1) + ' ' + Math.max(i0, i1);
i = edges[edge];
if (!defined(i)) {
mid = Cartesian3.add(v0, v1, subdivisionMidScratch);
Cartesian3.multiplyByScalar(mid, 0.5, mid);
subdividedPositions.push(mid.x, mid.y, mid.z);
i = subdividedPositions.length / 3 - 1;
edges[edge] = i;
}
triangles.push(i0, i, i2);
triangles.push(i, i1, i2);
} else if (g1 === max) {
edge = Math.min(i1, i2) + ' ' + Math.max(i1, i2);
i = edges[edge];
if (!defined(i)) {
mid = Cartesian3.add(v1, v2, subdivisionMidScratch);
Cartesian3.multiplyByScalar(mid, 0.5, mid);
subdividedPositions.push(mid.x, mid.y, mid.z);
i = subdividedPositions.length / 3 - 1;
edges[edge] = i;
}
triangles.push(i1, i, i0);
triangles.push(i, i2, i0);
} else if (g2 === max) {
edge = Math.min(i2, i0) + ' ' + Math.max(i2, i0);
i = edges[edge];
if (!defined(i)) {
mid = Cartesian3.add(v2, v0, subdivisionMidScratch);
Cartesian3.multiplyByScalar(mid, 0.5, mid);
subdividedPositions.push(mid.x, mid.y, mid.z);
i = subdividedPositions.length / 3 - 1;
edges[edge] = i;
}
triangles.push(i2, i, i1);
triangles.push(i, i0, i1);
}
} else {
subdividedIndices.push(i0);
subdividedIndices.push(i1);
subdividedIndices.push(i2);
}
}
return new Geometry({
attributes : {
position : new GeometryAttribute({
componentDatatype : ComponentDatatype.DOUBLE,
componentsPerAttribute : 3,
values : subdividedPositions
})
},
indices : subdividedIndices,
primitiveType : PrimitiveType.TRIANGLES
});
};
var subdivisionC0Scratch = new Cartographic();
var subdivisionC1Scratch = new Cartographic();
var subdivisionC2Scratch = new Cartographic();
var subdivisionCartographicScratch = new Cartographic();
/**
* Subdivides positions on rhumb lines and raises points to the surface of the ellipsoid.
*
* @param {Ellipsoid} ellipsoid The ellipsoid the polygon in on.
* @param {Cartesian3[]} positions An array of {@link Cartesian3} positions of the polygon.
* @param {Number[]} indices An array of indices that determines the triangles in the polygon.
* @param {Number} [granularity=CesiumMath.RADIANS_PER_DEGREE] The distance, in radians, between each latitude and longitude. Determines the number of positions in the buffer.
*
* @exception {DeveloperError} At least three indices are required.
* @exception {DeveloperError} The number of indices must be divisable by three.
* @exception {DeveloperError} Granularity must be greater than zero.
*/
PolygonPipeline.computeRhumbLineSubdivision = function(ellipsoid, positions, indices, granularity) {
granularity = defaultValue(granularity, CesiumMath.RADIANS_PER_DEGREE);
//>>includeStart('debug', pragmas.debug);
Check.typeOf.object('ellipsoid', ellipsoid);
Check.defined('positions', positions);
Check.defined('indices', indices);
Check.typeOf.number.greaterThanOrEquals('indices.length', indices.length, 3);
Check.typeOf.number.equals('indices.length % 3', '0', indices.length % 3, 0);
Check.typeOf.number.greaterThan('granularity', granularity, 0.0);
//>>includeEnd('debug');
// triangles that need (or might need) to be subdivided.
var triangles = indices.slice(0);
// New positions due to edge splits are appended to the positions list.
var i;
var length = positions.length;
var subdividedPositions = new Array(length * 3);
var q = 0;
for (i = 0; i < length; i++) {
var item = positions[i];
subdividedPositions[q++] = item.x;
subdividedPositions[q++] = item.y;
subdividedPositions[q++] = item.z;
}
var subdividedIndices = [];
// Used to make sure shared edges are not split more than once.
var edges = {};
var radius = ellipsoid.maximumRadius;
var minDistance = CesiumMath.chordLength(granularity, radius);
var rhumb0 = new EllipsoidRhumbLine(undefined, undefined, ellipsoid);
var rhumb1 = new EllipsoidRhumbLine(undefined, undefined, ellipsoid);
var rhumb2 = new EllipsoidRhumbLine(undefined, undefined, ellipsoid);
while (triangles.length > 0) {
var i2 = triangles.pop();
var i1 = triangles.pop();
var i0 = triangles.pop();
var v0 = Cartesian3.fromArray(subdividedPositions, i0 * 3, subdivisionV0Scratch);
var v1 = Cartesian3.fromArray(subdividedPositions, i1 * 3, subdivisionV1Scratch);
var v2 = Cartesian3.fromArray(subdividedPositions, i2 * 3, subdivisionV2Scratch);
var c0 = ellipsoid.cartesianToCartographic(v0, subdivisionC0Scratch);
var c1 = ellipsoid.cartesianToCartographic(v1, subdivisionC1Scratch);
var c2 = ellipsoid.cartesianToCartographic(v2, subdivisionC2Scratch);
rhumb0.setEndPoints(c0, c1);
var g0 = rhumb0.surfaceDistance;
rhumb1.setEndPoints(c1, c2);
var g1 = rhumb1.surfaceDistance;
rhumb2.setEndPoints(c2, c0);
var g2 = rhumb2.surfaceDistance;
var max = Math.max(g0, g1, g2);
var edge;
var mid;
var midHeight;
var midCartesian3;
// if the max length squared of a triangle edge is greater than granularity, subdivide the triangle
if (max > minDistance) {
if (g0 === max) {
edge = Math.min(i0, i1) + ' ' + Math.max(i0, i1);
i = edges[edge];
if (!defined(i)) {
mid = rhumb0.interpolateUsingFraction(0.5, subdivisionCartographicScratch);
midHeight = (c0.height + c1.height) * 0.5;
midCartesian3 = Cartesian3.fromRadians(mid.longitude, mid.latitude, midHeight, ellipsoid, subdivisionMidScratch);
subdividedPositions.push(midCartesian3.x, midCartesian3.y, midCartesian3.z);
i = subdividedPositions.length / 3 - 1;
edges[edge] = i;
}
triangles.push(i0, i, i2);
triangles.push(i, i1, i2);
} else if (g1 === max) {
edge = Math.min(i1, i2) + ' ' + Math.max(i1, i2);
i = edges[edge];
if (!defined(i)) {
mid = rhumb1.interpolateUsingFraction(0.5, subdivisionCartographicScratch);
midHeight = (c1.height + c2.height) * 0.5;
midCartesian3 = Cartesian3.fromRadians(mid.longitude, mid.latitude, midHeight, ellipsoid, subdivisionMidScratch);
subdividedPositions.push(midCartesian3.x, midCartesian3.y, midCartesian3.z);
i = subdividedPositions.length / 3 - 1;
edges[edge] = i;
}
triangles.push(i1, i, i0);
triangles.push(i, i2, i0);
} else if (g2 === max) {
edge = Math.min(i2, i0) + ' ' + Math.max(i2, i0);
i = edges[edge];
if (!defined(i)) {
mid = rhumb2.interpolateUsingFraction(0.5, subdivisionCartographicScratch);
midHeight = (c2.height + c0.height) * 0.5;
midCartesian3 = Cartesian3.fromRadians(mid.longitude, mid.latitude, midHeight, ellipsoid, subdivisionMidScratch);
subdividedPositions.push(midCartesian3.x, midCartesian3.y, midCartesian3.z);
i = subdividedPositions.length / 3 - 1;
edges[edge] = i;
}
triangles.push(i2, i, i1);
triangles.push(i, i0, i1);
}
} else {
subdividedIndices.push(i0);
subdividedIndices.push(i1);
subdividedIndices.push(i2);
}
}
return new Geometry({
attributes : {
position : new GeometryAttribute({
componentDatatype : ComponentDatatype.DOUBLE,
componentsPerAttribute : 3,
values : subdividedPositions
})
},
indices : subdividedIndices,
primitiveType : PrimitiveType.TRIANGLES
});
};
/**
* Scales each position of a geometry's position attribute to a height, in place.
*
* @param {Number[]} positions The array of numbers representing the positions to be scaled
* @param {Number} [height=0.0] The desired height to add to the positions
* @param {Ellipsoid} [ellipsoid=Ellipsoid.WGS84] The ellipsoid on which the positions lie.
* @param {Boolean} [scaleToSurface=true] <code>true</code> if the positions need to be scaled to the surface before the height is added.
* @returns {Number[]} The input array of positions, scaled to height
*/
PolygonPipeline.scaleToGeodeticHeight = function(positions, height, ellipsoid, scaleToSurface) {
ellipsoid = defaultValue(ellipsoid, Ellipsoid.WGS84);
var n = scaleToGeodeticHeightN;
var p = scaleToGeodeticHeightP;
height = defaultValue(height, 0.0);
scaleToSurface = defaultValue(scaleToSurface, true);
if (defined(positions)) {
var length = positions.length;
for ( var i = 0; i < length; i += 3) {
Cartesian3.fromArray(positions, i, p);
if (scaleToSurface) {
p = ellipsoid.scaleToGeodeticSurface(p, p);
}
if (height !== 0) {
n = ellipsoid.geodeticSurfaceNormal(p, n);
Cartesian3.multiplyByScalar(n, height, n);
Cartesian3.add(p, n, p);
}
positions[i] = p.x;
positions[i + 1] = p.y;
positions[i + 2] = p.z;
}
}
return positions;
};
return PolygonPipeline;
});