@undp/data-viz 2.5.4 → 2.6.1

package/dist/delaunay-ZuH6I4Fh.js

@@ -0,0 +1,679 @@
+//#region node_modules/delaunator/node_modules/robust-predicates/esm/util.js
+var e = 11102230246251565e-32, t = 134217729, n = (3 + 8 * e) * e;
+function r(e, t, n, r, i) {
+	let a, o, s, c, l = t[0], u = r[0], d = 0, f = 0;
+	u > l == u > -l ? (a = l, l = t[++d]) : (a = u, u = r[++f]);
+	let p = 0;
+	if (d < e && f < n) for (u > l == u > -l ? (o = l + a, s = a - (o - l), l = t[++d]) : (o = u + a, s = a - (o - u), u = r[++f]), a = o, s !== 0 && (i[p++] = s); d < e && f < n;) u > l == u > -l ? (o = a + l, c = o - a, s = a - (o - c) + (l - c), l = t[++d]) : (o = a + u, c = o - a, s = a - (o - c) + (u - c), u = r[++f]), a = o, s !== 0 && (i[p++] = s);
+	for (; d < e;) o = a + l, c = o - a, s = a - (o - c) + (l - c), l = t[++d], a = o, s !== 0 && (i[p++] = s);
+	for (; f < n;) o = a + u, c = o - a, s = a - (o - c) + (u - c), u = r[++f], a = o, s !== 0 && (i[p++] = s);
+	return (a !== 0 || p === 0) && (i[p++] = a), p;
+}
+function i(e, t) {
+	let n = t[0];
+	for (let r = 1; r < e; r++) n += t[r];
+	return n;
+}
+function a(e) {
+	return new Float64Array(e);
+}
+//#endregion
+//#region node_modules/delaunator/node_modules/robust-predicates/esm/orient2d.js
+var o = (3 + 16 * e) * e, s = (2 + 12 * e) * e, c = (9 + 64 * e) * e * e, l = a(4), u = a(8), d = a(12), f = a(16), p = a(4);
+function m(e, a, o, m, h, g, _) {
+	let v, y, b, x, S, C, w, T, E, D, O, k, A, j, M, N, P, F, I = e - h, L = o - h, R = a - g, z = m - g;
+	j = I * z, C = t * I, w = C - (C - I), T = I - w, C = t * z, E = C - (C - z), D = z - E, M = T * D - (j - w * E - T * E - w * D), N = R * L, C = t * R, w = C - (C - R), T = R - w, C = t * L, E = C - (C - L), D = L - E, P = T * D - (N - w * E - T * E - w * D), O = M - P, S = M - O, l[0] = M - (O + S) + (S - P), k = j + O, S = k - j, A = j - (k - S) + (O - S), O = A - N, S = A - O, l[1] = A - (O + S) + (S - N), F = k + O, S = F - k, l[2] = k - (F - S) + (O - S), l[3] = F;
+	let B = i(4, l), V = s * _;
+	if (B >= V || -B >= V || (S = e - I, v = e - (I + S) + (S - h), S = o - L, b = o - (L + S) + (S - h), S = a - R, y = a - (R + S) + (S - g), S = m - z, x = m - (z + S) + (S - g), v === 0 && y === 0 && b === 0 && x === 0) || (V = c * _ + n * Math.abs(B), B += I * x + z * v - (R * b + L * y), B >= V || -B >= V)) return B;
+	j = v * z, C = t * v, w = C - (C - v), T = v - w, C = t * z, E = C - (C - z), D = z - E, M = T * D - (j - w * E - T * E - w * D), N = y * L, C = t * y, w = C - (C - y), T = y - w, C = t * L, E = C - (C - L), D = L - E, P = T * D - (N - w * E - T * E - w * D), O = M - P, S = M - O, p[0] = M - (O + S) + (S - P), k = j + O, S = k - j, A = j - (k - S) + (O - S), O = A - N, S = A - O, p[1] = A - (O + S) + (S - N), F = k + O, S = F - k, p[2] = k - (F - S) + (O - S), p[3] = F;
+	let H = r(4, l, 4, p, u);
+	j = I * x, C = t * I, w = C - (C - I), T = I - w, C = t * x, E = C - (C - x), D = x - E, M = T * D - (j - w * E - T * E - w * D), N = R * b, C = t * R, w = C - (C - R), T = R - w, C = t * b, E = C - (C - b), D = b - E, P = T * D - (N - w * E - T * E - w * D), O = M - P, S = M - O, p[0] = M - (O + S) + (S - P), k = j + O, S = k - j, A = j - (k - S) + (O - S), O = A - N, S = A - O, p[1] = A - (O + S) + (S - N), F = k + O, S = F - k, p[2] = k - (F - S) + (O - S), p[3] = F;
+	let U = r(H, u, 4, p, d);
+	return j = v * x, C = t * v, w = C - (C - v), T = v - w, C = t * x, E = C - (C - x), D = x - E, M = T * D - (j - w * E - T * E - w * D), N = y * b, C = t * y, w = C - (C - y), T = y - w, C = t * b, E = C - (C - b), D = b - E, P = T * D - (N - w * E - T * E - w * D), O = M - P, S = M - O, p[0] = M - (O + S) + (S - P), k = j + O, S = k - j, A = j - (k - S) + (O - S), O = A - N, S = A - O, p[1] = A - (O + S) + (S - N), F = k + O, S = F - k, p[2] = k - (F - S) + (O - S), p[3] = F, f[r(U, d, 4, p, f) - 1];
+}
+function h(e, t, n, r, i, a) {
+	let s = (t - a) * (n - i), c = (e - i) * (r - a), l = s - c, u = Math.abs(s + c);
+	return Math.abs(l) >= o * u ? l : -m(e, t, n, r, i, a, u);
+}
+(7 + 56 * e) * e, (3 + 28 * e) * e, (26 + 288 * e) * e * e, a(4), a(4), a(4), a(4), a(4), a(4), a(4), a(4), a(4), a(8), a(8), a(8), a(4), a(8), a(8), a(8), a(12), a(192), a(192), (10 + 96 * e) * e, (4 + 48 * e) * e, (44 + 576 * e) * e * e, a(4), a(4), a(4), a(4), a(4), a(4), a(4), a(4), a(8), a(8), a(8), a(8), a(8), a(8), a(8), a(8), a(8), a(4), a(4), a(4), a(8), a(16), a(16), a(16), a(32), a(32), a(48), a(64), a(1152), a(1152), (16 + 224 * e) * e, (5 + 72 * e) * e, (71 + 1408 * e) * e * e, a(4), a(4), a(4), a(4), a(4), a(4), a(4), a(4), a(4), a(4), a(24), a(24), a(24), a(24), a(24), a(24), a(24), a(24), a(24), a(24), a(1152), a(1152), a(1152), a(1152), a(1152), a(2304), a(2304), a(3456), a(5760), a(8), a(8), a(8), a(16), a(24), a(48), a(48), a(96), a(192), a(384), a(384), a(384), a(768), a(96), a(96), a(96), a(1152);
+//#endregion
+//#region node_modules/delaunator/index.js
+var g = 2 ** -52, _ = new Uint32Array(512), v = class e {
+	static from(t, n = E, r = D) {
+		let i = t.length, a = new Float64Array(i * 2);
+		for (let e = 0; e < i; e++) {
+			let i = t[e];
+			a[2 * e] = n(i), a[2 * e + 1] = r(i);
+		}
+		return new e(a);
+	}
+	constructor(e) {
+		let t = e.length >> 1;
+		if (t > 0 && typeof e[0] != "number") throw Error("Expected coords to contain numbers.");
+		this.coords = e;
+		let n = Math.max(2 * t - 5, 0);
+		this._triangles = new Uint32Array(n * 3), this._halfedges = new Int32Array(n * 3), this._hashSize = Math.ceil(Math.sqrt(t)), this._hullPrev = new Uint32Array(t), this._hullNext = new Uint32Array(t), this._hullTri = new Uint32Array(t), this._hullHash = new Int32Array(this._hashSize), this._ids = new Uint32Array(t), this._dists = new Float64Array(t), this.update();
+	}
+	update() {
+		let { coords: e, _hullPrev: t, _hullNext: n, _hullTri: r, _hullHash: i } = this, a = e.length >> 1, o = Infinity, s = Infinity, c = -Infinity, l = -Infinity;
+		for (let t = 0; t < a; t++) {
+			let n = e[2 * t], r = e[2 * t + 1];
+			n < o && (o = n), r < s && (s = r), n > c && (c = n), r > l && (l = r), this._ids[t] = t;
+		}
+		let u = (o + c) / 2, d = (s + l) / 2, f, p, m;
+		for (let t = 0, n = Infinity; t < a; t++) {
+			let r = b(u, d, e[2 * t], e[2 * t + 1]);
+			r < n && (f = t, n = r);
+		}
+		let _ = e[2 * f], v = e[2 * f + 1];
+		for (let t = 0, n = Infinity; t < a; t++) {
+			if (t === f) continue;
+			let r = b(_, v, e[2 * t], e[2 * t + 1]);
+			r < n && r > 0 && (p = t, n = r);
+		}
+		let y = e[2 * p], x = e[2 * p + 1], T = Infinity;
+		for (let t = 0; t < a; t++) {
+			if (t === f || t === p) continue;
+			let n = S(_, v, y, x, e[2 * t], e[2 * t + 1]);
+			n < T && (m = t, T = n);
+		}
+		let E = e[2 * m], D = e[2 * m + 1];
+		if (T === Infinity) {
+			for (let t = 0; t < a; t++) this._dists[t] = e[2 * t] - e[0] || e[2 * t + 1] - e[1];
+			w(this._ids, this._dists, 0, a - 1);
+			let t = new Uint32Array(a), n = 0;
+			for (let e = 0, r = -Infinity; e < a; e++) {
+				let i = this._ids[e], a = this._dists[i];
+				a > r && (t[n++] = i, r = a);
+			}
+			this.hull = t.subarray(0, n), this.triangles = new Uint32Array(), this.halfedges = new Uint32Array();
+			return;
+		}
+		if (h(_, v, y, x, E, D) < 0) {
+			let e = p, t = y, n = x;
+			p = m, y = E, x = D, m = e, E = t, D = n;
+		}
+		let O = C(_, v, y, x, E, D);
+		this._cx = O.x, this._cy = O.y;
+		for (let t = 0; t < a; t++) this._dists[t] = b(e[2 * t], e[2 * t + 1], O.x, O.y);
+		w(this._ids, this._dists, 0, a - 1), this._hullStart = f;
+		let k = 3;
+		n[f] = t[m] = p, n[p] = t[f] = m, n[m] = t[p] = f, r[f] = 0, r[p] = 1, r[m] = 2, i.fill(-1), i[this._hashKey(_, v)] = f, i[this._hashKey(y, x)] = p, i[this._hashKey(E, D)] = m, this.trianglesLen = 0, this._addTriangle(f, p, m, -1, -1, -1);
+		for (let a = 0, o, s; a < this._ids.length; a++) {
+			let c = this._ids[a], l = e[2 * c], u = e[2 * c + 1];
+			if (a > 0 && Math.abs(l - o) <= g && Math.abs(u - s) <= g || (o = l, s = u, c === f || c === p || c === m)) continue;
+			let d = 0;
+			for (let e = 0, t = this._hashKey(l, u); e < this._hashSize && (d = i[(t + e) % this._hashSize], !(d !== -1 && d !== n[d])); e++);
+			d = t[d];
+			let _ = d, v;
+			for (; v = n[_], h(l, u, e[2 * _], e[2 * _ + 1], e[2 * v], e[2 * v + 1]) >= 0;) if (_ = v, _ === d) {
+				_ = -1;
+				break;
+			}
+			if (_ === -1) continue;
+			let y = this._addTriangle(_, c, n[_], -1, -1, r[_]);
+			r[c] = this._legalize(y + 2), r[_] = y, k++;
+			let b = n[_];
+			for (; v = n[b], h(l, u, e[2 * b], e[2 * b + 1], e[2 * v], e[2 * v + 1]) < 0;) y = this._addTriangle(b, c, v, r[c], -1, r[b]), r[c] = this._legalize(y + 2), n[b] = b, k--, b = v;
+			if (_ === d) for (; v = t[_], h(l, u, e[2 * v], e[2 * v + 1], e[2 * _], e[2 * _ + 1]) < 0;) y = this._addTriangle(v, c, _, -1, r[_], r[v]), this._legalize(y + 2), r[v] = y, n[_] = _, k--, _ = v;
+			this._hullStart = t[c] = _, n[_] = t[b] = c, n[c] = b, i[this._hashKey(l, u)] = c, i[this._hashKey(e[2 * _], e[2 * _ + 1])] = _;
+		}
+		this.hull = new Uint32Array(k);
+		for (let e = 0, t = this._hullStart; e < k; e++) this.hull[e] = t, t = n[t];
+		this.triangles = this._triangles.subarray(0, this.trianglesLen), this.halfedges = this._halfedges.subarray(0, this.trianglesLen);
+	}
+	_hashKey(e, t) {
+		return Math.floor(y(e - this._cx, t - this._cy) * this._hashSize) % this._hashSize;
+	}
+	_legalize(e) {
+		let { _triangles: t, _halfedges: n, coords: r } = this, i = 0, a = 0;
+		for (;;) {
+			let o = n[e], s = e - e % 3;
+			if (a = s + (e + 2) % 3, o === -1) {
+				if (i === 0) break;
+				e = _[--i];
+				continue;
+			}
+			let c = o - o % 3, l = s + (e + 1) % 3, u = c + (o + 2) % 3, d = t[a], f = t[e], p = t[l], m = t[u];
+			if (x(r[2 * d], r[2 * d + 1], r[2 * f], r[2 * f + 1], r[2 * p], r[2 * p + 1], r[2 * m], r[2 * m + 1])) {
+				t[e] = m, t[o] = d;
+				let r = n[u];
+				if (r === -1) {
+					let t = this._hullStart;
+					do {
+						if (this._hullTri[t] === u) {
+							this._hullTri[t] = e;
+							break;
+						}
+						t = this._hullPrev[t];
+					} while (t !== this._hullStart);
+				}
+				this._link(e, r), this._link(o, n[a]), this._link(a, u);
+				let s = c + (o + 1) % 3;
+				i < _.length && (_[i++] = s);
+			} else {
+				if (i === 0) break;
+				e = _[--i];
+			}
+		}
+		return a;
+	}
+	_link(e, t) {
+		this._halfedges[e] = t, t !== -1 && (this._halfedges[t] = e);
+	}
+	_addTriangle(e, t, n, r, i, a) {
+		let o = this.trianglesLen;
+		return this._triangles[o] = e, this._triangles[o + 1] = t, this._triangles[o + 2] = n, this._link(o, r), this._link(o + 1, i), this._link(o + 2, a), this.trianglesLen += 3, o;
+	}
+};
+function y(e, t) {
+	let n = e / (Math.abs(e) + Math.abs(t));
+	return (t > 0 ? 3 - n : 1 + n) / 4;
+}
+function b(e, t, n, r) {
+	let i = e - n, a = t - r;
+	return i * i + a * a;
+}
+function x(e, t, n, r, i, a, o, s) {
+	let c = e - o, l = t - s, u = n - o, d = r - s, f = i - o, p = a - s, m = c * c + l * l, h = u * u + d * d, g = f * f + p * p;
+	return c * (d * g - h * p) - l * (u * g - h * f) + m * (u * p - d * f) < 0;
+}
+function S(e, t, n, r, i, a) {
+	let o = n - e, s = r - t, c = i - e, l = a - t, u = o * o + s * s, d = c * c + l * l, f = .5 / (o * l - s * c), p = (l * u - s * d) * f, m = (o * d - c * u) * f;
+	return p * p + m * m;
+}
+function C(e, t, n, r, i, a) {
+	let o = n - e, s = r - t, c = i - e, l = a - t, u = o * o + s * s, d = c * c + l * l, f = .5 / (o * l - s * c);
+	return {
+		x: e + (l * u - s * d) * f,
+		y: t + (o * d - c * u) * f
+	};
+}
+function w(e, t, n, r) {
+	if (r - n <= 20) for (let i = n + 1; i <= r; i++) {
+		let r = e[i], a = t[r], o = i - 1;
+		for (; o >= n && t[e[o]] > a;) e[o + 1] = e[o--];
+		e[o + 1] = r;
+	}
+	else {
+		let i = n + r >> 1, a = n + 1, o = r;
+		T(e, i, a), t[e[n]] > t[e[r]] && T(e, n, r), t[e[a]] > t[e[r]] && T(e, a, r), t[e[n]] > t[e[a]] && T(e, n, a);
+		let s = e[a], c = t[s];
+		for (;;) {
+			do
+				a++;
+			while (t[e[a]] < c);
+			do
+				o--;
+			while (t[e[o]] > c);
+			if (o < a) break;
+			T(e, a, o);
+		}
+		e[n + 1] = e[o], e[o] = s, r - a + 1 >= o - n ? (w(e, t, a, r), w(e, t, n, o - 1)) : (w(e, t, n, o - 1), w(e, t, a, r));
+	}
+}
+function T(e, t, n) {
+	let r = e[t];
+	e[t] = e[n], e[n] = r;
+}
+function E(e) {
+	return e[0];
+}
+function D(e) {
+	return e[1];
+}
+//#endregion
+//#region node_modules/d3-delaunay/src/path.js
+var O = 1e-6, k = class {
+	constructor() {
+		this._x0 = this._y0 = this._x1 = this._y1 = null, this._ = "";
+	}
+	moveTo(e, t) {
+		this._ += `M${this._x0 = this._x1 = +e},${this._y0 = this._y1 = +t}`;
+	}
+	closePath() {
+		this._x1 !== null && (this._x1 = this._x0, this._y1 = this._y0, this._ += "Z");
+	}
+	lineTo(e, t) {
+		this._ += `L${this._x1 = +e},${this._y1 = +t}`;
+	}
+	arc(e, t, n) {
+		e = +e, t = +t, n = +n;
+		let r = e + n, i = t;
+		if (n < 0) throw Error("negative radius");
+		this._x1 === null ? this._ += `M${r},${i}` : (Math.abs(this._x1 - r) > O || Math.abs(this._y1 - i) > O) && (this._ += "L" + r + "," + i), n && (this._ += `A${n},${n},0,1,1,${e - n},${t}A${n},${n},0,1,1,${this._x1 = r},${this._y1 = i}`);
+	}
+	rect(e, t, n, r) {
+		this._ += `M${this._x0 = this._x1 = +e},${this._y0 = this._y1 = +t}h${+n}v${+r}h${-n}Z`;
+	}
+	value() {
+		return this._ || null;
+	}
+}, A = class {
+	constructor() {
+		this._ = [];
+	}
+	moveTo(e, t) {
+		this._.push([e, t]);
+	}
+	closePath() {
+		this._.push(this._[0].slice());
+	}
+	lineTo(e, t) {
+		this._.push([e, t]);
+	}
+	value() {
+		return this._.length ? this._ : null;
+	}
+}, j = class {
+	constructor(e, [t, n, r, i] = [
+		0,
+		0,
+		960,
+		500
+	]) {
+		if (!((r = +r) >= (t = +t)) || !((i = +i) >= (n = +n))) throw Error("invalid bounds");
+		this.delaunay = e, this._circumcenters = new Float64Array(e.points.length * 2), this.vectors = new Float64Array(e.points.length * 2), this.xmax = r, this.xmin = t, this.ymax = i, this.ymin = n, this._init();
+	}
+	update() {
+		return this.delaunay.update(), this._init(), this;
+	}
+	_init() {
+		let { delaunay: { points: e, hull: t, triangles: n }, vectors: r } = this, i, a, o = this.circumcenters = this._circumcenters.subarray(0, n.length / 3 * 2);
+		for (let r = 0, s = 0, c = n.length, l, u; r < c; r += 3, s += 2) {
+			let c = n[r] * 2, d = n[r + 1] * 2, f = n[r + 2] * 2, p = e[c], m = e[c + 1], h = e[d], g = e[d + 1], _ = e[f], v = e[f + 1], y = h - p, b = g - m, x = _ - p, S = v - m, C = (y * S - b * x) * 2;
+			if (Math.abs(C) < 1e-9) {
+				if (i === void 0) {
+					i = a = 0;
+					for (let n of t) i += e[n * 2], a += e[n * 2 + 1];
+					i /= t.length, a /= t.length;
+				}
+				let n = 1e9 * Math.sign((i - p) * S - (a - m) * x);
+				l = (p + _) / 2 - n * S, u = (m + v) / 2 + n * x;
+			} else {
+				let e = 1 / C, t = y * y + b * b, n = x * x + S * S;
+				l = p + (S * t - b * n) * e, u = m + (y * n - x * t) * e;
+			}
+			o[s] = l, o[s + 1] = u;
+		}
+		let s = t[t.length - 1], c, l = s * 4, u, d = e[2 * s], f, p = e[2 * s + 1];
+		r.fill(0);
+		for (let n = 0; n < t.length; ++n) s = t[n], c = l, u = d, f = p, l = s * 4, d = e[2 * s], p = e[2 * s + 1], r[c + 2] = r[l] = f - p, r[c + 3] = r[l + 1] = d - u;
+	}
+	render(e) {
+		let t = e == null ? e = new k() : void 0, { delaunay: { halfedges: n, inedges: r, hull: i }, circumcenters: a, vectors: o } = this;
+		if (i.length <= 1) return null;
+		for (let t = 0, r = n.length; t < r; ++t) {
+			let r = n[t];
+			if (r < t) continue;
+			let i = Math.floor(t / 3) * 2, o = Math.floor(r / 3) * 2, s = a[i], c = a[i + 1], l = a[o], u = a[o + 1];
+			this._renderSegment(s, c, l, u, e);
+		}
+		let s, c = i[i.length - 1];
+		for (let t = 0; t < i.length; ++t) {
+			s = c, c = i[t];
+			let n = Math.floor(r[c] / 3) * 2, l = a[n], u = a[n + 1], d = s * 4, f = this._project(l, u, o[d + 2], o[d + 3]);
+			f && this._renderSegment(l, u, f[0], f[1], e);
+		}
+		return t && t.value();
+	}
+	renderBounds(e) {
+		let t = e == null ? e = new k() : void 0;
+		return e.rect(this.xmin, this.ymin, this.xmax - this.xmin, this.ymax - this.ymin), t && t.value();
+	}
+	renderCell(e, t) {
+		let n = t == null ? t = new k() : void 0, r = this._clip(e);
+		if (r === null || !r.length) return;
+		t.moveTo(r[0], r[1]);
+		let i = r.length;
+		for (; r[0] === r[i - 2] && r[1] === r[i - 1] && i > 1;) i -= 2;
+		for (let e = 2; e < i; e += 2) (r[e] !== r[e - 2] || r[e + 1] !== r[e - 1]) && t.lineTo(r[e], r[e + 1]);
+		return t.closePath(), n && n.value();
+	}
+	*cellPolygons() {
+		let { delaunay: { points: e } } = this;
+		for (let t = 0, n = e.length / 2; t < n; ++t) {
+			let e = this.cellPolygon(t);
+			e && (e.index = t, yield e);
+		}
+	}
+	cellPolygon(e) {
+		let t = new A();
+		return this.renderCell(e, t), t.value();
+	}
+	_renderSegment(e, t, n, r, i) {
+		let a, o = this._regioncode(e, t), s = this._regioncode(n, r);
+		o === 0 && s === 0 ? (i.moveTo(e, t), i.lineTo(n, r)) : (a = this._clipSegment(e, t, n, r, o, s)) && (i.moveTo(a[0], a[1]), i.lineTo(a[2], a[3]));
+	}
+	contains(e, t, n) {
+		return (t = +t, t !== t) || (n = +n, n !== n) ? !1 : this.delaunay._step(e, t, n) === e;
+	}
+	*neighbors(e) {
+		let t = this._clip(e);
+		if (t) for (let n of this.delaunay.neighbors(e)) {
+			let e = this._clip(n);
+			if (e) {
+				loop: for (let r = 0, i = t.length; r < i; r += 2) for (let a = 0, o = e.length; a < o; a += 2) if (t[r] === e[a] && t[r + 1] === e[a + 1] && t[(r + 2) % i] === e[(a + o - 2) % o] && t[(r + 3) % i] === e[(a + o - 1) % o]) {
+					yield n;
+					break loop;
+				}
+			}
+		}
+	}
+	_cell(e) {
+		let { circumcenters: t, delaunay: { inedges: n, halfedges: r, triangles: i } } = this, a = n[e];
+		if (a === -1) return null;
+		let o = [], s = a;
+		do {
+			let n = Math.floor(s / 3);
+			if (o.push(t[n * 2], t[n * 2 + 1]), s = s % 3 == 2 ? s - 2 : s + 1, i[s] !== e) break;
+			s = r[s];
+		} while (s !== a && s !== -1);
+		return o;
+	}
+	_clip(e) {
+		if (e === 0 && this.delaunay.hull.length === 1) return [
+			this.xmax,
+			this.ymin,
+			this.xmax,
+			this.ymax,
+			this.xmin,
+			this.ymax,
+			this.xmin,
+			this.ymin
+		];
+		let t = this._cell(e);
+		if (t === null) return null;
+		let { vectors: n } = this, r = e * 4;
+		return this._simplify(n[r] || n[r + 1] ? this._clipInfinite(e, t, n[r], n[r + 1], n[r + 2], n[r + 3]) : this._clipFinite(e, t));
+	}
+	_clipFinite(e, t) {
+		let n = t.length, r = null, i, a, o = t[n - 2], s = t[n - 1], c, l = this._regioncode(o, s), u, d = 0;
+		for (let f = 0; f < n; f += 2) if (i = o, a = s, o = t[f], s = t[f + 1], c = l, l = this._regioncode(o, s), c === 0 && l === 0) u = d, d = 0, r ? r.push(o, s) : r = [o, s];
+		else {
+			let t, n, f, p, m;
+			if (c === 0) {
+				if ((t = this._clipSegment(i, a, o, s, c, l)) === null) continue;
+				[n, f, p, m] = t;
+			} else {
+				if ((t = this._clipSegment(o, s, i, a, l, c)) === null) continue;
+				[p, m, n, f] = t, u = d, d = this._edgecode(n, f), u && d && this._edge(e, u, d, r, r.length), r ? r.push(n, f) : r = [n, f];
+			}
+			u = d, d = this._edgecode(p, m), u && d && this._edge(e, u, d, r, r.length), r ? r.push(p, m) : r = [p, m];
+		}
+		if (r) u = d, d = this._edgecode(r[0], r[1]), u && d && this._edge(e, u, d, r, r.length);
+		else if (this.contains(e, (this.xmin + this.xmax) / 2, (this.ymin + this.ymax) / 2)) return [
+			this.xmax,
+			this.ymin,
+			this.xmax,
+			this.ymax,
+			this.xmin,
+			this.ymax,
+			this.xmin,
+			this.ymin
+		];
+		return r;
+	}
+	_clipSegment(e, t, n, r, i, a) {
+		let o = i < a;
+		for (o && ([e, t, n, r, i, a] = [
+			n,
+			r,
+			e,
+			t,
+			a,
+			i
+		]);;) {
+			if (i === 0 && a === 0) return o ? [
+				n,
+				r,
+				e,
+				t
+			] : [
+				e,
+				t,
+				n,
+				r
+			];
+			if (i & a) return null;
+			let s, c, l = i || a;
+			l & 8 ? (s = e + (n - e) * (this.ymax - t) / (r - t), c = this.ymax) : l & 4 ? (s = e + (n - e) * (this.ymin - t) / (r - t), c = this.ymin) : l & 2 ? (c = t + (r - t) * (this.xmax - e) / (n - e), s = this.xmax) : (c = t + (r - t) * (this.xmin - e) / (n - e), s = this.xmin), i ? (e = s, t = c, i = this._regioncode(e, t)) : (n = s, r = c, a = this._regioncode(n, r));
+		}
+	}
+	_clipInfinite(e, t, n, r, i, a) {
+		let o = Array.from(t), s;
+		if ((s = this._project(o[0], o[1], n, r)) && o.unshift(s[0], s[1]), (s = this._project(o[o.length - 2], o[o.length - 1], i, a)) && o.push(s[0], s[1]), o = this._clipFinite(e, o)) for (let t = 0, n = o.length, r, i = this._edgecode(o[n - 2], o[n - 1]); t < n; t += 2) r = i, i = this._edgecode(o[t], o[t + 1]), r && i && (t = this._edge(e, r, i, o, t), n = o.length);
+		else this.contains(e, (this.xmin + this.xmax) / 2, (this.ymin + this.ymax) / 2) && (o = [
+			this.xmin,
+			this.ymin,
+			this.xmax,
+			this.ymin,
+			this.xmax,
+			this.ymax,
+			this.xmin,
+			this.ymax
+		]);
+		return o;
+	}
+	_edge(e, t, n, r, i) {
+		for (; t !== n;) {
+			let n, a;
+			switch (t) {
+				case 5:
+					t = 4;
+					continue;
+				case 4:
+					t = 6, n = this.xmax, a = this.ymin;
+					break;
+				case 6:
+					t = 2;
+					continue;
+				case 2:
+					t = 10, n = this.xmax, a = this.ymax;
+					break;
+				case 10:
+					t = 8;
+					continue;
+				case 8:
+					t = 9, n = this.xmin, a = this.ymax;
+					break;
+				case 9:
+					t = 1;
+					continue;
+				case 1:
+					t = 5, n = this.xmin, a = this.ymin;
+					break;
+			}
+			(r[i] !== n || r[i + 1] !== a) && this.contains(e, n, a) && (r.splice(i, 0, n, a), i += 2);
+		}
+		return i;
+	}
+	_project(e, t, n, r) {
+		let i = Infinity, a, o, s;
+		if (r < 0) {
+			if (t <= this.ymin) return null;
+			(a = (this.ymin - t) / r) < i && (s = this.ymin, o = e + (i = a) * n);
+		} else if (r > 0) {
+			if (t >= this.ymax) return null;
+			(a = (this.ymax - t) / r) < i && (s = this.ymax, o = e + (i = a) * n);
+		}
+		if (n > 0) {
+			if (e >= this.xmax) return null;
+			(a = (this.xmax - e) / n) < i && (o = this.xmax, s = t + (i = a) * r);
+		} else if (n < 0) {
+			if (e <= this.xmin) return null;
+			(a = (this.xmin - e) / n) < i && (o = this.xmin, s = t + (i = a) * r);
+		}
+		return [o, s];
+	}
+	_edgecode(e, t) {
+		return (e === this.xmin ? 1 : e === this.xmax ? 2 : 0) | (t === this.ymin ? 4 : t === this.ymax ? 8 : 0);
+	}
+	_regioncode(e, t) {
+		return (e < this.xmin ? 1 : e > this.xmax ? 2 : 0) | (t < this.ymin ? 4 : t > this.ymax ? 8 : 0);
+	}
+	_simplify(e) {
+		if (e && e.length > 4) {
+			for (let t = 0; t < e.length; t += 2) {
+				let n = (t + 2) % e.length, r = (t + 4) % e.length;
+				(e[t] === e[n] && e[n] === e[r] || e[t + 1] === e[n + 1] && e[n + 1] === e[r + 1]) && (e.splice(n, 2), t -= 2);
+			}
+			e.length || (e = null);
+		}
+		return e;
+	}
+}, M = 2 * Math.PI, N = Math.pow;
+function P(e) {
+	return e[0];
+}
+function F(e) {
+	return e[1];
+}
+function I(e) {
+	let { triangles: t, coords: n } = e;
+	for (let e = 0; e < t.length; e += 3) {
+		let r = 2 * t[e], i = 2 * t[e + 1], a = 2 * t[e + 2];
+		if ((n[a] - n[r]) * (n[i + 1] - n[r + 1]) - (n[i] - n[r]) * (n[a + 1] - n[r + 1]) > 1e-10) return !1;
+	}
+	return !0;
+}
+function L(e, t, n) {
+	return [e + Math.sin(e + t) * n, t + Math.cos(e - t) * n];
+}
+var R = class e {
+	static from(t, n = P, r = F, i) {
+		return new e("length" in t ? z(t, n, r, i) : Float64Array.from(B(t, n, r, i)));
+	}
+	constructor(e) {
+		this._delaunator = new v(e), this.inedges = new Int32Array(e.length / 2), this._hullIndex = new Int32Array(e.length / 2), this.points = this._delaunator.coords, this._init();
+	}
+	update() {
+		return this._delaunator.update(), this._init(), this;
+	}
+	_init() {
+		let e = this._delaunator, t = this.points;
+		if (e.hull && e.hull.length > 2 && I(e)) {
+			this.collinear = Int32Array.from({ length: t.length / 2 }, (e, t) => t).sort((e, n) => t[2 * e] - t[2 * n] || t[2 * e + 1] - t[2 * n + 1]);
+			let e = this.collinear[0], n = this.collinear[this.collinear.length - 1], r = [
+				t[2 * e],
+				t[2 * e + 1],
+				t[2 * n],
+				t[2 * n + 1]
+			], i = 1e-8 * Math.hypot(r[3] - r[1], r[2] - r[0]);
+			for (let e = 0, n = t.length / 2; e < n; ++e) {
+				let n = L(t[2 * e], t[2 * e + 1], i);
+				t[2 * e] = n[0], t[2 * e + 1] = n[1];
+			}
+			this._delaunator = new v(t);
+		} else delete this.collinear;
+		let n = this.halfedges = this._delaunator.halfedges, r = this.hull = this._delaunator.hull, i = this.triangles = this._delaunator.triangles, a = this.inedges.fill(-1), o = this._hullIndex.fill(-1);
+		for (let e = 0, t = n.length; e < t; ++e) {
+			let t = i[e % 3 == 2 ? e - 2 : e + 1];
+			(n[e] === -1 || a[t] === -1) && (a[t] = e);
+		}
+		for (let e = 0, t = r.length; e < t; ++e) o[r[e]] = e;
+		r.length <= 2 && r.length > 0 && (this.triangles = new Int32Array(3).fill(-1), this.halfedges = new Int32Array(3).fill(-1), this.triangles[0] = r[0], a[r[0]] = 1, r.length === 2 && (a[r[1]] = 0, this.triangles[1] = r[1], this.triangles[2] = r[1]));
+	}
+	voronoi(e) {
+		return new j(this, e);
+	}
+	*neighbors(e) {
+		let { inedges: t, hull: n, _hullIndex: r, halfedges: i, triangles: a, collinear: o } = this;
+		if (o) {
+			let t = o.indexOf(e);
+			t > 0 && (yield o[t - 1]), t < o.length - 1 && (yield o[t + 1]);
+			return;
+		}
+		let s = t[e];
+		if (s === -1) return;
+		let c = s, l = -1;
+		do {
+			if (yield l = a[c], c = c % 3 == 2 ? c - 2 : c + 1, a[c] !== e) return;
+			if (c = i[c], c === -1) {
+				let t = n[(r[e] + 1) % n.length];
+				t !== l && (yield t);
+				return;
+			}
+		} while (c !== s);
+	}
+	find(e, t, n = 0) {
+		if ((e = +e, e !== e) || (t = +t, t !== t)) return -1;
+		let r = n, i;
+		for (; (i = this._step(n, e, t)) >= 0 && i !== n && i !== r;) n = i;
+		return i;
+	}
+	_step(e, t, n) {
+		let { inedges: r, hull: i, _hullIndex: a, halfedges: o, triangles: s, points: c } = this;
+		if (r[e] === -1 || !c.length) return (e + 1) % (c.length >> 1);
+		let l = e, u = N(t - c[e * 2], 2) + N(n - c[e * 2 + 1], 2), d = r[e], f = d;
+		do {
+			let r = s[f], d = N(t - c[r * 2], 2) + N(n - c[r * 2 + 1], 2);
+			if (d < u && (u = d, l = r), f = f % 3 == 2 ? f - 2 : f + 1, s[f] !== e) break;
+			if (f = o[f], f === -1) {
+				if (f = i[(a[e] + 1) % i.length], f !== r && N(t - c[f * 2], 2) + N(n - c[f * 2 + 1], 2) < u) return f;
+				break;
+			}
+		} while (f !== d);
+		return l;
+	}
+	render(e) {
+		let t = e == null ? e = new k() : void 0, { points: n, halfedges: r, triangles: i } = this;
+		for (let t = 0, a = r.length; t < a; ++t) {
+			let a = r[t];
+			if (a < t) continue;
+			let o = i[t] * 2, s = i[a] * 2;
+			e.moveTo(n[o], n[o + 1]), e.lineTo(n[s], n[s + 1]);
+		}
+		return this.renderHull(e), t && t.value();
+	}
+	renderPoints(e, t) {
+		t === void 0 && (!e || typeof e.moveTo != "function") && (t = e, e = null), t = t == null ? 2 : +t;
+		let n = e == null ? e = new k() : void 0, { points: r } = this;
+		for (let n = 0, i = r.length; n < i; n += 2) {
+			let i = r[n], a = r[n + 1];
+			e.moveTo(i + t, a), e.arc(i, a, t, 0, M);
+		}
+		return n && n.value();
+	}
+	renderHull(e) {
+		let t = e == null ? e = new k() : void 0, { hull: n, points: r } = this, i = n[0] * 2, a = n.length;
+		e.moveTo(r[i], r[i + 1]);
+		for (let t = 1; t < a; ++t) {
+			let i = 2 * n[t];
+			e.lineTo(r[i], r[i + 1]);
+		}
+		return e.closePath(), t && t.value();
+	}
+	hullPolygon() {
+		let e = new A();
+		return this.renderHull(e), e.value();
+	}
+	renderTriangle(e, t) {
+		let n = t == null ? t = new k() : void 0, { points: r, triangles: i } = this, a = i[e *= 3] * 2, o = i[e + 1] * 2, s = i[e + 2] * 2;
+		return t.moveTo(r[a], r[a + 1]), t.lineTo(r[o], r[o + 1]), t.lineTo(r[s], r[s + 1]), t.closePath(), n && n.value();
+	}
+	*trianglePolygons() {
+		let { triangles: e } = this;
+		for (let t = 0, n = e.length / 3; t < n; ++t) yield this.trianglePolygon(t);
+	}
+	trianglePolygon(e) {
+		let t = new A();
+		return this.renderTriangle(e, t), t.value();
+	}
+};
+function z(e, t, n, r) {
+	let i = e.length, a = new Float64Array(i * 2);
+	for (let o = 0; o < i; ++o) {
+		let i = e[o];
+		a[o * 2] = t.call(r, i, o, e), a[o * 2 + 1] = n.call(r, i, o, e);
+	}
+	return a;
+}
+function* B(e, t, n, r) {
+	let i = 0;
+	for (let a of e) yield t.call(r, a, i, e), yield n.call(r, a, i, e), ++i;
+}
+//#endregion
+export { R as t };
+
+//# sourceMappingURL=delaunay-ZuH6I4Fh.js.map