cesium_dev_kit 1.0.44 → 1.0.46

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
@@ -1,242 +0,0 @@
1
- "use strict";
2
-
3
- Object.defineProperty(exports, "__esModule", {
4
- value: true
5
- });
6
- exports.P = void 0;
7
- var P = {
8
- version: "1.0.0"
9
- };
10
- exports.P = P;
11
- P.PlotUtils = {};
12
- P.PlotUtils.distance = function (t, o) {
13
- return Math.sqrt(Math.pow(t[0] - o[0], 2) + Math.pow(t[1] - o[1], 2));
14
- };
15
- P.PlotUtils.wholeDistance = function (t) {
16
- for (var o = 0, e = 0; e < t.length - 1; e++) o += P.PlotUtils.distance(t[e], t[e + 1]);
17
- return o;
18
- };
19
- P.PlotUtils.getBaseLength = function (t) {
20
- return Math.pow(P.PlotUtils.wholeDistance(t), .99);
21
- };
22
- P.PlotUtils.mid = function (t, o) {
23
- return [(t[0] + o[0]) / 2, (t[1] + o[1]) / 2];
24
- };
25
- P.PlotUtils.getCircleCenterOfThreePoints = function (t, o, e) {
26
- var r = [(t[0] + o[0]) / 2, (t[1] + o[1]) / 2],
27
- n = [r[0] - t[1] + o[1], r[1] + t[0] - o[0]],
28
- g = [(t[0] + e[0]) / 2, (t[1] + e[1]) / 2],
29
- i = [g[0] - t[1] + e[1], g[1] + t[0] - e[0]];
30
- return P.PlotUtils.getIntersectPoint(r, n, g, i);
31
- };
32
- P.PlotUtils.getIntersectPoint = function (t, o, e, r) {
33
- if (t[1] == o[1]) {
34
- var n = (r[0] - e[0]) / (r[1] - e[1]),
35
- g = n * (t[1] - e[1]) + e[0],
36
- i = t[1];
37
- return [g, i];
38
- }
39
- if (e[1] == r[1]) {
40
- var s = (o[0] - t[0]) / (o[1] - t[1]);
41
- return g = s * (e[1] - t[1]) + t[0], i = e[1], [g, i];
42
- }
43
- return s = (o[0] - t[0]) / (o[1] - t[1]), n = (r[0] - e[0]) / (r[1] - e[1]), i = (s * t[1] - t[0] - n * e[1] + e[0]) / (s - n), g = s * i - s * t[1] + t[0], [g, i];
44
- };
45
- P.PlotUtils.getAzimuth = function (t, o) {
46
- var e,
47
- r = Math.asin(Math.abs(o[1] - t[1]) / P.PlotUtils.distance(t, o));
48
- return o[1] >= t[1] && o[0] >= t[0] ? e = r + Math.PI : o[1] >= t[1] && o[0] < t[0] ? e = P.Constants.TWO_PI - r : o[1] < t[1] && o[0] < t[0] ? e = r : o[1] < t[1] && o[0] >= t[0] && (e = Math.PI - r), e;
49
- };
50
- P.PlotUtils.getAngleOfThreePoints = function (t, o, e) {
51
- var r = P.PlotUtils.getAzimuth(o, t) - P.PlotUtils.getAzimuth(o, e);
52
- return 0 > r ? r + P.Constants.TWO_PI : r;
53
- };
54
- P.PlotUtils.isClockWise = function (t, o, e) {
55
- return (e[1] - t[1]) * (o[0] - t[0]) > (o[1] - t[1]) * (e[0] - t[0]);
56
- };
57
- P.PlotUtils.getPointOnLine = function (t, o, e) {
58
- var r = o[0] + t * (e[0] - o[0]),
59
- n = o[1] + t * (e[1] - o[1]);
60
- return [r, n];
61
- };
62
- P.PlotUtils.getCubicValue = function (t, o, e, r, n) {
63
- t = Math.max(Math.min(t, 1), 0);
64
- var g = 1 - t,
65
- i = t * t,
66
- s = i * t,
67
- a = g * g,
68
- l = a * g,
69
- u = l * o[0] + 3 * a * t * e[0] + 3 * g * i * r[0] + s * n[0],
70
- c = l * o[1] + 3 * a * t * e[1] + 3 * g * i * r[1] + s * n[1];
71
- return [u, c];
72
- };
73
- P.PlotUtils.getThirdPoint = function (t, o, e, r, n) {
74
- var g = P.PlotUtils.getAzimuth(t, o),
75
- i = n ? g + e : g - e,
76
- s = r * Math.cos(i),
77
- a = r * Math.sin(i);
78
- return [o[0] + s, o[1] + a];
79
- };
80
- P.PlotUtils.getArcPoints = function (t, o, e, r) {
81
- var n,
82
- g,
83
- i = [],
84
- s = r - e;
85
- s = 0 > s ? s + P.Constants.TWO_PI : s;
86
- for (var a = 0; a <= P.Constants.FITTING_COUNT; a++) {
87
- var l = e + s * a / P.Constants.FITTING_COUNT;
88
- n = t[0] + o * Math.cos(l), g = t[1] + o * Math.sin(l), i.push([n, g]);
89
- }
90
- return i;
91
- };
92
- P.PlotUtils.getBisectorNormals = function (t, o, e, r) {
93
- var n = P.PlotUtils.getNormal(o, e, r),
94
- g = Math.sqrt(n[0] * n[0] + n[1] * n[1]),
95
- i = n[0] / g,
96
- s = n[1] / g,
97
- a = P.PlotUtils.distance(o, e),
98
- l = P.PlotUtils.distance(e, r);
99
- if (g > P.Constants.ZERO_TOLERANCE) {
100
- if (P.PlotUtils.isClockWise(o, e, r)) {
101
- var u = t * a,
102
- c = e[0] - u * s,
103
- p = e[1] + u * i,
104
- h = [c, p];
105
- u = t * l, c = e[0] + u * s, p = e[1] - u * i;
106
- var d = [c, p];
107
- } else u = t * a, c = e[0] + u * s, p = e[1] - u * i, h = [c, p], u = t * l, c = e[0] - u * s, p = e[1] + u * i, d = [c, p];
108
- } else c = e[0] + t * (o[0] - e[0]), p = e[1] + t * (o[1] - e[1]), h = [c, p], c = e[0] + t * (r[0] - e[0]), p = e[1] + t * (r[1] - e[1]), d = [c, p];
109
- return [h, d];
110
- };
111
- P.PlotUtils.getNormal = function (t, o, e) {
112
- var r = t[0] - o[0],
113
- n = t[1] - o[1],
114
- g = Math.sqrt(r * r + n * n);
115
- r /= g, n /= g;
116
- var i = e[0] - o[0],
117
- s = e[1] - o[1],
118
- a = Math.sqrt(i * i + s * s);
119
- i /= a, s /= a;
120
- var l = r + i,
121
- u = n + s;
122
- return [l, u];
123
- };
124
- P.PlotUtils.getCurvePoints = function (t, o) {
125
- for (var e = P.PlotUtils.getLeftMostControlPoint(o), r = [e], n = 0; n < o.length - 2; n++) {
126
- var g = o[n],
127
- i = o[n + 1],
128
- s = o[n + 2],
129
- a = P.PlotUtils.getBisectorNormals(t, g, i, s);
130
- r = r.concat(a);
131
- }
132
- var l = P.PlotUtils.getRightMostControlPoint(o);
133
- r.push(l);
134
- var u = [];
135
- for (n = 0; n < o.length - 1; n++) {
136
- g = o[n], i = o[n + 1], u.push(g);
137
- for (var t = 0; t < P.Constants.FITTING_COUNT; t++) {
138
- var c = P.PlotUtils.getCubicValue(t / P.Constants.FITTING_COUNT, g, r[2 * n], r[2 * n + 1], i);
139
- u.push(c);
140
- }
141
- u.push(i);
142
- }
143
- return u;
144
- };
145
- P.PlotUtils.getLeftMostControlPoint = function (o) {
146
- var e = o[0],
147
- r = o[1],
148
- n = o[2],
149
- g = P.PlotUtils.getBisectorNormals(0, e, r, n),
150
- i = g[0],
151
- s = P.PlotUtils.getNormal(e, r, n),
152
- a = Math.sqrt(s[0] * s[0] + s[1] * s[1]);
153
- if (a > P.Constants.ZERO_TOLERANCE) var l = P.PlotUtils.mid(e, r),
154
- u = e[0] - l[0],
155
- c = e[1] - l[1],
156
- p = P.PlotUtils.distance(e, r),
157
- h = 2 / p,
158
- d = -h * c,
159
- f = h * u,
160
- E = d * d - f * f,
161
- v = 2 * d * f,
162
- A = f * f - d * d,
163
- _ = i[0] - l[0],
164
- y = i[1] - l[1],
165
- m = l[0] + E * _ + v * y,
166
- O = l[1] + v * _ + A * y;else m = e[0] + t * (r[0] - e[0]), O = e[1] + t * (r[1] - e[1]);
167
- return [m, O];
168
- };
169
- P.PlotUtils.getRightMostControlPoint = function (o) {
170
- var e = o.length,
171
- r = o[e - 3],
172
- n = o[e - 2],
173
- g = o[e - 1],
174
- i = P.PlotUtils.getBisectorNormals(0, r, n, g),
175
- s = i[1],
176
- a = P.PlotUtils.getNormal(r, n, g),
177
- l = Math.sqrt(a[0] * a[0] + a[1] * a[1]);
178
- if (l > P.Constants.ZERO_TOLERANCE) var u = P.PlotUtils.mid(n, g),
179
- c = g[0] - u[0],
180
- p = g[1] - u[1],
181
- h = P.PlotUtils.distance(n, g),
182
- d = 2 / h,
183
- f = -d * p,
184
- E = d * c,
185
- v = f * f - E * E,
186
- A = 2 * f * E,
187
- _ = E * E - f * f,
188
- y = s[0] - u[0],
189
- m = s[1] - u[1],
190
- O = u[0] + v * y + A * m,
191
- T = u[1] + A * y + _ * m;else O = g[0] + t * (n[0] - g[0]), T = g[1] + t * (n[1] - g[1]);
192
- return [O, T];
193
- };
194
- P.PlotUtils.getBezierPoints = function (t) {
195
- if (t.length <= 2) return t;
196
- for (var o = [], e = t.length - 1, r = 0; 1 >= r; r += .01) {
197
- for (var n = 0, y = 0, g = 0; e >= g; g++) {
198
- var i = P.PlotUtils.getBinomialFactor(e, g),
199
- s = Math.pow(r, g),
200
- a = Math.pow(1 - r, e - g);
201
- n += i * s * a * t[g][0], y += i * s * a * t[g][1];
202
- }
203
- o.push([n, y]);
204
- }
205
- return o.push(t[e]), o;
206
- };
207
- P.PlotUtils.getBinomialFactor = function (t, o) {
208
- return P.PlotUtils.getFactorial(t) / (P.PlotUtils.getFactorial(o) * P.PlotUtils.getFactorial(t - o));
209
- };
210
- P.PlotUtils.getFactorial = function (t) {
211
- if (1 >= t) return 1;
212
- if (2 == t) return 2;
213
- if (3 == t) return 6;
214
- if (4 == t) return 24;
215
- if (5 == t) return 120;
216
- for (var o = 1, e = 1; t >= e; e++) o *= e;
217
- return o;
218
- };
219
- P.PlotUtils.getQBSplinePoints = function (t) {
220
- if (t.length <= 2) return t;
221
- var o = 2,
222
- e = [],
223
- r = t.length - o - 1;
224
- e.push(t[0]);
225
- for (var n = 0; r >= n; n++) for (var g = 0; 1 >= g; g += .05) {
226
- for (var i = 0, y = 0, s = 0; o >= s; s++) {
227
- var a = P.PlotUtils.getQuadricBSplineFactor(s, g);
228
- i += a * t[n + s][0], y += a * t[n + s][1];
229
- }
230
- e.push([i, y]);
231
- }
232
- return e.push(t[t.length - 1]), e;
233
- };
234
- P.PlotUtils.getQuadricBSplineFactor = function (t, o) {
235
- return 0 == t ? Math.pow(o - 1, 2) / 2 : 1 == t ? (-2 * Math.pow(o, 2) + 2 * o + 1) / 2 : 2 == t ? Math.pow(o, 2) / 2 : 0;
236
- };
237
- P.Constants = {
238
- TWO_PI: 2 * Math.PI,
239
- HALF_PI: Math.PI / 2,
240
- FITTING_COUNT: 100,
241
- ZERO_TOLERANCE: 1e-4
242
- };