node-red-contrib-tak-registration 0.2.0 → 0.3.0

package/node_modules/@turf/polygonize/dist/js/lib/Graph.js

@@ -0,0 +1,307 @@
+"use strict";
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+var Node_1 = __importDefault(require("./Node"));
+var Edge_1 = __importDefault(require("./Edge"));
+var EdgeRing_1 = __importDefault(require("./EdgeRing"));
+var meta_1 = require("@turf/meta");
+var invariant_1 = require("@turf/invariant");
+/**
+ * Validates the geoJson.
+ *
+ * @param {GeoJSON} geoJson - input geoJson.
+ * @throws {Error} if geoJson is invalid.
+ */
+function validateGeoJson(geoJson) {
+    if (!geoJson)
+        throw new Error("No geojson passed");
+    if (geoJson.type !== "FeatureCollection" &&
+        geoJson.type !== "GeometryCollection" &&
+        geoJson.type !== "MultiLineString" &&
+        geoJson.type !== "LineString" &&
+        geoJson.type !== "Feature")
+        throw new Error("Invalid input type '" + geoJson.type + "'. Geojson must be FeatureCollection, GeometryCollection, LineString, MultiLineString or Feature");
+}
+/**
+ * Represents a planar graph of edges and nodes that can be used to compute a polygonization.
+ *
+ * Although, this class is inspired by GEOS's `geos::operation::polygonize::PolygonizeGraph`,
+ * it isn't a rewrite. As regards algorithm, this class implements the same logic, but it
+ * isn't a javascript transcription of the C++ source.
+ *
+ * This graph is directed (both directions are created)
+ */
+var Graph = /** @class */ (function () {
+    function Graph() {
+        this.edges = []; //< {Edge[]} dirEdges
+        // The key is the `id` of the Node (ie: coordinates.join(','))
+        this.nodes = {};
+    }
+    /**
+     * Creates a graph from a GeoJSON.
+     *
+     * @param {FeatureCollection<LineString>} geoJson - it must comply with the restrictions detailed in the index
+     * @returns {Graph} - The newly created graph
+     * @throws {Error} if geoJson is invalid.
+     */
+    Graph.fromGeoJson = function (geoJson) {
+        validateGeoJson(geoJson);
+        var graph = new Graph();
+        meta_1.flattenEach(geoJson, function (feature) {
+            invariant_1.featureOf(feature, "LineString", "Graph::fromGeoJson");
+            // When a LineString if formed by many segments, split them
+            meta_1.coordReduce(feature, function (prev, cur) {
+                if (prev) {
+                    var start = graph.getNode(prev), end = graph.getNode(cur);
+                    graph.addEdge(start, end);
+                }
+                return cur;
+            });
+        });
+        return graph;
+    };
+    /**
+     * Creates or get a Node.
+     *
+     * @param {number[]} coordinates - Coordinates of the node
+     * @returns {Node} - The created or stored node
+     */
+    Graph.prototype.getNode = function (coordinates) {
+        var id = Node_1.default.buildId(coordinates);
+        var node = this.nodes[id];
+        if (!node)
+            node = this.nodes[id] = new Node_1.default(coordinates);
+        return node;
+    };
+    /**
+     * Adds an Edge and its symetricall.
+     *
+     * Edges are added symetrically, i.e.: we also add its symetric
+     *
+     * @param {Node} from - Node which starts the Edge
+     * @param {Node} to - Node which ends the Edge
+     */
+    Graph.prototype.addEdge = function (from, to) {
+        var edge = new Edge_1.default(from, to), symetricEdge = edge.getSymetric();
+        this.edges.push(edge);
+        this.edges.push(symetricEdge);
+    };
+    /**
+     * Removes Dangle Nodes (nodes with grade 1).
+     */
+    Graph.prototype.deleteDangles = function () {
+        var _this = this;
+        Object.keys(this.nodes)
+            .map(function (id) { return _this.nodes[id]; })
+            .forEach(function (node) { return _this._removeIfDangle(node); });
+    };
+    /**
+     * Check if node is dangle, if so, remove it.
+     *
+     * It calls itself recursively, removing a dangling node might cause another dangling node
+     *
+     * @param {Node} node - Node to check if it's a dangle
+     */
+    Graph.prototype._removeIfDangle = function (node) {
+        var _this = this;
+        // As edges are directed and symetrical, we count only innerEdges
+        if (node.innerEdges.length <= 1) {
+            var outerNodes = node.getOuterEdges().map(function (e) { return e.to; });
+            this.removeNode(node);
+            outerNodes.forEach(function (n) { return _this._removeIfDangle(n); });
+        }
+    };
+    /**
+     * Delete cut-edges (bridge edges).
+     *
+     * The graph will be traversed, all the edges will be labeled according the ring
+     * in which they are. (The label is a number incremented by 1). Edges with the same
+     * label are cut-edges.
+     */
+    Graph.prototype.deleteCutEdges = function () {
+        var _this = this;
+        this._computeNextCWEdges();
+        this._findLabeledEdgeRings();
+        // Cut-edges (bridges) are edges where both edges have the same label
+        this.edges.forEach(function (edge) {
+            if (edge.label === edge.symetric.label) {
+                _this.removeEdge(edge.symetric);
+                _this.removeEdge(edge);
+            }
+        });
+    };
+    /**
+     * Set the `next` property of each Edge.
+     *
+     * The graph will be transversed in a CW form, so, we set the next of the symetrical edge as the previous one.
+     * OuterEdges are sorted CCW.
+     *
+     * @param {Node} [node] - If no node is passed, the function calls itself for every node in the Graph
+     */
+    Graph.prototype._computeNextCWEdges = function (node) {
+        var _this = this;
+        if (typeof node === "undefined") {
+            Object.keys(this.nodes).forEach(function (id) {
+                return _this._computeNextCWEdges(_this.nodes[id]);
+            });
+        }
+        else {
+            node.getOuterEdges().forEach(function (edge, i) {
+                node.getOuterEdge((i === 0 ? node.getOuterEdges().length : i) - 1).symetric.next = edge;
+            });
+        }
+    };
+    /**
+     * Computes the next edge pointers going CCW around the given node, for the given edgering label.
+     *
+     * This algorithm has the effect of converting maximal edgerings into minimal edgerings
+     *
+     * XXX: method literally transcribed from `geos::operation::polygonize::PolygonizeGraph::computeNextCCWEdges`,
+     * could be written in a more javascript way.
+     *
+     * @param {Node} node - Node
+     * @param {number} label - Ring's label
+     */
+    Graph.prototype._computeNextCCWEdges = function (node, label) {
+        var edges = node.getOuterEdges();
+        var firstOutDE, prevInDE;
+        for (var i = edges.length - 1; i >= 0; --i) {
+            var de = edges[i], sym = de.symetric, outDE = void 0, inDE = void 0;
+            if (de.label === label)
+                outDE = de;
+            if (sym.label === label)
+                inDE = sym;
+            if (!outDE || !inDE)
+                // This edge is not in edgering
+                continue;
+            if (inDE)
+                prevInDE = inDE;
+            if (outDE) {
+                if (prevInDE) {
+                    prevInDE.next = outDE;
+                    prevInDE = undefined;
+                }
+                if (!firstOutDE)
+                    firstOutDE = outDE;
+            }
+        }
+        if (prevInDE)
+            prevInDE.next = firstOutDE;
+    };
+    /**
+     * Finds rings and labels edges according to which rings are.
+     *
+     * The label is a number which is increased for each ring.
+     *
+     * @returns {Edge[]} edges that start rings
+     */
+    Graph.prototype._findLabeledEdgeRings = function () {
+        var edgeRingStarts = [];
+        var label = 0;
+        this.edges.forEach(function (edge) {
+            if (edge.label >= 0)
+                return;
+            edgeRingStarts.push(edge);
+            var e = edge;
+            do {
+                e.label = label;
+                e = e.next;
+            } while (!edge.isEqual(e));
+            label++;
+        });
+        return edgeRingStarts;
+    };
+    /**
+     * Computes the EdgeRings formed by the edges in this graph.
+     *
+     * @returns {EdgeRing[]} - A list of all the EdgeRings in the graph.
+     */
+    Graph.prototype.getEdgeRings = function () {
+        var _this = this;
+        this._computeNextCWEdges();
+        // Clear labels
+        this.edges.forEach(function (edge) {
+            edge.label = undefined;
+        });
+        this._findLabeledEdgeRings().forEach(function (edge) {
+            // convertMaximalToMinimalEdgeRings
+            _this._findIntersectionNodes(edge).forEach(function (node) {
+                _this._computeNextCCWEdges(node, edge.label);
+            });
+        });
+        var edgeRingList = [];
+        // find all edgerings
+        this.edges.forEach(function (edge) {
+            if (edge.ring)
+                return;
+            edgeRingList.push(_this._findEdgeRing(edge));
+        });
+        return edgeRingList;
+    };
+    /**
+     * Find all nodes in a Maxima EdgeRing which are self-intersection nodes.
+     *
+     * @param {Node} startEdge - Start Edge of the Ring
+     * @returns {Node[]} - intersection nodes
+     */
+    Graph.prototype._findIntersectionNodes = function (startEdge) {
+        var intersectionNodes = [];
+        var edge = startEdge;
+        var _loop_1 = function () {
+            // getDegree
+            var degree = 0;
+            edge.from.getOuterEdges().forEach(function (e) {
+                if (e.label === startEdge.label)
+                    ++degree;
+            });
+            if (degree > 1)
+                intersectionNodes.push(edge.from);
+            edge = edge.next;
+        };
+        do {
+            _loop_1();
+        } while (!startEdge.isEqual(edge));
+        return intersectionNodes;
+    };
+    /**
+     * Get the edge-ring which starts from the provided Edge.
+     *
+     * @param {Edge} startEdge - starting edge of the edge ring
+     * @returns {EdgeRing} - EdgeRing which start Edge is the provided one.
+     */
+    Graph.prototype._findEdgeRing = function (startEdge) {
+        var edge = startEdge;
+        var edgeRing = new EdgeRing_1.default();
+        do {
+            edgeRing.push(edge);
+            edge.ring = edgeRing;
+            edge = edge.next;
+        } while (!startEdge.isEqual(edge));
+        return edgeRing;
+    };
+    /**
+     * Removes a node from the Graph.
+     *
+     * It also removes edges asociated to that node
+     * @param {Node} node - Node to be removed
+     */
+    Graph.prototype.removeNode = function (node) {
+        var _this = this;
+        node.getOuterEdges().forEach(function (edge) { return _this.removeEdge(edge); });
+        node.innerEdges.forEach(function (edge) { return _this.removeEdge(edge); });
+        delete this.nodes[node.id];
+    };
+    /**
+     * Remove edge from the graph and deletes the edge.
+     *
+     * @param {Edge} edge - Edge to be removed
+     */
+    Graph.prototype.removeEdge = function (edge) {
+        this.edges = this.edges.filter(function (e) { return !e.isEqual(edge); });
+        edge.deleteEdge();
+    };
+    return Graph;
+}());
+exports.default = Graph;

