geojs 1.12.3 → 1.12.5

package/geo.lean.js

@@ -3445,6 +3445,7 @@ var _annotationLayer = function annotationLayer(arg) {
     m_options,
     m_mode = null,
     m_annotations = [],
+    m_annotationIds = {},
     m_features = [],
     m_labelFeature,
     m_labelLayer,
@@ -3886,6 +3887,7 @@ var _annotationLayer = function annotationLayer(arg) {
         annotation: annotation
       });
       m_annotations.push(annotation);
+      m_annotationIds[annotation.id()] = annotation;
       annotation.layer(m_this);
       var map = m_this.map();
       gcs = gcs === null ? map.gcs() : gcs === undefined ? map.ingcs() : gcs;
@@ -3918,6 +3920,9 @@ var _annotationLayer = function annotationLayer(arg) {
       if (annotation === m_this.currentAnnotation) {
         m_this.currentAnnotation = null;
       }
+      if (m_annotationIds[annotation.id()] !== undefined) {
+        delete m_annotationIds[annotation.id()];
+      }
       annotation._exit();
       m_annotations.splice(pos, 1);
       if (update !== false) {
@@ -3980,12 +3985,7 @@ var _annotationLayer = function annotationLayer(arg) {
     if (id !== undefined && id !== null) {
       id = +id; /* Cast to int */
     }
-    var annotations = m_annotations.filter(function (annotation) {
-      return annotation.id() === id;
-    });
-    if (annotations.length) {
-      return annotations[0];
-    }
+    return m_annotationIds[id];
   };
 
   /* A list of special modes */
@@ -4840,6 +4840,7 @@ var _annotationLayer = function annotationLayer(arg) {
     // Call super class exit
     s_exit.call(m_this);
     m_annotations = [];
+    m_annotationIds = {};
     m_features = [];
     return m_this;
   };
@@ -16352,10 +16353,10 @@ var _map2 = function map(arg) {
   this.layers = this.children;
 
   /**
-   * Comapare two layers by zIndex.  If the zIndex is the same, the order in
-   * the parent element is used.  If the two layers don't have the same parent
-   * (for instance, one layer isn't attached to the map), layers in the map
-   * are sorted below detached layers.
+   * Compare two layers by zIndex.  If the zIndex is the same, the order in the
+   * parent element is used.  If the two layers don't have the same parent (for
+   * instance, one layer isn't attached to the map), layers in the map are
+   * sorted below detached layers.
    *
    * @param {geo.layer} a First layer to compare.
    * @param {geo.layer} b Second layer to compare.
@@ -17268,7 +17269,7 @@ var Mousetrap = __webpack_require__(7549);
  * @property {boolean} [keyboard.focusHighlight=true] If truthy, when the map
  *      gains focus, a highlight style is shown around it.  This gives an
  *      indicator that keyboard events will affect the map, but may not be
- *      visuallly desirabel.
+ *      visually desirable.
  * @property {boolean} [alwaysTouch=false] If true, add touch support even if
  *      the browser doesn't apepar to be touch-aware.
  * @property {number} [wheelScaleX=1] A scale multiplier for horizontal wheel
@@ -22015,7 +22016,7 @@ var _pointFeature = function pointFeature(arg) {
     m_clusterTree = new ClusterGroup(opts);
     m_allData.forEach(function (d, i) {
       // for each point in the data set normalize the coordinate
-      // representation and add the point to the cluster treee
+      // representation and add the point to the cluster tree
       var pt = util.normalizeCoordinates(position(d, i));
       pt.index = i;
       m_clusterTree.addPoint(pt);
@@ -23200,7 +23201,7 @@ var _polygonFeature = function polygonFeature(arg) {
       return data;
     }
 
-    /* Set the reduced polgons as the data and use simple accessors. */
+    /* Set the reduced polygons as the data and use simple accessors. */
     m_this.style('position', util.identityFunction);
     m_this.style('polygon', util.identityFunction);
     m_this.data(data);
@@ -25072,7 +25073,7 @@ module.exports = _sceneObject;
  * @constant
  * @type {string}
  */
-module.exports = "9247bbff883ef9933b82df63c762b4d0dfcce9ae";
+module.exports = "1fd3450e4c094c4475819ff627ee93484c684c3c";
 
 /***/ }),
 
@@ -32276,7 +32277,7 @@ __webpack_require__(615);
  *   that determine what round values are displayed.
  * @property {number} multiples.multiple The value that is selected for display.
  * @property {number} multiples.digit The number of significant digits in
- *   `mutliple`.
+ *   `multiple`.
  */
 
 /**
@@ -36911,7 +36912,7 @@ module.exports = _vectorFeature;
  * @constant
  * @type {string}
  */
-module.exports = "1.12.3";
+module.exports = "1.12.5";
 
 /***/ }),
 
