@hztxi/cesium-engine 25.0.2 → 25.0.4

package/Build/Workers/chunk-6PYOAYJD.js

@@ -0,0 +1,1046 @@
+/**
+ * @license
+ * Cesium - https://github.com/CesiumGS/cesium
+ * Version 1.141.4
+ *
+ * Copyright 2011-2022 Cesium Contributors
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ * http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ *
+ * Columbus View (Pat. Pend.)
+ *
+ * Portions licensed separately.
+ * See https://github.com/CesiumGS/cesium/blob/main/LICENSE.md for full licensing details.
+ */
+
+import {
+  EllipsoidRhumbLine_default
+} from "./chunk-QX6AYJX2.js";
+import {
+  GeometryAttribute_default,
+  Geometry_default,
+  PrimitiveType_default
+} from "./chunk-SPTT255E.js";
+import {
+  ComponentDatatype_default
+} from "./chunk-IFSGYIDE.js";
+import {
+  WebGLConstants_default
+} from "./chunk-ZQUSI7YK.js";
+import {
+  Cartesian2_default,
+  Cartographic_default,
+  Ellipsoid_default
+} from "./chunk-UDXUBVNR.js";
+import {
+  Cartesian3_default
+} from "./chunk-MD7CEJO5.js";
+import {
+  Math_default
+} from "./chunk-GH2D6MPO.js";
+import {
+  Check_default
+} from "./chunk-4MHUA5ZK.js";
+import {
+  defined_default
+} from "./chunk-PCXE4XMI.js";
+
+// packages/engine/Source/Core/WindingOrder.js
+var WindingOrder = {
+  /**
+   * Vertices are in clockwise order.
+   *
+   * @type {number}
+   * @constant
+   */
+  CLOCKWISE: WebGLConstants_default.CW,
+  /**
+   * Vertices are in counter-clockwise order.
+   *
+   * @type {number}
+   * @constant
+   */
+  COUNTER_CLOCKWISE: WebGLConstants_default.CCW
+};
+WindingOrder.validate = function(windingOrder) {
+  return windingOrder === WindingOrder.CLOCKWISE || windingOrder === WindingOrder.COUNTER_CLOCKWISE;
+};
+Object.freeze(WindingOrder);
+var WindingOrder_default = WindingOrder;
+
+// node_modules/.pnpm/earcut@3.2.3/node_modules/earcut/src/earcut.js
+var steiners = /* @__PURE__ */ new Set();
+var filteredOut = false;
+function earcut(data, holeIndices, dim = 2) {
+  const hasHoles = holeIndices && holeIndices.length;
+  const outerLen = hasHoles ? holeIndices[0] * dim : data.length;
+  if (steiners.size) steiners.clear();
+  let outerNode = linkedList(data, 0, outerLen, dim, true);
+  const triangles = [];
+  if (!outerNode || outerNode.next === outerNode.prev) return triangles;
+  let minX = 0, minY = 0, invSize = 0;
+  if (hasHoles) outerNode = eliminateHoles(data, holeIndices, outerNode, dim);
+  if (data.length > 80 * dim) {
+    minX = data[0];
+    minY = data[1];
+    let maxX = minX;
+    let maxY = minY;
+    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, minX, minY, invSize);
+  return triangles;
+}
+function linkedList(data, start, end, dim, clockwise) {
+  let last = null;
+  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 = start) {
+  const full = end === start;
+  let p = start, again;
+  do {
+    again = false;
+    if (p !== p.next && (steiners.size === 0 || !steiners.has(p)) && (equals(p, p.next) || area(p.prev, p, p.next) === 0)) {
+      if (full || p === end) end = p.prev;
+      filteredOut = true;
+      removeNode(p);
+      p = p.prev;
+      again = true;
+    } else if (full || p !== end) {
+      p = p.next;
+      again = !full;
+    }
+  } while (again || p !== end);
+  return end;
+}
+function earcutLinked(ear, triangles, minX, minY, invSize) {
+  if (invSize) indexCurve(ear, minX, minY, invSize);
+  let stop = ear, cured = false;
+  while (ear.prev !== ear.next) {
+    const prev = ear.prev;
+    const next = ear.next;
+    if (area(prev, ear, next) < 0 && (invSize ? isEarHashed(ear, minX, minY, invSize) : isEar(ear))) {
+      triangles.push(prev.i, ear.i, next.i);
+      removeNode(ear);
+      ear = next;
+      stop = next;
+      continue;
+    }
+    ear = next;
+    if (ear === stop) {
+      filteredOut = false;
+      ear = filterPoints(ear);
+      if (filteredOut) {
+        stop = ear;
+        continue;
+      }
+      if (!cured) {
+        ear = cureLocalIntersections(ear, triangles);
+        stop = ear;
+        cured = true;
+        continue;
+      }
+      splitEarcut(ear, triangles, minX, minY, invSize);
+      break;
+    }
+  }
+}
+function isEar(ear) {
+  const a = ear.prev, b = ear, c = ear.next, ax = a.x, bx = b.x, cx = c.x, ay = a.y, by = b.y, cy = c.y, x0 = Math.min(ax, bx, cx), y0 = Math.min(ay, by, cy), x1 = Math.max(ax, bx, cx), y1 = Math.max(ay, by, cy);
+  let p = c.next;
+  while (p !== a) {
+    if (p.x >= x0 && p.x <= x1 && p.y >= y0 && p.y <= y1 && !(ax === p.x && ay === p.y) && 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, ax = a.x, bx = b.x, cx = c.x, ay = a.y, by = b.y, cy = c.y, x0 = Math.min(ax, bx, cx), y0 = Math.min(ay, by, cy), x1 = Math.max(ax, bx, cx), y1 = Math.max(ay, by, cy), minZ = zOrder(x0, y0, minX, minY, invSize), maxZ = zOrder(x1, y1, minX, minY, invSize);
+  let p = ear.prevZ;
+  while (p && p.z >= minZ) {
+    if (p.x >= x0 && p.x <= x1 && p.y >= y0 && p.y <= y1 && p !== c && !(ax === p.x && ay === p.y) && pointInTriangle(ax, ay, bx, by, cx, cy, p.x, p.y) && area(p.prev, p, p.next) >= 0) return false;
+    p = p.prevZ;
+  }
+  let n = ear.nextZ;
+  while (n && n.z <= maxZ) {
+    if (n.x >= x0 && n.x <= x1 && n.y >= y0 && n.y <= y1 && n !== c && !(ax === n.x && ay === n.y) && 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;
+  let cured = false;
+  do {
+    const a = p.prev, b = p.next.next;
+    if (intersects(a, p, p.next, b, false) && locallyInside(a, b) && locallyInside(b, a)) {
+      triangles.push(a.i, p.i, b.i);
+      removeNode(p);
+      removeNode(p.next);
+      p = start = b;
+      cured = true;
+    }
+    p = p.next;
+  } while (p !== start);
+  return cured ? filterPoints(p) : p;
+}
+function splitEarcut(start, triangles, 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, minX, minY, invSize);
+        earcutLinked(c, triangles, minX, minY, invSize);
+        return;
+      }
+      b = b.next;
+    }
+    a = a.next;
+  } while (a !== start);
+}
+var indexActive = false;
+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 = (
+      /** @type {Node} */
+      linkedList(data, start, end, dim, false)
+    );
+    if (list === list.next) steiners.add(list);
+    queue.push(getLeftmost(list));
+  }
+  queue.sort(compareXYSlope);
+  buildBlockIndex(data.length / dim, holeIndices.length);
+  indexSegment(outerNode, outerNode);
+  indexActive = true;
+  for (let i = 0; i < queue.length; i++) {
+    outerNode = eliminateHole(queue[i], outerNode);
+  }
+  indexActive = false;
+  return filterPoints(outerNode);
+}
+function compareXYSlope(a, b) {
+  return a.x - b.x || a.y - b.y || (a.next.y - a.y) / (a.next.x - a.x) - (b.next.y - b.y) / (b.next.x - b.x);
+}
+function eliminateHole(hole, outerNode) {
+  const bridge = findHoleBridge(hole, outerNode);
+  if (!bridge) {
+    return outerNode;
+  }
+  const bridgeReverse = splitPolygon(bridge, hole);
+  const bridge2 = bridgeReverse.next;
+  indexSegment(bridge, bridge2.next);
+  filterPoints(bridgeReverse, bridgeReverse.next);
+  return filterPoints(bridge, bridge.next);
+}
+var K = 16;
+var blockBBox = new Float64Array(0);
+var numBlocks = 0;
+var blockHead = [];
+var blockStop = [];
+function buildBlockIndex(maxNodes, numHoles) {
+  const maxBlocks = Math.ceil((maxNodes + 2 * numHoles) / K) + numHoles + 2;
+  if (blockBBox.length < maxBlocks * 4) blockBBox = new Float64Array(maxBlocks * 4);
+  numBlocks = 0;
+}
+function indexSegment(head, stop) {
+  let p = head;
+  do {
+    const b = numBlocks++;
+    blockHead[b] = p;
+    let minX = Infinity, minY = Infinity, maxX = -Infinity, maxY = -Infinity;
+    let k = 0;
+    do {
+      const c = p.next;
+      p.z = b;
+      if (p.x < minX) minX = p.x;
+      if (p.x > maxX) maxX = p.x;
+      if (p.y < minY) minY = p.y;
+      if (p.y > maxY) maxY = p.y;
+      if (c.x < minX) minX = c.x;
+      if (c.x > maxX) maxX = c.x;
+      if (c.y < minY) minY = c.y;
+      if (c.y > maxY) maxY = c.y;
+      p = c;
+    } while (++k < K && p !== stop);
+    blockStop[b] = p;
+    const g = b * 4;
+    blockBBox[g] = minX;
+    blockBBox[g + 1] = minY;
+    blockBBox[g + 2] = maxX;
+    blockBBox[g + 3] = maxY;
+  } while (p !== stop);
+}
+function growBlock(head, tail) {
+  const g = head.z * 4;
+  if (tail.x < blockBBox[g]) blockBBox[g] = tail.x;
+  if (tail.y < blockBBox[g + 1]) blockBBox[g + 1] = tail.y;
+  if (tail.x > blockBBox[g + 2]) blockBBox[g + 2] = tail.x;
+  if (tail.y > blockBBox[g + 3]) blockBBox[g + 3] = tail.y;
+}
+function liveBlockStop(b) {
+  let stop = blockStop[b];
+  while (stop.prev.next !== stop) stop = stop.next;
+  blockStop[b] = stop;
+  return stop;
+}
+function liveBlockHead(b) {
+  let head = blockHead[b];
+  while (head.prev.next !== head) head = head.next;
+  blockHead[b] = head;
+  return head;
+}
+function findHoleBridge(hole, outerNode) {
+  let p = outerNode;
+  const hx = hole.x;
+  const hy = hole.y;
+  let qx = -Infinity;
+  let m;
+  if (equals(hole, p)) return p;
+  for (let b = 0, g = 0; b < numBlocks; b++, g += 4) {
+    if (hy < blockBBox[g + 1] || hy > blockBBox[g + 3] || blockBBox[g] > hx || blockBBox[g + 2] <= qx) continue;
+    const stop = liveBlockStop(b);
+    p = liveBlockHead(b);
+    do {
+      if (p.prev.next === p) {
+        if (equals(hole, p.next)) return p.next;
+        else 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 !== stop);
+  }
+  if (!m) return null;
+  const mx = m.x;
+  const my = m.y;
+  const tminY = Math.min(hy, my);
+  const tmaxY = Math.max(hy, my);
+  let tanMin = Infinity;
+  for (let b = 0, g = 0; b < numBlocks; b++, g += 4) {
+    if (blockBBox[g + 2] < mx || blockBBox[g] > hx || blockBBox[g + 3] < tminY || blockBBox[g + 1] > tmaxY) continue;
+    const stop = liveBlockStop(b);
+    p = liveBlockHead(b);
+    do {
+      if (p.prev.next === p && hx >= p.x && p.x >= mx && hx !== p.x && // skip dead nodes
+      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) || p.y === hy && p.next.y === hy && p.next.x > hx) && (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;
+}
+var sortArr = [];
+var sortBuf = [];
+var zArr = new Uint32Array(0);
+var zBuf = new Uint32Array(0);
+var counts = new Uint32Array(256);
+function indexCurve(start, minX, minY, invSize) {
+  let p = start;
+  let n = 0;
+  do {
+    p.z = zOrder(p.x, p.y, minX, minY, invSize);
+    sortArr[n++] = p;
+    p = p.next;
+  } while (p !== start);
+  sortNodes(n);
+  let prev = null;
+  for (let i = 0; i < n; i++) {
+    const node = sortArr[i];
+    node.prevZ = prev;
+    if (prev) prev.nextZ = node;
+    prev = node;
+  }
+  prev.nextZ = null;
+}
+function sortNodes(n) {
+  if (n <= 32) {
+    for (let i = 1; i < n; i++) {
+      const node = sortArr[i], z = node.z;
+      let j = i - 1;
+      while (j >= 0 && sortArr[j].z > z) {
+        sortArr[j + 1] = sortArr[j];
+        j--;
+      }
+      sortArr[j + 1] = node;
+    }
+    return;
+  }
+  if (zArr.length < n) {
+    zArr = new Uint32Array(n);
+    zBuf = new Uint32Array(n);
+    sortBuf = new Array(n);
+  }
+  for (let i = 0; i < n; i++) zArr[i] = sortArr[i].z;
+  radixPass(n, sortArr, zArr, sortBuf, zBuf, 0);
+  radixPass(n, sortBuf, zBuf, sortArr, zArr, 8);
+  radixPass(n, sortArr, zArr, sortBuf, zBuf, 16);
+  radixPass(n, sortBuf, zBuf, sortArr, zArr, 24);
+}
+function radixPass(n, src, srcZ, dst, dstZ, shift) {
+  counts.fill(0);
+  for (let i = 0; i < n; i++) counts[srcZ[i] >>> shift & 255]++;
+  let sum = 0;
+  for (let b = 0; b < 256; b++) {
+    const c = counts[b];
+    counts[b] = sum;
+    sum += c;
+  }
+  for (let i = 0; i < n; i++) {
+    const z = srcZ[i];
+    const pos = counts[z >>> shift & 255]++;
+    dst[pos] = src[i];
+    dstZ[pos] = z;
+  }
+}
+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) {
+  const zeroLength = equals(a, b) && area(a.prev, a, a.next) > 0 && area(b.prev, b, b.next) > 0;
+  return a.next.i !== b.i && (zeroLength || locallyInside(a, b) && locallyInside(b, a) && // // locally visible
+  (area(a.prev, a, b.prev) !== 0 || area(a, b.prev, b) !== 0)) && // no opposite-facing sectors
+  !intersectsPolygon(a, b) && (zeroLength || middleInside(a, b));
+}
+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, includeBoundary = true) {
+  const o1 = area(p1, q1, p2);
+  const o2 = area(p1, q1, q2);
+  const o3 = area(p2, q2, p1);
+  const o4 = area(p2, q2, q1);
+  if ((o1 > 0 && o2 < 0 || o1 < 0 && o2 > 0) && (o3 > 0 && o4 < 0 || o3 < 0 && o4 > 0)) return true;
+  if (!includeBoundary) return false;
+  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 intersectsPolygon(a, b) {
+  const minX = Math.min(a.x, b.x);
+  const maxX = Math.max(a.x, b.x);
+  const minY = Math.min(a.y, b.y);
+  const maxY = Math.max(a.y, b.y);
+  let p = a;
+  do {
+    const n = p.next;
+    if (p.x > maxX && n.x > maxX || p.x < minX && n.x < minX || p.y > maxY && n.y > maxY || p.y < minY && n.y < minY) {
+      p = n;
+      continue;
+    }
+    if (p.i !== a.i && n.i !== a.i && p.i !== b.i && n.i !== b.i && intersects(p, n, a, b)) return true;
+    p = n;
+  } 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 {
+    const n = p.next;
+    if (p.y > py !== n.y > py && px < (n.x - p.x) * (py - p.y) / (n.y - p.y) + p.x)
+      inside = !inside;
+    p = n;
+  } 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;
+  if (indexActive) growBlock(p.prev, p.next);
+}
+function createNode(i, x, y) {
+  return (
+    /** @type {Node} */
+    /** @type {unknown} */
+    {
+      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; doubles as owning block in the hole-bridge index during eliminateHoles
+      prevZ: null,
+      // previous and next nodes in z-order
+      nextZ: null
+    }
+  );
+}
+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 scaleToGeodeticHeightN = new Cartesian3_default();
+var scaleToGeodeticHeightP = new Cartesian3_default();
+var PolygonPipeline = {};
+PolygonPipeline.computeArea2D = function(positions) {
+  Check_default.defined("positions", positions);
+  Check_default.typeOf.number.greaterThanOrEquals(
+    "positions.length",
+    positions.length,
+    3
+  );
+  const length = positions.length;
+  let area2 = 0;
+  for (let i0 = length - 1, i1 = 0; i1 < length; i0 = i1++) {
+    const v0 = positions[i0];
+    const v1 = positions[i1];
+    area2 += v0.x * v1.y - v1.x * v0.y;
+  }
+  return area2 * 0.5;
+};
+PolygonPipeline.computeWindingOrder2D = function(positions) {
+  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 earcut(flattenedPositions, holes, 2);
+};
+var subdivisionV0Scratch = new Cartesian3_default();
+var subdivisionV1Scratch = new Cartesian3_default();
+var subdivisionV2Scratch = new Cartesian3_default();
+var subdivisionS0Scratch = new Cartesian3_default();
+var subdivisionS1Scratch = new Cartesian3_default();
+var subdivisionS2Scratch = new Cartesian3_default();
+var subdivisionMidScratch = new Cartesian3_default();
+var subdivisionT0Scratch = new Cartesian2_default();
+var subdivisionT1Scratch = new Cartesian2_default();
+var subdivisionT2Scratch = new Cartesian2_default();
+var subdivisionTexcoordMidScratch = new Cartesian2_default();
+PolygonPipeline.computeSubdivision = function(ellipsoid, positions, indices, texcoords, granularity) {
+  granularity = granularity ?? Math_default.RADIANS_PER_DEGREE;
+  const hasTexcoords = defined_default(texcoords);
+  Check_default.typeOf.object("ellipsoid", ellipsoid);
+  Check_default.defined("positions", positions);
+  Check_default.defined("indices", indices);
+  Check_default.typeOf.number.greaterThanOrEquals("indices.length", indices.length, 3);
+  Check_default.typeOf.number.equals("indices.length % 3", "0", indices.length % 3, 0);
+  Check_default.typeOf.number.greaterThan("granularity", granularity, 0);
+  const triangles = indices.slice(0);
+  let i;
+  const length = positions.length;
+  const subdividedPositions = new Array(length * 3);
+  const subdividedTexcoords = new Array(length * 2);
+  let q = 0;
+  let p = 0;
+  for (i = 0; i < length; i++) {
+    const item = positions[i];
+    subdividedPositions[q++] = item.x;
+    subdividedPositions[q++] = item.y;
+    subdividedPositions[q++] = item.z;
+    if (hasTexcoords) {
+      const texcoordItem = texcoords[i];
+      subdividedTexcoords[p++] = texcoordItem.x;
+      subdividedTexcoords[p++] = texcoordItem.y;
+    }
+  }
+  const subdividedIndices = [];
+  const edges = {};
+  const radius = ellipsoid.maximumRadius;
+  const minDistance = Math_default.chordLength(granularity, radius);
+  const minDistanceSqrd = minDistance * minDistance;
+  while (triangles.length > 0) {
+    const i2 = triangles.pop();
+    const i1 = triangles.pop();
+    const i0 = triangles.pop();
+    const v0 = Cartesian3_default.fromArray(
+      subdividedPositions,
+      i0 * 3,
+      subdivisionV0Scratch
+    );
+    const v1 = Cartesian3_default.fromArray(
+      subdividedPositions,
+      i1 * 3,
+      subdivisionV1Scratch
+    );
+    const v2 = Cartesian3_default.fromArray(
+      subdividedPositions,
+      i2 * 3,
+      subdivisionV2Scratch
+    );
+    let t0, t1, t2;
+    if (hasTexcoords) {
+      t0 = Cartesian2_default.fromArray(
+        subdividedTexcoords,
+        i0 * 2,
+        subdivisionT0Scratch
+      );
+      t1 = Cartesian2_default.fromArray(
+        subdividedTexcoords,
+        i1 * 2,
+        subdivisionT1Scratch
+      );
+      t2 = Cartesian2_default.fromArray(
+        subdividedTexcoords,
+        i2 * 2,
+        subdivisionT2Scratch
+      );
+    }
+    const s0 = Cartesian3_default.multiplyByScalar(
+      Cartesian3_default.normalize(v0, subdivisionS0Scratch),
+      radius,
+      subdivisionS0Scratch
+    );
+    const s1 = Cartesian3_default.multiplyByScalar(
+      Cartesian3_default.normalize(v1, subdivisionS1Scratch),
+      radius,
+      subdivisionS1Scratch
+    );
+    const s2 = Cartesian3_default.multiplyByScalar(
+      Cartesian3_default.normalize(v2, subdivisionS2Scratch),
+      radius,
+      subdivisionS2Scratch
+    );
+    const g0 = Cartesian3_default.magnitudeSquared(
+      Cartesian3_default.subtract(s0, s1, subdivisionMidScratch)
+    );
+    const g1 = Cartesian3_default.magnitudeSquared(
+      Cartesian3_default.subtract(s1, s2, subdivisionMidScratch)
+    );
+    const g2 = Cartesian3_default.magnitudeSquared(
+      Cartesian3_default.subtract(s2, s0, subdivisionMidScratch)
+    );
+    const max = Math.max(g0, g1, g2);
+    let edge;
+    let mid;
+    let midTexcoord;
+    if (max > minDistanceSqrd) {
+      if (g0 === max) {
+        edge = `${Math.min(i0, i1)} ${Math.max(i0, i1)}`;
+        i = edges[edge];
+        if (!defined_default(i)) {
+          mid = Cartesian3_default.add(v0, v1, subdivisionMidScratch);
+          Cartesian3_default.multiplyByScalar(mid, 0.5, mid);
+          subdividedPositions.push(mid.x, mid.y, mid.z);
+          i = subdividedPositions.length / 3 - 1;
+          edges[edge] = i;
+          if (hasTexcoords) {
+            midTexcoord = Cartesian2_default.add(t0, t1, subdivisionTexcoordMidScratch);
+            Cartesian2_default.multiplyByScalar(midTexcoord, 0.5, midTexcoord);
+            subdividedTexcoords.push(midTexcoord.x, midTexcoord.y);
+          }
+        }
+        triangles.push(i0, i, i2);
+        triangles.push(i, i1, i2);
+      } else if (g1 === max) {
+        edge = `${Math.min(i1, i2)} ${Math.max(i1, i2)}`;
+        i = edges[edge];
+        if (!defined_default(i)) {
+          mid = Cartesian3_default.add(v1, v2, subdivisionMidScratch);
+          Cartesian3_default.multiplyByScalar(mid, 0.5, mid);
+          subdividedPositions.push(mid.x, mid.y, mid.z);
+          i = subdividedPositions.length / 3 - 1;
+          edges[edge] = i;
+          if (hasTexcoords) {
+            midTexcoord = Cartesian2_default.add(t1, t2, subdivisionTexcoordMidScratch);
+            Cartesian2_default.multiplyByScalar(midTexcoord, 0.5, midTexcoord);
+            subdividedTexcoords.push(midTexcoord.x, midTexcoord.y);
+          }
+        }
+        triangles.push(i1, i, i0);
+        triangles.push(i, i2, i0);
+      } else if (g2 === max) {
+        edge = `${Math.min(i2, i0)} ${Math.max(i2, i0)}`;
+        i = edges[edge];
+        if (!defined_default(i)) {
+          mid = Cartesian3_default.add(v2, v0, subdivisionMidScratch);
+          Cartesian3_default.multiplyByScalar(mid, 0.5, mid);
+          subdividedPositions.push(mid.x, mid.y, mid.z);
+          i = subdividedPositions.length / 3 - 1;
+          edges[edge] = i;
+          if (hasTexcoords) {
+            midTexcoord = Cartesian2_default.add(t2, t0, subdivisionTexcoordMidScratch);
+            Cartesian2_default.multiplyByScalar(midTexcoord, 0.5, midTexcoord);
+            subdividedTexcoords.push(midTexcoord.x, midTexcoord.y);
+          }
+        }
+        triangles.push(i2, i, i1);
+        triangles.push(i, i0, i1);
+      }
+    } else {
+      subdividedIndices.push(i0);
+      subdividedIndices.push(i1);
+      subdividedIndices.push(i2);
+    }
+  }
+  const geometryOptions = {
+    attributes: {
+      position: new GeometryAttribute_default({
+        componentDatatype: ComponentDatatype_default.DOUBLE,
+        componentsPerAttribute: 3,
+        values: subdividedPositions
+      })
+    },
+    indices: subdividedIndices,
+    primitiveType: PrimitiveType_default.TRIANGLES
+  };
+  if (hasTexcoords) {
+    geometryOptions.attributes.st = new GeometryAttribute_default({
+      componentDatatype: ComponentDatatype_default.FLOAT,
+      componentsPerAttribute: 2,
+      values: subdividedTexcoords
+    });
+  }
+  return new Geometry_default(geometryOptions);
+};
+var subdivisionC0Scratch = new Cartographic_default();
+var subdivisionC1Scratch = new Cartographic_default();
+var subdivisionC2Scratch = new Cartographic_default();
+var subdivisionCartographicScratch = new Cartographic_default();
+PolygonPipeline.computeRhumbLineSubdivision = function(ellipsoid, positions, indices, texcoords, granularity) {
+  granularity = granularity ?? Math_default.RADIANS_PER_DEGREE;
+  const hasTexcoords = defined_default(texcoords);
+  Check_default.typeOf.object("ellipsoid", ellipsoid);
+  Check_default.defined("positions", positions);
+  Check_default.defined("indices", indices);
+  Check_default.typeOf.number.greaterThanOrEquals("indices.length", indices.length, 3);
+  Check_default.typeOf.number.equals("indices.length % 3", "0", indices.length % 3, 0);
+  Check_default.typeOf.number.greaterThan("granularity", granularity, 0);
+  const triangles = indices.slice(0);
+  let i;
+  const length = positions.length;
+  const subdividedPositions = new Array(length * 3);
+  const subdividedTexcoords = new Array(length * 2);
+  let q = 0;
+  let p = 0;
+  for (i = 0; i < length; i++) {
+    const item = positions[i];
+    subdividedPositions[q++] = item.x;
+    subdividedPositions[q++] = item.y;
+    subdividedPositions[q++] = item.z;
+    if (hasTexcoords) {
+      const texcoordItem = texcoords[i];
+      subdividedTexcoords[p++] = texcoordItem.x;
+      subdividedTexcoords[p++] = texcoordItem.y;
+    }
+  }
+  const subdividedIndices = [];
+  const edges = {};
+  const radius = ellipsoid.maximumRadius;
+  const minDistance = Math_default.chordLength(granularity, radius);
+  const rhumb0 = new EllipsoidRhumbLine_default(void 0, void 0, ellipsoid);
+  const rhumb1 = new EllipsoidRhumbLine_default(void 0, void 0, ellipsoid);
+  const rhumb2 = new EllipsoidRhumbLine_default(void 0, void 0, ellipsoid);
+  while (triangles.length > 0) {
+    const i2 = triangles.pop();
+    const i1 = triangles.pop();
+    const i0 = triangles.pop();
+    const v0 = Cartesian3_default.fromArray(
+      subdividedPositions,
+      i0 * 3,
+      subdivisionV0Scratch
+    );
+    const v1 = Cartesian3_default.fromArray(
+      subdividedPositions,
+      i1 * 3,
+      subdivisionV1Scratch
+    );
+    const v2 = Cartesian3_default.fromArray(
+      subdividedPositions,
+      i2 * 3,
+      subdivisionV2Scratch
+    );
+    let t0, t1, t2;
+    if (hasTexcoords) {
+      t0 = Cartesian2_default.fromArray(
+        subdividedTexcoords,
+        i0 * 2,
+        subdivisionT0Scratch
+      );
+      t1 = Cartesian2_default.fromArray(
+        subdividedTexcoords,
+        i1 * 2,
+        subdivisionT1Scratch
+      );
+      t2 = Cartesian2_default.fromArray(
+        subdividedTexcoords,
+        i2 * 2,
+        subdivisionT2Scratch
+      );
+    }
+    const c0 = ellipsoid.cartesianToCartographic(v0, subdivisionC0Scratch);
+    const c1 = ellipsoid.cartesianToCartographic(v1, subdivisionC1Scratch);
+    const c2 = ellipsoid.cartesianToCartographic(v2, subdivisionC2Scratch);
+    rhumb0.setEndPoints(c0, c1);
+    const g0 = rhumb0.surfaceDistance;
+    rhumb1.setEndPoints(c1, c2);
+    const g1 = rhumb1.surfaceDistance;
+    rhumb2.setEndPoints(c2, c0);
+    const g2 = rhumb2.surfaceDistance;
+    const max = Math.max(g0, g1, g2);
+    let edge;
+    let mid;
+    let midHeight;
+    let midCartesian3;
+    let midTexcoord;
+    if (max > minDistance) {
+      if (g0 === max) {
+        edge = `${Math.min(i0, i1)} ${Math.max(i0, i1)}`;
+        i = edges[edge];
+        if (!defined_default(i)) {
+          mid = rhumb0.interpolateUsingFraction(
+            0.5,
+            subdivisionCartographicScratch
+          );
+          midHeight = (c0.height + c1.height) * 0.5;
+          midCartesian3 = Cartesian3_default.fromRadians(
+            mid.longitude,
+            mid.latitude,
+            midHeight,
+            ellipsoid,
+            subdivisionMidScratch
+          );
+          subdividedPositions.push(
+            midCartesian3.x,
+            midCartesian3.y,
+            midCartesian3.z
+          );
+          i = subdividedPositions.length / 3 - 1;
+          edges[edge] = i;
+          if (hasTexcoords) {
+            midTexcoord = Cartesian2_default.add(t0, t1, subdivisionTexcoordMidScratch);
+            Cartesian2_default.multiplyByScalar(midTexcoord, 0.5, midTexcoord);
+            subdividedTexcoords.push(midTexcoord.x, midTexcoord.y);
+          }
+        }
+        triangles.push(i0, i, i2);
+        triangles.push(i, i1, i2);
+      } else if (g1 === max) {
+        edge = `${Math.min(i1, i2)} ${Math.max(i1, i2)}`;
+        i = edges[edge];
+        if (!defined_default(i)) {
+          mid = rhumb1.interpolateUsingFraction(
+            0.5,
+            subdivisionCartographicScratch
+          );
+          midHeight = (c1.height + c2.height) * 0.5;
+          midCartesian3 = Cartesian3_default.fromRadians(
+            mid.longitude,
+            mid.latitude,
+            midHeight,
+            ellipsoid,
+            subdivisionMidScratch
+          );
+          subdividedPositions.push(
+            midCartesian3.x,
+            midCartesian3.y,
+            midCartesian3.z
+          );
+          i = subdividedPositions.length / 3 - 1;
+          edges[edge] = i;
+          if (hasTexcoords) {
+            midTexcoord = Cartesian2_default.add(t1, t2, subdivisionTexcoordMidScratch);
+            Cartesian2_default.multiplyByScalar(midTexcoord, 0.5, midTexcoord);
+            subdividedTexcoords.push(midTexcoord.x, midTexcoord.y);
+          }
+        }
+        triangles.push(i1, i, i0);
+        triangles.push(i, i2, i0);
+      } else if (g2 === max) {
+        edge = `${Math.min(i2, i0)} ${Math.max(i2, i0)}`;
+        i = edges[edge];
+        if (!defined_default(i)) {
+          mid = rhumb2.interpolateUsingFraction(
+            0.5,
+            subdivisionCartographicScratch
+          );
+          midHeight = (c2.height + c0.height) * 0.5;
+          midCartesian3 = Cartesian3_default.fromRadians(
+            mid.longitude,
+            mid.latitude,
+            midHeight,
+            ellipsoid,
+            subdivisionMidScratch
+          );
+          subdividedPositions.push(
+            midCartesian3.x,
+            midCartesian3.y,
+            midCartesian3.z
+          );
+          i = subdividedPositions.length / 3 - 1;
+          edges[edge] = i;
+          if (hasTexcoords) {
+            midTexcoord = Cartesian2_default.add(t2, t0, subdivisionTexcoordMidScratch);
+            Cartesian2_default.multiplyByScalar(midTexcoord, 0.5, midTexcoord);
+            subdividedTexcoords.push(midTexcoord.x, midTexcoord.y);
+          }
+        }
+        triangles.push(i2, i, i1);
+        triangles.push(i, i0, i1);
+      }
+    } else {
+      subdividedIndices.push(i0);
+      subdividedIndices.push(i1);
+      subdividedIndices.push(i2);
+    }
+  }
+  const geometryOptions = {
+    attributes: {
+      position: new GeometryAttribute_default({
+        componentDatatype: ComponentDatatype_default.DOUBLE,
+        componentsPerAttribute: 3,
+        values: subdividedPositions
+      })
+    },
+    indices: subdividedIndices,
+    primitiveType: PrimitiveType_default.TRIANGLES
+  };
+  if (hasTexcoords) {
+    geometryOptions.attributes.st = new GeometryAttribute_default({
+      componentDatatype: ComponentDatatype_default.FLOAT,
+      componentsPerAttribute: 2,
+      values: subdividedTexcoords
+    });
+  }
+  return new Geometry_default(geometryOptions);
+};
+PolygonPipeline.scaleToGeodeticHeight = function(positions, height, ellipsoid, scaleToSurface) {
+  ellipsoid = ellipsoid ?? Ellipsoid_default.default;
+  let n = scaleToGeodeticHeightN;
+  let p = scaleToGeodeticHeightP;
+  height = height ?? 0;
+  scaleToSurface = scaleToSurface ?? true;
+  if (defined_default(positions)) {
+    const length = positions.length;
+    for (let i = 0; i < length; i += 3) {
+      Cartesian3_default.fromArray(positions, i, p);
+      if (scaleToSurface) {
+        p = ellipsoid.scaleToGeodeticSurface(p, p);
+      }
+      if (height !== 0) {
+        n = ellipsoid.geodeticSurfaceNormal(p, n);
+        Cartesian3_default.multiplyByScalar(n, height, n);
+        Cartesian3_default.add(p, n, p);
+      }
+      positions[i] = p.x;
+      positions[i + 1] = p.y;
+      positions[i + 2] = p.z;
+    }
+  }
+  return positions;
+};
+var PolygonPipeline_default = PolygonPipeline;
+
+export {
+  WindingOrder_default,
+  PolygonPipeline_default
+};