package/node_modules/@turf/polygonize/dist/js/lib/Node.d.ts

@@ -0,0 +1,40 @@
+import Edge from "./Edge";
+/**
+ * Node
+ */
+export default class Node {
+    static buildId(coordinates: number[]): string;
+    id: string;
+    coordinates: number[];
+    innerEdges: Edge[];
+    private outerEdges;
+    private outerEdgesSorted;
+    constructor(coordinates: number[]);
+    removeInnerEdge(edge: Edge): void;
+    removeOuterEdge(edge: Edge): void;
+    /**
+     * Outer edges are stored CCW order.
+     *
+     * @memberof Node
+     * @param {Edge} edge - Edge to add as an outerEdge.
+     */
+    addOuterEdge(edge: Edge): void;
+    /**
+     * Sorts outer edges in CCW way.
+     *
+     * @memberof Node
+     * @private
+     */
+    sortOuterEdges(): void;
+    /**
+     * Retrieves outer edges.
+     *
+     * They are sorted if they aren't in the CCW order.
+     *
+     * @memberof Node
+     * @returns {Edge[]} - List of outer edges sorted in a CCW order.
+     */
+    getOuterEdges(): Edge[];
+    getOuterEdge(i: number): Edge;
+    addInnerEdge(edge: Edge): void;
+}

