-
Notifications
You must be signed in to change notification settings - Fork 67
/
Copy pathops.geo.dropchop.js
367 lines (343 loc) · 10.4 KB
/
ops.geo.dropchop.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
var dropchop = (function(dc) {
'use strict';
dc = dc || {};
dc.ops = dc.ops || {};
dc.ops.geo = {
along: {
minFeatures: 1,
maxFeatures: 1,
requirements: {
generalFeature: false,
types: ['Feature<LineString>', 'FeatureCollection']
},
description: 'Takes a line and returns a point at a specified distance along the line.',
parameters: [
{
name: 'distance',
description :'distance along the line',
type: 'number',
default: 10
},
{
name: 'units',
type: 'select',
description: '',
options: ['miles', 'kilometers', 'radians', 'degrees'],
default: 'miles'
}
],
execute: function(params) {
var result = {};
var newParams = params;
// if there is a feature collection, do it recursively
if (params[0].type === 'FeatureCollection') {
result = dc.util.executeFC(params[0], 'along', params);
// otherwise it's a single
} else {
result = turf.along.apply(null, params);
}
return result;
}
},
bezier: {
minFeatures: 1,
maxFeatures: 1,
requirements: {
generalFeature: false,
types: ['Feature<LineString>', 'FeatureCollection']
},
description: 'Takes a line and returns a curved version by applying a Bezier spline algorithm.',
parameters: [
{
name: 'resolution',
description :'Time in milliseconds between points',
type: 'number',
default: 10000
},
{
name: 'sharpness',
description :'a measure of how curvy the path should be between splines',
type: 'number',
default: 0.85
}
],
execute: function(params) {
var result = {};
var newParams = params;
// if there is a feature collection, do it recursively
if (params[0].type === 'FeatureCollection') {
result = dc.util.executeFC(params[0], 'bezier', params);
// otherwise it's a single
} else {
result = turf.bezier.apply(null, params);
}
return result;
}
},
buffer: {
maxFeatures: 1,
minFeatures: 1,
requirements: {
generalFeature: true,
types: ['Feature', 'FeatureCollection']
},
description: 'Calculates a buffer for input features for a given radius. Units supported are miles, kilometers, and degrees.',
parameters: [
{
name: 'distance',
description: 'Distance to draw the buffer.',
type: 'number',
default: 10
},
{
name: 'unit',
type: 'select',
description: '',
options: ['miles', 'feet', 'kilometers', 'meters', 'degrees'],
default: 'miles'
}
],
execute: function(params) {
var result = turf.buffer.apply(null, params);
return result;
}
},
center: {
minFeatures: 1,
maxFeatures: 1,
requirements: {
generalFeature: true,
types: ['Feature', 'FeatureCollection']
},
description: 'Creates a point in the center of the feature.',
parameters: [
{
name: 'recursive',
description: 'Run the operation on each feature in the collection or the entire collection.',
type: 'recursive'
}
],
execute: function(params) {
var result = {};
// if running the operation recursively "true"
if (params[1] === "true") {
result = dc.util.executeFC(params[0], 'center', params);
} else {
result = turf.center.apply(null, params);
}
return result;
}
},
centroid: {
minFeatures: 1,
maxFeatures: 1,
requirements: {
generalFeature: true,
types: ['Feature', 'FeatureCollection']
},
description: 'Creates a point in the centroid of the features.',
parameters: [
{
name: 'recursive',
description: 'Run the operation on each feature in the collection or the entire collection.',
type: 'recursive'
}
],
execute: function(params) {
var result = {};
// if running the operation recursively "true"
if (params[1] === "true") {
result = dc.util.executeFC(params[0], 'centroid', params);
} else {
result = turf.centroid.apply(null, params);
}
return result;
}
},
destination: {
minFeatures: 1,
maxFeatures: 1,
requirements: {
generalFeature: false,
types: ['Feature<Point>', 'FeatureCollection']
},
description: 'Takes a Point and calculates the location of a destination point given a distance in degrees, radians, miles, or kilometers; and bearing in degrees. This uses the Haversine formula to account for global curvature.',
parameters: [
{
name: 'distance',
description :'distance from the starting point',
type: 'number',
default: 10
},
{
name: 'bearing',
description :'ranging from -180 to 180',
type: 'number',
default: 0
},
{
name: 'units',
type: 'select',
description: '',
options: ['miles', 'kilometers', 'radians', 'degrees'],
default: 'miles'
}
],
execute: function(params) {
var result = {};
var newParams = params;
// if there is a feature collection, do it recursively
if (params[0].type === 'FeatureCollection') {
result = dc.util.executeFC(params[0], 'destination', params);
// otherwise it's a single
} else {
result = turf.destination.apply(null, params);
}
return result;
}
},
envelope: {
minFeatures: 1,
maxFeatures: 1,
requirements: {
generalFeature: false,
types: ['FeatureCollection'] // TODO: make this take features and run across full selection
},
description: 'Takes any number of features and returns a rectangular Polygon that encompasses all vertices.',
execute: function(params) {
var result = turf.envelope.apply(null, params);
return result;
}
},
explode: {
minFeatures: 1,
maxFeatures: 1,
requirements: {
generalFeature: true,
types: ['Feature', 'FeatureCollection']
},
description: 'Takes a feature or set of features and returns all positions as points.',
execute: function(params) {
var result = turf.explode.apply(null, params);
return result;
}
},
midpoint: {
minFeatures: 2,
maxFeatures: 2,
requirements: {
generalFeature: false,
types: ['Feature<Point>']
},
description: 'Takes two points and returns a point midway between them.',
execute: function(params) {
var result = turf.midpoint.apply(null, params);
return result;
}
},
sample: {
maxFeatures: 1,
minFeatures: 1,
requirements: {
generalFeature: true,
types: ['FeatureCollection']
},
description: 'Takes a FeatureCollection and returns a FeatureCollection with given number of features at random.',
parameters: [
{
name: 'num',
description: 'Number of features to select.',
type: 'number',
default: 1
}
],
execute: function(params) {
var result = turf.sample.apply(null, params);
return result;
}
},
simplify: {
minFeatures: 1,
maxFeatures: 1,
requirements: {
generalFeature: false,
types: ['Feature<LineString>', 'Feature<Polygon>', 'FeatureCollection']
},
description: 'Takes a LineString or Polygon and returns a simplified version. Internally uses simplify-js to perform simplification.',
parameters: [
{
name: 'tolerance',
description :'simplification tolerance',
type: 'number',
default: 0.1
},
{
name: 'high quality',
type: 'checkbox',
description: 'whether or not to spend more time to create a higher-quality simplification with a different algorithm',
default: false
}
],
execute: function(params) {
var result = {};
var newParams = params;
// if there is a feature collection, do it recursively
if (params[0].type === 'FeatureCollection') {
result = dc.util.executeFC(params[0], 'simplify', params);
// otherwise it's a single
} else {
result = turf.simplify.apply(null, params);
}
return result;
}
},
tin: {
minFeatures: 1,
maxFeatures: 1,
requirements: {
generalFeature: false,
types: ['FeatureCollection']
},
description: 'Triangulated irregular network, interpolation method',
execute: function(params) {
var result = turf.tin.apply(null, params);
return result;
}
},
union: {
minFeatures: 2,
maxFeatures: 2,
requirements: {
generalFeature: false,
types: ['Feature<Polygon>']
},
description: 'Takes two polygons and returns a combined polygon. If the input polygons are not contiguous, this function returns a MultiPolygon feature.',
execute: function(params) {
var result = turf.union.apply(null, params);
return result;
}
},
within: {
minFeatures: 2,
maxFeatures: 2,
requirements: {
generalFeature: false,
types: ['FeatureCollection']
},
description: 'Takes a set of points and a set of polygons and returns the points that fall within the polygons. First input should be the points.',
parameters: [
{
name: 'Points to clip',
description :'Select the layer that represents the points you want to clip. This assumes the other layer is your clipping polygon.',
type: 'switch'
// default: dc.selection.list[0]
}
],
execute: function(params) {
var result = turf.within.apply(null, params);
return result;
}
}
};
return dc;
})(dropchop || {});