@es3d/es3d 0.0.0-stage → 1.0.0

package/src/path/shapes.js

@@ -0,0 +1,129 @@
+// Contours -> fill regions (polygons with holes) following SVG fill rules.
+//
+// Closed contours are organised into a containment tree. A contour's interior
+// (minus its children) is filled when its nesting depth is even ("evenodd") or
+// when the accumulated winding number is non-zero ("nonzero", SVG default).
+// Side walls for extrusions/sweeps exist exactly where the fill state changes
+// across a contour; walls are oriented with the filled side on the left so the
+// right-hand perpendicular of each edge is the outward normal.
+
+import { signedArea, reverseContour } from './path-flatten.js';
+import { triangulate, triangulationError } from './triangulate.js';
+
+function pointInPolygon(points, x, y) {
+  let inside = false;
+  const n = points.length / 2;
+  for (let i = 0, j = n - 1; i < n; j = i++) {
+    const xi = points[i * 2], yi = points[i * 2 + 1];
+    const xj = points[j * 2], yj = points[j * 2 + 1];
+    if (yi > y !== yj > y && x < ((xj - xi) * (y - yi)) / (yj - yi) + xi) inside = !inside;
+  }
+  return inside;
+}
+
+function bbox(points) {
+  let minX = Infinity, minY = Infinity, maxX = -Infinity, maxY = -Infinity;
+  for (let i = 0; i < points.length; i += 2) {
+    const x = points[i], y = points[i + 1];
+    if (x < minX) minX = x;
+    if (y < minY) minY = y;
+    if (x > maxX) maxX = x;
+    if (y > maxY) maxY = y;
+  }
+  return { minX, minY, maxX, maxY };
+}
+
+/** A sample point strictly inside the contour near its first vertex (robust against shared vertices). */
+function samplePoint(points) {
+  const n = points.length / 2;
+  // centroid of a small triangle at a convex-ish vertex works for most inputs;
+  // fall back to the first vertex.
+  for (let k = 0; k < Math.min(n, 8); k++) {
+    const i0 = ((k - 1 + n) % n) * 2, i1 = k * 2, i2 = ((k + 1) % n) * 2;
+    const cx = (points[i0] + points[i1] + points[i2]) / 3;
+    const cy = (points[i0 + 1] + points[i1 + 1] + points[i2 + 1]) / 3;
+    if (pointInPolygon(points, cx, cy)) return [cx, cy];
+  }
+  return [points[0], points[1]];
+}
+
+/**
+ * @param {{points: Float64Array, smooth: Uint8Array}[]} contours 2D contours (treated as closed)
+ * @param {'nonzero'|'evenodd'} fillRule
+ */
+export function buildRegions(contours, fillRule = 'nonzero') {
+  const items = [];
+  for (const c of contours) {
+    if (c.points.length < 6) continue;
+    const a = signedArea(c.points);
+    if (Math.abs(a) < 1e-14) continue;
+    items.push({ c, area: a, abs: Math.abs(a), box: bbox(c.points), parent: -1, depth: 0, winding: 0, children: [] });
+  }
+  items.sort((p, q) => q.abs - p.abs);
+  for (let i = 0; i < items.length; i++) {
+    const it = items[i];
+    const [sx, sy] = samplePoint(it.c.points);
+    for (let j = i - 1; j >= 0; j--) {
+      const cand = items[j];
+      const b = cand.box;
+      if (sx < b.minX || sx > b.maxX || sy < b.minY || sy > b.maxY) continue;
+      if (pointInPolygon(cand.c.points, sx, sy)) {
+        it.parent = j;
+        break;
+      }
+    }
+    const sgn = it.area > 0 ? 1 : -1;
+    if (it.parent >= 0) {
+      const p = items[it.parent];
+      it.depth = p.depth + 1;
+      it.winding = p.winding + sgn;
+      p.children.push(i);
+    } else {
+      it.depth = 0;
+      it.winding = sgn;
+    }
+    it.filled = fillRule === 'evenodd' ? it.depth % 2 === 0 : it.winding !== 0;
+  }
+
+  // A contour is a wall where the fill state differs on its two sides.
+  for (const it of items) it.isWall = it.filled !== (it.parent >= 0 ? items[it.parent].filled : false);
+  const oriented = (it, wantCcw) => {
+    const c = (signedArea(it.c.points) > 0) === wantCcw ? it.c : reverseContour(it.c);
+    return { ...c, isWall: it.isWall };
+  };
+
+  const regions = [];
+  const walls = [];
+  for (let i = 0; i < items.length; i++) {
+    const it = items[i];
+    if (it.filled) {
+      regions.push({ outer: oriented(it, true), holes: it.children.map((k) => oriented(items[k], false)) });
+    }
+    if (it.isWall) walls.push(oriented(it, it.filled));
+  }
+  return { regions, walls };
+}
+
+/**
+ * Triangulate a region; returns {positions: Float64Array (2D), smooth, indices, error}.
+ * `error` is the relative area mismatch (large = self-intersecting input).
+ */
+export function triangulateRegion(region) {
+  let total = region.outer.points.length;
+  for (const h of region.holes) total += h.points.length;
+  const data = new Float64Array(total);
+  const smooth = new Uint8Array(total / 2);
+  data.set(region.outer.points, 0);
+  smooth.set(region.outer.smooth, 0);
+  const holeIndices = [];
+  let off = region.outer.points.length;
+  for (const h of region.holes) {
+    holeIndices.push(off / 2);
+    data.set(h.points, off);
+    smooth.set(h.smooth, off / 2);
+    off += h.points.length;
+  }
+  const indices = triangulate(data, holeIndices.length ? holeIndices : null);
+  const error = triangulationError(data, holeIndices.length ? holeIndices : null, indices);
+  return { positions: data, smooth, indices, holeIndices, error };
+}