package/node_modules/@turf/polygonize/dist/js/lib/Node.js

@@ -0,0 +1,95 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+var util_1 = require("./util");
+/**
+ * Node
+ */
+var Node = /** @class */ (function () {
+    function Node(coordinates) {
+        this.id = Node.buildId(coordinates);
+        this.coordinates = coordinates; //< {Number[]}
+        this.innerEdges = []; //< {Edge[]}
+        // We wil store to (out) edges in an CCW order as geos::planargraph::DirectedEdgeStar does
+        this.outerEdges = []; //< {Edge[]}
+        this.outerEdgesSorted = false; //< {Boolean} flag that stores if the outer Edges had been sorted
+    }
+    Node.buildId = function (coordinates) {
+        return coordinates.join(",");
+    };
+    Node.prototype.removeInnerEdge = function (edge) {
+        this.innerEdges = this.innerEdges.filter(function (e) { return e.from.id !== edge.from.id; });
+    };
+    Node.prototype.removeOuterEdge = function (edge) {
+        this.outerEdges = this.outerEdges.filter(function (e) { return e.to.id !== edge.to.id; });
+    };
+    /**
+     * Outer edges are stored CCW order.
+     *
+     * @memberof Node
+     * @param {Edge} edge - Edge to add as an outerEdge.
+     */
+    Node.prototype.addOuterEdge = function (edge) {
+        this.outerEdges.push(edge);
+        this.outerEdgesSorted = false;
+    };
+    /**
+     * Sorts outer edges in CCW way.
+     *
+     * @memberof Node
+     * @private
+     */
+    Node.prototype.sortOuterEdges = function () {
+        var _this = this;
+        if (!this.outerEdgesSorted) {
+            //this.outerEdges.sort((a, b) => a.compareTo(b));
+            // Using this comparator in order to be deterministic
+            this.outerEdges.sort(function (a, b) {
+                var aNode = a.to, bNode = b.to;
+                if (aNode.coordinates[0] - _this.coordinates[0] >= 0 &&
+                    bNode.coordinates[0] - _this.coordinates[0] < 0)
+                    return 1;
+                if (aNode.coordinates[0] - _this.coordinates[0] < 0 &&
+                    bNode.coordinates[0] - _this.coordinates[0] >= 0)
+                    return -1;
+                if (aNode.coordinates[0] - _this.coordinates[0] === 0 &&
+                    bNode.coordinates[0] - _this.coordinates[0] === 0) {
+                    if (aNode.coordinates[1] - _this.coordinates[1] >= 0 ||
+                        bNode.coordinates[1] - _this.coordinates[1] >= 0)
+                        return aNode.coordinates[1] - bNode.coordinates[1];
+                    return bNode.coordinates[1] - aNode.coordinates[1];
+                }
+                var det = util_1.orientationIndex(_this.coordinates, aNode.coordinates, bNode.coordinates);
+                if (det < 0)
+                    return 1;
+                if (det > 0)
+                    return -1;
+                var d1 = Math.pow(aNode.coordinates[0] - _this.coordinates[0], 2) +
+                    Math.pow(aNode.coordinates[1] - _this.coordinates[1], 2), d2 = Math.pow(bNode.coordinates[0] - _this.coordinates[0], 2) +
+                    Math.pow(bNode.coordinates[1] - _this.coordinates[1], 2);
+                return d1 - d2;
+            });
+            this.outerEdgesSorted = true;
+        }
+    };
+    /**
+     * Retrieves outer edges.
+     *
+     * They are sorted if they aren't in the CCW order.
+     *
+     * @memberof Node
+     * @returns {Edge[]} - List of outer edges sorted in a CCW order.
+     */
+    Node.prototype.getOuterEdges = function () {
+        this.sortOuterEdges();
+        return this.outerEdges;
+    };
+    Node.prototype.getOuterEdge = function (i) {
+        this.sortOuterEdges();
+        return this.outerEdges[i];
+    };
+    Node.prototype.addInnerEdge = function (edge) {
+        this.innerEdges.push(edge);
+    };
+    return Node;
+}());
+exports.default = Node;

