-
Notifications
You must be signed in to change notification settings - Fork 3.4k
/
PolygonPipelineSpec.js
284 lines (236 loc) · 12.2 KB
/
PolygonPipelineSpec.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
defineSuite([
'Core/PolygonPipeline',
'Core/Cartesian2',
'Core/Cartesian3',
'Core/Ellipsoid',
'Core/Math',
'Core/WindingOrder'
], function(
PolygonPipeline,
Cartesian2,
Cartesian3,
Ellipsoid,
CesiumMath,
WindingOrder) {
'use strict';
beforeEach(function() {
CesiumMath.setRandomNumberSeed(0.0);
});
it('computeArea2D computes a positive area', function() {
var area = PolygonPipeline.computeArea2D([
new Cartesian2(0.0, 0.0),
new Cartesian2(2.0, 0.0),
new Cartesian2(2.0, 1.0),
new Cartesian2(0.0, 1.0)
]);
expect(area).toEqual(2.0);
});
it('computeArea2D computes a negative area', function() {
var area = PolygonPipeline.computeArea2D([
new Cartesian2(0.0, 0.0),
new Cartesian2(0.0, 2.0),
new Cartesian2(1.0, 2.0),
new Cartesian2(1.0, 0.0)
]);
expect(area).toEqual(-2.0);
});
it('computeArea2D throws without positions', function() {
expect(function() {
PolygonPipeline.computeArea2D();
}).toThrowDeveloperError();
});
it('computeArea2D throws without three positions', function() {
expect(function() {
PolygonPipeline.computeArea2D([Cartesian3.ZERO, Cartesian3.ZERO]);
}).toThrowDeveloperError();
});
///////////////////////////////////////////////////////////////////////
it('computeWindingOrder2D computes counter-clockwise', function() {
var area = PolygonPipeline.computeWindingOrder2D([
new Cartesian2(0.0, 0.0),
new Cartesian2(2.0, 0.0),
new Cartesian2(2.0, 1.0),
new Cartesian2(0.0, 1.0)
]);
expect(area).toEqual(WindingOrder.COUNTER_CLOCKWISE);
});
it('computeWindingOrder2D computes clockwise', function() {
var area = PolygonPipeline.computeWindingOrder2D([
new Cartesian2(0.0, 0.0),
new Cartesian2(0.0, 2.0),
new Cartesian2(1.0, 2.0),
new Cartesian2(1.0, 0.0)
]);
expect(area).toEqual(WindingOrder.CLOCKWISE);
});
it('computeWindingOrder2D throws without positions', function() {
expect(function() {
PolygonPipeline.computeWindingOrder2D();
}).toThrowDeveloperError();
});
it('computeWindingOrder2D throws without three positions', function() {
expect(function() {
PolygonPipeline.computeWindingOrder2D([Cartesian3.ZERO, Cartesian3.ZERO]);
}).toThrowDeveloperError();
});
describe('triangulate', function() {
// Test integration with earcut.js
// The package is tested independently. See https://github.com/mapbox/earcut
it('throws without positions', function() {
expect(function() {
PolygonPipeline.triangulate(undefined, []);
}).toThrowDeveloperError();
});
it('a triangle', function() {
var positions = [new Cartesian2(0.0, 0.0), new Cartesian2(1.0, 0.0), new Cartesian2(0.0, 1.0)];
var indices = PolygonPipeline.triangulate(positions, []);
expect(indices).toEqual([1, 2, 0]);
});
it('a square', function() {
var positions = [new Cartesian2(0.0, 0.0), new Cartesian2(1.0, 0.0), new Cartesian2(1.0, 1.0), new Cartesian2(0.0, 1.0)];
var indices = PolygonPipeline.triangulate(positions, []);
expect(indices).toEqual([2, 3, 0, 0, 1, 2]);
});
it('eliminates holes', function() {
var positions = [new Cartesian2(0.0, 0.0), new Cartesian2(3.0, 0.0), new Cartesian2(3.0, 3.0), new Cartesian2(0.0, 3.0)];
var hole = [new Cartesian2(1.0, 1.0), new Cartesian2(2.0, 1.0), new Cartesian2(2.0, 2.0), new Cartesian2(1.0, 2.0)];
var combinedPositions = positions.concat(hole);
var indices = PolygonPipeline.triangulate(combinedPositions, [4]);
expect(indices).toEqual([3, 0, 4, 5, 4, 0, 3, 4, 7, 5, 0, 1, 2, 3, 7, 6, 5, 1, 2, 7, 6, 6, 1, 2]);
});
it('eliminates multiple holes', function() {
var positions = [new Cartesian2(0.0, 0.0), new Cartesian2(3.0, 0.0), new Cartesian2(3.0, 5.0), new Cartesian2(0.0, 5.0)];
var bottomHole = [new Cartesian2(1.0, 1.0), new Cartesian2(2.0, 1.0), new Cartesian2(2.0, 2.0), new Cartesian2(1.0, 2.0)];
var topHole = [new Cartesian2(1.0, 3.0), new Cartesian2(2.0, 3.0), new Cartesian2(2.0, 4.0), new Cartesian2(1.0, 4.0)];
var combinedPositions = positions.concat(bottomHole).concat(topHole);
var indices = PolygonPipeline.triangulate(combinedPositions, [4, 8]);
expect(indices).toEqual([0, 8, 11, 0, 4, 7, 5, 4, 0, 3, 0, 11, 8, 0, 7, 5, 0, 1, 2, 3, 11, 9, 8, 7, 6, 5, 1, 2, 11, 10, 9, 7, 6, 6, 1, 2, 2, 10, 9, 9, 6, 2]);
});
});
///////////////////////////////////////////////////////////////////////
it('computeSubdivision throws without ellipsoid', function() {
expect(function() {
PolygonPipeline.computeSubdivision();
}).toThrowDeveloperError();
});
it('computeSubdivision throws without positions', function() {
expect(function() {
PolygonPipeline.computeSubdivision(Ellipsoid.WGS84);
}).toThrowDeveloperError();
});
it('computeSubdivision throws without indices', function() {
expect(function() {
PolygonPipeline.computeSubdivision(Ellipsoid.WGS84, []);
}).toThrowDeveloperError();
});
it('computeSubdivision throws with less than 3 indices', function() {
expect(function() {
PolygonPipeline.computeSubdivision(Ellipsoid.WGS84, [], [1, 2]);
}).toThrowDeveloperError();
});
it('computeSubdivision throws without a multiple of 3 indices', function() {
expect(function() {
PolygonPipeline.computeSubdivision(Ellipsoid.WGS84, [], [1, 2, 3, 4]);
}).toThrowDeveloperError();
});
it('computeSubdivision throws with negative granularity', function() {
expect(function() {
PolygonPipeline.computeSubdivision(Ellipsoid.WGS84, [], [1, 2, 3], -1.0);
}).toThrowDeveloperError();
});
it('computeSubdivision', function() {
var positions = [
new Cartesian3(0.0, 0.0, 90.0),
new Cartesian3(0.0, 90.0, 0.0),
new Cartesian3(90.0, 0.0, 0.0)
];
var indices = [0, 1, 2];
var subdivision = PolygonPipeline.computeSubdivision(Ellipsoid.WGS84, positions, indices, 60.0);
expect(subdivision.attributes.position.values[0]).toEqual(0.0);
expect(subdivision.attributes.position.values[1]).toEqual(0.0);
expect(subdivision.attributes.position.values[2]).toEqual(90.0);
expect(subdivision.attributes.position.values[3]).toEqual(0.0);
expect(subdivision.attributes.position.values[4]).toEqual(90.0);
expect(subdivision.attributes.position.values[5]).toEqual(0.0);
expect(subdivision.attributes.position.values[6]).toEqual(90.0);
expect(subdivision.attributes.position.values[7]).toEqual(0.0);
expect(subdivision.attributes.position.values[8]).toEqual(0.0);
expect(subdivision.indices[0]).toEqual(0);
expect(subdivision.indices[1]).toEqual(1);
expect(subdivision.indices[2]).toEqual(2);
});
///////////////////////////////////////////////////////////////////////
it('computeRhumbLineSubdivision throws without ellipsoid', function() {
expect(function() {
PolygonPipeline.computeRhumbLineSubdivision();
}).toThrowDeveloperError();
});
it('computeRhumbLineSubdivision throws without positions', function() {
expect(function() {
PolygonPipeline.computeRhumbLineSubdivision(Ellipsoid.WGS84);
}).toThrowDeveloperError();
});
it('computeRhumbLineSubdivision throws without indices', function() {
expect(function() {
PolygonPipeline.computeRhumbLineSubdivision(Ellipsoid.WGS84, []);
}).toThrowDeveloperError();
});
it('computeRhumbLineSubdivision throws with less than 3 indices', function() {
expect(function() {
PolygonPipeline.computeRhumbLineSubdivision(Ellipsoid.WGS84, [], [1, 2]);
}).toThrowDeveloperError();
});
it('computeRhumbLineSubdivision throws without a multiple of 3 indices', function() {
expect(function() {
PolygonPipeline.computeRhumbLineSubdivision(Ellipsoid.WGS84, [], [1, 2, 3, 4]);
}).toThrowDeveloperError();
});
it('computeRhumbLineSubdivision throws with negative granularity', function() {
expect(function() {
PolygonPipeline.computeRhumbLineSubdivision(Ellipsoid.WGS84, [], [1, 2, 3], -1.0);
}).toThrowDeveloperError();
});
it('computeRhumbLineSubdivision', function() {
var positions = Cartesian3.fromDegreesArray([
0, 0,
1, 0,
1, 1
]);
var indices = [0, 1, 2];
var subdivision = PolygonPipeline.computeRhumbLineSubdivision(Ellipsoid.WGS84, positions, indices, 2 * CesiumMath.RADIANS_PER_DEGREE);
expect(subdivision.attributes.position.values[0]).toEqual(positions[0].x);
expect(subdivision.attributes.position.values[1]).toEqual(positions[0].y);
expect(subdivision.attributes.position.values[2]).toEqual(positions[0].y);
expect(subdivision.attributes.position.values[3]).toEqual(positions[1].x);
expect(subdivision.attributes.position.values[4]).toEqual(positions[1].y);
expect(subdivision.attributes.position.values[5]).toEqual(positions[1].z);
expect(subdivision.attributes.position.values[6]).toEqual(positions[2].x);
expect(subdivision.attributes.position.values[7]).toEqual(positions[2].y);
expect(subdivision.attributes.position.values[8]).toEqual(positions[2].z);
expect(subdivision.indices[0]).toEqual(0);
expect(subdivision.indices[1]).toEqual(1);
expect(subdivision.indices[2]).toEqual(2);
});
it('computeRhumbLineSubdivision with subdivisions', function() {
var positions = Cartesian3.fromDegreesArray([
0, 0,
1, 0,
1, 1
]);
var indices = [0, 1, 2];
var subdivision = PolygonPipeline.computeRhumbLineSubdivision(Ellipsoid.WGS84, positions, indices, 0.5 * CesiumMath.RADIANS_PER_DEGREE);
expect(subdivision.attributes.position.values.length).toEqual(36); // 12 vertices
expect(subdivision.indices.length).toEqual(36); // 12 triangles
});
it('computeRhumbLineSubdivision with subdivisions across the IDL', function() {
var positions = Cartesian3.fromDegreesArray([
178, 0,
-178, 0,
-178, 1
]);
var indices = [0, 1, 2];
var subdivision = PolygonPipeline.computeRhumbLineSubdivision(Ellipsoid.WGS84, positions, indices, 0.5 * CesiumMath.RADIANS_PER_DEGREE);
expect(subdivision.attributes.position.values.length).toEqual(180); // 60 vertices
expect(subdivision.indices.length).toEqual(252); // 84 triangles
});
});