@vcmap/ui 5.3.7 → 6.0.0-rc.10

package/dist/assets/cesium/Workers/{chunk-J3JY6I2C.js → chunk-TI3TRKIC.js}

@@ -1,7 +1,7 @@
 /**
  * @license
  * Cesium - https://github.com/CesiumGS/cesium
- * Version 1.109.3
+ * Version 1.121.2
  *
  * Copyright 2011-2022 Cesium Contributors
  *
@@ -25,506 +25,36 @@
 
 import {
   EllipsoidRhumbLine_default
-} from "./chunk-K36FEYS7.js";
+} from "./chunk-JSQJDZI4.js";
 import {
   GeometryAttribute_default,
   Geometry_default,
   PrimitiveType_default
-} from "./chunk-X4SU25DT.js";
-import {
-  Cartesian2_default
-} from "./chunk-DUHWWBQQ.js";
+} from "./chunk-JXVLNVXC.js";
 import {
   ComponentDatatype_default
-} from "./chunk-LLUNNUJV.js";
+} from "./chunk-XIUSRWL6.js";
 import {
+  Cartesian2_default,
   Cartesian3_default,
   Cartographic_default,
   Ellipsoid_default
-} from "./chunk-PCJWUS4M.js";
+} from "./chunk-FFLMY4TE.js";
 import {
   Math_default
-} from "./chunk-N3JIFFX2.js";
+} from "./chunk-WGDFYAGC.js";
 import {
   WebGLConstants_default
-} from "./chunk-AHKEZ2OE.js";
+} from "./chunk-3HQMMUPU.js";
 import {
   defaultValue_default
-} from "./chunk-WXTV4ATB.js";
+} from "./chunk-U5HSOKPQ.js";
 import {
   Check_default
-} from "./chunk-4MFFIWUA.js";
+} from "./chunk-P6TRGU3S.js";
 import {
-  __commonJS,
-  __toESM,
   defined_default
-} from "./chunk-6BTKZDRG.js";
-
-// node_modules/earcut/src/earcut.js
-var require_earcut = __commonJS({
-  "node_modules/earcut/src/earcut.js"(exports, module) {
-    "use strict";
-    module.exports = earcut2;
-    module.exports.default = earcut2;
-    function earcut2(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 (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;
-        }
-        invSize = Math.max(maxX - minX, maxY - minY);
-        invSize = invSize !== 0 ? 32767 / invSize : 0;
-      }
-      earcutLinked(outerNode, triangles, dim, minX, minY, invSize, 0);
-      return triangles;
-    }
-    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;
-    }
-    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;
-    }
-    function earcutLinked(ear, triangles, dim, minX, minY, invSize, pass) {
-      if (!ear)
-        return;
-      if (!pass && invSize)
-        indexCurve(ear, minX, minY, invSize);
-      var stop = ear, prev, next;
-      while (ear.prev !== ear.next) {
-        prev = ear.prev;
-        next = ear.next;
-        if (invSize ? isEarHashed(ear, minX, minY, invSize) : isEar(ear)) {
-          triangles.push(prev.i / dim | 0);
-          triangles.push(ear.i / dim | 0);
-          triangles.push(next.i / dim | 0);
-          removeNode(ear);
-          ear = next.next;
-          stop = next.next;
-          continue;
-        }
-        ear = next;
-        if (ear === stop) {
-          if (!pass) {
-            earcutLinked(filterPoints(ear), triangles, dim, minX, minY, invSize, 1);
-          } else if (pass === 1) {
-            ear = cureLocalIntersections(filterPoints(ear), triangles, dim);
-            earcutLinked(ear, triangles, dim, minX, minY, invSize, 2);
-          } else if (pass === 2) {
-            splitEarcut(ear, triangles, dim, minX, minY, invSize);
-          }
-          break;
-        }
-      }
-    }
-    function isEar(ear) {
-      var a = ear.prev, b = ear, c = ear.next;
-      if (area(a, b, c) >= 0)
-        return false;
-      var ax = a.x, bx = b.x, cx = c.x, ay = a.y, by = b.y, cy = c.y;
-      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;
-      var ax = a.x, bx = b.x, cx = c.x, ay = a.y, by = b.y, cy = c.y;
-      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 minZ = zOrder(x0, y0, minX, minY, invSize), maxZ = zOrder(x1, y1, minX, minY, invSize);
-      var p = ear.prevZ, n = ear.nextZ;
-      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;
-      }
-      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;
-      }
-      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;
-    }
-    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);
-          removeNode(p);
-          removeNode(p.next);
-          p = start = b;
-        }
-        p = p.next;
-      } while (p !== start);
-      return filterPoints(p);
-    }
-    function splitEarcut(start, triangles, dim, minX, minY, invSize) {
-      var a = start;
-      do {
-        var b = a.next.next;
-        while (b !== a.prev) {
-          if (a.i !== b.i && isValidDiagonal(a, b)) {
-            var c = splitPolygon(a, b);
-            a = filterPoints(a, a.next);
-            c = filterPoints(c, c.next);
-            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);
-    }
-    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);
-      for (i = 0; i < queue.length; i++) {
-        outerNode = eliminateHole(queue[i], outerNode);
-      }
-      return outerNode;
-    }
-    function compareX(a, b) {
-      return a.x - b.x;
-    }
-    function eliminateHole(hole, outerNode) {
-      var bridge = findHoleBridge(hole, outerNode);
-      if (!bridge) {
-        return outerNode;
-      }
-      var bridgeReverse = splitPolygon(bridge, hole);
-      filterPoints(bridgeReverse, bridgeReverse.next);
-      return filterPoints(bridge, bridge.next);
-    }
-    function findHoleBridge(hole, outerNode) {
-      var p = outerNode, hx = hole.x, hy = hole.y, qx = -Infinity, m;
-      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;
-          }
-        }
-        p = p.next;
-      } while (p !== outerNode);
-      if (!m)
-        return null;
-      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);
-          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;
-    }
-    function sectorContainsSector(m, p) {
-      return area(m.prev, m, p.prev) < 0 && area(p.next, m, m.next) < 0;
-    }
-    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);
-    }
-    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;
-    }
-    function zOrder(x, y, minX, minY, invSize) {
-      x = (x - minX) * invSize | 0;
-      y = (y - minY) * invSize | 0;
-      x = (x | x << 8) & 16711935;
-      x = (x | x << 4) & 252645135;
-      x = (x | x << 2) & 858993459;
-      x = (x | x << 1) & 1431655765;
-      y = (y | y << 8) & 16711935;
-      y = (y | y << 4) & 252645135;
-      y = (y | y << 2) & 858993459;
-      y = (y | y << 1) & 1431655765;
-      return x | y << 1;
-    }
-    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;
-    }
-    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);
-    }
-    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);
-    }
-    function area(p, q, r) {
-      return (q.y - p.y) * (r.x - q.x) - (q.x - p.x) * (r.y - q.y);
-    }
-    function equals(p1, p2) {
-      return p1.x === p2.x && p1.y === p2.y;
-    }
-    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;
-      if (o1 === 0 && onSegment(p1, p2, q1))
-        return true;
-      if (o2 === 0 && onSegment(p1, q2, q1))
-        return true;
-      if (o3 === 0 && onSegment(p2, p1, q2))
-        return true;
-      if (o4 === 0 && onSegment(p2, q1, q2))
-        return true;
-      return false;
-    }
-    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;
-    }
-    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;
-    }
-    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;
-    }
-    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;
-    }
-    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;
-    }
-    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) {
-      this.i = i;
-      this.x = x;
-      this.y = y;
-      this.prev = null;
-      this.next = null;
-      this.z = 0;
-      this.prevZ = null;
-      this.nextZ = null;
-      this.steiner = false;
-    }
-    earcut2.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;
-    }
-    earcut2.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;
-    };
-  }
-});
+} from "./chunk-YCDZX5LS.js";
 
 // packages/engine/Source/Core/WindingOrder.js
 var WindingOrder = {
@@ -548,8 +78,414 @@ WindingOrder.validate = function(windingOrder) {
 };
 var WindingOrder_default = Object.freeze(WindingOrder);
 
+// node_modules/earcut/src/earcut.js
+function earcut(data, holeIndices, dim = 2) {
+  const hasHoles = holeIndices && holeIndices.length;
+  const outerLen = hasHoles ? holeIndices[0] * dim : data.length;
+  let outerNode = linkedList(data, 0, outerLen, dim, true);
+  const triangles = [];
+  if (!outerNode || outerNode.next === outerNode.prev) return triangles;
+  let minX, minY, invSize;
+  if (hasHoles) outerNode = eliminateHoles(data, holeIndices, outerNode, dim);
+  if (data.length > 80 * dim) {
+    minX = Infinity;
+    minY = Infinity;
+    let maxX = -Infinity;
+    let maxY = -Infinity;
+    for (let i = dim; i < outerLen; i += dim) {
+      const x = data[i];
+      const y = data[i + 1];
+      if (x < minX) minX = x;
+      if (y < minY) minY = y;
+      if (x > maxX) maxX = x;
+      if (y > maxY) maxY = y;
+    }
+    invSize = Math.max(maxX - minX, maxY - minY);
+    invSize = invSize !== 0 ? 32767 / invSize : 0;
+  }
+  earcutLinked(outerNode, triangles, dim, minX, minY, invSize, 0);
+  return triangles;
+}
+function linkedList(data, start, end, dim, clockwise) {
+  let last;
+  if (clockwise === signedArea(data, start, end, dim) > 0) {
+    for (let i = start; i < end; i += dim) last = insertNode(i / dim | 0, data[i], data[i + 1], last);
+  } else {
+    for (let 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;
+}
+function filterPoints(start, end) {
+  if (!start) return start;
+  if (!end) end = start;
+  let 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;
+}
+function earcutLinked(ear, triangles, dim, minX, minY, invSize, pass) {
+  if (!ear) return;
+  if (!pass && invSize) indexCurve(ear, minX, minY, invSize);
+  let stop = ear;
+  while (ear.prev !== ear.next) {
+    const prev = ear.prev;
+    const next = ear.next;
+    if (invSize ? isEarHashed(ear, minX, minY, invSize) : isEar(ear)) {
+      triangles.push(prev.i, ear.i, next.i);
+      removeNode(ear);
+      ear = next.next;
+      stop = next.next;
+      continue;
+    }
+    ear = next;
+    if (ear === stop) {
+      if (!pass) {
+        earcutLinked(filterPoints(ear), triangles, dim, minX, minY, invSize, 1);
+      } else if (pass === 1) {
+        ear = cureLocalIntersections(filterPoints(ear), triangles);
+        earcutLinked(ear, triangles, dim, minX, minY, invSize, 2);
+      } else if (pass === 2) {
+        splitEarcut(ear, triangles, dim, minX, minY, invSize);
+      }
+      break;
+    }
+  }
+}
+function isEar(ear) {
+  const a = ear.prev, b = ear, c = ear.next;
+  if (area(a, b, c) >= 0) return false;
+  const ax = a.x, bx = b.x, cx = c.x, ay = a.y, by = b.y, cy = c.y;
+  const 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;
+  let 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) {
+  const a = ear.prev, b = ear, c = ear.next;
+  if (area(a, b, c) >= 0) return false;
+  const ax = a.x, bx = b.x, cx = c.x, ay = a.y, by = b.y, cy = c.y;
+  const 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;
+  const minZ = zOrder(x0, y0, minX, minY, invSize), maxZ = zOrder(x1, y1, minX, minY, invSize);
+  let p = ear.prevZ, n = ear.nextZ;
+  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;
+  }
+  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;
+  }
+  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;
+}
+function cureLocalIntersections(start, triangles) {
+  let p = start;
+  do {
+    const 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);
+      removeNode(p);
+      removeNode(p.next);
+      p = start = b;
+    }
+    p = p.next;
+  } while (p !== start);
+  return filterPoints(p);
+}
+function splitEarcut(start, triangles, dim, minX, minY, invSize) {
+  let a = start;
+  do {
+    let b = a.next.next;
+    while (b !== a.prev) {
+      if (a.i !== b.i && isValidDiagonal(a, b)) {
+        let c = splitPolygon(a, b);
+        a = filterPoints(a, a.next);
+        c = filterPoints(c, c.next);
+        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);
+}
+function eliminateHoles(data, holeIndices, outerNode, dim) {
+  const queue = [];
+  for (let i = 0, len = holeIndices.length; i < len; i++) {
+    const start = holeIndices[i] * dim;
+    const end = i < len - 1 ? holeIndices[i + 1] * dim : data.length;
+    const list = linkedList(data, start, end, dim, false);
+    if (list === list.next) list.steiner = true;
+    queue.push(getLeftmost(list));
+  }
+  queue.sort(compareX);
+  for (let i = 0; i < queue.length; i++) {
+    outerNode = eliminateHole(queue[i], outerNode);
+  }
+  return outerNode;
+}
+function compareX(a, b) {
+  return a.x - b.x;
+}
+function eliminateHole(hole, outerNode) {
+  const bridge = findHoleBridge(hole, outerNode);
+  if (!bridge) {
+    return outerNode;
+  }
+  const bridgeReverse = splitPolygon(bridge, hole);
+  filterPoints(bridgeReverse, bridgeReverse.next);
+  return filterPoints(bridge, bridge.next);
+}
+function findHoleBridge(hole, outerNode) {
+  let p = outerNode;
+  const hx = hole.x;
+  const hy = hole.y;
+  let qx = -Infinity;
+  let m;
+  do {
+    if (hy <= p.y && hy >= p.next.y && p.next.y !== p.y) {
+      const 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;
+      }
+    }
+    p = p.next;
+  } while (p !== outerNode);
+  if (!m) return null;
+  const stop = m;
+  const mx = m.x;
+  const my = m.y;
+  let 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)) {
+      const tan = Math.abs(hy - p.y) / (hx - p.x);
+      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;
+}
+function sectorContainsSector(m, p) {
+  return area(m.prev, m, p.prev) < 0 && area(p.next, m, m.next) < 0;
+}
+function indexCurve(start, minX, minY, invSize) {
+  let 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);
+}
+function sortLinked(list) {
+  let numMerges;
+  let inSize = 1;
+  do {
+    let p = list;
+    let e;
+    list = null;
+    let tail = null;
+    numMerges = 0;
+    while (p) {
+      numMerges++;
+      let q = p;
+      let pSize = 0;
+      for (let i = 0; i < inSize; i++) {
+        pSize++;
+        q = q.nextZ;
+        if (!q) break;
+      }
+      let 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;
+}
+function zOrder(x, y, minX, minY, invSize) {
+  x = (x - minX) * invSize | 0;
+  y = (y - minY) * invSize | 0;
+  x = (x | x << 8) & 16711935;
+  x = (x | x << 4) & 252645135;
+  x = (x | x << 2) & 858993459;
+  x = (x | x << 1) & 1431655765;
+  y = (y | y << 8) & 16711935;
+  y = (y | y << 4) & 252645135;
+  y = (y | y << 2) & 858993459;
+  y = (y | y << 1) & 1431655765;
+  return x | y << 1;
+}
+function getLeftmost(start) {
+  let 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;
+}
+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);
+}
+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);
+}
+function area(p, q, r) {
+  return (q.y - p.y) * (r.x - q.x) - (q.x - p.x) * (r.y - q.y);
+}
+function equals(p1, p2) {
+  return p1.x === p2.x && p1.y === p2.y;
+}
+function intersects(p1, q1, p2, q2) {
+  const o1 = sign(area(p1, q1, p2));
+  const o2 = sign(area(p1, q1, q2));
+  const o3 = sign(area(p2, q2, p1));
+  const o4 = sign(area(p2, q2, q1));
+  if (o1 !== o2 && o3 !== o4) return true;
+  if (o1 === 0 && onSegment(p1, p2, q1)) return true;
+  if (o2 === 0 && onSegment(p1, q2, q1)) return true;
+  if (o3 === 0 && onSegment(p2, p1, q2)) return true;
+  if (o4 === 0 && onSegment(p2, q1, q2)) return true;
+  return false;
+}
+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;
+}
+function intersectsPolygon(a, b) {
+  let 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;
+}
+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;
+}
+function middleInside(a, b) {
+  let p = a;
+  let inside = false;
+  const px = (a.x + b.x) / 2;
+  const 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;
+}
+function splitPolygon(a, b) {
+  const 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;
+}
+function insertNode(i, x, y, last) {
+  const 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,
+    // vertex index in coordinates array
+    x,
+    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
+  };
+}
+function signedArea(data, start, end, dim) {
+  let sum = 0;
+  for (let i = start, j = end - dim; i < end; i += dim) {
+    sum += (data[j] - data[i]) * (data[i + 1] + data[j + 1]);
+    j = i;
+  }
+  return sum;
+}
+
 // packages/engine/Source/Core/PolygonPipeline.js
-var import_earcut = __toESM(require_earcut(), 1);
 var scaleToGeodeticHeightN = new Cartesian3_default();
 var scaleToGeodeticHeightP = new Cartesian3_default();
 var PolygonPipeline = {};
@@ -561,22 +497,22 @@ PolygonPipeline.computeArea2D = function(positions) {
     3
   );
   const length = positions.length;
-  let area = 0;
+  let area2 = 0;
   for (let i0 = length - 1, i1 = 0; i1 < length; i0 = i1++) {
     const v0 = positions[i0];
     const v1 = positions[i1];
-    area += v0.x * v1.y - v1.x * v0.y;
+    area2 += v0.x * v1.y - v1.x * v0.y;
   }
-  return area * 0.5;
+  return area2 * 0.5;
 };
 PolygonPipeline.computeWindingOrder2D = function(positions) {
-  const area = PolygonPipeline.computeArea2D(positions);
-  return area > 0 ? WindingOrder_default.COUNTER_CLOCKWISE : WindingOrder_default.CLOCKWISE;
+  const area2 = PolygonPipeline.computeArea2D(positions);
+  return area2 > 0 ? WindingOrder_default.COUNTER_CLOCKWISE : WindingOrder_default.CLOCKWISE;
 };
 PolygonPipeline.triangulate = function(positions, holes) {
   Check_default.defined("positions", positions);
   const flattenedPositions = Cartesian2_default.packArray(positions);
-  return (0, import_earcut.default)(flattenedPositions, holes, 2);
+  return earcut(flattenedPositions, holes, 2);
 };
 var subdivisionV0Scratch = new Cartesian3_default();
 var subdivisionV1Scratch = new Cartesian3_default();
@@ -977,7 +913,7 @@ PolygonPipeline.computeRhumbLineSubdivision = function(ellipsoid, positions, ind
   return new Geometry_default(geometryOptions);
 };
 PolygonPipeline.scaleToGeodeticHeight = function(positions, height, ellipsoid, scaleToSurface) {
-  ellipsoid = defaultValue_default(ellipsoid, Ellipsoid_default.WGS84);
+  ellipsoid = defaultValue_default(ellipsoid, Ellipsoid_default.default);
   let n = scaleToGeodeticHeightN;
   let p = scaleToGeodeticHeightP;
   height = defaultValue_default(height, 0);