package/node_modules/@turf/polygonize/dist/js/lib/util.d.ts

@@ -0,0 +1,46 @@
+import { Feature, Polygon } from "@turf/helpers";
+/**
+ * Returns the direction of the point q relative to the vector p1 -> p2.
+ *
+ * Implementation of geos::algorithm::CGAlgorithm::orientationIndex()
+ * (same as geos::algorithm::CGAlgorithm::computeOrientation())
+ *
+ * @param {number[]} p1 - the origin point of the vector
+ * @param {number[]} p2 - the final point of the vector
+ * @param {number[]} q - the point to compute the direction to
+ *
+ * @returns {number} - 1 if q is ccw (left) from p1->p2,
+ *    -1 if q is cw (right) from p1->p2,
+ *     0 if q is colinear with p1->p2
+ */
+export declare function orientationIndex(p1: number[], p2: number[], q: number[]): number;
+/**
+ * Checks if two envelopes are equal.
+ *
+ * The function assumes that the arguments are envelopes, i.e.: Rectangular polygon
+ *
+ * @param {Feature<Polygon>} env1 - Envelope
+ * @param {Feature<Polygon>} env2 - Envelope
+ * @returns {boolean} - True if the envelopes are equal
+ */
+export declare function envelopeIsEqual(env1: Feature<Polygon>, env2: Feature<Polygon>): boolean;
+/**
+ * Check if a envelope is contained in other one.
+ *
+ * The function assumes that the arguments are envelopes, i.e.: Convex polygon
+ * XXX: Envelopes are rectangular, checking if a point is inside a rectangule is something easy,
+ * this could be further improved.
+ *
+ * @param {Feature<Polygon>} self - Envelope
+ * @param {Feature<Polygon>} env - Envelope
+ * @returns {boolean} - True if env is contained in self
+ */
+export declare function envelopeContains(self: Feature<Polygon>, env: Feature<Polygon>): boolean;
+/**
+ * Checks if two coordinates are equal.
+ *
+ * @param {number[]} coord1 - First coordinate
+ * @param {number[]} coord2 - Second coordinate
+ * @returns {boolean} - True if coordinates are equal
+ */
+export declare function coordinatesEqual(coord1: number[], coord2: number[]): boolean;