package/src/path/triangulate.js

@@ -0,0 +1,517 @@
+// Polygon triangulation with holes.
+//
+// Ear clipping on a doubly linked vertex list with hole elimination by
+// bridging (David Eberly's method), z-order curve acceleration for large
+// polygons and the classic fallbacks for degenerate input (curing local
+// self-intersections, splitting the polygon). The algorithm follows the
+// structure popularised by Mapbox "earcut" (ISC license, Vladimir Agafonkin).
+//
+// Input: flat coordinate array [x0,y0,x1,y1,...] and hole start indices (in
+// vertices). Output: triangle vertex indices, counter-clockwise (y up).
+
+import { triangulateWasm } from '../wasm/kernels.js';
+
+export function triangulate(data, holeIndices = null) {
+  const w = triangulateWasm(data, holeIndices);
+  if (w) return w;
+  const 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;
+
+  if (hasHoles) outerNode = eliminateHoles(data, holeIndices, outerNode, dim);
+
+  let minX = 0, minY = 0, invSize = 0;
+  if (data.length > 80 * dim) {
+    minX = Infinity;
+    minY = Infinity;
+    let maxX = -Infinity, maxY = -Infinity;
+    for (let i = 0; i < outerLen; i += dim) {
+      const 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;
+}
+
+class Node {
+  constructor(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;
+  }
+}
+
+// keeps the class's hidden class alive between triangulations (see MeshBuilder.shapeKeeper);
+// fractional coordinates, so its fields have the representation real nodes use
+Node.shapeKeeper = new Node(0, 0.5, 0.5);
+
+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, data[i], data[i + 1], last);
+  } else {
+    for (let i = end - dim; i >= start; i -= dim) last = insertNode(i / dim, 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;
+  let 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);
+      // skipping the next vertex leads to fewer sliver triangles
+      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; // reflex
+  const ax = a.x, bx = b.x, cx = c.x, ay = a.y, by = b.y, cy = c.y;
+  const x0 = Math.min(ax, bx, cx), y0 = Math.min(ay, by, cy);
+  const 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 &&
+      pointInTriangleExceptFirst(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 = Math.min(ax, bx, cx), y0 = Math.min(ay, by, cy);
+  const x1 = Math.max(ax, bx, cx), y1 = Math.max(ay, by, cy);
+  const minZ = zOrder(x0, y0, minX, minY, invSize);
+  const maxZ = zOrder(x1, y1, minX, minY, invSize);
+  let p = ear.prevZ;
+  let 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 &&
+      pointInTriangleExceptFirst(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 &&
+      pointInTriangleExceptFirst(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 &&
+      pointInTriangleExceptFirst(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 &&
+      pointInTriangleExceptFirst(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) continue;
+    if (list === list.next) list.steiner = true;
+    queue.push(getLeftmost(list));
+  }
+  queue.sort(compareXYSlope);
+  for (let i = 0; i < queue.length; i++) outerNode = eliminateHole(queue[i], outerNode);
+  return outerNode;
+}
+
+function compareXYSlope(a, b) {
+  let result = a.x - b.x;
+  if (result === 0) {
+    result = a.y - b.y;
+    if (result === 0) {
+      const aSlope = (a.next.y - a.y) / (a.next.x - a.x);
+      const bSlope = (b.next.y - b.y) / (b.next.x - b.x);
+      result = aSlope - bSlope;
+    }
+  }
+  return result;
+}
+
+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, hy = hole.y;
+  let qx = -Infinity;
+  let m = null;
+  if (equals(hole, p)) return p;
+  do {
+    if (equals(hole, p.next)) return p.next;
+    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, 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)) & 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);
+}
+
+function getLeftmost(start) {
+  let p = start;
+  let 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 pointInTriangleExceptFirst(ax, ay, bx, by, cx, cy, px, py) {
+  return !(ax === px && ay === py) && pointInTriangle(ax, ay, bx, by, cx, cy, px, py);
+}
+
+function isValidDiagonal(a, b) {
+  return (
+    a.next.i !== b.i && a.prev.i !== b.i && !intersectsPolygon(a, b) &&
+    ((locallyInside(a, b) && locallyInside(b, a) && middleInside(a, b) &&
+      (area(a.prev, a, b.prev) || area(a, b.prev, b))) ||
+      (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, 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 = new Node(a.i, a.x, a.y);
+  const b2 = new Node(b.i, b.x, b.y);
+  const an = a.next;
+  const 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 = 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 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;
+}
+
+/**
+ * Relative difference between the triangulated area and the polygon area.
+ * Large values indicate self-intersecting or otherwise malformed input.
+ */
+export function triangulationError(data, holeIndices, triangles) {
+  const polyArea = (start, end) => {
+    let s = 0;
+    for (let i = start, j = end - 2; i < end; i += 2) {
+      s += (data[j] - data[i]) * (data[i + 1] + data[j + 1]);
+      j = i;
+    }
+    return Math.abs(s / 2);
+  };
+  const outerEnd = holeIndices && holeIndices.length ? holeIndices[0] * 2 : data.length;
+  let expected = polyArea(0, outerEnd);
+  if (holeIndices) {
+    for (let i = 0; i < holeIndices.length; i++) {
+      const s = holeIndices[i] * 2;
+      const e = i < holeIndices.length - 1 ? holeIndices[i + 1] * 2 : data.length;
+      expected -= polyArea(s, e);
+    }
+  }
+  let actual = 0;
+  for (let i = 0; i < triangles.length; i += 3) {
+    const a = triangles[i] * 2, b = triangles[i + 1] * 2, c = triangles[i + 2] * 2;
+    actual += Math.abs((data[a] - data[c]) * (data[b + 1] - data[a + 1]) - (data[a] - data[b]) * (data[c + 1] - data[a + 1])) / 2;
+  }
+  if (expected === 0 && actual === 0) return 0;
+  return Math.abs(expected - actual) / Math.max(Math.abs(expected), 1e-12);
+}