@@ -41676,7 +41677,7 @@ var _vtkjsRenderer = function vtkjsRenderer(arg) {
     /* If we are already scheduled to render, don't schedule again.  Rather,
      * mark that we should render after other animation frame requests occur.
      * It would be nice if we could just reschedule the call by removing and
-     * readding the animation frame request, but this doesn't work for if the
+     * re-adding the animation frame request, but this doesn't work for if the
      * reschedule occurs during another animation frame callback (it then waits
      * until a subsequent frame). */
     m_this.layer().map().scheduleAnimationFrame(m_this._renderFrame, true);
@@ -44664,7 +44665,8 @@ var _webgl_polygonFeature = function webgl_polygonFeature(arg) {
   arg = arg || {};
   polygonFeature.call(this, arg);
   var vgl = __webpack_require__(1611);
-  var earcut = __webpack_require__(5230);
+  var earcut = __webpack_require__(9747);
+  earcut = earcut.__esModule ? earcut.default : earcut;
   var transform = __webpack_require__(5325);
   var util = __webpack_require__(642);
   var object = __webpack_require__(4084);
@@ -46433,695 +46435,6 @@ module.exports = function (item) {
   return [content].join("\n");
 };
 
-/***/ }),
-
-/***/ 5230:
-/***/ (function(module) {
-
-"use strict";
-
-
-module.exports = earcut;
-module.exports["default"] = earcut;
-
-function earcut(data, holeIndices, dim) {
-
-    dim = dim || 2;
-
-    var hasHoles = holeIndices && holeIndices.length,
-        outerLen = hasHoles ? holeIndices[0] * dim : data.length,
-        outerNode = linkedList(data, 0, outerLen, dim, true),
-        triangles = [];
-
-    if (!outerNode || outerNode.next === outerNode.prev) return triangles;
-
-    var minX, minY, maxX, maxY, x, y, invSize;
-
-    if (hasHoles) outerNode = eliminateHoles(data, holeIndices, outerNode, dim);
-
-    // if the shape is not too simple, we'll use z-order curve hash later; calculate polygon bbox
-    if (data.length > 80 * dim) {
-        minX = maxX = data[0];
-        minY = maxY = data[1];
-
-        for (var i = dim; i < outerLen; i += dim) {
-            x = data[i];
-            y = data[i + 1];
-            if (x < minX) minX = x;
-            if (y < minY) minY = y;
-            if (x > maxX) maxX = x;
-            if (y > maxY) maxY = y;
-        }
-
-        // minX, minY and invSize are later used to transform coords into integers for z-order calculation
-        invSize = Math.max(maxX - minX, maxY - minY);
-        invSize = invSize !== 0 ? 32767 / invSize : 0;
-    }
-
-    earcutLinked(outerNode, triangles, dim, minX, minY, invSize, 0);
-
-    return triangles;
-}
-
-// create a circular doubly linked list from polygon points in the specified winding order
-function linkedList(data, start, end, dim, clockwise) {
-    var i, last;
-
-    if (clockwise === (signedArea(data, start, end, dim) > 0)) {
-        for (i = start; i < end; i += dim) last = insertNode(i, data[i], data[i + 1], last);
-    } else {
-        for (i = end - dim; i >= start; i -= dim) last = insertNode(i, data[i], data[i + 1], last);
-    }
-
-    if (last && equals(last, last.next)) {
-        removeNode(last);
-        last = last.next;
-    }
-
-    return last;
-}
-
-// eliminate colinear or duplicate points
-function filterPoints(start, end) {
-    if (!start) return start;
-    if (!end) end = start;
-
-    var p = start,
-        again;
-    do {
-        again = false;
-
-        if (!p.steiner && (equals(p, p.next) || area(p.prev, p, p.next) === 0)) {
-            removeNode(p);
-            p = end = p.prev;
-            if (p === p.next) break;
-            again = true;
-
-        } else {
-            p = p.next;
-        }
-    } while (again || p !== end);
-
-    return end;
-}
-
-// main ear slicing loop which triangulates a polygon (given as a linked list)
-function earcutLinked(ear, triangles, dim, minX, minY, invSize, pass) {
-    if (!ear) return;
-
-    // interlink polygon nodes in z-order
-    if (!pass && invSize) indexCurve(ear, minX, minY, invSize);
-
-    var stop = ear,
-        prev, next;
-
-    // iterate through ears, slicing them one by one
-    while (ear.prev !== ear.next) {
-        prev = ear.prev;
-        next = ear.next;
-
-        if (invSize ? isEarHashed(ear, minX, minY, invSize) : isEar(ear)) {
-            // cut off the triangle
-            triangles.push(prev.i / dim | 0);
-            triangles.push(ear.i / dim | 0);
-            triangles.push(next.i / dim | 0);
-
-            removeNode(ear);
-
-            // skipping the next vertex leads to less sliver triangles
-            ear = next.next;
-            stop = next.next;
-
-            continue;
-        }
-
-        ear = next;
-
-        // if we looped through the whole remaining polygon and can't find any more ears
-        if (ear === stop) {
-            // try filtering points and slicing again
-            if (!pass) {
-                earcutLinked(filterPoints(ear), triangles, dim, minX, minY, invSize, 1);
-
-            // if this didn't work, try curing all small self-intersections locally
-            } else if (pass === 1) {
-                ear = cureLocalIntersections(filterPoints(ear), triangles, dim);
-                earcutLinked(ear, triangles, dim, minX, minY, invSize, 2);
-
-            // as a last resort, try splitting the remaining polygon into two
-            } else if (pass === 2) {
-                splitEarcut(ear, triangles, dim, minX, minY, invSize);
-            }
-
-            break;
-        }
-    }
-}
-
-// check whether a polygon node forms a valid ear with adjacent nodes
-function isEar(ear) {
-    var a = ear.prev,
-        b = ear,
-        c = ear.next;
-
-    if (area(a, b, c) >= 0) return false; // reflex, can't be an ear
-
-    // now make sure we don't have other points inside the potential ear
-    var ax = a.x, bx = b.x, cx = c.x, ay = a.y, by = b.y, cy = c.y;
-
-    // triangle bbox; min & max are calculated like this for speed
-    var x0 = ax < bx ? (ax < cx ? ax : cx) : (bx < cx ? bx : cx),
-        y0 = ay < by ? (ay < cy ? ay : cy) : (by < cy ? by : cy),
-        x1 = ax > bx ? (ax > cx ? ax : cx) : (bx > cx ? bx : cx),
-        y1 = ay > by ? (ay > cy ? ay : cy) : (by > cy ? by : cy);
-
-    var p = c.next;
-    while (p !== a) {
-        if (p.x >= x0 && p.x <= x1 && p.y >= y0 && p.y <= y1 &&
-            pointInTriangle(ax, ay, bx, by, cx, cy, p.x, p.y) &&
-            area(p.prev, p, p.next) >= 0) return false;
-        p = p.next;
-    }
-
-    return true;
-}
-
-function isEarHashed(ear, minX, minY, invSize) {
-    var a = ear.prev,
-        b = ear,
-        c = ear.next;
-
-    if (area(a, b, c) >= 0) return false; // reflex, can't be an ear
-
-    var ax = a.x, bx = b.x, cx = c.x, ay = a.y, by = b.y, cy = c.y;
-
-    // triangle bbox; min & max are calculated like this for speed
-    var x0 = ax < bx ? (ax < cx ? ax : cx) : (bx < cx ? bx : cx),
-        y0 = ay < by ? (ay < cy ? ay : cy) : (by < cy ? by : cy),
-        x1 = ax > bx ? (ax > cx ? ax : cx) : (bx > cx ? bx : cx),
-        y1 = ay > by ? (ay > cy ? ay : cy) : (by > cy ? by : cy);
-
-    // z-order range for the current triangle bbox;
-    var minZ = zOrder(x0, y0, minX, minY, invSize),
-        maxZ = zOrder(x1, y1, minX, minY, invSize);
-
-    var p = ear.prevZ,
-        n = ear.nextZ;
-
-    // look for points inside the triangle in both directions
-    while (p && p.z >= minZ && n && n.z <= maxZ) {
-        if (p.x >= x0 && p.x <= x1 && p.y >= y0 && p.y <= y1 && p !== a && p !== c &&
-            pointInTriangle(ax, ay, bx, by, cx, cy, p.x, p.y) && area(p.prev, p, p.next) >= 0) return false;
-        p = p.prevZ;
-
-        if (n.x >= x0 && n.x <= x1 && n.y >= y0 && n.y <= y1 && n !== a && n !== c &&
-            pointInTriangle(ax, ay, bx, by, cx, cy, n.x, n.y) && area(n.prev, n, n.next) >= 0) return false;
-        n = n.nextZ;
-    }
-
-    // look for remaining points in decreasing z-order
-    while (p && p.z >= minZ) {
-        if (p.x >= x0 && p.x <= x1 && p.y >= y0 && p.y <= y1 && p !== a && p !== c &&
-            pointInTriangle(ax, ay, bx, by, cx, cy, p.x, p.y) && area(p.prev, p, p.next) >= 0) return false;
-        p = p.prevZ;
-    }
-
-    // look for remaining points in increasing z-order
-    while (n && n.z <= maxZ) {
-        if (n.x >= x0 && n.x <= x1 && n.y >= y0 && n.y <= y1 && n !== a && n !== c &&
-            pointInTriangle(ax, ay, bx, by, cx, cy, n.x, n.y) && area(n.prev, n, n.next) >= 0) return false;
-        n = n.nextZ;
-    }
-
-    return true;
-}
-
-// go through all polygon nodes and cure small local self-intersections
-function cureLocalIntersections(start, triangles, dim) {
-    var p = start;
-    do {
-        var a = p.prev,
-            b = p.next.next;
-
-        if (!equals(a, b) && intersects(a, p, p.next, b) && locallyInside(a, b) && locallyInside(b, a)) {
-
-            triangles.push(a.i / dim | 0);
-            triangles.push(p.i / dim | 0);
-            triangles.push(b.i / dim | 0);
-
-            // remove two nodes involved
-            removeNode(p);
-            removeNode(p.next);
-
-            p = start = b;
-        }
-        p = p.next;
-    } while (p !== start);
-
-    return filterPoints(p);
-}
-
-// try splitting polygon into two and triangulate them independently
-function splitEarcut(start, triangles, dim, minX, minY, invSize) {
-    // look for a valid diagonal that divides the polygon into two
-    var a = start;
-    do {
-        var b = a.next.next;
-        while (b !== a.prev) {
-            if (a.i !== b.i && isValidDiagonal(a, b)) {
-                // split the polygon in two by the diagonal
-                var c = splitPolygon(a, b);
-
-                // filter colinear points around the cuts
-                a = filterPoints(a, a.next);
-                c = filterPoints(c, c.next);
-
-                // run earcut on each half
-                earcutLinked(a, triangles, dim, minX, minY, invSize, 0);
-                earcutLinked(c, triangles, dim, minX, minY, invSize, 0);
-                return;
-            }
-            b = b.next;
-        }
-        a = a.next;
-    } while (a !== start);
-}
-
-// link every hole into the outer loop, producing a single-ring polygon without holes
-function eliminateHoles(data, holeIndices, outerNode, dim) {
-    var queue = [],
-        i, len, start, end, list;
-
-    for (i = 0, len = holeIndices.length; i < len; i++) {
-        start = holeIndices[i] * dim;
-        end = i < len - 1 ? holeIndices[i + 1] * dim : data.length;
-        list = linkedList(data, start, end, dim, false);
-        if (list === list.next) list.steiner = true;
-        queue.push(getLeftmost(list));
-    }
-
-    queue.sort(compareX);
-
-    // process holes from left to right
-    for (i = 0; i < queue.length; i++) {
-        outerNode = eliminateHole(queue[i], outerNode);
-    }
-
-    return outerNode;
-}
-
-function compareX(a, b) {
-    return a.x - b.x;
-}
-
-// find a bridge between vertices that connects hole with an outer ring and and link it
-function eliminateHole(hole, outerNode) {
-    var bridge = findHoleBridge(hole, outerNode);
-    if (!bridge) {
-        return outerNode;
-    }
-
-    var bridgeReverse = splitPolygon(bridge, hole);
-
-    // filter collinear points around the cuts
-    filterPoints(bridgeReverse, bridgeReverse.next);
-    return filterPoints(bridge, bridge.next);
-}
-
-// David Eberly's algorithm for finding a bridge between hole and outer polygon
-function findHoleBridge(hole, outerNode) {
-    var p = outerNode,
-        hx = hole.x,
-        hy = hole.y,
-        qx = -Infinity,
-        m;
-
-    // find a segment intersected by a ray from the hole's leftmost point to the left;
-    // segment's endpoint with lesser x will be potential connection point
-    do {
-        if (hy <= p.y && hy >= p.next.y && p.next.y !== p.y) {
-            var x = p.x + (hy - p.y) * (p.next.x - p.x) / (p.next.y - p.y);
-            if (x <= hx && x > qx) {
-                qx = x;
-                m = p.x < p.next.x ? p : p.next;
-                if (x === hx) return m; // hole touches outer segment; pick leftmost endpoint
-            }
-        }
-        p = p.next;
-    } while (p !== outerNode);
-
-    if (!m) return null;
-
-    // look for points inside the triangle of hole point, segment intersection and endpoint;
-    // if there are no points found, we have a valid connection;
-    // otherwise choose the point of the minimum angle with the ray as connection point
-
-    var stop = m,
-        mx = m.x,
-        my = m.y,
-        tanMin = Infinity,
-        tan;
-
-    p = m;
-
-    do {
-        if (hx >= p.x && p.x >= mx && hx !== p.x &&
-                pointInTriangle(hy < my ? hx : qx, hy, mx, my, hy < my ? qx : hx, hy, p.x, p.y)) {
-
-            tan = Math.abs(hy - p.y) / (hx - p.x); // tangential
-
-            if (locallyInside(p, hole) &&
-                (tan < tanMin || (tan === tanMin && (p.x > m.x || (p.x === m.x && sectorContainsSector(m, p)))))) {
-                m = p;
-                tanMin = tan;
-            }
-        }
-
-        p = p.next;
-    } while (p !== stop);
-
-    return m;
-}
-
-// whether sector in vertex m contains sector in vertex p in the same coordinates
-function sectorContainsSector(m, p) {
-    return area(m.prev, m, p.prev) < 0 && area(p.next, m, m.next) < 0;
-}
-
-// interlink polygon nodes in z-order
-function indexCurve(start, minX, minY, invSize) {
-    var p = start;
-    do {
-        if (p.z === 0) p.z = zOrder(p.x, p.y, minX, minY, invSize);
-        p.prevZ = p.prev;
-        p.nextZ = p.next;
-        p = p.next;
-    } while (p !== start);
-
-    p.prevZ.nextZ = null;
-    p.prevZ = null;
-
-    sortLinked(p);
-}
-
-// Simon Tatham's linked list merge sort algorithm
-// http://www.chiark.greenend.org.uk/~sgtatham/algorithms/listsort.html
-function sortLinked(list) {
-    var i, p, q, e, tail, numMerges, pSize, qSize,
-        inSize = 1;
-
-    do {
-        p = list;
-        list = null;
-        tail = null;
-        numMerges = 0;
-
-        while (p) {
-            numMerges++;
-            q = p;
-            pSize = 0;
-            for (i = 0; i < inSize; i++) {
-                pSize++;
-                q = q.nextZ;
-                if (!q) break;
-            }
-            qSize = inSize;
-
-            while (pSize > 0 || (qSize > 0 && q)) {
-
-                if (pSize !== 0 && (qSize === 0 || !q || p.z <= q.z)) {
-                    e = p;
-                    p = p.nextZ;
-                    pSize--;
-                } else {
-                    e = q;
-                    q = q.nextZ;
-                    qSize--;
-                }
-
-                if (tail) tail.nextZ = e;
-                else list = e;
-
-                e.prevZ = tail;
-                tail = e;
-            }
-
-            p = q;
-        }
-
-        tail.nextZ = null;
-        inSize *= 2;
-
-    } while (numMerges > 1);
-
-    return list;
-}
-
-// z-order of a point given coords and inverse of the longer side of data bbox
-function zOrder(x, y, minX, minY, invSize) {
-    // coords are transformed into non-negative 15-bit integer range
-    x = (x - minX) * invSize | 0;
-    y = (y - minY) * invSize | 0;
-
-    x = (x | (x << 8)) & 0x00FF00FF;
-    x = (x | (x << 4)) & 0x0F0F0F0F;
-    x = (x | (x << 2)) & 0x33333333;
-    x = (x | (x << 1)) & 0x55555555;
-
-    y = (y | (y << 8)) & 0x00FF00FF;
-    y = (y | (y << 4)) & 0x0F0F0F0F;
-    y = (y | (y << 2)) & 0x33333333;
-    y = (y | (y << 1)) & 0x55555555;
-
-    return x | (y << 1);
-}
-
-// find the leftmost node of a polygon ring
-function getLeftmost(start) {
-    var p = start,
-        leftmost = start;
-    do {
-        if (p.x < leftmost.x || (p.x === leftmost.x && p.y < leftmost.y)) leftmost = p;
-        p = p.next;
-    } while (p !== start);
-
-    return leftmost;
-}
-
-// check if a point lies within a convex triangle
-function pointInTriangle(ax, ay, bx, by, cx, cy, px, py) {
-    return (cx - px) * (ay - py) >= (ax - px) * (cy - py) &&
-           (ax - px) * (by - py) >= (bx - px) * (ay - py) &&
-           (bx - px) * (cy - py) >= (cx - px) * (by - py);
-}
-
-// check if a diagonal between two polygon nodes is valid (lies in polygon interior)
-function isValidDiagonal(a, b) {
-    return a.next.i !== b.i && a.prev.i !== b.i && !intersectsPolygon(a, b) && // dones't intersect other edges
-           (locallyInside(a, b) && locallyInside(b, a) && middleInside(a, b) && // locally visible
-            (area(a.prev, a, b.prev) || area(a, b.prev, b)) || // does not create opposite-facing sectors
-            equals(a, b) && area(a.prev, a, a.next) > 0 && area(b.prev, b, b.next) > 0); // special zero-length case
-}
-
-// signed area of a triangle
-function area(p, q, r) {
-    return (q.y - p.y) * (r.x - q.x) - (q.x - p.x) * (r.y - q.y);
-}
-
-// check if two points are equal
-function equals(p1, p2) {
-    return p1.x === p2.x && p1.y === p2.y;
-}
-
-// check if two segments intersect
-function intersects(p1, q1, p2, q2) {
-    var o1 = sign(area(p1, q1, p2));
-    var o2 = sign(area(p1, q1, q2));
-    var o3 = sign(area(p2, q2, p1));
-    var o4 = sign(area(p2, q2, q1));
-
-    if (o1 !== o2 && o3 !== o4) return true; // general case
-
-    if (o1 === 0 && onSegment(p1, p2, q1)) return true; // p1, q1 and p2 are collinear and p2 lies on p1q1
-    if (o2 === 0 && onSegment(p1, q2, q1)) return true; // p1, q1 and q2 are collinear and q2 lies on p1q1
-    if (o3 === 0 && onSegment(p2, p1, q2)) return true; // p2, q2 and p1 are collinear and p1 lies on p2q2
-    if (o4 === 0 && onSegment(p2, q1, q2)) return true; // p2, q2 and q1 are collinear and q1 lies on p2q2
-
-    return false;
-}
-
-// for collinear points p, q, r, check if point q lies on segment pr
-function onSegment(p, q, r) {
-    return q.x <= Math.max(p.x, r.x) && q.x >= Math.min(p.x, r.x) && q.y <= Math.max(p.y, r.y) && q.y >= Math.min(p.y, r.y);
-}
-
-function sign(num) {
-    return num > 0 ? 1 : num < 0 ? -1 : 0;
-}
-
-// check if a polygon diagonal intersects any polygon segments
-function intersectsPolygon(a, b) {
-    var p = a;
-    do {
-        if (p.i !== a.i && p.next.i !== a.i && p.i !== b.i && p.next.i !== b.i &&
-                intersects(p, p.next, a, b)) return true;
-        p = p.next;
-    } while (p !== a);
-
-    return false;
-}
-
-// check if a polygon diagonal is locally inside the polygon
-function locallyInside(a, b) {
-    return area(a.prev, a, a.next) < 0 ?
-        area(a, b, a.next) >= 0 && area(a, a.prev, b) >= 0 :
-        area(a, b, a.prev) < 0 || area(a, a.next, b) < 0;
-}
-
-// check if the middle point of a polygon diagonal is inside the polygon
-function middleInside(a, b) {
-    var p = a,
-        inside = false,
-        px = (a.x + b.x) / 2,
-        py = (a.y + b.y) / 2;
-    do {
-        if (((p.y > py) !== (p.next.y > py)) && p.next.y !== p.y &&
-                (px < (p.next.x - p.x) * (py - p.y) / (p.next.y - p.y) + p.x))
-            inside = !inside;
-        p = p.next;
-    } while (p !== a);
-
-    return inside;
-}
-
-// link two polygon vertices with a bridge; if the vertices belong to the same ring, it splits polygon into two;
-// if one belongs to the outer ring and another to a hole, it merges it into a single ring
-function splitPolygon(a, b) {
-    var a2 = new Node(a.i, a.x, a.y),
-        b2 = new Node(b.i, b.x, b.y),
-        an = a.next,
-        bp = b.prev;
-
-    a.next = b;
-    b.prev = a;
-
-    a2.next = an;
-    an.prev = a2;
-
-    b2.next = a2;
-    a2.prev = b2;
-
-    bp.next = b2;
-    b2.prev = bp;
-
-    return b2;
-}
-
-// create a node and optionally link it with previous one (in a circular doubly linked list)
-function insertNode(i, x, y, last) {
-    var p = new Node(i, x, y);
-
-    if (!last) {
-        p.prev = p;
-        p.next = p;
-
-    } else {
-        p.next = last.next;
-        p.prev = last;
-        last.next.prev = p;
-        last.next = p;
-    }
-    return p;
-}
-
-function removeNode(p) {
-    p.next.prev = p.prev;
-    p.prev.next = p.next;
-
-    if (p.prevZ) p.prevZ.nextZ = p.nextZ;
-    if (p.nextZ) p.nextZ.prevZ = p.prevZ;
-}
-
-function Node(i, x, y) {
-    // vertex index in coordinates array
-    this.i = i;
-
-    // vertex coordinates
-    this.x = x;
-    this.y = y;
-
-    // previous and next vertex nodes in a polygon ring
-    this.prev = null;
-    this.next = null;
-
-    // z-order curve value
-    this.z = 0;
-
-    // previous and next nodes in z-order
-    this.prevZ = null;
-    this.nextZ = null;
-
-    // indicates whether this is a steiner point
-    this.steiner = false;
-}
-
-// return a percentage difference between the polygon area and its triangulation area;
-// used to verify correctness of triangulation
-earcut.deviation = function (data, holeIndices, dim, triangles) {
-    var hasHoles = holeIndices && holeIndices.length;
-    var outerLen = hasHoles ? holeIndices[0] * dim : data.length;
-
-    var polygonArea = Math.abs(signedArea(data, 0, outerLen, dim));
-    if (hasHoles) {
-        for (var i = 0, len = holeIndices.length; i < len; i++) {
-            var start = holeIndices[i] * dim;
-            var end = i < len - 1 ? holeIndices[i + 1] * dim : data.length;
-            polygonArea -= Math.abs(signedArea(data, start, end, dim));
-        }
-    }
-
-    var trianglesArea = 0;
-    for (i = 0; i < triangles.length; i += 3) {
-        var a = triangles[i] * dim;
-        var b = triangles[i + 1] * dim;
-        var c = triangles[i + 2] * dim;
-        trianglesArea += Math.abs(
-            (data[a] - data[c]) * (data[b + 1] - data[a + 1]) -
-            (data[a] - data[b]) * (data[c + 1] - data[a + 1]));
-    }
-
-    return polygonArea === 0 && trianglesArea === 0 ? 0 :
-        Math.abs((trianglesArea - polygonArea) / polygonArea);
-};
-
-function signedArea(data, start, end, dim) {
-    var sum = 0;
-    for (var i = start, j = end - dim; i < end; i += dim) {
-        sum += (data[j] - data[i]) * (data[i + 1] + data[j + 1]);
-        j = i;
-    }
-    return sum;
-}
-
-// turn a polygon in a multi-dimensional array form (e.g. as in GeoJSON) into a form Earcut accepts
-earcut.flatten = function (data) {
-    var dim = data[0][0].length,
-        result = {vertices: [], holes: [], dimensions: dim},
-        holeIndex = 0;
-
-    for (var i = 0; i < data.length; i++) {
-        for (var j = 0; j < data[i].length; j++) {
-            for (var d = 0; d < dim; d++) result.vertices.push(data[i][j][d]);
-        }
-        if (i > 0) {
-            holeIndex += data[i - 1].length;
-            result.holes.push(holeIndex);
-        }
-    }
-    return result;
-};
-
-
 /***/ }),
 
 /***/ 3369:
@@ -65028,11 +64341,16 @@ __webpack_require__.d(__webpack_exports__, {
   "default": function() { return /* binding */ lib; }
 });
 
-;// CONCATENATED MODULE: ../node_modules/proj4/lib/global.js
+;// ../node_modules/proj4/lib/global.js
 /* harmony default export */ function global(defs) {
   defs('EPSG:4326', "+title=WGS 84 (long/lat) +proj=longlat +ellps=WGS84 +datum=WGS84 +units=degrees");
   defs('EPSG:4269', "+title=NAD83 (long/lat) +proj=longlat +a=6378137.0 +b=6356752.31414036 +ellps=GRS80 +datum=NAD83 +units=degrees");
   defs('EPSG:3857', "+title=WGS 84 / Pseudo-Mercator +proj=merc +a=6378137 +b=6378137 +lat_ts=0.0 +lon_0=0.0 +x_0=0.0 +y_0=0 +k=1.0 +units=m +nadgrids=@null +no_defs");
+  // UTM WGS84
+  for (var i = 0; i <= 60; ++i) {
+    defs('EPSG:' + (32600 + i), "+proj=utm +zone=" + i + " +datum=WGS84 +units=m");
+    defs('EPSG:' + (32700 + i), "+proj=utm +zone=" + i + " +south +datum=WGS84 +units=m");
+  }
 
   defs.WGS84 = defs['EPSG:4326'];
   defs['EPSG:3785'] = defs['EPSG:3857']; // maintain backward compat, official code is 3857
@@ -65043,7 +64361,7 @@ __webpack_require__.d(__webpack_exports__, {
 
 // EXTERNAL MODULE: ../node_modules/proj4/lib/constants/values.js
 var values = __webpack_require__(2556);
-;// CONCATENATED MODULE: ../node_modules/proj4/lib/constants/PrimeMeridian.js
+;// ../node_modules/proj4/lib/constants/PrimeMeridian.js
 var PrimeMeridian_exports = {};
 
 
@@ -65061,13 +64379,31 @@ PrimeMeridian_exports.stockholm = 18.058277777778; //"18d3'29.8\"E",
 PrimeMeridian_exports.athens = 23.7163375; //"23d42'58.815\"E",
 PrimeMeridian_exports.oslo = 10.722916666667; //"10d43'22.5\"E"
 
-;// CONCATENATED MODULE: ../node_modules/proj4/lib/constants/units.js
+;// ../node_modules/proj4/lib/constants/units.js
 /* harmony default export */ var units = ({
-  ft: {to_meter: 0.3048},
-  'us-ft': {to_meter: 1200 / 3937}
+  'mm': {to_meter: 0.001},
+  'cm': {to_meter: 0.01},
+  'ft': {to_meter: 0.3048},
+  'us-ft': {to_meter: 1200 / 3937},
+  'fath': {to_meter: 1.8288},
+  'kmi': {to_meter: 1852},
+  'us-ch': {to_meter: 20.1168402336805},
+  'us-mi': {to_meter: 1609.34721869444},
+  'km': {to_meter: 1000},
+  'ind-ft': {to_meter: 0.30479841},
+  'ind-yd': {to_meter: 0.91439523},
+  'mi': {to_meter: 1609.344},
+  'yd': {to_meter: 0.9144},
+  'ch': {to_meter: 20.1168},
+  'link': {to_meter: 0.201168},
+  'dm': {to_meter: 0.01},
+  'in': {to_meter: 0.0254},
+  'ind-ch': {to_meter: 20.11669506},
+  'us-in': {to_meter: 0.025400050800101},
+  'us-yd': {to_meter: 0.914401828803658}
 });
 
-;// CONCATENATED MODULE: ../node_modules/proj4/lib/match.js
+;// ../node_modules/proj4/lib/match.js
 var ignoredChar = /[\s_\-\/\(\)]/g;
 function match(obj, key) {
   if (obj[key]) {
@@ -65086,7 +64422,7 @@ function match(obj, key) {
   }
 }
 
-;// CONCATENATED MODULE: ../node_modules/proj4/lib/projString.js
+;// ../node_modules/proj4/lib/projString.js
 
 
 
@@ -65232,7 +64568,7 @@ function match(obj, key) {
   return self;
 }
 
-;// CONCATENATED MODULE: ../node_modules/wkt-parser/parser.js
+;// ../node_modules/wkt-parser/parser.js
 /* harmony default export */ var parser = (parseString);
 
 var NEUTRAL = 1;
@@ -65403,7 +64739,7 @@ function parseString(txt) {
   return parser.output();
 }
 
-;// CONCATENATED MODULE: ../node_modules/wkt-parser/process.js
+;// ../node_modules/wkt-parser/process.js
 
 
 function mapit(obj, key, value) {
@@ -65483,6 +64819,21 @@ function sExpr(v, obj) {
         sExpr(v[3], obj[key]);
       }
       return;
+    case 'EDATUM':
+    case 'ENGINEERINGDATUM':
+    case 'LOCAL_DATUM':
+    case 'DATUM':
+    case 'VERT_CS':
+    case 'VERTCRS':
+    case 'VERTICALCRS':
+      v[0] = ['name', v[0]];
+      mapit(obj, key, v);
+      return;
+    case 'COMPD_CS':
+    case 'COMPOUNDCRS':
+    case 'FITTED_CS':
+    // the followings are the crs defined in
+    // https://github.com/proj4js/proj4js/blob/1da4ed0b865d0fcb51c136090569210cdcc9019e/lib/parseCode.js#L11
     case 'PROJECTEDCRS':
     case 'PROJCRS':
     case 'GEOGCS':
@@ -65492,20 +64843,11 @@ function sExpr(v, obj) {
     case 'GEODCRS':
     case 'GEODETICCRS':
     case 'GEODETICDATUM':
-    case 'EDATUM':
-    case 'ENGINEERINGDATUM':
-    case 'VERT_CS':
-    case 'VERTCRS':
-    case 'VERTICALCRS':
-    case 'COMPD_CS':
-    case 'COMPOUNDCRS':
-    case 'ENGINEERINGCRS':
     case 'ENGCRS':
-    case 'FITTED_CS':
-    case 'LOCAL_DATUM':
-    case 'DATUM':
+    case 'ENGINEERINGCRS':
       v[0] = ['name', v[0]];
       mapit(obj, key, v);
+      obj[key].type = key;
       return;
     default:
       i = -1;
@@ -65518,12 +64860,13 @@ function sExpr(v, obj) {
   }
 }
 
-;// CONCATENATED MODULE: ../node_modules/wkt-parser/index.js
+;// ../node_modules/wkt-parser/index.js
 var D2R = 0.01745329251994329577;
 
 
 
-
+var knownTypes = ['PROJECTEDCRS', 'PROJCRS', 'GEOGCS', 'GEOCCS', 'PROJCS', 'LOCAL_CS', 'GEODCRS',
+  'GEODETICCRS', 'GEODETICDATUM', 'ENGCRS', 'ENGINEERINGCRS'];
 
 function rename(obj, params) {
   var outName = params[0];
@@ -65541,6 +64884,27 @@ function d2r(input) {
 }
 
 function cleanWKT(wkt) {
+  var keys = Object.keys(wkt);
+  for (var i = 0, ii = keys.length; i <ii; ++i) {
+    var key = keys[i];
+    // the followings are the crs defined in
+    // https://github.com/proj4js/proj4js/blob/1da4ed0b865d0fcb51c136090569210cdcc9019e/lib/parseCode.js#L11
+    if (knownTypes.indexOf(key) !== -1) {
+      setPropertiesFromWkt(wkt[key]);
+    }
+    if (typeof wkt[key] === 'object') {
+      cleanWKT(wkt[key]);
+    }
+  }
+}
+
+function setPropertiesFromWkt(wkt) {
+  if (wkt.AUTHORITY) {
+    var authority = Object.keys(wkt.AUTHORITY)[0];
+    if (authority && authority in wkt.AUTHORITY) {
+      wkt.title = authority + ':' + wkt.AUTHORITY[authority];
+    }
+  }
   if (wkt.type === 'GEOGCS') {
     wkt.projName = 'longlat';
   } else if (wkt.type === 'LOCAL_CS') {
@@ -65605,7 +64969,7 @@ function cleanWKT(wkt) {
     if (wkt.datumCode.slice(0, 2) === 'd_') {
       wkt.datumCode = wkt.datumCode.slice(2);
     }
-    if (wkt.datumCode === 'new_zealand_geodetic_datum_1949' || wkt.datumCode === 'new_zealand_1949') {
+    if (wkt.datumCode === 'new_zealand_1949') {
       wkt.datumCode = 'nzgd49';
     }
     if (wkt.datumCode === 'wgs_1984' || wkt.datumCode === 'world_geodetic_system_1984') {
@@ -65614,13 +64978,7 @@ function cleanWKT(wkt) {
       }
       wkt.datumCode = 'wgs84';
     }
-    if (wkt.datumCode.slice(-6) === '_ferro') {
-      wkt.datumCode = wkt.datumCode.slice(0, - 6);
-    }
-    if (wkt.datumCode.slice(-8) === '_jakarta') {
-      wkt.datumCode = wkt.datumCode.slice(0, - 8);
-    }
-    if (~wkt.datumCode.indexOf('belge')) {
+    if (wkt.datumCode === 'belge_1972') {
       wkt.datumCode = 'rnb72';
     }
     if (geogcs.DATUM && geogcs.DATUM.SPHEROID) {
@@ -65715,17 +65073,14 @@ function cleanWKT(wkt) {
 }
 /* harmony default export */ function wkt_parser(wkt) {
   var lisp = parser(wkt);
-  var type = lisp.shift();
-  var name = lisp.shift();
-  lisp.unshift(['name', name]);
-  lisp.unshift(['type', type]);
+  var type = lisp[0];
   var obj = {};
   sExpr(lisp, obj);
   cleanWKT(obj);
-  return obj;
+  return obj[type];
 }
 
-;// CONCATENATED MODULE: ../node_modules/proj4/lib/defs.js
+;// ../node_modules/proj4/lib/defs.js
 
 
 
@@ -65782,7 +65137,7 @@ function defs(name) {
 global(defs);
 /* harmony default export */ var lib_defs = (defs);
 
-;// CONCATENATED MODULE: ../node_modules/proj4/lib/parseCode.js
+;// ../node_modules/proj4/lib/parseCode.js
 
 
 
@@ -65846,7 +65201,7 @@ function parse(code){
 
 /* harmony default export */ var parseCode = (parse);
 
-;// CONCATENATED MODULE: ../node_modules/proj4/lib/extend.js
+;// ../node_modules/proj4/lib/extend.js
 /* harmony default export */ function extend(destination, source) {
   destination = destination || {};
   var value, property;
@@ -65866,7 +65221,7 @@ function parse(code){
 var merc = __webpack_require__(2286);
 // EXTERNAL MODULE: ../node_modules/proj4/lib/projections/longlat.js
 var longlat = __webpack_require__(2848);
-;// CONCATENATED MODULE: ../node_modules/proj4/lib/projections.js
+;// ../node_modules/proj4/lib/projections.js
 
 
 var projs = [merc["default"], longlat["default"]];
@@ -65907,7 +65262,7 @@ function start() {
   get: get
 });
 
-;// CONCATENATED MODULE: ../node_modules/proj4/lib/constants/Ellipsoid.js
+;// ../node_modules/proj4/lib/constants/Ellipsoid.js
 var Ellipsoid_exports = {};
 
 Ellipsoid_exports.MERIT = {
@@ -66175,7 +65530,7 @@ Ellipsoid_exports.sphere = {
   ellipseName: "Normal Sphere (r=6370997)"
 };
 
-;// CONCATENATED MODULE: ../node_modules/proj4/lib/deriveConstants.js
+;// ../node_modules/proj4/lib/deriveConstants.js
 
 
 
@@ -66225,121 +65580,111 @@ function sphere(a, b, rf, ellps, sphere) {
   };
 }
 
-;// CONCATENATED MODULE: ../node_modules/proj4/lib/constants/Datum.js
-var Datum_exports = {};
-
-Datum_exports.wgs84 = {
-  towgs84: "0,0,0",
-  ellipse: "WGS84",
-  datumName: "WGS84"
-};
-
-Datum_exports.ch1903 = {
-  towgs84: "674.374,15.056,405.346",
-  ellipse: "bessel",
-  datumName: "swiss"
-};
-
-Datum_exports.ggrs87 = {
-  towgs84: "-199.87,74.79,246.62",
-  ellipse: "GRS80",
-  datumName: "Greek_Geodetic_Reference_System_1987"
-};
-
-Datum_exports.nad83 = {
-  towgs84: "0,0,0",
-  ellipse: "GRS80",
-  datumName: "North_American_Datum_1983"
-};
-
-Datum_exports.nad27 = {
-  nadgrids: "@conus,@alaska,@ntv2_0.gsb,@ntv1_can.dat",
-  ellipse: "clrk66",
-  datumName: "North_American_Datum_1927"
-};
-
-Datum_exports.potsdam = {
-  towgs84: "598.1,73.7,418.2,0.202,0.045,-2.455,6.7",
-  ellipse: "bessel",
-  datumName: "Potsdam Rauenberg 1950 DHDN"
-};
-
-Datum_exports.carthage = {
-  towgs84: "-263.0,6.0,431.0",
-  ellipse: "clark80",
-  datumName: "Carthage 1934 Tunisia"
-};
-
-Datum_exports.hermannskogel = {
-  towgs84: "577.326,90.129,463.919,5.137,1.474,5.297,2.4232",
-  ellipse: "bessel",
-  datumName: "Hermannskogel"
-};
-
-Datum_exports.militargeographische_institut = {
-  towgs84: "577.326,90.129,463.919,5.137,1.474,5.297,2.4232",
-  ellipse: "bessel",
-  datumName: "Militar-Geographische Institut"
-};
-
-Datum_exports.osni52 = {
-  towgs84: "482.530,-130.596,564.557,-1.042,-0.214,-0.631,8.15",
-  ellipse: "airy",
-  datumName: "Irish National"
-};
-
-Datum_exports.ire65 = {
-  towgs84: "482.530,-130.596,564.557,-1.042,-0.214,-0.631,8.15",
-  ellipse: "mod_airy",
-  datumName: "Ireland 1965"
-};
-
-Datum_exports.rassadiran = {
-  towgs84: "-133.63,-157.5,-158.62",
-  ellipse: "intl",
-  datumName: "Rassadiran"
-};
-
-Datum_exports.nzgd49 = {
-  towgs84: "59.47,-5.04,187.44,0.47,-0.1,1.024,-4.5993",
-  ellipse: "intl",
-  datumName: "New Zealand Geodetic Datum 1949"
-};
-
-Datum_exports.osgb36 = {
-  towgs84: "446.448,-125.157,542.060,0.1502,0.2470,0.8421,-20.4894",
-  ellipse: "airy",
-  datumName: "Airy 1830"
-};
-
-Datum_exports.s_jtsk = {
-  towgs84: "589,76,480",
-  ellipse: 'bessel',
-  datumName: 'S-JTSK (Ferro)'
-};
-
-Datum_exports.beduaram = {
-  towgs84: '-106,-87,188',
-  ellipse: 'clrk80',
-  datumName: 'Beduaram'
+;// ../node_modules/proj4/lib/constants/Datum.js
+var datums = {
+  wgs84: {
+    towgs84: "0,0,0",
+    ellipse: "WGS84",
+    datumName: "WGS84"
+  },
+  ch1903: {
+    towgs84: "674.374,15.056,405.346",
+    ellipse: "bessel",
+    datumName: "swiss"
+  },
+  ggrs87: {
+    towgs84: "-199.87,74.79,246.62",
+    ellipse: "GRS80",
+    datumName: "Greek_Geodetic_Reference_System_1987"
+  },
+  nad83: {
+    towgs84: "0,0,0",
+    ellipse: "GRS80",
+    datumName: "North_American_Datum_1983"
+  },
+  nad27: {
+    nadgrids: "@conus,@alaska,@ntv2_0.gsb,@ntv1_can.dat",
+    ellipse: "clrk66",
+    datumName: "North_American_Datum_1927"
+  },
+  potsdam: {
+    towgs84: "598.1,73.7,418.2,0.202,0.045,-2.455,6.7",
+    ellipse: "bessel",
+    datumName: "Potsdam Rauenberg 1950 DHDN"
+  },
+  carthage: {
+    towgs84: "-263.0,6.0,431.0",
+    ellipse: "clark80",
+    datumName: "Carthage 1934 Tunisia"
+  },
+  hermannskogel: {
+    towgs84: "577.326,90.129,463.919,5.137,1.474,5.297,2.4232",
+    ellipse: "bessel",
+    datumName: "Hermannskogel"
+  },
+  militargeographische_institut: {
+    towgs84: "577.326,90.129,463.919,5.137,1.474,5.297,2.4232",
+    ellipse: "bessel",
+    datumName: "Militar-Geographische Institut",
+  },
+  osni52: {
+    towgs84: "482.530,-130.596,564.557,-1.042,-0.214,-0.631,8.15",
+    ellipse: "airy",
+    datumName: "Irish National"
+  },
+  ire65: {
+    towgs84: "482.530,-130.596,564.557,-1.042,-0.214,-0.631,8.15",
+    ellipse: "mod_airy",
+    datumName: "Ireland 1965"
+  },
+  rassadiran: {
+    towgs84: "-133.63,-157.5,-158.62",
+    ellipse: "intl",
+    datumName: "Rassadiran"
+  },
+  nzgd49: {
+    towgs84: "59.47,-5.04,187.44,0.47,-0.1,1.024,-4.5993",
+    ellipse: "intl",
+    datumName: "New Zealand Geodetic Datum 1949"
+  },
+  osgb36: {
+    towgs84: "446.448,-125.157,542.060,0.1502,0.2470,0.8421,-20.4894",
+    ellipse: "airy",
+    datumName: "Ordnance Survey of Great Britain 1936"
+  },
+  s_jtsk: {
+    towgs84: "589,76,480",
+    ellipse: 'bessel',
+    datumName: 'S-JTSK (Ferro)'
+  },
+  beduaram: {
+    towgs84: '-106,-87,188',
+    ellipse: 'clrk80',
+    datumName: 'Beduaram'
+  },
+  gunung_segara: {
+    towgs84: '-403,684,41',
+    ellipse: 'bessel',
+    datumName: 'Gunung Segara Jakarta'
+  },
+  rnb72: {
+    towgs84: "106.869,-52.2978,103.724,-0.33657,0.456955,-1.84218,1",
+    ellipse: "intl",
+    datumName: "Reseau National Belge 1972"
+  }
 };
 
-Datum_exports.gunung_segara = {
-  towgs84: '-403,684,41',
-  ellipse: 'bessel',
-  datumName: 'Gunung Segara Jakarta'
-};
+for (var key in datums) {
+  var datum = datums[key];
+  datums[datum.datumName] = datum;
+}
 
-Datum_exports.rnb72 = {
-  towgs84: "106.869,-52.2978,103.724,-0.33657,0.456955,-1.84218,1",
-  ellipse: "intl",
-  datumName: "Reseau National Belge 1972"
-};
+/* harmony default export */ var Datum = (datums);
 
-;// CONCATENATED MODULE: ../node_modules/proj4/lib/datum.js
+;// ../node_modules/proj4/lib/datum.js
 
 
-function datum(datumCode, datum_params, a, b, es, ep2, nadgrids) {
+function datum_datum(datumCode, datum_params, a, b, es, ep2, nadgrids) {
   var out = {};
 
   if (datumCode === undefined || datumCode === 'none') {
@@ -66375,9 +65720,9 @@ function datum(datumCode, datum_params, a, b, es, ep2, nadgrids) {
   return out;
 }
 
-/* harmony default export */ var lib_datum = (datum);
+/* harmony default export */ var lib_datum = (datum_datum);
 
-;// CONCATENATED MODULE: ../node_modules/proj4/lib/nadgrid.js
+;// ../node_modules/proj4/lib/nadgrid.js
 /**
  * Resources for details of NTv2 file formats:
  * - https://web.archive.org/web/20140127204822if_/http://www.mgs.gov.on.ca:80/stdprodconsume/groups/content/@mgs/@iandit/documents/resourcelist/stel02_047447.pdf
@@ -66519,7 +65864,7 @@ function readGridNodes(view, offset, gridHeader, isLittleEndian) {
   return gridShiftRecords;
 }
 
-;// CONCATENATED MODULE: ../node_modules/proj4/lib/Proj.js
+;// ../node_modules/proj4/lib/Proj.js
 
 
 
@@ -66549,7 +65894,7 @@ function Projection(srsCode,callback) {
     return;
   }
   if (json.datumCode && json.datumCode !== 'none') {
-    var datumDef = match(Datum_exports, json.datumCode);
+    var datumDef = match(Datum, json.datumCode);
     if (datumDef) {
       json.datum_params = json.datum_params || (datumDef.towgs84 ? datumDef.towgs84.split(',') : null);
       json.ellps = datumDef.ellipse;
@@ -66599,7 +65944,7 @@ Projection.projections.start();
 var datumUtils = __webpack_require__(9160);
 // EXTERNAL MODULE: ../node_modules/proj4/lib/common/adjust_lon.js
 var adjust_lon = __webpack_require__(737);
-;// CONCATENATED MODULE: ../node_modules/proj4/lib/datum_transform.js
+;// ../node_modules/proj4/lib/datum_transform.js
 
 
 
@@ -66789,7 +66134,7 @@ function nadInterpolate(pin, ct) {
   return val;
 }
 
-;// CONCATENATED MODULE: ../node_modules/proj4/lib/adjust_axis.js
+;// ../node_modules/proj4/lib/adjust_axis.js
 /* harmony default export */ function adjust_axis(crs, denorm, point) {
   var xin = point.x,
     yin = point.y,
@@ -66852,7 +66197,7 @@ function nadInterpolate(pin, ct) {
   return out;
 }
 
-;// CONCATENATED MODULE: ../node_modules/proj4/lib/common/toPoint.js
+;// ../node_modules/proj4/lib/common/toPoint.js
 /* harmony default export */ function toPoint(array){
   var out = {
     x: array[0],
@@ -66866,7 +66211,7 @@ function nadInterpolate(pin, ct) {
   }
   return out;
 }
-;// CONCATENATED MODULE: ../node_modules/proj4/lib/checkSanity.js
+;// ../node_modules/proj4/lib/checkSanity.js
 /* harmony default export */ function checkSanity(point) {
   checkCoord(point.x);
   checkCoord(point.y);
@@ -66883,7 +66228,7 @@ function checkCoord(num) {
   }
 }
 
-;// CONCATENATED MODULE: ../node_modules/proj4/lib/transform.js
+;// ../node_modules/proj4/lib/transform.js
 
 
 
@@ -66991,7 +66336,7 @@ function transform(source, dest, point, enforceAxis) {
   return point;
 }
 
-;// CONCATENATED MODULE: ../node_modules/proj4/lib/core.js
+;// ../node_modules/proj4/lib/core.js
 
 
 var wgs84 = Proj('WGS84');
@@ -67003,12 +66348,12 @@ function transformer(from, to, coords, enforceAxis) {
     if (coords.length > 2) {
       if ((typeof from.name !== 'undefined' && from.name === 'geocent') || (typeof to.name !== 'undefined' && to.name === 'geocent')) {
         if (typeof transformedArray.z === 'number') {
-          return [transformedArray.x, transformedArray.y, transformedArray.z].concat(coords.splice(3));
+          return [transformedArray.x, transformedArray.y, transformedArray.z].concat(coords.slice(3));
         } else {
-          return [transformedArray.x, transformedArray.y, coords[2]].concat(coords.splice(3));
+          return [transformedArray.x, transformedArray.y, coords[2]].concat(coords.slice(3));
         }
       } else {
-        return [transformedArray.x, transformedArray.y].concat(coords.splice(2));
+        return [transformedArray.x, transformedArray.y].concat(coords.slice(2));
       }
     } else {
       return [transformedArray.x, transformedArray.y];
@@ -67078,7 +66423,7 @@ function proj4(fromProj, toProj, coord) {
   }
 }
 /* harmony default export */ var core = (proj4);
-;// CONCATENATED MODULE: ../node_modules/mgrs/mgrs.js
+;// ../node_modules/mgrs/mgrs.js
 
 
 
@@ -67826,7 +67171,7 @@ function getMinNorthing(zoneLetter) {
 
 }
 
-;// CONCATENATED MODULE: ../node_modules/proj4/lib/Point.js
+;// ../node_modules/proj4/lib/Point.js
 
 
 function Point(x, y, z) {
@@ -67924,7 +67269,7 @@ var geos = __webpack_require__(469);
 var eqearth = __webpack_require__(7129);
 // EXTERNAL MODULE: ../node_modules/proj4/lib/projections/bonne.js
 var bonne = __webpack_require__(5789);
-;// CONCATENATED MODULE: ../node_modules/proj4/projs.js
+;// ../node_modules/proj4/projs.js
 
 
 
@@ -67989,7 +67334,7 @@ var bonne = __webpack_require__(5789);
   proj4.Proj.projections.add(eqearth["default"]);
   proj4.Proj.projections.add(bonne["default"]);
 }
-;// CONCATENATED MODULE: ../node_modules/proj4/lib/index.js
+;// ../node_modules/proj4/lib/index.js
 
 
 
@@ -68688,7 +68033,7 @@ var qsfnz = __webpack_require__(7200);
 var msfnz = __webpack_require__(444);
 // EXTERNAL MODULE: ../node_modules/proj4/lib/constants/values.js
 var values = __webpack_require__(2556);
-;// CONCATENATED MODULE: ../node_modules/proj4/lib/common/iqsfnz.js
+;// ../node_modules/proj4/lib/common/iqsfnz.js
 
 
 /* harmony default export */ function iqsfnz(eccent, q) {
@@ -68722,7 +68067,7 @@ var values = __webpack_require__(2556);
   return NaN;
 }
 
-;// CONCATENATED MODULE: ../node_modules/proj4/lib/projections/cea.js
+;// ../node_modules/proj4/lib/projections/cea.js
 
 
 
@@ -69198,7 +68543,7 @@ var tmerc = __webpack_require__(5602);
 var sinh = __webpack_require__(3882);
 // EXTERNAL MODULE: ../node_modules/proj4/lib/common/hypot.js
 var hypot = __webpack_require__(1708);
-;// CONCATENATED MODULE: ../node_modules/proj4/lib/common/log1py.js
+;// ../node_modules/proj4/lib/common/log1py.js
 /* harmony default export */ function log1py(x) {
   var y = 1 + x;
   var z = y - 1;
@@ -69206,7 +68551,7 @@ var hypot = __webpack_require__(1708);
   return z === 0 ? x : x * Math.log(y) / z;
 }
 
-;// CONCATENATED MODULE: ../node_modules/proj4/lib/common/asinhy.js
+;// ../node_modules/proj4/lib/common/asinhy.js
 
 
 
@@ -69217,7 +68562,7 @@ var hypot = __webpack_require__(1708);
   return x < 0 ? -y : y;
 }
 
-;// CONCATENATED MODULE: ../node_modules/proj4/lib/common/gatg.js
+;// ../node_modules/proj4/lib/common/gatg.js
 /* harmony default export */ function gatg(pp, B) {
   var cos_2B = 2 * Math.cos(2 * B);
   var i = pp.length - 1;
@@ -69234,7 +68579,7 @@ var hypot = __webpack_require__(1708);
   return (B + h * Math.sin(2 * B));
 }
 
-;// CONCATENATED MODULE: ../node_modules/proj4/lib/common/clens.js
+;// ../node_modules/proj4/lib/common/clens.js
 /* harmony default export */ function clens(pp, arg_r) {
   var r = 2 * Math.cos(arg_r);
   var i = pp.length - 1;
@@ -69253,7 +68598,7 @@ var hypot = __webpack_require__(1708);
 
 // EXTERNAL MODULE: ../node_modules/proj4/lib/common/cosh.js
 var cosh = __webpack_require__(4885);
-;// CONCATENATED MODULE: ../node_modules/proj4/lib/common/clens_cmplx.js
+;// ../node_modules/proj4/lib/common/clens_cmplx.js
 
 
 
@@ -69289,7 +68634,7 @@ var cosh = __webpack_require__(4885);
 
 // EXTERNAL MODULE: ../node_modules/proj4/lib/common/adjust_lon.js
 var adjust_lon = __webpack_require__(737);
-;// CONCATENATED MODULE: ../node_modules/proj4/lib/projections/etmerc.js
+;// ../node_modules/proj4/lib/projections/etmerc.js
 // Heavily based on this etmerc projection implementation
 // https://github.com/mbloch/mapshaper-proj/blob/master/src/projections/etmerc.js
 
@@ -69482,13 +68827,13 @@ __webpack_require__.d(__webpack_exports__, {
   names: function() { return /* binding */ names; }
 });
 
-;// CONCATENATED MODULE: ../node_modules/proj4/lib/common/srat.js
+;// ../node_modules/proj4/lib/common/srat.js
 /* harmony default export */ function srat(esinp, exp) {
   return (Math.pow((1 - esinp) / (1 + esinp), exp));
 }
 // EXTERNAL MODULE: ../node_modules/proj4/lib/constants/values.js
 var values = __webpack_require__(2556);
-;// CONCATENATED MODULE: ../node_modules/proj4/lib/projections/gauss.js
+;// ../node_modules/proj4/lib/projections/gauss.js
 
 var MAX_ITER = 20;
 
@@ -69897,7 +69242,7 @@ __webpack_require__.d(__webpack_exports__, {
 
 // EXTERNAL MODULE: ../node_modules/proj4/lib/constants/values.js
 var values = __webpack_require__(2556);
-;// CONCATENATED MODULE: ../node_modules/proj4/lib/common/latiso.js
+;// ../node_modules/proj4/lib/common/latiso.js
 
 
 /* harmony default export */ function latiso(eccent, phi, sinphi) {
@@ -69919,14 +69264,14 @@ var values = __webpack_require__(2556);
 var sinh = __webpack_require__(3882);
 // EXTERNAL MODULE: ../node_modules/proj4/lib/common/cosh.js
 var cosh = __webpack_require__(4885);
-;// CONCATENATED MODULE: ../node_modules/proj4/lib/common/fL.js
+;// ../node_modules/proj4/lib/common/fL.js
 
 
 /* harmony default export */ function fL(x, L) {
   return 2 * Math.atan(x * Math.exp(L)) - values/* HALF_PI */.sK;
 }
 
-;// CONCATENATED MODULE: ../node_modules/proj4/lib/common/invlatiso.js
+;// ../node_modules/proj4/lib/common/invlatiso.js
 
 
 /* harmony default export */ function invlatiso(eccent, ts) {
@@ -69940,7 +69285,7 @@ var cosh = __webpack_require__(4885);
   } while (Math.abs(phi - Iphi) > 1.0e-12);
   return phi;
 }
-;// CONCATENATED MODULE: ../node_modules/proj4/lib/projections/gstmerc.js
+;// ../node_modules/proj4/lib/projections/gstmerc.js
 
 
 
@@ -73196,7 +72541,7 @@ __webpack_require__.d(__webpack_exports__, {
 
 // EXTERNAL MODULE: ../node_modules/proj4/lib/common/adjust_lon.js
 var adjust_lon = __webpack_require__(737);
-;// CONCATENATED MODULE: ../node_modules/proj4/lib/common/adjust_zone.js
+;// ../node_modules/proj4/lib/common/adjust_zone.js
 
 
 /* harmony default export */ function adjust_zone(zone, lon) {
@@ -73216,7 +72561,7 @@ var adjust_lon = __webpack_require__(737);
 var etmerc = __webpack_require__(994);
 // EXTERNAL MODULE: ../node_modules/proj4/lib/constants/values.js
 var values = __webpack_require__(2556);
-;// CONCATENATED MODULE: ../node_modules/proj4/lib/projections/utm.js
+;// ../node_modules/proj4/lib/projections/utm.js
 
 
 var dependsOn = 'etmerc';
@@ -73633,9 +72978,7 @@ var options = {};
 
 options.styleTagTransform = (_node_modules_style_loader_dist_runtime_styleTagTransform_js__WEBPACK_IMPORTED_MODULE_5___default());
 options.setAttributes = (_node_modules_style_loader_dist_runtime_setAttributesWithoutAttributes_js__WEBPACK_IMPORTED_MODULE_3___default());
-
-      options.insert = _node_modules_style_loader_dist_runtime_insertBySelector_js__WEBPACK_IMPORTED_MODULE_2___default().bind(null, "head");
-    
+options.insert = _node_modules_style_loader_dist_runtime_insertBySelector_js__WEBPACK_IMPORTED_MODULE_2___default().bind(null, "head");
 options.domAPI = (_node_modules_style_loader_dist_runtime_styleDomAPI_js__WEBPACK_IMPORTED_MODULE_1___default());
 options.insertStyleElement = (_node_modules_style_loader_dist_runtime_insertStyleElement_js__WEBPACK_IMPORTED_MODULE_4___default());
 
@@ -73682,9 +73025,7 @@ var options = {};
 
 options.styleTagTransform = (_node_modules_style_loader_dist_runtime_styleTagTransform_js__WEBPACK_IMPORTED_MODULE_5___default());
 options.setAttributes = (_node_modules_style_loader_dist_runtime_setAttributesWithoutAttributes_js__WEBPACK_IMPORTED_MODULE_3___default());
-
-      options.insert = _node_modules_style_loader_dist_runtime_insertBySelector_js__WEBPACK_IMPORTED_MODULE_2___default().bind(null, "head");
-    
+options.insert = _node_modules_style_loader_dist_runtime_insertBySelector_js__WEBPACK_IMPORTED_MODULE_2___default().bind(null, "head");
 options.domAPI = (_node_modules_style_loader_dist_runtime_styleDomAPI_js__WEBPACK_IMPORTED_MODULE_1___default());
 options.insertStyleElement = (_node_modules_style_loader_dist_runtime_insertStyleElement_js__WEBPACK_IMPORTED_MODULE_4___default());
 
@@ -73731,9 +73072,7 @@ var options = {};
 
 options.styleTagTransform = (_node_modules_style_loader_dist_runtime_styleTagTransform_js__WEBPACK_IMPORTED_MODULE_5___default());
 options.setAttributes = (_node_modules_style_loader_dist_runtime_setAttributesWithoutAttributes_js__WEBPACK_IMPORTED_MODULE_3___default());
-
-      options.insert = _node_modules_style_loader_dist_runtime_insertBySelector_js__WEBPACK_IMPORTED_MODULE_2___default().bind(null, "head");
-    
+options.insert = _node_modules_style_loader_dist_runtime_insertBySelector_js__WEBPACK_IMPORTED_MODULE_2___default().bind(null, "head");
 options.domAPI = (_node_modules_style_loader_dist_runtime_styleDomAPI_js__WEBPACK_IMPORTED_MODULE_1___default());
 options.insertStyleElement = (_node_modules_style_loader_dist_runtime_insertStyleElement_js__WEBPACK_IMPORTED_MODULE_4___default());
 
@@ -74064,6 +73403,630 @@ module.exports = __WEBPACK_EXTERNAL_MODULE__7606__;
 
 /***/ }),
 
+/***/ 9747:
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */   "default": function() { return /* binding */ earcut; },
+/* harmony export */   deviation: function() { return /* binding */ deviation; },
+/* harmony export */   flatten: function() { return /* binding */ flatten; }
+/* harmony export */ });
+function _createForOfIteratorHelper(r, e) { var t = "undefined" != typeof Symbol && r[Symbol.iterator] || r["@@iterator"]; if (!t) { if (Array.isArray(r) || (t = _unsupportedIterableToArray(r)) || e && r && "number" == typeof r.length) { t && (r = t); var _n = 0, F = function F() {}; return { s: F, n: function n() { return _n >= r.length ? { done: !0 } : { done: !1, value: r[_n++] }; }, e: function e(r) { throw r; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var o, a = !0, u = !1; return { s: function s() { t = t.call(r); }, n: function n() { var r = t.next(); return a = r.done, r; }, e: function e(r) { u = !0, o = r; }, f: function f() { try { a || null == t.return || t.return(); } finally { if (u) throw o; } } }; }
+function _unsupportedIterableToArray(r, a) { if (r) { if ("string" == typeof r) return _arrayLikeToArray(r, a); var t = {}.toString.call(r).slice(8, -1); return "Object" === t && r.constructor && (t = r.constructor.name), "Map" === t || "Set" === t ? Array.from(r) : "Arguments" === t || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(t) ? _arrayLikeToArray(r, a) : void 0; } }
+function _arrayLikeToArray(r, a) { (null == a || a > r.length) && (a = r.length); for (var e = 0, n = Array(a); e < a; e++) n[e] = r[e]; return n; }
+function earcut(data, holeIndices) {
+  var dim = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 2;
+  var hasHoles = holeIndices && holeIndices.length;
+  var outerLen = hasHoles ? holeIndices[0] * dim : data.length;
+  var outerNode = linkedList(data, 0, outerLen, dim, true);
+  var triangles = [];
+  if (!outerNode || outerNode.next === outerNode.prev) return triangles;
+  var minX, minY, invSize;
+  if (hasHoles) outerNode = eliminateHoles(data, holeIndices, outerNode, dim);
+
+  // if the shape is not too simple, we'll use z-order curve hash later; calculate polygon bbox
+  if (data.length > 80 * dim) {
+    minX = Infinity;
+    minY = Infinity;
+    var maxX = -Infinity;
+    var maxY = -Infinity;
+    for (var i = dim; i < outerLen; i += dim) {
+      var x = data[i];
+      var y = data[i + 1];
+      if (x < minX) minX = x;
+      if (y < minY) minY = y;
+      if (x > maxX) maxX = x;
+      if (y > maxY) maxY = y;
+    }
+
+    // minX, minY and invSize are later used to transform coords into integers for z-order calculation
+    invSize = Math.max(maxX - minX, maxY - minY);
+    invSize = invSize !== 0 ? 32767 / invSize : 0;
+  }
+  earcutLinked(outerNode, triangles, dim, minX, minY, invSize, 0);
+  return triangles;
+}
+
+// create a circular doubly linked list from polygon points in the specified winding order
+function linkedList(data, start, end, dim, clockwise) {
+  var last;
+  if (clockwise === signedArea(data, start, end, dim) > 0) {
+    for (var i = start; i < end; i += dim) last = insertNode(i / dim | 0, data[i], data[i + 1], last);
+  } else {
+    for (var _i = end - dim; _i >= start; _i -= dim) last = insertNode(_i / dim | 0, data[_i], data[_i + 1], last);
+  }
+  if (last && equals(last, last.next)) {
+    removeNode(last);
+    last = last.next;
+  }
+  return last;
+}
+
+// eliminate colinear or duplicate points
+function filterPoints(start, end) {
+  if (!start) return start;
+  if (!end) end = start;
+  var p = start,
+    again;
+  do {
+    again = false;
+    if (!p.steiner && (equals(p, p.next) || area(p.prev, p, p.next) === 0)) {
+      removeNode(p);
+      p = end = p.prev;
+      if (p === p.next) break;
+      again = true;
+    } else {
+      p = p.next;
+    }
+  } while (again || p !== end);
+  return end;
+}
+
+// main ear slicing loop which triangulates a polygon (given as a linked list)
+function earcutLinked(ear, triangles, dim, minX, minY, invSize, pass) {
+  if (!ear) return;
+
+  // interlink polygon nodes in z-order
+  if (!pass && invSize) indexCurve(ear, minX, minY, invSize);
+  var stop = ear;
+
+  // iterate through ears, slicing them one by one
+  while (ear.prev !== ear.next) {
+    var prev = ear.prev;
+    var next = ear.next;
+    if (invSize ? isEarHashed(ear, minX, minY, invSize) : isEar(ear)) {
+      triangles.push(prev.i, ear.i, next.i); // cut off the triangle
+
+      removeNode(ear);
+
+      // skipping the next vertex leads to less sliver triangles
+      ear = next.next;
+      stop = next.next;
+      continue;
+    }
+    ear = next;
+
+    // if we looped through the whole remaining polygon and can't find any more ears
+    if (ear === stop) {
+      // try filtering points and slicing again
+      if (!pass) {
+        earcutLinked(filterPoints(ear), triangles, dim, minX, minY, invSize, 1);
+
+        // if this didn't work, try curing all small self-intersections locally
+      } else if (pass === 1) {
+        ear = cureLocalIntersections(filterPoints(ear), triangles);
+        earcutLinked(ear, triangles, dim, minX, minY, invSize, 2);
+
+        // as a last resort, try splitting the remaining polygon into two
+      } else if (pass === 2) {
+        splitEarcut(ear, triangles, dim, minX, minY, invSize);
+      }
+      break;
+    }
+  }
+}
+
+// check whether a polygon node forms a valid ear with adjacent nodes
+function isEar(ear) {
+  var a = ear.prev,
+    b = ear,
+    c = ear.next;
+  if (area(a, b, c) >= 0) return false; // reflex, can't be an ear
+
+  // now make sure we don't have other points inside the potential ear
+  var ax = a.x,
+    bx = b.x,
+    cx = c.x,
+    ay = a.y,
+    by = b.y,
+    cy = c.y;
+
+  // triangle bbox; min & max are calculated like this for speed
+  var x0 = ax < bx ? ax < cx ? ax : cx : bx < cx ? bx : cx,
+    y0 = ay < by ? ay < cy ? ay : cy : by < cy ? by : cy,
+    x1 = ax > bx ? ax > cx ? ax : cx : bx > cx ? bx : cx,
+    y1 = ay > by ? ay > cy ? ay : cy : by > cy ? by : cy;
+  var p = c.next;
+  while (p !== a) {
+    if (p.x >= x0 && p.x <= x1 && p.y >= y0 && p.y <= y1 && pointInTriangle(ax, ay, bx, by, cx, cy, p.x, p.y) && area(p.prev, p, p.next) >= 0) return false;
+    p = p.next;
+  }
+  return true;
+}
+function isEarHashed(ear, minX, minY, invSize) {
+  var a = ear.prev,
+    b = ear,
+    c = ear.next;
+  if (area(a, b, c) >= 0) return false; // reflex, can't be an ear
+
+  var ax = a.x,
+    bx = b.x,
+    cx = c.x,
+    ay = a.y,
+    by = b.y,
+    cy = c.y;
+
+  // triangle bbox; min & max are calculated like this for speed
+  var x0 = ax < bx ? ax < cx ? ax : cx : bx < cx ? bx : cx,
+    y0 = ay < by ? ay < cy ? ay : cy : by < cy ? by : cy,
+    x1 = ax > bx ? ax > cx ? ax : cx : bx > cx ? bx : cx,
+    y1 = ay > by ? ay > cy ? ay : cy : by > cy ? by : cy;
+
+  // z-order range for the current triangle bbox;
+  var minZ = zOrder(x0, y0, minX, minY, invSize),
+    maxZ = zOrder(x1, y1, minX, minY, invSize);
+  var p = ear.prevZ,
+    n = ear.nextZ;
+
+  // look for points inside the triangle in both directions
+  while (p && p.z >= minZ && n && n.z <= maxZ) {
+    if (p.x >= x0 && p.x <= x1 && p.y >= y0 && p.y <= y1 && p !== a && p !== c && pointInTriangle(ax, ay, bx, by, cx, cy, p.x, p.y) && area(p.prev, p, p.next) >= 0) return false;
+    p = p.prevZ;
+    if (n.x >= x0 && n.x <= x1 && n.y >= y0 && n.y <= y1 && n !== a && n !== c && pointInTriangle(ax, ay, bx, by, cx, cy, n.x, n.y) && area(n.prev, n, n.next) >= 0) return false;
+    n = n.nextZ;
+  }
+
+  // look for remaining points in decreasing z-order
+  while (p && p.z >= minZ) {
+    if (p.x >= x0 && p.x <= x1 && p.y >= y0 && p.y <= y1 && p !== a && p !== c && pointInTriangle(ax, ay, bx, by, cx, cy, p.x, p.y) && area(p.prev, p, p.next) >= 0) return false;
+    p = p.prevZ;
+  }
+
+  // look for remaining points in increasing z-order
+  while (n && n.z <= maxZ) {
+    if (n.x >= x0 && n.x <= x1 && n.y >= y0 && n.y <= y1 && n !== a && n !== c && pointInTriangle(ax, ay, bx, by, cx, cy, n.x, n.y) && area(n.prev, n, n.next) >= 0) return false;
+    n = n.nextZ;
+  }
+  return true;
+}
+
+// go through all polygon nodes and cure small local self-intersections
+function cureLocalIntersections(start, triangles) {
+  var p = start;
+  do {
+    var a = p.prev,
+      b = p.next.next;
+    if (!equals(a, b) && intersects(a, p, p.next, b) && locallyInside(a, b) && locallyInside(b, a)) {
+      triangles.push(a.i, p.i, b.i);
+
+      // remove two nodes involved
+      removeNode(p);
+      removeNode(p.next);
+      p = start = b;
+    }
+    p = p.next;
+  } while (p !== start);
+  return filterPoints(p);
+}
+
+// try splitting polygon into two and triangulate them independently
+function splitEarcut(start, triangles, dim, minX, minY, invSize) {
+  // look for a valid diagonal that divides the polygon into two
+  var a = start;
+  do {
+    var b = a.next.next;
+    while (b !== a.prev) {
+      if (a.i !== b.i && isValidDiagonal(a, b)) {
+        // split the polygon in two by the diagonal
+        var c = splitPolygon(a, b);
+
+        // filter colinear points around the cuts
+        a = filterPoints(a, a.next);
+        c = filterPoints(c, c.next);
+
+        // run earcut on each half
+        earcutLinked(a, triangles, dim, minX, minY, invSize, 0);
+        earcutLinked(c, triangles, dim, minX, minY, invSize, 0);
+        return;
+      }
+      b = b.next;
+    }
+    a = a.next;
+  } while (a !== start);
+}
+
+// link every hole into the outer loop, producing a single-ring polygon without holes
+function eliminateHoles(data, holeIndices, outerNode, dim) {
+  var queue = [];
+  for (var i = 0, len = holeIndices.length; i < len; i++) {
+    var start = holeIndices[i] * dim;
+    var end = i < len - 1 ? holeIndices[i + 1] * dim : data.length;
+    var list = linkedList(data, start, end, dim, false);
+    if (list === list.next) list.steiner = true;
+    queue.push(getLeftmost(list));
+  }
+  queue.sort(compareX);
+
+  // process holes from left to right
+  for (var _i2 = 0; _i2 < queue.length; _i2++) {
+    outerNode = eliminateHole(queue[_i2], outerNode);
+  }
+  return outerNode;
+}
+function compareX(a, b) {
+  return a.x - b.x;
+}
+
+// find a bridge between vertices that connects hole with an outer ring and and link it
+function eliminateHole(hole, outerNode) {
+  var bridge = findHoleBridge(hole, outerNode);
+  if (!bridge) {
+    return outerNode;
+  }
+  var bridgeReverse = splitPolygon(bridge, hole);
+
+  // filter collinear points around the cuts
+  filterPoints(bridgeReverse, bridgeReverse.next);
+  return filterPoints(bridge, bridge.next);
+}
+
+// David Eberly's algorithm for finding a bridge between hole and outer polygon
+function findHoleBridge(hole, outerNode) {
+  var p = outerNode;
+  var hx = hole.x;
+  var hy = hole.y;
+  var qx = -Infinity;
+  var m;
+
+  // find a segment intersected by a ray from the hole's leftmost point to the left;
+  // segment's endpoint with lesser x will be potential connection point
+  do {
+    if (hy <= p.y && hy >= p.next.y && p.next.y !== p.y) {
+      var x = p.x + (hy - p.y) * (p.next.x - p.x) / (p.next.y - p.y);
+      if (x <= hx && x > qx) {
+        qx = x;
+        m = p.x < p.next.x ? p : p.next;
+        if (x === hx) return m; // hole touches outer segment; pick leftmost endpoint
+      }
+    }
+    p = p.next;
+  } while (p !== outerNode);
+  if (!m) return null;
+
+  // look for points inside the triangle of hole point, segment intersection and endpoint;
+  // if there are no points found, we have a valid connection;
+  // otherwise choose the point of the minimum angle with the ray as connection point
+
+  var stop = m;
+  var mx = m.x;
+  var my = m.y;
+  var tanMin = Infinity;
+  p = m;
+  do {
+    if (hx >= p.x && p.x >= mx && hx !== p.x && pointInTriangle(hy < my ? hx : qx, hy, mx, my, hy < my ? qx : hx, hy, p.x, p.y)) {
+      var tan = Math.abs(hy - p.y) / (hx - p.x); // tangential
+
+      if (locallyInside(p, hole) && (tan < tanMin || tan === tanMin && (p.x > m.x || p.x === m.x && sectorContainsSector(m, p)))) {
+        m = p;
+        tanMin = tan;
+      }
+    }
+    p = p.next;
+  } while (p !== stop);
+  return m;
+}
+
+// whether sector in vertex m contains sector in vertex p in the same coordinates
+function sectorContainsSector(m, p) {
+  return area(m.prev, m, p.prev) < 0 && area(p.next, m, m.next) < 0;
+}
+
+// interlink polygon nodes in z-order
+function indexCurve(start, minX, minY, invSize) {
+  var p = start;
+  do {
+    if (p.z === 0) p.z = zOrder(p.x, p.y, minX, minY, invSize);
+    p.prevZ = p.prev;
+    p.nextZ = p.next;
+    p = p.next;
+  } while (p !== start);
+  p.prevZ.nextZ = null;
+  p.prevZ = null;
+  sortLinked(p);
+}
+
+// Simon Tatham's linked list merge sort algorithm
+// http://www.chiark.greenend.org.uk/~sgtatham/algorithms/listsort.html
+function sortLinked(list) {
+  var numMerges;
+  var inSize = 1;
+  do {
+    var p = list;
+    var e = void 0;
+    list = null;
+    var tail = null;
+    numMerges = 0;
+    while (p) {
+      numMerges++;
+      var q = p;
+      var pSize = 0;
+      for (var i = 0; i < inSize; i++) {
+        pSize++;
+        q = q.nextZ;
+        if (!q) break;
+      }
+      var qSize = inSize;
+      while (pSize > 0 || qSize > 0 && q) {
+        if (pSize !== 0 && (qSize === 0 || !q || p.z <= q.z)) {
+          e = p;
+          p = p.nextZ;
+          pSize--;
+        } else {
+          e = q;
+          q = q.nextZ;
+          qSize--;
+        }
+        if (tail) tail.nextZ = e;else list = e;
+        e.prevZ = tail;
+        tail = e;
+      }
+      p = q;
+    }
+    tail.nextZ = null;
+    inSize *= 2;
+  } while (numMerges > 1);
+  return list;
+}
+
+// z-order of a point given coords and inverse of the longer side of data bbox
+function zOrder(x, y, minX, minY, invSize) {
+  // coords are transformed into non-negative 15-bit integer range
+  x = (x - minX) * invSize | 0;
+  y = (y - minY) * invSize | 0;
+  x = (x | x << 8) & 0x00FF00FF;
+  x = (x | x << 4) & 0x0F0F0F0F;
+  x = (x | x << 2) & 0x33333333;
+  x = (x | x << 1) & 0x55555555;
+  y = (y | y << 8) & 0x00FF00FF;
+  y = (y | y << 4) & 0x0F0F0F0F;
+  y = (y | y << 2) & 0x33333333;
+  y = (y | y << 1) & 0x55555555;
+  return x | y << 1;
+}
+
+// find the leftmost node of a polygon ring
+function getLeftmost(start) {
+  var p = start,
+    leftmost = start;
+  do {
+    if (p.x < leftmost.x || p.x === leftmost.x && p.y < leftmost.y) leftmost = p;
+    p = p.next;
+  } while (p !== start);
+  return leftmost;
+}
+
+// check if a point lies within a convex triangle
+function pointInTriangle(ax, ay, bx, by, cx, cy, px, py) {
+  return (cx - px) * (ay - py) >= (ax - px) * (cy - py) && (ax - px) * (by - py) >= (bx - px) * (ay - py) && (bx - px) * (cy - py) >= (cx - px) * (by - py);
+}
+
+// check if a diagonal between two polygon nodes is valid (lies in polygon interior)
+function isValidDiagonal(a, b) {
+  return a.next.i !== b.i && a.prev.i !== b.i && !intersectsPolygon(a, b) && (
+  // dones't intersect other edges
+  locallyInside(a, b) && locallyInside(b, a) && middleInside(a, b) && (
+  // locally visible
+  area(a.prev, a, b.prev) || area(a, b.prev, b)) ||
+  // does not create opposite-facing sectors
+  equals(a, b) && area(a.prev, a, a.next) > 0 && area(b.prev, b, b.next) > 0); // special zero-length case
+}
+
+// signed area of a triangle
+function area(p, q, r) {
+  return (q.y - p.y) * (r.x - q.x) - (q.x - p.x) * (r.y - q.y);
+}
+
+// check if two points are equal
+function equals(p1, p2) {
+  return p1.x === p2.x && p1.y === p2.y;
+}
+
+// check if two segments intersect
+function intersects(p1, q1, p2, q2) {
+  var o1 = sign(area(p1, q1, p2));
+  var o2 = sign(area(p1, q1, q2));
+  var o3 = sign(area(p2, q2, p1));
+  var o4 = sign(area(p2, q2, q1));
+  if (o1 !== o2 && o3 !== o4) return true; // general case
+
+  if (o1 === 0 && onSegment(p1, p2, q1)) return true; // p1, q1 and p2 are collinear and p2 lies on p1q1
+  if (o2 === 0 && onSegment(p1, q2, q1)) return true; // p1, q1 and q2 are collinear and q2 lies on p1q1
+  if (o3 === 0 && onSegment(p2, p1, q2)) return true; // p2, q2 and p1 are collinear and p1 lies on p2q2
+  if (o4 === 0 && onSegment(p2, q1, q2)) return true; // p2, q2 and q1 are collinear and q1 lies on p2q2
+
+  return false;
+}
+
+// for collinear points p, q, r, check if point q lies on segment pr
+function onSegment(p, q, r) {
+  return q.x <= Math.max(p.x, r.x) && q.x >= Math.min(p.x, r.x) && q.y <= Math.max(p.y, r.y) && q.y >= Math.min(p.y, r.y);
+}
+function sign(num) {
+  return num > 0 ? 1 : num < 0 ? -1 : 0;
+}
+
+// check if a polygon diagonal intersects any polygon segments
+function intersectsPolygon(a, b) {
+  var p = a;
+  do {
+    if (p.i !== a.i && p.next.i !== a.i && p.i !== b.i && p.next.i !== b.i && intersects(p, p.next, a, b)) return true;
+    p = p.next;
+  } while (p !== a);
+  return false;
+}
+
+// check if a polygon diagonal is locally inside the polygon
+function locallyInside(a, b) {
+  return area(a.prev, a, a.next) < 0 ? area(a, b, a.next) >= 0 && area(a, a.prev, b) >= 0 : area(a, b, a.prev) < 0 || area(a, a.next, b) < 0;
+}
+
+// check if the middle point of a polygon diagonal is inside the polygon
+function middleInside(a, b) {
+  var p = a;
+  var inside = false;
+  var px = (a.x + b.x) / 2;
+  var py = (a.y + b.y) / 2;
+  do {
+    if (p.y > py !== p.next.y > py && p.next.y !== p.y && px < (p.next.x - p.x) * (py - p.y) / (p.next.y - p.y) + p.x) inside = !inside;
+    p = p.next;
+  } while (p !== a);
+  return inside;
+}
+
+// link two polygon vertices with a bridge; if the vertices belong to the same ring, it splits polygon into two;
+// if one belongs to the outer ring and another to a hole, it merges it into a single ring
+function splitPolygon(a, b) {
+  var a2 = createNode(a.i, a.x, a.y),
+    b2 = createNode(b.i, b.x, b.y),
+    an = a.next,
+    bp = b.prev;
+  a.next = b;
+  b.prev = a;
+  a2.next = an;
+  an.prev = a2;
+  b2.next = a2;
+  a2.prev = b2;
+  bp.next = b2;
+  b2.prev = bp;
+  return b2;
+}
+
+// create a node and optionally link it with previous one (in a circular doubly linked list)
+function insertNode(i, x, y, last) {
+  var p = createNode(i, x, y);
+  if (!last) {
+    p.prev = p;
+    p.next = p;
+  } else {
+    p.next = last.next;
+    p.prev = last;
+    last.next.prev = p;
+    last.next = p;
+  }
+  return p;
+}
+function removeNode(p) {
+  p.next.prev = p.prev;
+  p.prev.next = p.next;
+  if (p.prevZ) p.prevZ.nextZ = p.nextZ;
+  if (p.nextZ) p.nextZ.prevZ = p.prevZ;
+}
+function createNode(i, x, y) {
+  return {
+    i: i,
+    // vertex index in coordinates array
+    x: x,
+    y: y,
+    // vertex coordinates
+    prev: null,
+    // previous and next vertex nodes in a polygon ring
+    next: null,
+    z: 0,
+    // z-order curve value
+    prevZ: null,
+    // previous and next nodes in z-order
+    nextZ: null,
+    steiner: false // indicates whether this is a steiner point
+  };
+}
+
+// return a percentage difference between the polygon area and its triangulation area;
+// used to verify correctness of triangulation
+function deviation(data, holeIndices, dim, triangles) {
+  var hasHoles = holeIndices && holeIndices.length;
+  var outerLen = hasHoles ? holeIndices[0] * dim : data.length;
+  var polygonArea = Math.abs(signedArea(data, 0, outerLen, dim));
+  if (hasHoles) {
+    for (var i = 0, len = holeIndices.length; i < len; i++) {
+      var start = holeIndices[i] * dim;
+      var end = i < len - 1 ? holeIndices[i + 1] * dim : data.length;
+      polygonArea -= Math.abs(signedArea(data, start, end, dim));
+    }
+  }
+  var trianglesArea = 0;
+  for (var _i3 = 0; _i3 < triangles.length; _i3 += 3) {
+    var a = triangles[_i3] * dim;
+    var b = triangles[_i3 + 1] * dim;
+    var c = triangles[_i3 + 2] * dim;
+    trianglesArea += Math.abs((data[a] - data[c]) * (data[b + 1] - data[a + 1]) - (data[a] - data[b]) * (data[c + 1] - data[a + 1]));
+  }
+  return polygonArea === 0 && trianglesArea === 0 ? 0 : Math.abs((trianglesArea - polygonArea) / polygonArea);
+}
+function signedArea(data, start, end, dim) {
+  var sum = 0;
+  for (var i = start, j = end - dim; i < end; i += dim) {
+    sum += (data[j] - data[i]) * (data[i + 1] + data[j + 1]);
+    j = i;
+  }
+  return sum;
+}
+
+// turn a polygon in a multi-dimensional array form (e.g. as in GeoJSON) into a form Earcut accepts
+function flatten(data) {
+  var vertices = [];
+  var holes = [];
+  var dimensions = data[0][0].length;
+  var holeIndex = 0;
+  var prevLen = 0;
+  var _iterator = _createForOfIteratorHelper(data),
+    _step;
+  try {
+    for (_iterator.s(); !(_step = _iterator.n()).done;) {
+      var ring = _step.value;
+      var _iterator2 = _createForOfIteratorHelper(ring),
+        _step2;
+      try {
+        for (_iterator2.s(); !(_step2 = _iterator2.n()).done;) {
+          var p = _step2.value;
+          for (var d = 0; d < dimensions; d++) vertices.push(p[d]);
+        }
+      } catch (err) {
+        _iterator2.e(err);
+      } finally {
+        _iterator2.f();
+      }
+      if (prevLen) {
+        holeIndex += prevLen;
+        holes.push(holeIndex);
+      }
+      prevLen = ring.length;
+    }
+  } catch (err) {
+    _iterator.e(err);
+  } finally {
+    _iterator.f();
+  }
+  return {
+    vertices: vertices,
+    holes: holes,
+    dimensions: dimensions
+  };
+}
+
+/***/ }),
+
 /***/ 4279:
 /***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
 
@@ -74655,8 +74618,8 @@ __webpack_require__.r(__webpack_exports__);
 /******/ 		// undefined = chunk not loaded, null = chunk preloaded/prefetched
 /******/ 		// [resolve, reject, Promise] = chunk loading, 0 = chunk loaded
 /******/ 		var installedChunks = {
-/******/ 			692: 0,
-/******/ 			294: 0
+/******/ 			294: 0,
+/******/ 			692: 0
 /******/ 		};
 /******/ 		
 /******/ 		// no chunk on demand loading