package/node_modules/@turf/polygonize/dist/js/lib/util.js

@@ -0,0 +1,75 @@
+"use strict";
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+var boolean_point_in_polygon_1 = __importDefault(require("@turf/boolean-point-in-polygon"));
+var helpers_1 = require("@turf/helpers");
+// https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Math/sign#Polyfill
+function mathSign(x) {
+    return ((x > 0) - (x < 0) || +x);
+}
+/**
+ * Returns the direction of the point q relative to the vector p1 -> p2.
+ *
+ * Implementation of geos::algorithm::CGAlgorithm::orientationIndex()
+ * (same as geos::algorithm::CGAlgorithm::computeOrientation())
+ *
+ * @param {number[]} p1 - the origin point of the vector
+ * @param {number[]} p2 - the final point of the vector
+ * @param {number[]} q - the point to compute the direction to
+ *
+ * @returns {number} - 1 if q is ccw (left) from p1->p2,
+ *    -1 if q is cw (right) from p1->p2,
+ *     0 if q is colinear with p1->p2
+ */
+function orientationIndex(p1, p2, q) {
+    var dx1 = p2[0] - p1[0], dy1 = p2[1] - p1[1], dx2 = q[0] - p2[0], dy2 = q[1] - p2[1];
+    return mathSign(dx1 * dy2 - dx2 * dy1);
+}
+exports.orientationIndex = orientationIndex;
+/**
+ * Checks if two envelopes are equal.
+ *
+ * The function assumes that the arguments are envelopes, i.e.: Rectangular polygon
+ *
+ * @param {Feature<Polygon>} env1 - Envelope
+ * @param {Feature<Polygon>} env2 - Envelope
+ * @returns {boolean} - True if the envelopes are equal
+ */
+function envelopeIsEqual(env1, env2) {
+    var envX1 = env1.geometry.coordinates[0].map(function (c) { return c[0]; }), envY1 = env1.geometry.coordinates[0].map(function (c) { return c[1]; }), envX2 = env2.geometry.coordinates[0].map(function (c) { return c[0]; }), envY2 = env2.geometry.coordinates[0].map(function (c) { return c[1]; });
+    return (Math.max.apply(null, envX1) === Math.max.apply(null, envX2) &&
+        Math.max.apply(null, envY1) === Math.max.apply(null, envY2) &&
+        Math.min.apply(null, envX1) === Math.min.apply(null, envX2) &&
+        Math.min.apply(null, envY1) === Math.min.apply(null, envY2));
+}
+exports.envelopeIsEqual = envelopeIsEqual;
+/**
+ * Check if a envelope is contained in other one.
+ *
+ * The function assumes that the arguments are envelopes, i.e.: Convex polygon
+ * XXX: Envelopes are rectangular, checking if a point is inside a rectangule is something easy,
+ * this could be further improved.
+ *
+ * @param {Feature<Polygon>} self - Envelope
+ * @param {Feature<Polygon>} env - Envelope
+ * @returns {boolean} - True if env is contained in self
+ */
+function envelopeContains(self, env) {
+    return env.geometry.coordinates[0].every(function (c) {
+        return boolean_point_in_polygon_1.default(helpers_1.point(c), self);
+    });
+}
+exports.envelopeContains = envelopeContains;
+/**
+ * Checks if two coordinates are equal.
+ *
+ * @param {number[]} coord1 - First coordinate
+ * @param {number[]} coord2 - Second coordinate
+ * @returns {boolean} - True if coordinates are equal
+ */
+function coordinatesEqual(coord1, coord2) {
+    return coord1[0] === coord2[0] && coord1[1] === coord2[1];
+}
+exports.coordinatesEqual = coordinatesEqual;

package/node_modules/@turf/polygonize/package.json

@@ -0,0 +1,105 @@
+{
+  "_from": "@turf/polygonize@^6.5.0",
+  "_id": "@turf/polygonize@6.5.0",
+  "_inBundle": false,
+  "_integrity": "sha512-a/3GzHRaCyzg7tVYHo43QUChCspa99oK4yPqooVIwTC61npFzdrmnywMv0S+WZjHZwK37BrFJGFrZGf6ocmY5w==",
+  "_location": "/@turf/polygonize",
+  "_phantomChildren": {},
+  "_requested": {
+    "type": "range",
+    "registry": true,
+    "raw": "@turf/polygonize@^6.5.0",
+    "name": "@turf/polygonize",
+    "escapedName": "@turf%2fpolygonize",
+    "scope": "@turf",
+    "rawSpec": "^6.5.0",
+    "saveSpec": null,
+    "fetchSpec": "^6.5.0"
+  },
+  "_requiredBy": [
+    "/@turf/turf"
+  ],
+  "_resolved": "https://registry.npmjs.org/@turf/polygonize/-/polygonize-6.5.0.tgz",
+  "_shasum": "8aa0f1e386e96c533a320c426aaf387020320fa3",
+  "_spec": "@turf/polygonize@^6.5.0",
+  "_where": "/Users/conway/Projects/TAKreg/node_modules/@turf/turf",
+  "author": {
+    "name": "Turf Authors"
+  },
+  "bugs": {
+    "url": "https://github.com/Turfjs/turf/issues"
+  },
+  "bundleDependencies": false,
+  "contributors": [
+    {
+      "name": "Nicolas Cisco",
+      "email": "@nickcis"
+    },
+    {
+      "name": "Denis Carriere",
+      "email": "@DenisCarriere"
+    }
+  ],
+  "dependencies": {
+    "@turf/boolean-point-in-polygon": "^6.5.0",
+    "@turf/envelope": "^6.5.0",
+    "@turf/helpers": "^6.5.0",
+    "@turf/invariant": "^6.5.0",
+    "@turf/meta": "^6.5.0"
+  },
+  "deprecated": false,
+  "description": "turf polygonize module",
+  "devDependencies": {
+    "benchmark": "*",
+    "load-json-file": "*",
+    "npm-run-all": "*",
+    "rollup": "*",
+    "tape": "*",
+    "ts-node": "*",
+    "typescript": "*",
+    "write-json-file": "*"
+  },
+  "exports": {
+    "./package.json": "./package.json",
+    ".": {
+      "import": "./dist/es/index.js",
+      "require": "./dist/js/index.js"
+    }
+  },
+  "files": [
+    "dist"
+  ],
+  "funding": "https://opencollective.com/turf",
+  "gitHead": "5375941072b90d489389db22b43bfe809d5e451e",
+  "homepage": "https://github.com/Turfjs/turf",
+  "keywords": [
+    "turf",
+    "geojson",
+    "gis",
+    "polygonize"
+  ],
+  "license": "MIT",
+  "main": "dist/js/index.js",
+  "module": "dist/es/index.js",
+  "name": "@turf/polygonize",
+  "publishConfig": {
+    "access": "public"
+  },
+  "repository": {
+    "type": "git",
+    "url": "git://github.com/Turfjs/turf.git"
+  },
+  "scripts": {
+    "bench": "ts-node bench.js",
+    "build": "npm-run-all build:*",
+    "build:es": "tsc --outDir dist/es --module esnext --declaration false && echo '{\"type\":\"module\"}' > dist/es/package.json",
+    "build:js": "tsc",
+    "docs": "node ../../scripts/generate-readmes",
+    "test": "npm-run-all test:*",
+    "test:tape": "ts-node -r esm test.js",
+    "test:types": "tsc --esModuleInterop --noEmit types.ts"
+  },
+  "sideEffects": false,
+  "types": "dist/js/index.d.ts",
+  "version": "6.5.0"
+}

package/node_modules/@turf/projection/LICENSE

@@ -0,0 +1,20 @@
+The MIT License (MIT)
+
+Copyright (c) 2017 TurfJS
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of
+this software and associated documentation files (the "Software"), to deal in
+the Software without restriction, including without limitation the rights to
+use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
+the Software, and to permit persons to whom the Software is furnished to do so,
+subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
+FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
+COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
+IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
+CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.