@equinor/videx-3d 2.0.0 → 3.1.0

package/dist/chunk-DKAquGKk.js

@@ -0,0 +1,2820 @@
+import { AddEquation as e, BufferAttribute as t, BufferGeometry as n, CustomBlending as r, DataTexture as i, FloatType as a, LinearFilter as o, Material as s, Mesh as c, MinEquation as l, NoBlending as u, OneFactor as d, OneMinusSrcAlphaFactor as f, OrthographicCamera as p, Path as m, PlaneGeometry as h, RGBAFormat as g, RGFormat as _, RedFormat as v, RedIntegerFormat as y, Scene as b, ShaderLib as x, ShaderMaterial as S, Shape as C, ShapeGeometry as w, SrcAlphaFactor as T, Uniform as E, UniformsGroup as D, UniformsUtils as O, UnsignedByteType as k, UnsignedShortType as A, Vector2 as j, Vector3 as M, Vector4 as N, WebGLRenderTarget as ee } from "three";
+import { wrap as te } from "comlink";
+import ne from "p-limit";
+import { CurveInterpolator as P, EPS as F } from "curve-interpolator";
+import { lerp as I } from "three/src/math/MathUtils.js";
+import L from "proj4";
+//#region src/sdk/data/DataLoader.ts
+var R = 10, re = 25, ie = class {
+	store;
+	config;
+	cached = /* @__PURE__ */ new Map();
+	_activeLoaders = {};
+	_batchqueue = /* @__PURE__ */ new Map();
+	_flushScheduled = null;
+	constructor(e, t = {}) {
+		this.store = e, this.config = { ...t }, this.config.batched && (this.config.batchSize === void 0 && (this.config.batchSize = R), this.config.batchMaxDelay === void 0 && (this.config.batchMaxDelay = re)), this._flushScheduled = null;
+	}
+	async init(...e) {
+		if (this.config.init) try {
+			let t = await this.config.init(...e);
+			if (Array.isArray(t)) return this.cached = new Map(t), !0;
+		} catch (e) {
+			console.warn("Init failed", e);
+		}
+		return this.clear(), !1;
+	}
+	async all() {
+		if (this.config.preloaded) {
+			if (this.config.transform) {
+				let e = this.config.transform;
+				return Array.from(this.cached.values()).map((t) => e(t));
+			}
+			return Array.from(this.cached.values());
+		} else console.warn("Data Loader: \"all\" called on non-preloaded dataset!");
+		return [];
+	}
+	async _enqueueRequest(e) {
+		if (this._batchqueue.has(e)) return this._batchqueue.get(e).promise;
+		let t = null, n = new Promise((e) => {
+			t = e;
+		}), r = {
+			key: e,
+			promise: n,
+			_resolve: t
+		};
+		return this._batchqueue.set(e, r), this._flushScheduled ||= setTimeout(() => {
+			this._processBatchQueue();
+		}, this.config.batchMaxDelay), n;
+	}
+	async _processBatch(e) {
+		let t = e.map((e) => e.key);
+		if (!this.config.batchLoad) return null;
+		this.config.batchLoad(t).then((e) => {
+			Array.isArray(e) && e.forEach(([e, t]) => {
+				this.set(e, t);
+			});
+		}).catch((e) => {
+			console.warn("Batch load failed", e);
+		}).finally(() => {
+			e.forEach((e) => {
+				let t = this.cached.get(e.key) || null;
+				e._resolve(t);
+			});
+		});
+	}
+	async _processBatchQueue() {
+		let e = [];
+		for (let t of this._batchqueue.values()) e.push(t), this._batchqueue.delete(t.key), (e.length >= this.config.batchSize || this._batchqueue.size === 0) && (this._processBatch(e), e = []);
+		this._batchqueue.size ? this._flushScheduled = setTimeout(() => this._processBatchQueue(), 1) : this._flushScheduled = null;
+	}
+	async get(e, t) {
+		if (this.cached.has(e)) return this.config.transform ? this.config.transform(this.cached.get(e)) : this.cached.get(e);
+		if (this.config.preloaded) return null;
+		if (!this.config.batched && this.config.load) {
+			if (this.config.noCache) return this.config.load(e, t);
+			let n = this._activeLoaders[e];
+			if (!n) {
+				if (t) throw Error("DataLoader: A load function with additional args may not be cached. Set noCache to true in config.");
+				n = this.config.load(e).then((t) => {
+					t && this.cached.set(e, t);
+				}).catch((e) => {
+					console.warn("Load failed", e);
+				}).finally(() => {
+					delete this._activeLoaders[e];
+				}), this._activeLoaders[e] = n;
+			}
+			return await n, this.config.transform ? this.config.transform(this.cached.get(e)) : this.cached.get(e);
+		}
+		return this.config.batched && this.config.batchLoad ? this._enqueueRequest(e) : null;
+	}
+	set(e, t) {
+		this.cached.set(e, t);
+	}
+	clear() {
+		this.cached.clear();
+	}
+}, ae = class {
+	store = null;
+	config;
+	generators = /* @__PURE__ */ new Map();
+	constructor(e = {}, t) {
+		this.config = {
+			concurrentStoreCalls: 0,
+			...e
+		}, t && this.setStore(t);
+	}
+	add(e, t) {
+		this.generators.set(e, t);
+	}
+	setStore(e) {
+		if (e && this.config.concurrentStoreCalls) {
+			let t = ne(this.config.concurrentStoreCalls), n = {
+				get: (n, r, i) => t(() => e.get(n, r, i)),
+				all: (n) => t(() => e.all(n)),
+				query: (n, r) => t(() => e.query(n, r))
+			};
+			this.store = n;
+		} else this.store = e;
+	}
+	async connectRemoteStore(e) {
+		let t = te(e);
+		this.setStore(t);
+	}
+	async invoke(e, ...t) {
+		if (!this.store) throw Error("No available store!");
+		if (!this.generators.has(e)) throw Error(`Generator with key '${e}' not found!`);
+		return this.generators.get(e).bind(this.store)(...t);
+	}
+};
+//#endregion
+//#region src/sdk/data/helpers/formations-helpers.ts
+async function oe(e, t, n, r) {
+	let i = await n.get("formations", e) || [];
+	r = r === void 0 ? -Infinity : r;
+	let a = i.filter((e) => e.stratColumnId === t && e.exit.mdMsl > r);
+	return a.sort((e, t) => e.entry.mdMsl - t.entry.mdMsl || e.level - t.level), a.length && a[0].entry.mdMsl < r && (a[0].entry.mdMsl = r), a;
+}
+function se(e, t, n) {
+	return {
+		mdMslFrom: t,
+		mdMslTo: n,
+		name: e.name,
+		level: e.level,
+		color: e.color,
+		properties: { ...e.properties || {} }
+	};
+}
+function ce(e) {
+	if (!e.length) return [];
+	let t = [], n = [...e].sort((e, t) => {
+		let n = t.level - e.level || e.entry.mdMsl - t.entry.mdMsl;
+		if (n === 0 && (e.properties?.updated || t.properties?.updated)) {
+			let n = e.properties?.updated ? new Date(e.properties?.updated) : null, r = t.properties?.updated ? new Date(t.properties?.updated) : null;
+			return n === null ? 1 : r === null ? -1 : r.getTime() - n.getTime();
+		}
+		return n;
+	});
+	for (let e = 0; e < n.length; e++) {
+		let r = n[e], i = r.entry.mdMsl, a = [...t];
+		for (let e = 0; e < t.length && i < r.exit.mdMsl; e++) {
+			let n = t[e];
+			if (i < n.mdMslFrom) {
+				let e = Math.min(r.exit.mdMsl, n.mdMslFrom);
+				a.push(se(r, i, e));
+			}
+			i = Math.max(i, n.mdMslTo);
+		}
+		i < r.exit.mdMsl && a.push(se(r, i, r.exit.mdMsl)), t = a.sort((e, t) => e.mdMslFrom - t.mdMslFrom);
+	}
+	return t;
+}
+function le(e) {
+	let t = [], n = [...e].sort((e, t) => e.entry.mdMsl - t.entry.mdMsl || t.level - e.level), r = null, i = -Infinity;
+	for (let e = 0; e < n.length; e++) {
+		let a = n[e];
+		a.entry.mdMsl > i && (i = a.entry.mdMsl, r && r.exit.mdMsl < i && t.push({
+			color: r.color,
+			name: r.name,
+			type: "base",
+			mdMsl: r.exit.mdMsl,
+			tvdMsl: r.exit.tvdMsl,
+			level: r.level
+		}), t.push({
+			color: a.color,
+			name: a.name,
+			type: "top",
+			mdMsl: i,
+			tvdMsl: a.entry.tvdMsl,
+			level: a.level
+		}), r = a);
+	}
+	return r && t.push({
+		color: r.color,
+		name: r.name,
+		type: "base",
+		mdMsl: r.exit.mdMsl,
+		tvdMsl: r.exit.tvdMsl,
+		level: r.level
+	}), t;
+}
+//#endregion
+//#region src/sdk/data/helpers/well-helpers.ts
+function ue(e, t, n) {
+	let r = /* @__PURE__ */ new Map(), i = {};
+	t.sort((e, t) => e.id === n ? -1 : t.id === n ? 1 : e.drilled && t.drilled ? t.drilled.getTime() - e.drilled.getTime() : e.name.localeCompare(t.name));
+	for (let n = 0; n < t.length; n++) {
+		let a = t[n];
+		if (!a) continue;
+		let o = a.parent && a.kickoffDepthMsl !== null ? a.kickoffDepthMsl : -a.depthReferenceElevation;
+		if (r.has(a.id)) o = r.get(a.id);
+		else {
+			let t = a.parent;
+			for (; t;) {
+				let n = e[t];
+				if (!n) break;
+				if (r.has(n.id)) {
+					let e = r.get(n.id);
+					o >= e && (r.set(n.id, o), o = e);
+					break;
+				} else r.set(n.id, o), o = n.parent && n.kickoffDepthMsl !== null ? n.kickoffDepthMsl : -n.depthReferenceElevation;
+				t = n.parent;
+			}
+		}
+		i[a.id] = [o, n], r.set(a.id, a.depthMdMsl);
+	}
+	return i;
+}
+//#endregion
+//#region src/sdk/geometries/boundary-loops.ts
+function de(e) {
+	let t = e.getIndex(), n = e.getAttribute("position");
+	if (!t || !n) return [];
+	let r = t.array, i = n.count, a = (e, t) => e < t ? e * i + t : t * i + e, o = [
+		[0, 1],
+		[1, 2],
+		[2, 0]
+	], s = /* @__PURE__ */ new Map();
+	for (let e = 0; e + 2 < r.length; e += 3) for (let [t, n] of o) {
+		let i = a(r[e + t], r[e + n]);
+		s.set(i, (s.get(i) ?? 0) + 1);
+	}
+	let c = /* @__PURE__ */ new Map(), l = (e, t) => {
+		let n = c.get(e);
+		n || (n = [], c.set(e, n)), n.includes(t) || n.push(t);
+	};
+	for (let e = 0; e + 2 < r.length; e += 3) for (let [t, n] of o) {
+		let i = r[e + t], o = r[e + n];
+		s.get(a(i, o)) === 1 && (l(i, o), l(o, i));
+	}
+	let u = /* @__PURE__ */ new Set(), d = [];
+	for (let e of c.keys()) {
+		if (c.get(e).every((t) => u.has(a(e, t)))) continue;
+		let t = [], n = -1, r = e;
+		for (; r !== -1;) {
+			t.push(r);
+			let i = c.get(r), o = -1;
+			for (let e of i) if (e !== n && !u.has(a(r, e))) {
+				o = e;
+				break;
+			}
+			if (o === -1) {
+				for (let e of i) if (!u.has(a(r, e))) {
+					o = e;
+					break;
+				}
+			}
+			if (o === -1) break;
+			u.add(a(r, o)), n = r, r = o === e ? -1 : o;
+		}
+		t.length >= 3 && d.push(t);
+	}
+	return d;
+}
+function fe(e, t, n) {
+	let r = e.getAttribute("position");
+	if (r) {
+		for (let e of t) {
+			let t = e.length;
+			if (t < 4) continue;
+			let i = Math.max(1, Math.min(n * 2, Math.floor((t - 1) / 3))), a = new Float64Array(t), o = new Float64Array(t);
+			for (let n = 0; n < t; n++) a[n] = r.getX(e[n]), o[n] = r.getZ(e[n]);
+			for (let e = 0; e < 2; e++) {
+				let e = new Float64Array(t), n = new Float64Array(t);
+				for (let r = 0; r < t; r++) {
+					let s = 0, c = 0;
+					for (let e = -i; e <= i; e++) {
+						let n = ((r + e) % t + t) % t;
+						s += a[n], c += o[n];
+					}
+					let l = i * 2 + 1;
+					e[r] = s / l, n[r] = c / l;
+				}
+				a = e, o = n;
+			}
+			for (let n = 0; n < t; n++) r.setX(e[n], a[n]), r.setZ(e[n], o[n]);
+		}
+		r.needsUpdate = !0;
+	}
+}
+function pe(e, t, n) {
+	let r = e.getAttribute("position");
+	if (!r) return;
+	let i = de(e), a = /* @__PURE__ */ new Set();
+	for (let e of i) for (let i of e) {
+		if (a.has(i)) continue;
+		a.add(i);
+		let e = r.getX(i), o = r.getZ(i), s = e, c = o, l = Infinity;
+		for (let n of t) for (let t = 0; t + 1 < n.length; t++) {
+			let r = n[t][0], i = n[t][1], a = n[t + 1][0] - r, u = n[t + 1][1] - i, d = a * a + u * u || 1, f = ((e - r) * a + (o - i) * u) / d;
+			f = f < 0 ? 0 : f > 1 ? 1 : f;
+			let p = r + a * f, m = i + u * f, h = (e - p) * (e - p) + (o - m) * (o - m);
+			h < l && (l = h, s = p, c = m);
+		}
+		r.setX(i, s), r.setZ(i, c), n && r.setY(i, n(s, c));
+	}
+	r.needsUpdate = !0;
+}
+//#endregion
+//#region src/sdk/utils/numbers.ts
+function z(e, t = 0, n = 1) {
+	return e < t ? t : e > n ? n : e;
+}
+function me(e, t, n) {
+	return n = z(n, 0, 1), (1 - n) * e + n * t;
+}
+function he(e, t, n) {
+	return (e - t) / (n - t);
+}
+function ge(e, t, n, r, i) {
+	return me(r, i, he(e, t, n));
+}
+var _e = (e) => {
+	if (e < 0) return [
+		0,
+		0,
+		0
+	];
+	if (e > 16777.215) throw Error("Value out of range!");
+	let t = Math.round(e * 1e3), n = Math.floor(t / 65536), r = Math.floor(t / 256) - n * 256;
+	return [
+		n,
+		r,
+		Math.floor(t) - n * 65536 - r * 256
+	];
+}, B = Math.PI, ve = 2 * Math.PI, ye = Math.PI / 2, be = Math.PI / 4, xe = Math.PI / 8;
+function Se(e, t, n) {
+	for (; t < -Math.PI;) t += ve;
+	for (; t > Math.PI;) t -= ve;
+	let r = Math.atan2(e[1], e[0]), i = Math.tan(t), a;
+	a = t > -r && t <= r ? 1 : t > r && t <= Math.PI - r ? 2 : t > Math.PI - r || t <= -(Math.PI - r) ? 3 : 4;
+	let o = n || [0, 0];
+	o[0] = 0, o[1] = 0;
+	let s = 1, c = 1;
+	switch (a) {
+		case 1:
+			c = -1;
+			break;
+		case 2:
+			c = -1;
+			break;
+		case 3:
+			s = -1;
+			break;
+		case 4:
+			s = -1;
+			break;
+	}
+	return a === 1 || a === 3 ? (o[0] += s * (e[0] / 2), o[1] += c * (e[0] / 2) * i) : (o[0] += s * (e[1] / (2 * i)), o[1] += c * (e[1] / 2)), o;
+}
+//#endregion
+//#region src/sdk/utils/vector-operations.ts
+function Ce(e) {
+	return e[0] = -e[0], e[1] = -e[1], e[2] = -e[2], e;
+}
+function we(e, t) {
+	return [
+		e[t],
+		e[t + 1],
+		e[t + 2]
+	];
+}
+function Te(e, t, n) {
+	e[t] = n[0], e[t + 1] = n[1], e[t + 2] = n[2];
+}
+function Ee(e, t) {
+	return [
+		e[0] + t[0],
+		e[1] + t[1],
+		e[2] + t[2]
+	];
+}
+function De(e, t) {
+	return [
+		e[0] - t[0],
+		e[1] - t[1],
+		e[2] - t[2]
+	];
+}
+function Oe(e, t) {
+	return e[0] *= t, e[1] *= t, e[2] *= t, e;
+}
+function ke(e) {
+	let t = e[0] ** 2 + e[1] ** 2 + e[2] ** 2;
+	return t > 0 ? Math.sqrt(t) : 0;
+}
+function V(e, t) {
+	return [
+		e[1] * t[2] - e[2] * t[1],
+		e[2] * t[0] - e[0] * t[2],
+		e[0] * t[1] - e[1] * t[0]
+	];
+}
+function Ae(e, t) {
+	return e[0] * t[0] + e[1] * t[1] + e[2] * t[2];
+}
+function H(e) {
+	let t = Math.sqrt(e[0] * e[0] + e[1] * e[1] + e[2] * e[2]);
+	return t ? (e[0] /= t, e[1] /= t, e[2] /= t, e) : [
+		0,
+		0,
+		0
+	];
+}
+function je(e, t, n = .5) {
+	let r = 1 - n;
+	return [
+		e[0] * r + t[0] * n,
+		e[1] * r + t[1] * n,
+		e[2] * r + t[2] * n
+	];
+}
+function Me(e) {
+	return [
+		e[0],
+		e[1],
+		e[2]
+	];
+}
+function Ne(e, t) {
+	let n = Math.sqrt((e[0] ** 2 + e[1] ** 2 + e[2] ** 2) * (t[0] ** 2 + t[1] ** 2 + t[2] ** 2));
+	if (n === 0) return ye;
+	let r = Ae(e, t) / n;
+	return Math.acos(z(r, -1, 1));
+}
+function Pe(e, t = [
+	0,
+	1,
+	0
+], n = 0) {
+	let r = Math.cos(n), i = Math.sin(n), a = 1 - r, o = e[0], s = e[1], c = e[2], l = t[0], u = t[1], d = t[2], f = a * l, p = a * u;
+	return [
+		(f * l + r) * o + (f * u - i * d) * s + (f * d + i * u) * c,
+		(f * u + i * d) * o + (p * u + r) * s + (p * d - i * l) * c,
+		(f * d - i * u) * o + (p * d + i * l) * s + (a * d * d + r) * c
+	];
+}
+function Fe(e, t) {
+	return H(De(t, e));
+}
+function Ie(e, t) {
+	return ke(De(t, e));
+}
+function U(e, t) {
+	return e === void 0 ? [t, t] : typeof e == "number" ? [e, e] : e;
+}
+function Le(e, t) {
+	return [e[t], e[t + 1]];
+}
+function Re(e, t, n) {
+	e[t] = n[0], e[t + 1] = n[1];
+}
+function ze(e) {
+	let t = Math.sqrt(e[0] * e[0] + e[1] * e[1]);
+	return t ? (e[0] /= t, e[1] /= t, e) : [0, 0];
+}
+function Be(e, t) {
+	return [e[0] + t[0], e[1] + t[1]];
+}
+function Ve(e, t) {
+	return [e[0] - t[0], e[1] - t[1]];
+}
+function He(e, t) {
+	return e[0] * t[0] + e[1] * t[1];
+}
+function Ue(e) {
+	return e[0] = -e[0], e[1] = -e[1], e;
+}
+function We(e, t) {
+	return e[0] *= t, e[1] *= t, e;
+}
+function Ge(e) {
+	let t = e[0] ** 2 + e[1] ** 2;
+	return t > 0 ? Math.sqrt(t) : 0;
+}
+function Ke(e, t, n = .5) {
+	let r = 1 - n;
+	return [e[0] * r + t[0] * n, e[1] * r + t[1] * n];
+}
+function qe(e, t) {
+	return ze(Ve(t, e));
+}
+function W(e, t) {
+	return Ge(Ve(t, e));
+}
+//#endregion
+//#region src/sdk/geometries/curve/curve-3d.ts
+function Je(e, t = !1) {
+	let n = new P(e, {
+		alpha: 1,
+		tension: 0,
+		closed: t
+	});
+	return {
+		getPointAt: (e) => n.getPointAt(e),
+		getPoints: (e, t = 0, r = 1) => n.getPoints(e, null, t, r),
+		getTangentAt: (e) => n.getTangentAt(e),
+		getNormalAt: (e) => n.getNormalAt(e),
+		getBoundingBox: (e = 0, t = 1) => {
+			let r = n.getBoundingBox(e, t);
+			return {
+				min: r.min,
+				max: r.max
+			};
+		},
+		nearest: (e) => {
+			let t = n.getNearestPosition(e);
+			return {
+				position: t.u,
+				point: t.point,
+				distance: t.distance
+			};
+		},
+		get length() {
+			return n.length;
+		},
+		closed: t
+	};
+}
+function Ye(e, t) {
+	let n = t.length, r = Array(n);
+	if (!r.length) return [];
+	t.forEach((t, n) => {
+		r[n] = {
+			curvePosition: t,
+			position: e.getPointAt(t),
+			tangent: e.getTangentAt(t),
+			normal: [
+				0,
+				0,
+				0
+			],
+			binormal: [
+				0,
+				0,
+				0
+			]
+		};
+	});
+	let i = [
+		0,
+		1,
+		0
+	], a = Math.abs(r[0].tangent[1]), o = Math.abs(r[0].tangent[0]), s = Math.abs(r[0].tangent[2]);
+	o <= a && (a = o, i = [
+		1,
+		0,
+		0
+	]), s <= a && (i = [
+		0,
+		0,
+		1
+	]);
+	let c = H(V(r[0].tangent, i));
+	r[0].normal = V(r[0].tangent, c), r[0].binormal = V(r[0].tangent, r[0].normal);
+	for (let e = 1; e < t.length; e++) {
+		if (c = V(r[e - 1].tangent, r[e].tangent), r[e].normal = Me(r[e - 1].normal), ke(c) > F) {
+			H(c);
+			let t = Math.acos(z(Ae(r[e - 1].tangent, r[e].tangent), -1, 1));
+			r[e].normal = Pe(r[e - 1].normal, c, t);
+		}
+		r[e].binormal = V(r[e].tangent, r[e].normal);
+	}
+	return r;
+}
+function Xe(e, t = 0, n = 1, r = .1, i = 0) {
+	let a = [], o = e.length, s = Math.ceil(r * o), c = 1 / s, l = 1 / (o * .01);
+	i && (i *= .1), a.push(t);
+	let u = i ? e.getTangentAt(t) : null, d = Math.floor(t * s), f = t;
+	for (let r = d; r <= s; r++) {
+		let o = r * c, s = o - f, d = i ? e.getTangentAt(o) : null;
+		o > t && o < n && (s >= l || !i || Math.abs(Ae(u, d)) < 1 - i) && (a.push(o), u = d, f = o);
+	}
+	return a.push(n), a;
+}
+//#endregion
+//#region src/sdk/geometries/geometry.ts
+function Ze(e, t) {
+	switch (t) {
+		case "Uint8Array": return new Uint8Array(e);
+		case "Uint16Array": return new Uint16Array(e);
+		case "Uint32Array": return new Uint32Array(e);
+		case "Int8Array": return new Int8Array(e);
+		case "Int16Array": return new Int16Array(e);
+		case "Int32Array": return new Int32Array(e);
+		case "Float32Array": return new Float32Array(e);
+		case "Float64Array": return new Float64Array(e);
+		default: throw Error("Unsupported typed array!");
+	}
+}
+function Qe(e, t = !1) {
+	if (!e.length) return null;
+	if (e.length === 1) return {
+		geometry: e[0],
+		groups: null
+	};
+	let n = {
+		positions: Array.from(e[0].positions),
+		indices: Array.from(e[0].indices),
+		vertexCount: e[0].vertexCount,
+		indexCount: e[0].indexCount,
+		attributes: {}
+	};
+	for (let t in e[0].attributes) n.attributes[t] = {
+		array: Array.from(e[0].attributes[t].array),
+		itemSize: e[0].attributes[t].itemSize,
+		type: e[0].attributes[t].type
+	};
+	let r = t ? [] : null, i = n.vertexCount, a = 0;
+	if (r) {
+		let e = n.indexCount;
+		r.push([
+			a,
+			e,
+			r.length
+		]), a += e;
+	}
+	for (let t = 1; t < e.length; t++) {
+		let o = e[t];
+		if (r) {
+			let e = o.indexCount;
+			r.push([
+				a,
+				e,
+				r.length
+			]), a += e;
+		}
+		n.positions = n.positions.concat(o.positions);
+		for (let e = 0; e < o.indices.length; e++) n.indices.push(i + o.indices[e]);
+		n.vertexCount += o.vertexCount, n.indexCount += o.indexCount;
+		for (let e in n.attributes) {
+			if (!o.attributes || !o.attributes[e]) throw Error(`Attribute '${e}' missing in geometry`);
+			n.attributes[e].array = n.attributes[e].array.concat(o.attributes[e].array);
+		}
+		i += o.vertexCount, o.vertexCount = 0, o.indexCount = 0;
+	}
+	return {
+		geometry: n,
+		groups: r
+	};
+}
+function $e(e, r = !1) {
+	let i = Qe(e, r);
+	if (!i) return null;
+	let { geometry: a, groups: o } = i, s = new n();
+	o && o.forEach((e) => {
+		s.addGroup(e[0], e[1], e[2]);
+	}), s.setAttribute("position", new t(Float32Array.from(a.positions), 3));
+	for (let e in a.attributes) {
+		let n = a.attributes[e], r = Ze(n.array, n.type);
+		s.setAttribute(e, new t(r, n.itemSize));
+	}
+	let c = a.indices.length < 65535 ? Uint16Array.from(a.indices) : Uint32Array.from(a.indices);
+	return s.setIndex(new t(c, 1)), s;
+}
+//#endregion
+//#region src/sdk/geometries/curve/tube-geometry.ts
+function et(e) {
+	let t = {
+		vertexCount: 0,
+		indexCount: 0,
+		positions: [],
+		indices: [],
+		attributes: {}
+	};
+	return e.computeNormals && (t.attributes.normal = {
+		array: [],
+		itemSize: 3,
+		type: "Float32Array"
+	}), e.computeLengths && (t.attributes.curveLength = {
+		array: [],
+		itemSize: 1,
+		type: "Float32Array"
+	}), e.computeRelativeLengths && (t.attributes.curveRelativeLength = {
+		array: [],
+		itemSize: 1,
+		type: "Float32Array"
+	}), e.computeCurveNormals && (t.attributes.curveNormal = {
+		array: [],
+		itemSize: 3,
+		type: "Float32Array"
+	}), e.computeCurveTangents && (t.attributes.curveTangent = {
+		array: [],
+		itemSize: 3,
+		type: "Float32Array"
+	}), e.computeCurveBinormals && (t.attributes.curveBinormal = {
+		array: [],
+		itemSize: 3,
+		type: "Float32Array"
+	}), e.computeCenterPoints && (t.attributes.centerPoint = {
+		array: [],
+		itemSize: 3,
+		type: "Float32Array"
+	}), e.computeUvs && (t.attributes.uv = {
+		array: [],
+		itemSize: 2,
+		type: "Float32Array"
+	}), t;
+}
+function tt(e, t, n) {
+	if (t[0] === n[0]) return n[1];
+	let r = n[0] - t[0], i = z((e - t[0]) / r, 0, 1);
+	return I(t[1], n[1], i);
+}
+function nt(e, t, n, r, i, a, o, s) {
+	let c = [];
+	if (t === "none" || a.length === 0) c.push([n, i], [r, i]);
+	else {
+		let e = [0, i], o = [1, i], s = a.findIndex((e) => e[0] > n);
+		s === -1 ? e = a[a.length - 1] : (s > 0 && (e = a[s - 1]), o = a[s]);
+		let l = t === "linear" ? tt(n, e, o) : e[1];
+		c.push([n, l]);
+		for (let e = s; e >= 0 && e < a.length; e++) {
+			let n = a[e];
+			if (n[0] < r) c.push(n);
+			else {
+				t === "linear" ? c.push([r, tt(r, c[c.length - 1], n)]) : c.push([r, c[c.length - 1][1]]);
+				break;
+			}
+		}
+		c[c.length - 1][0] < r && (t === "linear" ? c.push([r, tt(r, c[c.length - 1], [1, i])]) : c.push([r, c[c.length - 1][1]]));
+	}
+	let l = [], u = Xe(e, n, r, o, s), d = 0, f = u[d];
+	for (let n = 0; n < c.length - 1; n++) {
+		let r = n + 1, [i, a] = c[n], [o, s] = c[r], p = (o - i) * e.length, m = s - a, h = Math.atan2(m, p);
+		for (l.push([
+			i,
+			a,
+			t === "linear" ? h : 0
+		]); f <= i && d < u.length - 1;) f = u[++d];
+		for (; f < o && d < u.length;) {
+			let e = t === "linear" ? tt(f, c[n], c[r]) : a;
+			l.push([
+				f,
+				e,
+				t === "linear" ? h : 0
+			]), f = u[d++];
+		}
+		if (r < c.length) {
+			if (t === "linear") l.push([
+				o,
+				s,
+				t === "linear" ? h : 0
+			]);
+			else if (t === "stepped") {
+				let e = h < 0 ? -B / 2 : B / 2;
+				l.push([
+					o,
+					a,
+					0
+				], [
+					o,
+					a,
+					e
+				], [
+					o,
+					s,
+					e
+				]);
+			}
+		}
+		r === c.length - 1 && t === "none" && l.push([
+			o,
+			s,
+			h
+		]);
+	}
+	let p = Ye(e, l.map((e) => e[0]));
+	return l.map((e, t) => ({
+		radius: e[1],
+		theta: e[2],
+		...p[t]
+	}));
+}
+function rt(e, t, n, r, i, a, o = !0) {
+	let s = et(a), c = (e) => {
+		for (let n = 0; n <= t; n++) {
+			let a = n / t * B * 2, o = Math.sin(a), c = -Math.cos(a), l = H([
+				c * e.normal[0] + o * e.binormal[0],
+				c * e.normal[1] + o * e.binormal[1],
+				c * e.normal[2] + o * e.binormal[2]
+			]), u = [
+				e.position[0] + e.radius * l[0],
+				e.position[1] + e.radius * l[1],
+				e.position[2] + e.radius * l[2]
+			];
+			if (s.positions.push(...u), s.vertexCount++, s.attributes.normal) {
+				let t = Me(l);
+				Number.isFinite(e.theta) && (t = Pe(l, H(V(e.tangent, l)), e.theta)), s.attributes.normal.array.push(...t);
+			}
+			s.attributes.curveLength && s.attributes.curveLength.array.push(e.curvePosition * r), s.attributes.curveRelativeLength && s.attributes.curveRelativeLength.array.push((e.curvePosition - i) * r), s.attributes.curveNormal && s.attributes.curveNormal.array.push(...e.normal), s.attributes.curveTangent && s.attributes.curveTangent.array.push(...e.tangent), s.attributes.curveBinormal && s.attributes.curveBinormal.array.push(...e.binormal), s.attributes.centerPoint && s.attributes.centerPoint.array.push(...e.position);
+		}
+	};
+	for (let t = 0; t < e.length; t++) c(e[t]);
+	if (n && c(e[0]), s.attributes.uv) for (let n = 0; n < e.length; n++) for (let r = 0; r <= t; r++) s.attributes.uv.array.push(r / t, n / (e.length - 1));
+	for (let n = 1; n < e.length; n++) for (let e = 1; e <= t; e++) {
+		let r = (t + 1) * (n - 1) + (e - 1), i = (t + 1) * n + (e - 1), a = (t + 1) * n + e, o = (t + 1) * (n - 1) + e;
+		s.indices.push(r, i, o), s.indices.push(i, a, o), s.indexCount += 6;
+	}
+	return o || s.indices.reverse(), s;
+}
+function it(e, t, n = !0, r, i, a) {
+	let o = et(a), s = n ? [
+		-e.tangent[0],
+		-e.tangent[1],
+		-e.tangent[2]
+	] : e.tangent;
+	o.positions.push(...e.position), o.vertexCount++, o.attributes.normal && o.attributes.normal.array.push(...s), o.attributes.uv && o.attributes.uv.array.push(.5, .5);
+	for (let r = 0; r <= t; r++) {
+		let i = r / t * B * 2, a = Math.sin(i), c = -Math.cos(i), l = H([
+			c * e.normal[0] + a * e.binormal[0],
+			c * e.normal[1] + a * e.binormal[1],
+			c * e.normal[2] + a * e.binormal[2]
+		]);
+		if (o.positions.push(e.position[0] + e.radius * l[0], e.position[1] + e.radius * l[1], e.position[2] + e.radius * l[2]), o.vertexCount++, o.attributes.normal && o.attributes.normal.array.push(...s), o.attributes.uv) {
+			let e = [(c + 1) / 2, (a + 1) / 2];
+			n && (e[0] = 1 - e[0]), o.attributes.uv.array.push(...e);
+		}
+	}
+	let c = e.curvePosition * r, l = (e.curvePosition - i) * r;
+	for (let t = 0; t < o.vertexCount; t++) o.attributes.curveLength && o.attributes.curveLength.array.push(c), o.attributes.curveRelativeLength && o.attributes.curveRelativeLength.array.push(l), o.attributes.curveNormal && o.attributes.curveNormal.array.push(...e.normal), o.attributes.curveTangent && o.attributes.curveTangent.array.push(...e.tangent), o.attributes.curveBinormal && o.attributes.curveBinormal.array.push(...e.binormal), o.attributes.centerPoint && o.attributes.centerPoint.array.push(...e.position);
+	for (let e = 1; e <= t; e++) {
+		let t, r;
+		n ? (t = e + 0, r = e + 0 + 1) : (t = e + 0 + 1, r = e + 0), o.indices.push(t, r, 0), o.indexCount += 3;
+	}
+	return o;
+}
+function at(e, t, n, r = !0, i, a, o) {
+	let s = et(o), c = r ? [
+		-e.tangent[0],
+		-e.tangent[1],
+		-e.tangent[2]
+	] : [...e.tangent], l = t.radius / e.radius;
+	for (let i = 0; i <= n; i++) {
+		let a = i / n * B * 2, o = Math.sin(a), u = -Math.cos(a), d = H([
+			u * e.normal[0] + o * e.binormal[0],
+			u * e.normal[1] + o * e.binormal[1],
+			u * e.normal[2] + o * e.binormal[2]
+		]);
+		if (s.positions.push(e.position[0] + e.radius * d[0], e.position[1] + e.radius * d[1], e.position[2] + e.radius * d[2]), s.positions.push(t.position[0] + t.radius * d[0], t.position[1] + t.radius * d[1], t.position[2] + t.radius * d[2]), s.vertexCount += 2, s.attributes.normal && (s.attributes.normal.array.push(...c), s.attributes.normal.array.push(...c)), s.attributes.uv) {
+			let e = [(u + 1) / 2, (o + 1) / 2], t = [(u * l + 1) / 2, (o * l + 1) / 2];
+			r && (e[0] = 1 - e[0], t[0] = 1 - t[0]), s.attributes.uv.array.push(...e, ...t);
+		}
+	}
+	let u = e.curvePosition * i, d = (e.curvePosition - a) * i;
+	for (let t = 0; t < s.vertexCount; t++) s.attributes.curveLength && s.attributes.curveLength.array.push(u), s.attributes.curveRelativeLength && s.attributes.curveRelativeLength.array.push(d), s.attributes.curveNormal && s.attributes.curveNormal.array.push(...e.normal), s.attributes.curveTangent && s.attributes.curveTangent.array.push(...e.tangent), s.attributes.curveBinormal && s.attributes.curveBinormal.array.push(...e.binormal), s.attributes.centerPoint && s.attributes.centerPoint.array.push(...e.position);
+	for (let e = 0; e < n; e++) {
+		let t = e * 2, n = t + 1, i = t + 2, a = t + 3;
+		r ? s.indices.push(t, i, n, n, i, a) : s.indices.push(i, t, n, n, a, i), s.indexCount += 6;
+	}
+	return s;
+}
+function ot(e, t = {}) {
+	let n = z(t.from || 0, 0, 1), r = z(t.to || 1);
+	if (r < n) throw Error("Value of \"from\" must be less than the value of \"to\"!");
+	let i = [], a = t.radius || 1, o = t.radiusModifier?.steps || [], s = t.radialSegments || 8, c = t.startCap || !1, l = t.endCap || !1, u = e.closed, d = e.length;
+	o.sort((e, t) => e[0] - t[0]);
+	let f = t.segmentsPerMeter || .1, p = t.radiusModifier?.type || "none", m = z(t.simplificationThreshold || 0, 0, 1), h = nt(e, p, n, r, a, o, f, m);
+	i.push(rt(h, s, u, d, n, t, !0));
+	let g = null, _ = t.innerRadius || 0, v = t.thickness || 0;
+	return (_ > 0 || v > 0) && (g = v ? h.map((e) => ({
+		...e,
+		radius: e.radius - v,
+		theta: e.theta - B
+	})) : nt(e, "none", n, r, _, [], f, m).map((e) => ({
+		...e,
+		theta: e.theta - B
+	})), i.push(rt(g, s, u, d, n, t, !1))), c && (!u || n > 0 || r < 1) && (g ? i.push(at(h[0], g[0], s, !0, d, n, t)) : i.push(it(h[0], s, !0, d, n, t))), l && (!u || n > 0 || r < 1) && (g ? i.push(at(h[h.length - 1], g[g.length - 1], s, !1, d, n, t)) : i.push(it(h[h.length - 1], s, !1, d, n, t))), i;
+}
+function st(e, t = {}) {
+	return $e(ot(e, t), t.addGroups);
+}
+//#endregion
+//#region src/sdk/geometries/delatin.ts
+var ct = -1e3, lt = class {
+	data;
+	width;
+	height;
+	coords = [];
+	triangles = [];
+	nullValue;
+	_queue = [];
+	_queueIndices = [];
+	_errors = [];
+	_halfedges = [];
+	_candidates = [];
+	_invalidPoints;
+	_rms = [];
+	_pending = [];
+	_pendingLen = 0;
+	_rmsSum = 0;
+	constructor(e, t, n = -1) {
+		this.data = e, this.width = t, this.height = this.data.length / t, this.nullValue = n, this._invalidPoints = /* @__PURE__ */ new Set();
+		let r = this.width - 1, i = this.height - 1, a = this._addPoint(0, 0), o = this._addPoint(r, 0), s = this._addPoint(0, i), c = this._addPoint(r, i), l = this._addTriangle(c, a, s, -1, -1, -1);
+		this._addTriangle(a, c, o, l, -1, -1), this._flush();
+	}
+	run(e = 1) {
+		for (; this.getMaxError() > e;) this.refine();
+	}
+	removeInvalidTriangles() {
+		let e = [];
+		for (let t = 0; t < this.triangles.length; t += 3) {
+			let n = this.triangles[t], r = this.triangles[t + 1], i = this.triangles[t + 2];
+			!this._invalidPoints.has(n) && !this._invalidPoints.has(r) && !this._invalidPoints.has(i) && e.push(this.triangles[t], this.triangles[t + 1], this.triangles[t + 2]);
+		}
+		this.triangles = e;
+	}
+	refine() {
+		this._step(), this._flush();
+	}
+	getMaxError() {
+		return this._errors[0];
+	}
+	getRMSD() {
+		return this._rmsSum > 0 ? Math.sqrt(this._rmsSum / (this.width * this.height)) : 0;
+	}
+	heightAt(e, t) {
+		let n = this.data[this.width * t + e];
+		return n === this.nullValue ? ct : n;
+	}
+	_findCandidate(e, t, n, r, i, a, o) {
+		let s = Math.min(e, n, i), c = Math.min(t, r, a), l = Math.max(e, n, i), u = Math.max(t, r, a), d = G(n, r, i, a, s, c), f = G(i, a, e, t, s, c), p = G(e, t, n, r, s, c), m = r - t, h = e - n, g = a - r, _ = n - i, v = t - a, y = i - e, b = G(e, t, n, r, i, a), x = this.heightAt(e, t) / b, S = this.heightAt(n, r) / b, C = this.heightAt(i, a) / b, w = 0, T = 0, E = 0, D = 0;
+		for (let e = c; e <= u; e++) {
+			let t = 0;
+			d < 0 && g !== 0 && (t = Math.max(t, Math.floor(-d / g))), f < 0 && v !== 0 && (t = Math.max(t, Math.floor(-f / v))), p < 0 && m !== 0 && (t = Math.max(t, Math.floor(-p / m)));
+			let n = d + g * t, r = f + v * t, i = p + m * t, a = !1;
+			for (let o = s + t; o <= l; o++) {
+				if (n >= 0 && r >= 0 && i >= 0) {
+					a = !0;
+					let t = x * n + S * r + C * i, s = this.heightAt(o, e), c = Math.abs(t - s);
+					D += c * c, c > w && (w = c, T = o, E = e);
+				} else if (a) break;
+				n += g, r += v, i += m;
+			}
+			d += _, f += y, p += h;
+		}
+		(T === e && E === t || T === n && E === r || T === i && E === a) && (w = 0), this._candidates[2 * o] = T, this._candidates[2 * o + 1] = E, this._rms[o] = D, this._queuePush(o, w, D);
+	}
+	_step() {
+		let e = this._queuePop(), t = e * 3 + 0, n = e * 3 + 1, r = e * 3 + 2, i = this.triangles[t], a = this.triangles[n], o = this.triangles[r], s = this.coords[2 * i], c = this.coords[2 * i + 1], l = this.coords[2 * a], u = this.coords[2 * a + 1], d = this.coords[2 * o], f = this.coords[2 * o + 1], p = this._candidates[2 * e], m = this._candidates[2 * e + 1], h = this._addPoint(p, m);
+		if (G(s, c, l, u, p, m) === 0) this._handleCollinear(h, t);
+		else if (G(l, u, d, f, p, m) === 0) this._handleCollinear(h, n);
+		else if (G(d, f, s, c, p, m) === 0) this._handleCollinear(h, r);
+		else {
+			let e = this._halfedges[t], s = this._halfedges[n], c = this._halfedges[r], l = this._addTriangle(i, a, h, e, -1, -1, t), u = this._addTriangle(a, o, h, s, -1, l + 1), d = this._addTriangle(o, i, h, c, l + 2, u + 1);
+			this._legalize(l), this._legalize(u), this._legalize(d);
+		}
+	}
+	_addPoint(e, t) {
+		let n = this.coords.length >> 1;
+		return this.coords.push(e, t), this.heightAt(e, t) === ct && this._invalidPoints.add(n), n;
+	}
+	_addTriangle(e, t, n, r, i, a, o = this.triangles.length) {
+		let s = o / 3;
+		return this.triangles[o + 0] = e, this.triangles[o + 1] = t, this.triangles[o + 2] = n, this._halfedges[o + 0] = r, this._halfedges[o + 1] = i, this._halfedges[o + 2] = a, r >= 0 && (this._halfedges[r] = o + 0), i >= 0 && (this._halfedges[i] = o + 1), a >= 0 && (this._halfedges[a] = o + 2), this._candidates[2 * s + 0] = 0, this._candidates[2 * s + 1] = 0, this._queueIndices[s] = -1, this._rms[s] = 0, this._pending[this._pendingLen++] = s, o;
+	}
+	_flush() {
+		let e = this.coords;
+		for (let t = 0; t < this._pendingLen; t++) {
+			let n = this._pending[t], r = 2 * this.triangles[n * 3 + 0], i = 2 * this.triangles[n * 3 + 1], a = 2 * this.triangles[n * 3 + 2];
+			this._findCandidate(e[r], e[r + 1], e[i], e[i + 1], e[a], e[a + 1], n);
+		}
+		this._pendingLen = 0;
+	}
+	_legalize(e) {
+		let t = this._halfedges[e];
+		if (t < 0) return;
+		let n = e - e % 3, r = t - t % 3, i = n + (e + 1) % 3, a = n + (e + 2) % 3, o = r + (t + 2) % 3, s = r + (t + 1) % 3, c = this.triangles[a], l = this.triangles[e], u = this.triangles[i], d = this.triangles[o], f = this.coords;
+		if (!ut(f[2 * c], f[2 * c + 1], f[2 * l], f[2 * l + 1], f[2 * u], f[2 * u + 1], f[2 * d], f[2 * d + 1])) return;
+		let p = this._halfedges[i], m = this._halfedges[a], h = this._halfedges[o], g = this._halfedges[s];
+		this._queueRemove(n / 3), this._queueRemove(r / 3);
+		let _ = this._addTriangle(c, d, u, -1, h, p, n), v = this._addTriangle(d, c, l, _, m, g, r);
+		this._legalize(_ + 1), this._legalize(v + 2);
+	}
+	_handleCollinear(e, t) {
+		let n = t - t % 3, r = n + (t + 1) % 3, i = n + (t + 2) % 3, a = this.triangles[i], o = this.triangles[t], s = this.triangles[r], c = this._halfedges[r], l = this._halfedges[i], u = this._halfedges[t];
+		if (u < 0) {
+			let t = this._addTriangle(e, a, o, -1, l, -1, n), r = this._addTriangle(a, e, s, t, -1, c);
+			this._legalize(t + 1), this._legalize(r + 2);
+			return;
+		}
+		let d = u - u % 3, f = d + (u + 2) % 3, p = d + (u + 1) % 3, m = this.triangles[f], h = this._halfedges[f], g = this._halfedges[p];
+		this._queueRemove(d / 3);
+		let _ = this._addTriangle(a, o, e, l, -1, -1, n), v = this._addTriangle(o, m, e, g, -1, _ + 1, d), y = this._addTriangle(m, s, e, h, -1, v + 1), b = this._addTriangle(s, a, e, c, _ + 2, y + 1);
+		this._legalize(_), this._legalize(v), this._legalize(y), this._legalize(b);
+	}
+	_queuePush(e, t, n) {
+		let r = this._queue.length;
+		this._queueIndices[e] = r, this._queue.push(e), this._errors.push(t), this._rmsSum += n, this._queueUp(r);
+	}
+	_queuePop() {
+		let e = this._queue.length - 1;
+		return this._queueSwap(0, e), this._queueDown(0, e), this._queuePopBack();
+	}
+	_queuePopBack() {
+		let e = this._queue.pop();
+		return this._errors.pop(), this._rmsSum -= this._rms[e], this._queueIndices[e] = -1, e;
+	}
+	_queueRemove(e) {
+		let t = this._queueIndices[e];
+		if (t < 0) {
+			let t = this._pending.indexOf(e);
+			if (t !== -1) this._pending[t] = this._pending[--this._pendingLen];
+			else throw Error("Broken triangulation (something went wrong).");
+			return;
+		}
+		let n = this._queue.length - 1;
+		n !== t && (this._queueSwap(t, n), this._queueDown(t, n) || this._queueUp(t)), this._queuePopBack();
+	}
+	_queueLess(e, t) {
+		return this._errors[e] > this._errors[t];
+	}
+	_queueSwap(e, t) {
+		let n = this._queue[e], r = this._queue[t];
+		this._queue[e] = r, this._queue[t] = n, this._queueIndices[n] = t, this._queueIndices[r] = e;
+		let i = this._errors[e];
+		this._errors[e] = this._errors[t], this._errors[t] = i;
+	}
+	_queueUp(e) {
+		let t = e;
+		for (;;) {
+			let e = t - 1 >> 1;
+			if (e === t || !this._queueLess(t, e)) break;
+			this._queueSwap(e, t), t = e;
+		}
+	}
+	_queueDown(e, t) {
+		let n = e;
+		for (;;) {
+			let e = 2 * n + 1;
+			if (e >= t || e < 0) break;
+			let r = e + 1, i = e;
+			if (r < t && this._queueLess(r, e) && (i = r), !this._queueLess(i, n)) break;
+			this._queueSwap(n, i), n = i;
+		}
+		return n > e;
+	}
+};
+function G(e, t, n, r, i, a) {
+	return (n - i) * (t - a) - (r - a) * (e - i);
+}
+function ut(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;
+}
+//#endregion
+//#region src/sdk/utils/trajectory.ts
+function dt(e, t) {
+	if (!t || t.length < 8) return null;
+	let [n, , r] = t, i = Array(t.length / 4);
+	for (let e = 0, a = 0; e < i.length; e++, a += 4) i[e] = [
+		t[a] - n,
+		-t[a + 1],
+		r - t[a + 2]
+	];
+	let a = Je(i, !1);
+	if (!a) return null;
+	let o = t[3], s = t[t.length - 1], c = s - o, l = (e, t = !1) => {
+		let n = (e - o) / c;
+		return t && (n = z(n, 0, 1)), n < 0 || n > 1 ? null : n;
+	};
+	return {
+		id: e,
+		curve: a,
+		get measuredLength() {
+			return c;
+		},
+		get measuredTop() {
+			return o;
+		},
+		get measuredBottom() {
+			return s;
+		},
+		getPositionAtDepth: l,
+		getPointAtDepth: (e, t = !1) => {
+			let n = l(e, t);
+			return n === null ? null : a.getPointAt(n);
+		}
+	};
+}
+function ft(e, t = (e) => e, n = 1e-7) {
+	if (e.length <= 2) return e;
+	let r = t(e[0]), i = [0, 0], a = [e[0]];
+	for (let o = 1; o < e.length - 1; o++) {
+		let s = t(e[o]), c = ze(Ve(s, r));
+		Math.abs(He(i, c)) < 1 - n && (a.push(e[o]), i = c, r = s);
+	}
+	return a.push(e[e.length - 1]), a;
+}
+function pt(e, t, n = 1e3, r = 2e3, i = 0) {
+	if (!e || e.length < 1) return null;
+	let a = [], o = 0, s = [e[0][0], e[0][2]], c = e[0][1], l = c, u = 1;
+	a.push(s);
+	let d = a[a.length - 1];
+	for (; u < e.length;) {
+		let n = [e[u][0], e[u][2]];
+		e[u][1] > c && (c = e[u][1]), e[u][1] < l && (l = e[u][1]);
+		let r = W(d, n);
+		if (r < t) u === e.length - 1 && a.length > 1 && (o += r, a.push(n)), u++;
+		else if (o += t, r > t) {
+			let e = qe(d, n), r = [d[0] + e[0] * t, d[1] + e[1] * t];
+			a.push(r), d = r;
+		} else a.push(n), d = n, u++;
+	}
+	let f = a.length;
+	if (n || o < r) {
+		let e = 0, c = n;
+		o + n / 2 < r && (e = (r - o) / 2, c = e);
+		let l = [Math.cos(i), Math.sin(i)];
+		if (c) {
+			f > 1 && (l = qe(a[a.length - 2], a[a.length - 1]));
+			let e = a[a.length - 1], n = Math.floor(c / t), r = [l[0] * t, l[1] * t], i = [e[0] + l[0] * c, e[1] + l[1] * c], o = e;
+			for (let e = 0; e < n; e++) o = Be(o, r), a.push(o);
+			W(o, i) && a.push(i);
+		}
+		if (e) {
+			let n;
+			n = f > 1 ? qe(a[1], a[0]) : [-Math.cos(i), -Math.sin(i)], (o < 100 || Math.abs(He(l, n)) > .95) && (n = [-l[0], -l[1]]);
+			let r = Math.floor(e / t), c = [n[0] * t, n[1] * t], u = [s[0] + n[0] * e, s[1] + n[1] * e], d = s;
+			for (let e = 0; e < r; e++) d = Be(d, c), a.unshift(d);
+			W(d, u) && a.unshift(u);
+		}
+	}
+	return {
+		positions: a,
+		top: c,
+		bottom: l,
+		length: o
+	};
+}
+//#endregion
+//#region src/sdk/geometries/fence.ts
+function mt(e, r, i) {
+	let a = ft(e), o = Array(a.length), s = null;
+	for (let e = 0; e < a.length; e++) s === null ? o[e] = 0 : o[e] = o[s] + W(a[s], a[e]), s = e;
+	let c = o[o.length - 1], l = new n(), u = new Float32Array(a.length * 2 * 3), d = new Uint32Array((a.length - 1) * 6), f = new Float32Array(a.length * 2 * 2);
+	for (let e = 0; e < a.length; e++) {
+		let t = e * 6;
+		u[t] = a[e][0], u[t + 1] = r, u[t + 2] = a[e][1], u[t + 3] = a[e][0], u[t + 4] = i, u[t + 5] = a[e][1];
+		let n = e * 4;
+		f[n] = o[e] / c, f[n + 1] = 1, f[n + 2] = o[e] / c, f[n + 3] = 0;
+		let s = e * 2;
+		e < a.length - 1 && (d[t] = s, d[t + 1] = s + 1, d[t + 2] = s + 2, d[t + 3] = s + 2, d[t + 4] = s + 1, d[t + 5] = s + 3);
+	}
+	return l.setAttribute("position", new t(u, 3)), l.setAttribute("uv", new t(f, 2)), l.setIndex(new t(d, 1)), l.computeVertexNormals(), l;
+}
+//#endregion
+//#region src/sdk/geometries/geometry-attributes.ts
+function K(e, r, i, a, o) {
+	let s = new n();
+	s.setAttribute("position", new t(Float32Array.from(e), 3)), s.setAttribute("normal", new t(Float32Array.from(r), 3)), s.setAttribute("uv", new t(Float32Array.from(i), 2));
+	let c = e.length / 3 <= 65536 ? Uint16Array.from(a) : Uint32Array.from(a);
+	if (s.setIndex(new t(c, 1)), o) for (let e of o) s.addGroup(e[0], e[1], e[2]);
+	return s.computeBoundingBox(), s.computeBoundingSphere(), s;
+}
+function q(e, t, n = [0, 0]) {
+	if (!t) return;
+	let r = t * Math.PI / 180, [i, a] = n, o = i !== 0 || a !== 0;
+	o && e.translate(-i, 0, -a), e.rotateY(r), o && e.translate(i, 0, a), e.computeBoundingBox(), e.computeBoundingSphere();
+}
+function ht(e) {
+	let n = e.getAttribute("position"), r = Infinity, i = Infinity, a = -Infinity, o = -Infinity;
+	for (let e = 0; e < n.count; e++) {
+		let t = n.getX(e), s = n.getZ(e);
+		t < r && (r = t), t > a && (a = t), s < i && (i = s), s > o && (o = s);
+	}
+	let s = a - r || 1, c = o - i || 1, l = new Float32Array(n.count * 2);
+	for (let e = 0; e < n.count; e++) l[e * 2] = (n.getX(e) - r) / s, l[e * 2 + 1] = (n.getZ(e) - i) / c;
+	e.setAttribute("uv", new t(l, 2));
+}
+function J(e) {
+	e.computeVertexNormals();
+	let t = e.getAttribute("normal"), n = 0;
+	for (let e = 0; e < t.count; e++) n += t.getY(e);
+	if (n < 0) {
+		let t = e.getIndex();
+		if (t) {
+			let e = t.array;
+			for (let t = 0; t + 2 < e.length; t += 3) {
+				let n = e[t + 1];
+				e[t + 1] = e[t + 2], e[t + 2] = n;
+			}
+			t.needsUpdate = !0;
+		}
+		e.computeVertexNormals();
+	}
+	e.computeBoundingBox(), e.computeBoundingSphere();
+}
+//#endregion
+//#region src/sdk/geometries/grid-sampling.ts
+function gt(e, t, n, r) {
+	let i = new Uint8Array(t * n), a = [], o = (t) => {
+		!i[t] && r(e[t]) && (i[t] = 1, a.push(t));
+	};
+	for (let e = 0; e < t; e++) o(e), o((n - 1) * t + e);
+	for (let e = 0; e < n; e++) o(e * t), o(e * t + t - 1);
+	for (; a.length;) {
+		let e = a.pop(), r = e % t, i = (e - r) / t;
+		r > 0 && o(e - 1), r < t - 1 && o(e + 1), i > 0 && o(e - t), i < n - 1 && o(e + t);
+	}
+	return i;
+}
+function _t(e, t, n, r, i, a, o) {
+	let s = Math.min(Math.max(r, 0), t - 1), c = Math.min(Math.max(i, 0), n - 1), l = Math.floor(s), u = Math.floor(c), d = Math.min(l + 1, t - 1), f = Math.min(u + 1, n - 1), p = s - l, m = c - u, h = 0, g = 0, _ = (n, r, i) => {
+		let o = e[r * t + n];
+		a(o) || (h += o * i, g += i);
+	};
+	if (_(l, u, (1 - p) * (1 - m)), _(d, u, p * (1 - m)), _(l, f, (1 - p) * m), _(d, f, p * m), g > 0) return h / g;
+	let v = Math.min(Math.max(Math.round(s), 0), t - 1), y = Math.min(Math.max(Math.round(c), 0), n - 1);
+	for (let r = 1; r <= 8; r++) {
+		let i = NaN, o = Infinity;
+		for (let s = -r; s <= r; s++) for (let c = -r; c <= r; c++) {
+			if (Math.max(Math.abs(c), Math.abs(s)) !== r) continue;
+			let l = v + c, u = y + s;
+			if (l < 0 || u < 0 || l >= t || u >= n) continue;
+			let d = e[u * t + l];
+			if (a(d)) continue;
+			let f = c * c + s * s;
+			f < o && (o = f, i = d);
+		}
+		if (!Number.isNaN(i)) return i;
+	}
+	return o;
+}
+function vt(e, t, n, r, i, a = 0, o = 0) {
+	let s = (e, t) => i(e, t) && i(e + 1, t) && i(e, t + 1) && i(e + 1, t + 1), c = (e - 1) * n || 1, l = (t - 1) * r || 1, u = [], d = [], f = [], p = [], m = new Int32Array(e * t).fill(-1), h = (t, i) => {
+		let s = i * e + t, p = m[s];
+		return p === -1 && (p = u.length / 3, m[s] = p, u.push(a + t * n, 0, o + i * r), d.push(0, 1, 0), f.push(t * n / c, i * r / l)), p;
+	};
+	for (let n = 0; n < t - 1; n++) for (let t = 0; t < e - 1; t++) {
+		if (!s(t, n)) continue;
+		let e = h(t, n), r = h(t + 1, n), i = h(t, n + 1), a = h(t + 1, n + 1);
+		p.push(e, i, r, r, i, a);
+	}
+	return K(u, d, f, p, null);
+}
+//#endregion
+//#region src/sdk/geometries/tessellation.ts
+function yt(e, t) {
+	for (let n = 0; n < t; n++) bt(e);
+}
+function bt(e) {
+	let n = e.getIndex(), r = e.getAttribute("position");
+	if (!n) return;
+	let i = n.array, a = [];
+	for (let e = 0; e < r.count; e++) a.push(r.getX(e), r.getY(e), r.getZ(e));
+	let o = [], s = /* @__PURE__ */ new Map(), c = (e, t) => {
+		let n = e < t ? `${e}_${t}` : `${t}_${e}`, r = s.get(n);
+		if (r !== void 0) return r;
+		let i = a.length / 3;
+		return a.push((a[e * 3] + a[t * 3]) / 2, (a[e * 3 + 1] + a[t * 3 + 1]) / 2, (a[e * 3 + 2] + a[t * 3 + 2]) / 2), s.set(n, i), i;
+	};
+	for (let e = 0; e + 2 < i.length; e += 3) {
+		let t = i[e], n = i[e + 1], r = i[e + 2], a = c(t, n), s = c(n, r), l = c(r, t);
+		o.push(t, a, l, a, n, s, l, s, r, a, s, l);
+	}
+	let l = a.length / 3;
+	e.setAttribute("position", new t(Float32Array.from(a), 3));
+	let u = l <= 65536 ? Uint16Array.from(o) : Uint32Array.from(o);
+	e.setIndex(new t(u, 1)), e.deleteAttribute("normal"), e.deleteAttribute("uv");
+}
+function xt(e, t) {
+	for (let n = 0; n < t; n++) St(e);
+}
+function St(e) {
+	let n = e.getIndex(), r = e.getAttribute("position");
+	if (!n) return;
+	let i = n.array, a = [];
+	for (let e = 0; e < r.count; e++) a.push(r.getX(e), r.getY(e), r.getZ(e));
+	let o = (e, t) => e < t ? `${e}_${t}` : `${t}_${e}`, s = /* @__PURE__ */ new Map();
+	for (let e = 0; e + 2 < i.length; e += 3) {
+		let t = [
+			i[e],
+			i[e + 1],
+			i[e + 2]
+		];
+		for (let e = 0; e < 3; e++) {
+			let n = o(t[e], t[(e + 1) % 3]);
+			s.set(n, (s.get(n) ?? 0) + 1);
+		}
+	}
+	let c = /* @__PURE__ */ new Map(), l = (e, t) => {
+		let n = o(e, t), r = c.get(n);
+		if (r !== void 0) return r;
+		let i = a.length / 3;
+		return a.push((a[e * 3] + a[t * 3]) / 2, (a[e * 3 + 1] + a[t * 3 + 1]) / 2, (a[e * 3 + 2] + a[t * 3 + 2]) / 2), c.set(n, i), i;
+	}, u = (e, t) => (s.get(o(e, t)) ?? 0) > 1, d = [];
+	for (let e = 0; e + 2 < i.length; e += 3) {
+		let t = i[e], n = i[e + 1], r = i[e + 2], a = u(t, n), o = u(n, r), s = u(r, t), c = +!!a + +!!o + +!!s;
+		if (c === 0) d.push(t, n, r);
+		else if (c === 3) {
+			let e = l(t, n), i = l(n, r), a = l(r, t);
+			d.push(t, e, a, n, i, e, r, a, i, e, i, a);
+		} else if (c === 1) if (a) {
+			let e = l(t, n);
+			d.push(t, e, r, e, n, r);
+		} else if (o) {
+			let e = l(n, r);
+			d.push(n, e, t, e, r, t);
+		} else {
+			let e = l(r, t);
+			d.push(r, e, n, e, t, n);
+		}
+		else if (!s) {
+			let e = l(t, n), i = l(n, r);
+			d.push(e, n, i, t, e, i, t, i, r);
+		} else if (a) {
+			let e = l(r, t), i = l(t, n);
+			d.push(e, t, i, r, e, i, r, i, n);
+		} else {
+			let e = l(n, r), i = l(r, t);
+			d.push(e, r, i, n, e, i, n, i, t);
+		}
+	}
+	let f = a.length / 3;
+	e.setAttribute("position", new t(Float32Array.from(a), 3));
+	let p = f <= 65536 ? Uint16Array.from(d) : Uint32Array.from(d);
+	e.setIndex(new t(p, 1)), e.deleteAttribute("normal"), e.deleteAttribute("uv");
+}
+//#endregion
+//#region src/sdk/geometries/triangulate-grid-delaunay.ts
+function Ct(e, t, n = 1, r = 1, i = -1, a = 5) {
+	let o = t, s = e.length / o;
+	console.time("delatin");
+	let c = new lt(e, o, i);
+	c.run(a), c.removeInvalidTriangles(), console.timeEnd("delatin");
+	let l = new Float32Array(c.coords.length * 1.5), u = new Float32Array(c.coords.length);
+	for (let e = 0, t = 0; e < c.coords.length; e += 2) u[e] = c.coords[e] / (o - 1), u[e + 1] = 1 - c.coords[e + 1] / (s - 1), t = e * 1.5, l[t] = c.coords[e] * n, l[t + 1] = c.heightAt(c.coords[e], c.coords[e + 1]), l[t + 2] = c.coords[e + 1] * r;
+	let d = new Uint32Array(c.triangles);
+	return console.log(c.triangles.length / 3), {
+		positions: l,
+		uvs: u,
+		indices: d
+	};
+}
+//#endregion
+//#region src/sdk/geometries/ocean-geometry.ts
+function wt(e, t, n, r, i, a, o) {
+	return (s, c) => {
+		let l = (s - e) / n, u = (c - t) / r, d = .5;
+		return d += .25 * Math.sin((l * 6 + o) * Math.PI) * Math.cos(u * 5 * Math.PI), d += .15 * Math.sin((l * 13 - o) * Math.PI + 1.7) * Math.cos(u * 11 * Math.PI - .6), d += .1 * Math.sin(l * 23 * Math.PI + .3) * Math.cos(u * 19 * Math.PI + 2.1), i + (Math.min(Math.max(d, 0), 1) * 2 - 1) * a;
+	};
+}
+function Tt(e = {}) {
+	let [t, n] = U(e.size, 1e5), [r, i] = U(e.surfaceSegments, 0), [a, o] = e.origin ?? [0, 0], s = e.rotation ?? 0, c = Math.max(1, Math.floor(r)), l = Math.max(1, Math.floor(i)), u = [], d = [], f = [], p = [];
+	for (let e = 0; e <= l; e++) for (let r = 0; r <= c; r++) u.push(a - t / 2 + r / c * t, 0, o - n / 2 + e / l * n), d.push(0, 1, 0), f.push(r / c, e / l);
+	for (let e = 0; e < l; e++) for (let t = 0; t < c; t++) {
+		let n = e * (c + 1) + t, r = n + 1, i = n + (c + 1), a = i + 1;
+		p.push(n, i, r, r, i, a);
+	}
+	let m = K(u, d, f, p);
+	return q(m, s, [a, o]), m;
+}
+function Et(e = {}) {
+	let [t, n] = U(e.size, 1e5), [r, i] = U(e.bedSegments, 32), [a, o] = e.origin ?? [0, 0], s = e.rotation ?? 0, c = e.waterDepth ?? 150, l = e.depthVariation ?? 50, u = e.seed ?? 0, d = Math.max(1, Math.floor(r)), f = Math.max(1, Math.floor(i)), p = t / 2, m = n / 2, h = a - p, g = o - m, _ = h + t, v = g + n, y = wt(h, g, t, n, c, l, u), b = Math.min(t, n) / 1e3, x = (e, t) => {
+		let n = (y(e + b, t) - y(e - b, t)) / (2 * b), r = (y(e, t + b) - y(e, t - b)) / (2 * b), i = 1 / Math.hypot(n, 1, r);
+		return [
+			n * i,
+			i,
+			r * i
+		];
+	}, S = Tt({
+		size: e.size,
+		surfaceSegments: e.surfaceSegments,
+		origin: e.origin
+	}), C = [], w = [], T = [], E = [], D = (e, t) => {
+		let n = C.length / 3;
+		for (let n = 0; n < e.length; n++) {
+			let [r, i] = e[n], a = n / (e.length - 1);
+			C.push(r, 0, i), w.push(t[0], 0, t[1]), T.push(a, 1), C.push(r, -y(r, i), i), w.push(t[0], 0, t[1]), T.push(a, 0);
+		}
+		for (let r = 0; r < e.length - 1; r++) {
+			let e = n + r * 2, i = e + 1, a = n + (r + 1) * 2, o = a + 1, s = C[e * 3], c = C[e * 3 + 1], l = C[e * 3 + 2], u = C[i * 3] - s, d = C[i * 3 + 1] - c, f = C[i * 3 + 2] - l, p = C[a * 3] - s, m = C[a * 3 + 1] - c, h = d * (C[a * 3 + 2] - l) - f * m, g = u * m - d * p;
+			h * t[0] + g * t[1] >= 0 ? E.push(e, i, a, a, i, o) : E.push(e, a, i, a, o, i);
+		}
+	}, O = (e, t, n, r, i) => {
+		let a = [];
+		for (let o = 0; o <= i; o++) {
+			let s = o / i;
+			a.push([e + (n - e) * s, t + (r - t) * s]);
+		}
+		return a;
+	};
+	D(O(h, g, _, g, d), [0, -1]), D(O(_, v, h, v, d), [0, 1]), D(O(h, v, h, g, f), [-1, 0]), D(O(_, g, _, v, f), [1, 0]);
+	let k = K(C, w, T, E), A = [], j = [], M = [], N = [];
+	for (let e = 0; e <= f; e++) for (let r = 0; r <= d; r++) {
+		let i = h + r / d * t, a = g + e / f * n;
+		A.push(i, -y(i, a), a);
+		let [o, s, c] = x(i, a);
+		j.push(o, s, c), M.push(r / d, e / f);
+	}
+	for (let e = 0; e < f; e++) for (let t = 0; t < d; t++) {
+		let n = e * (d + 1) + t, r = n + 1, i = n + (d + 1), a = i + 1;
+		N.push(n, i, r, r, i, a);
+	}
+	let ee = K(A, j, M, N);
+	return q(S, s, [a, o]), q(k, s, [a, o]), q(ee, s, [a, o]), {
+		surface: S,
+		body: k,
+		bed: ee
+	};
+}
+function Dt(e = {}) {
+	let [t, n] = U(e.size, 1e5), [r, i] = e.origin ?? [0, 0], a = e.rotation ?? 0, o = e.waterDepth ?? 150, s = e.depthVariation ?? 50, c = e.seed ?? 0, l = Math.max(3, Math.floor(e.perimeterSegments ?? 96)), u = e.radialSegments && e.radialSegments > 0 ? Math.floor(e.radialSegments) : Math.max(1, Math.ceil(l / (2 * Math.PI))), d = Math.max(t / 2, 1e-6), f = Math.max(n / 2, 1e-6), p = d * 2, m = f * 2, h = r - d, g = i - f, _ = wt(h, g, p, m, o, s, c), v = Math.min(d, f) / 1e3, y = (e, t) => {
+		let n = (_(e + v, t) - _(e - v, t)) / (2 * v), r = (_(e, t + v) - _(e, t - v)) / (2 * v), i = 1 / Math.hypot(n, 1, r);
+		return [
+			n * i,
+			i,
+			r * i
+		];
+	}, b = (e, t) => {
+		let n = [], a = [], o = [], s = [], c = (r, i) => {
+			if (n.push(r, e(r, i), i), t) {
+				let [e, t, n] = y(r, i);
+				a.push(e, t, n);
+			} else a.push(0, 1, 0);
+			o.push((r - h) / p, (i - g) / m);
+		};
+		c(r, i);
+		for (let e = 1; e <= u; e++) {
+			let t = e / u;
+			for (let e = 0; e < l; e++) {
+				let n = e / l * Math.PI * 2;
+				c(r + d * t * Math.cos(n), i + f * t * Math.sin(n));
+			}
+		}
+		let _ = (e) => 1 + (e - 1) * l;
+		for (let e = 0; e < l; e++) {
+			let t = _(1) + e, n = _(1) + (e + 1) % l;
+			s.push(0, n, t);
+		}
+		for (let e = 1; e < u; e++) {
+			let t = _(e), n = _(e + 1);
+			for (let e = 0; e < l; e++) {
+				let r = (e + 1) % l, i = t + e, a = t + r, o = n + e, c = n + r;
+				s.push(i, a, o, a, c, o);
+			}
+		}
+		return K(n, a, o, s);
+	}, x = b(() => 0, !1), S = b((e, t) => -_(e, t), !0), C = [];
+	for (let e = 0; e <= l; e++) {
+		let t = e % l / l * Math.PI * 2;
+		C.push([r + d * Math.cos(t), i + f * Math.sin(t)]);
+	}
+	let w = Vt([C], _);
+	return q(x, a, [r, i]), q(w, a, [r, i]), q(S, a, [r, i]), {
+		surface: x,
+		body: w,
+		bed: S
+	};
+}
+function Ot(e, r, i = {}) {
+	let { nx: a, ny: o, xinc: s, yinc: c } = r, l = i.nullValue ?? -1, u = i.referenceDepth, [d, f] = U(i.surfaceSegments, 0), p = i.maxError ?? 5, m = Math.max(0, Math.floor(i.rimSmoothing ?? 0)), h = (e) => e === l || e < 0, g = (e) => u === void 0 ? e : u - e, _ = Infinity, v = -Infinity;
+	for (let t = 0; t < e.length; t++) {
+		let n = e[t];
+		h(n) || (n < _ && (_ = n), n > v && (v = n));
+	}
+	Number.isFinite(v) || (v = 0), Number.isFinite(_) || (_ = 0);
+	let y = i.fillDepth ?? (u === void 0 ? v : _), b = gt(e, a, o, h), x = Float32Array.from(e, (e, t) => b[t] ? l : h(e) ? y : e), S = (a - 1) * s, C = (o - 1) * c, w = r.rot * (Math.PI / 180), T = Ct(x, a, s, c, l, p), E = T.positions;
+	for (let e = 1; e < E.length; e += 3) E[e] = -g(E[e]);
+	let D = Math.max(d, f), O = new n();
+	O.setAttribute("position", new t(E, 3)), O.setAttribute("uv", new t(T.uvs, 2)), O.setIndex(new t(T.indices, 1));
+	let k = de(O);
+	m > 0 && fe(O, k, m), J(O);
+	let A = O.getAttribute("position"), j = k.map((e) => {
+		let t = e.map((e) => [
+			A.getX(e),
+			A.getY(e),
+			A.getZ(e)
+		]);
+		return t.length > 0 && t.push(t[0]), t;
+	}), M = null;
+	if (D > 0) {
+		let e = Math.max(1, Math.floor(d || f)), t = Math.max(1, Math.floor(f || d));
+		M = Lt(Rt(k.map((e) => e.map((e) => [A.getX(e), -A.getZ(e)]))), e, t, 0, 0, S, C);
+	}
+	M ||= zt(O);
+	let N = Bt(j);
+	for (let e of [
+		M,
+		N,
+		O
+	]) e.translate(0, 0, -(o - 1) * c), e.rotateY(w), e.computeBoundingBox(), e.computeBoundingSphere();
+	return {
+		surface: M,
+		body: N,
+		bed: O
+	};
+}
+function kt(e, t = {}) {
+	let n = t.waterDepth ?? 150, r = t.depthVariation ?? 50, i = t.seed ?? 0, [a, o] = U(t.surfaceSegments, 0), [s, c] = U(t.bedSegments, 48), [l, u] = e.min, [d, f] = e.max, p = l, m = Math.max(d - l, 1e-6), h = wt(p, -f, m, Math.max(f - u, 1e-6), n, r, i), g = e.toShapes(), _ = e.coordinates, v = jt(g, At(Math.max(Math.max(0, Math.floor(a)), Math.max(0, Math.floor(o))))), y = jt(g, At(Math.max(Math.max(0, Math.floor(s)), Math.max(0, Math.floor(c)))));
+	Ht(y, h), J(y);
+	let b = [];
+	for (let e of _) for (let t of e) {
+		let e = t.map(([e, t]) => [e, -t]);
+		e.length > 0 && e.push(e[0]), b.push(e);
+	}
+	return {
+		surface: v,
+		body: Vt(b, h),
+		bed: y
+	};
+}
+function At(e) {
+	return e <= 0 ? 0 : Math.min(Math.max(Math.round(Math.log2(e / 12)), 0), 5);
+}
+function jt(e, t = 0) {
+	let n = new w(e);
+	return n.rotateX(-Math.PI / 2), t > 0 && xt(n, t), ht(n), J(n), n;
+}
+function Mt(e, t, n) {
+	let r = !1;
+	for (let i = 0, a = n.length - 1; i < n.length; a = i++) {
+		let o = n[i][0], s = n[i][1], c = n[a][0], l = n[a][1];
+		s > t != l > t && e < (c - o) * (t - s) / (l - s) + o && (r = !r);
+	}
+	return r;
+}
+function Nt(e, t, n) {
+	for (let r of n) {
+		if (!Mt(e, t, r[0])) continue;
+		let n = !1;
+		for (let i = 1; i < r.length; i++) if (Mt(e, t, r[i])) {
+			n = !0;
+			break;
+		}
+		if (!n) return !0;
+	}
+	return !1;
+}
+function Pt(e) {
+	let t = 0;
+	for (let n = 0, r = e.length - 1; n < e.length; r = n++) t += e[r][0] * e[n][1] - e[n][0] * e[r][1];
+	return t / 2;
+}
+function Ft(e) {
+	let t = 0, n = 0;
+	for (let [r, i] of e) t += r, n += i;
+	return [t / e.length, n / e.length];
+}
+function It(e) {
+	let r = [], i = [], a = /* @__PURE__ */ new Map(), o = (e, t) => `${Math.round(e * 1e3)}_${Math.round(t * 1e3)}`;
+	for (let t of e) {
+		let e = t.getAttribute("position"), n = t.getIndex(), s = [];
+		for (let t = 0; t < e.count; t++) {
+			let n = e.getX(t), i = e.getY(t), c = e.getZ(t), l = o(n, c), u = a.get(l);
+			u === void 0 && (u = r.length / 3, a.set(l, u), r.push(n, i, c)), s.push(u);
+		}
+		if (n) for (let e = 0; e < n.count; e++) i.push(s[n.getX(e)]);
+		else for (let t = 0; t < e.count; t++) i.push(s[t]);
+	}
+	let s = new n();
+	s.setAttribute("position", new t(Float32Array.from(r), 3));
+	let c = r.length / 3;
+	return s.setIndex(new t(c <= 65536 ? Uint16Array.from(i) : Uint32Array.from(i), 1)), s;
+}
+function Lt(e, t, n, r, i, a, o) {
+	let s = a / t, c = o / n, l = t + 1, u = n + 1, d = s / 2, f = c / 2, p = vt(l, u, s, c, (t, n) => {
+		let a = r + t * s, o = i + n * c;
+		return Nt(a, -o, e) && Nt(a - d, -(o - f), e) && Nt(a + d, -(o - f), e) && Nt(a - d, -(o + f), e) && Nt(a + d, -(o + f), e);
+	}, r, i), h = p.getIndex();
+	if (!h || h.count === 0) return null;
+	let g = p.getAttribute("position"), _ = de(p).map((e) => e.map((e) => [g.getX(e), -g.getZ(e)]));
+	if (_.length === 0) return null;
+	let v = _.map(Pt), y = 0;
+	for (let e = 1; e < v.length; e++) Math.abs(v[e]) > Math.abs(v[y]) && (y = e);
+	let b = Math.sign(v[y]) || 1, x = (e) => e.map(([e, t]) => new j(e, t)), S = [], T = [];
+	for (let t of e) {
+		S.push({
+			ring: t[0],
+			area: Math.abs(Pt(t[0]))
+		});
+		for (let e = 1; e < t.length; e++) T.push(t[e]);
+	}
+	for (let e = 0; e < _.length; e++) Math.sign(v[e]) === b ? T.push(_[e]) : S.push({
+		ring: _[e],
+		area: Math.abs(v[e])
+	});
+	let E = S.map((e) => new C(x(e.ring)));
+	for (let e of T) {
+		let [t, n] = e[0], r = -1, i = Infinity;
+		for (let e = 0; e < S.length; e++) S[e].area < i && Mt(t, n, S[e].ring) && (r = e, i = S[e].area);
+		r >= 0 && E[r].holes.push(new m(x(e)));
+	}
+	let D = new w(E);
+	D.rotateX(-Math.PI / 2);
+	let O = It([p, D]);
+	return ht(O), J(O), O;
+}
+function Rt(e) {
+	let t = e.filter((e) => e.length >= 3), n = t.map(Pt), r = t.map(Ft), i = (e) => {
+		let i = -1, a = Infinity;
+		for (let o = 0; o < t.length; o++) o === e || Math.abs(n[o]) <= Math.abs(n[e]) || Mt(r[e][0], r[e][1], t[o]) && Math.abs(n[o]) < a && (a = Math.abs(n[o]), i = o);
+		return i;
+	}, a = t.map((e, t) => i(t)), o = [], s = /* @__PURE__ */ new Map();
+	return t.forEach((e, t) => {
+		a[t] === -1 && (s.set(t, o.length), o.push([e]));
+	}), t.forEach((e, t) => {
+		if (a[t] !== -1 && a[a[t]] === -1) {
+			let n = s.get(a[t]);
+			n !== void 0 && o[n].push(e);
+		}
+	}), o;
+}
+function zt(e) {
+	let r = e.getAttribute("position"), i = new Float32Array(r.count * 3), a = new Float32Array(r.count * 3);
+	for (let e = 0; e < r.count; e++) i[e * 3] = r.getX(e), i[e * 3 + 2] = r.getZ(e), a[e * 3 + 1] = 1;
+	let o = new n();
+	o.setAttribute("position", new t(i, 3)), o.setAttribute("normal", new t(a, 3));
+	let s = e.getAttribute("uv");
+	s && o.setAttribute("uv", new t(Float32Array.from(s.array), 2));
+	let c = e.getIndex();
+	return c && o.setIndex(new t(Uint32Array.from(c.array), 1)), o.computeBoundingBox(), o.computeBoundingSphere(), o;
+}
+function Bt(e) {
+	let t = [], n = [], r = [], i = [];
+	for (let a of e) {
+		if (a.length < 2) continue;
+		let e = t.length / 3;
+		for (let e = 0; e < a.length; e++) {
+			let [i, o, s] = a[e], c = e / (a.length - 1), l = a[Math.max(0, e - 1)], u = a[Math.min(a.length - 1, e + 1)], d = u[0] - l[0], f = u[2] - l[2], p = Math.hypot(d, f) || 1;
+			d /= p, f /= p;
+			let m = f, h = -d;
+			t.push(i, 0, s), n.push(m, 0, h), r.push(c, 1), t.push(i, o, s), n.push(m, 0, h), r.push(c, 0);
+		}
+		for (let t = 0; t < a.length - 1; t++) {
+			let n = e + t * 2, r = n + 1, a = e + (t + 1) * 2, o = a + 1;
+			i.push(n, r, a, a, r, o);
+		}
+	}
+	return K(t, n, r, i);
+}
+function Vt(e, t) {
+	let n = [], r = [], i = [], a = [];
+	for (let o of e) {
+		if (o.length < 2) continue;
+		let e = n.length / 3;
+		for (let e = 0; e < o.length; e++) {
+			let [a, s] = o[e], c = e / (o.length - 1), l = o[Math.max(0, e - 1)], u = o[Math.min(o.length - 1, e + 1)], d = u[0] - l[0], f = u[1] - l[1], p = Math.hypot(d, f) || 1;
+			d /= p, f /= p;
+			let m = f, h = -d;
+			n.push(a, 0, s), r.push(m, 0, h), i.push(c, 1), n.push(a, -t(a, s), s), r.push(m, 0, h), i.push(c, 0);
+		}
+		for (let t = 0; t < o.length - 1; t++) {
+			let n = e + t * 2, r = n + 1, i = e + (t + 1) * 2, o = i + 1;
+			a.push(n, r, i, i, r, o);
+		}
+	}
+	return K(n, r, i, a);
+}
+function Ht(e, t) {
+	let n = e.getAttribute("position");
+	for (let e = 0; e < n.count; e++) n.setY(e, -t(n.getX(e), n.getZ(e)));
+	n.needsUpdate = !0;
+}
+//#endregion
+//#region src/sdk/geometries/packing.ts
+function Ut(e) {
+	if (e.constructor === Uint8Array) return "Uint8Array";
+	if (e.constructor === Uint16Array) return "Uint16Array";
+	if (e.constructor === Uint32Array) return "Uint32Array";
+	if (e.constructor === Int8Array) return "Int8Array";
+	if (e.constructor === Int16Array) return "Int16Array";
+	if (e.constructor === Int32Array) return "Int32Array";
+	if (e.constructor === Float32Array) return "Float32Array";
+	if (e.constructor === Float64Array) return "Float64Array";
+	throw Error("Unsupported typed array!");
+}
+function Wt(e, t) {
+	switch (t) {
+		case "Uint8Array": return new Uint8Array(e);
+		case "Uint16Array": return new Uint16Array(e);
+		case "Uint32Array": return new Uint32Array(e);
+		case "Int8Array": return new Int8Array(e);
+		case "Int16Array": return new Int16Array(e);
+		case "Int32Array": return new Int32Array(e);
+		case "Float32Array": return new Float32Array(e);
+		case "Float64Array": return new Float64Array(e);
+		default: throw Error("Unsupported typed array!");
+	}
+}
+function Gt(e, t = 1) {
+	return {
+		buffer: e.buffer,
+		attributeType: Ut(e),
+		itemSize: t
+	};
+}
+function Kt(e) {
+	let t = [], n = {
+		drawRange: e.drawRange || {
+			start: 0,
+			count: Infinity
+		},
+		groups: e.groups || [],
+		attributes: {},
+		index: e.index,
+		indexType: e.index ? Ut(e.index) : void 0,
+		userData: e.userData ? structuredClone(e.userData) : void 0
+	};
+	for (let r in e.attributes) n.attributes[r] = Gt(e.attributes[r].array, e.attributes[r].itemSize), t.push(n.attributes[r].buffer);
+	return [n, t];
+}
+function qt(e) {
+	let t = [], n = {
+		drawRange: e.drawRange,
+		groups: e.groups,
+		attributes: {},
+		index: void 0,
+		indexType: void 0
+	}, r = e.getIndex();
+	r && (n.index = r.array.buffer, n.indexType = Ut(r.array));
+	for (let r in e.attributes) {
+		let i = e.getAttribute(r);
+		n.attributes[r] = {
+			buffer: i.array.buffer,
+			attributeType: Ut(i.array),
+			itemSize: i.itemSize
+		}, t.push(n.attributes[r].buffer);
+	}
+	return e.userData && (n.userData = structuredClone(e.userData)), [n, t];
+}
+function Jt(e) {
+	let t = {}, n = [];
+	for (let r in e) {
+		let i = e[r], a = qt(i);
+		t[r] = a[0], a[1].length && n.push(...a[1]);
+	}
+	return {
+		data: t,
+		transferrables: n
+	};
+}
+function Yt(e) {
+	let r = new n();
+	if (e.index) {
+		let n = new t(Wt(e.index, e.indexType || "Uint32Array"), 1);
+		r.setIndex(n);
+	}
+	for (let n in e.attributes) {
+		let i = new t(Wt(e.attributes[n].buffer, e.attributes[n].attributeType), e.attributes[n].itemSize);
+		r.setAttribute(n, i);
+	}
+	return r.drawRange = e.drawRange, r.groups = e.groups, e.userData && (r.userData = e.userData), r;
+}
+function Xt(e) {
+	let r = {};
+	for (let i in e) {
+		let a = new n();
+		if (e[i].index) {
+			let n = new t(Wt(e[i].index, e[i].indexType || "Uint32Array"), 1);
+			a.setIndex(n);
+		}
+		for (let n in e[i].attributes) {
+			let r = new t(Wt(e[i].attributes[n].buffer, e[i].attributes[n].attributeType), e[i].attributes[n].itemSize);
+			a.setAttribute(n, r);
+		}
+		a.drawRange = e[i].drawRange, a.groups = e[i].groups, r[i] = a;
+	}
+	return r;
+}
+//#endregion
+//#region src/sdk/geometries/planar-geometry.ts
+var Zt = class {
+	type;
+	coordinates;
+	_min = null;
+	_max = null;
+	_size = null;
+	_offset = [0, 0];
+	constructor(e, t, n) {
+		this.type = e, this.coordinates = t, n && (this._offset[0] = n[0], this._offset[1] = n[1]);
+	}
+	static fromPointCoordinates(e, t) {
+		return new Qt(t ? e.map(t) : e);
+	}
+	static fromLineCoordinates(e, t) {
+		return new $t(t ? e.map((e) => e.map(t)) : e);
+	}
+	static fromPolygonCoordinates(e, t) {
+		return new en(t ? e.map((e) => e.map((e) => e.map(t))) : e);
+	}
+	_calculateBounds() {
+		let e = [Infinity, Infinity], t = [-Infinity, -Infinity];
+		this.forEachCoordinate((n) => {
+			n[0] < e[0] && (e[0] = n[0]), n[0] > t[0] && (t[0] = n[0]), n[1] < e[1] && (e[1] = n[1]), n[1] > t[1] && (t[1] = n[1]);
+		}), this._min = e, this._max = t, this._size = [t[0] - e[0], t[1] - e[1]];
+	}
+	get min() {
+		return this._min || this._calculateBounds(), [...this._min];
+	}
+	get max() {
+		return this._max || this._calculateBounds(), [...this._max];
+	}
+	get center() {
+		return (!this._min || !this._max || !this._size) && this._calculateBounds(), [this.min[0] + this.size[0] / 2, this.min[1] + this.size[1] / 2];
+	}
+	get size() {
+		return this._size || this._calculateBounds(), [...this._size];
+	}
+	get offset() {
+		return [...this._offset];
+	}
+	setOffset(e) {
+		this.forEachCoordinate((t) => {
+			t[0] -= e[0], t[1] -= e[1];
+		}), this._min && (this._min[0] -= e[0], this._min[1] -= e[1]), this._max && (this._max[0] -= e[0], this._max[1] -= e[1]), this._offset[0] += e[0], this._offset[1] += e[1];
+	}
+	removeOffset() {
+		(this._offset[0] !== 0 || this._offset[1] !== 0) && (this.forEachCoordinate((e) => {
+			e[0] += this._offset[0], e[1] += this._offset[1];
+		}), this._min = null, this._max = null, this._size = null, this._offset = [0, 0]);
+	}
+	centralize() {
+		this.setOffset(this.center);
+	}
+	normalize(e = [1, 1], t = [0, 0]) {
+		this.centralize();
+		let n = this.getBounds();
+		this.forEachCoordinate((r) => {
+			r[0] = z((r[0] - n.min[0]) / n.size[0]) * e[0] + t[0], r[1] = z((r[1] - n.min[1]) / n.size[1]) * e[1] + t[1];
+		});
+	}
+	transform(e) {
+		(this._offset[0] !== 0 || this._offset[1] !== 0) && this.removeOffset(), this.forEachCoordinate((t) => {
+			let n = e(t);
+			t[0] = n[0], t[1] = n[1];
+		}), this._min = null, this._max = null, this._size = null;
+	}
+	toObject() {
+		return {
+			type: this.type.toString(),
+			coordinates: structuredClone(this.coordinates),
+			offset: this.offset
+		};
+	}
+	getPointsFlattened() {
+		let e = [];
+		return this.forEachCoordinate((t) => {
+			e.push(new j(t[0], t[1]));
+		}), e;
+	}
+	getBounds() {
+		return {
+			min: this.min,
+			max: this.max,
+			size: this.size
+		};
+	}
+}, Qt = class e extends Zt {
+	constructor(e, t) {
+		super("point2d", e, t);
+	}
+	forEachCoordinate(e) {
+		this.coordinates.forEach((t) => e(t));
+	}
+	getPoints() {
+		return this.coordinates.map((e) => [new j(e[0], e[1])]);
+	}
+	clone() {
+		return new e(structuredClone(this.coordinates), this.offset);
+	}
+}, $t = class e extends Zt {
+	constructor(e, t) {
+		super("line2d", e, t);
+	}
+	forEachCoordinate(e) {
+		this.coordinates.forEach((t) => t.forEach((t) => e(t)));
+	}
+	getPoints() {
+		return this.coordinates.map((e) => e.map((e) => new j(e[0], e[1])));
+	}
+	clone() {
+		return new e(structuredClone(this.coordinates), this.offset);
+	}
+}, en = class e extends Zt {
+	constructor(e, t) {
+		super("polygon2d", e, t);
+	}
+	forEachCoordinate(e) {
+		this.coordinates.forEach((t) => t.forEach((t) => t.forEach((t) => e(t))));
+	}
+	getPoints() {
+		return this.coordinates.map((e) => e.reduce((e, t) => e.concat(t.map((e) => new j(e[0], e[1]))), []));
+	}
+	clone() {
+		return new e(structuredClone(this.coordinates), this._offset);
+	}
+	toShapes() {
+		let e = [], t = (e, t) => {
+			e.moveTo(t[0][0], t[0][1]);
+			for (let n = 1; n < t.length; n++) e.lineTo(t[n][0], t[n][1]);
+			e.closePath();
+		};
+		return this.coordinates.forEach((n) => {
+			let r = new C(), i = n[0];
+			t(r, i);
+			for (let e = 1; e < n.length; e++) {
+				let i = new m();
+				t(i, n[e]), r.holes.push(i);
+			}
+			e.push(r);
+		}), e;
+	}
+};
+//#endregion
+//#region src/sdk/geometries/triangulate-grid.ts
+function tn(e, t, n = 1, r = 1, i = (e) => e) {
+	console.time("triangulate");
+	let a = [], o = [], s = [], c = [], l = e.length / t, u, d, f, p, m, h, g, _, v, y, b, x, S, C, w, T, E, D, O, k, A, j, M, N, ee = 0, te = 0, ne = 0, P = Array(t).fill(null), F = Array(t).fill(null), I = Array(t - 1).fill(null);
+	function L(e, i, o) {
+		return a.push({
+			x: e * n,
+			y: o,
+			z: i * r,
+			edge: null
+		}), s.push(e / (t - 1), 1 - i / (l - 1)), ee++;
+	}
+	function R(e, t, n) {
+		O = {
+			index: te++,
+			tail: e,
+			head: t,
+			twin: null,
+			prev: null,
+			next: null
+		}, k = {
+			index: te++,
+			tail: t,
+			head: n,
+			twin: null,
+			prev: null,
+			next: null
+		}, A = {
+			index: te++,
+			tail: n,
+			head: e,
+			twin: null,
+			prev: null,
+			next: null
+		}, O.next = k, k.next = A, A.next = O, O.prev = A, k.prev = O, A.prev = k, a[e].edge || (a[e].edge = O), a[t].edge || (a[t].edge = k), a[n].edge || (a[n].edge = A), o.push(O, k, A), c.push(e, t, n);
+	}
+	for (T = 1; T < l - 1; T++) {
+		N = !1;
+		let n = P;
+		for (P = F, F = n.fill(null), j = null, D = T - 1, ne += t, w = 1; w < t - 1; w++) E = w - 1, y = ne + w, v = y - 1, _ = y - t, g = _ - 1, b = i(e[g]), x = i(e[_]), S = i(e[v]), C = i(e[y]), M = b !== null && x !== null && S !== null && C !== null ? 1 : b !== null && x !== null && S !== null ? 2 : b !== null && x !== null && C !== null ? 3 : b !== null && S !== null && C !== null ? 4 : x !== null && S !== null && C !== null ? 5 : 0, f = null, p = null, M === 0 ? (I[E] = null, j = null) : (N ? (u = P[E], f = F[E]) : (M !== 5 && (P[E] === null ? (u = L(E, D, b), P[E] = u) : u = P[E]), M !== 3 && (f = L(E, T, S)), F[E] = f), M !== 4 && (P[w] === null ? (d = L(w, D, x), P[w] = d) : d = P[w]), M !== 2 && (p = L(w, T, C)), M === 1 ? (m = Math.abs(a[u].y - a[p].y), h = Math.abs(a[d].y - a[f].y), m < h ? (R(u, f, p), j !== null && (o[o.length - 3].twin = j, j.twin = o[o.length - 3]), R(p, d, u), I[E] !== null && (o[o.length - 2].twin = I[E], I[E].twin = o[o.length - 2]), o[o.length - 4].twin = o[o.length - 1], o[o.length - 1].twin = o[o.length - 4], I[E] = o[o.length - 5], j = o[o.length - 3]) : (R(u, f, d), I[E] !== null && (o[o.length - 1].twin = I[E], I[E].twin = o[o.length - 1]), j !== null && (o[o.length - 3].twin = j, j.twin = o[o.length - 3]), R(d, f, p), o[o.length - 5].twin = o[o.length - 3], o[o.length - 3].twin = o[o.length - 5], I[E] = o[o.length - 2], j = o[o.length - 1])) : M === 2 ? (R(u, f, d), I[E] !== null && (o[o.length - 1].twin = I[E], I[E].twin = o[o.length - 1]), j !== null && (o[o.length - 3].twin = j, j.twin = o[o.length - 3]), I[E] = null, j = null) : M === 5 ? (R(d, f, p), I[E] = o[o.length - 2], j = o[o.length - 1]) : M === 3 ? (R(d, u, p), I[E] !== null && (o[o.length - 3].twin = I[E], I[E].twin = o[o.length - 3]), I[E] = null, j = o[o.length - 1]) : (R(u, f, p), j !== null && (o[o.length - 3].twin = j, j.twin = o[o.length - 3]), I[E] = o[o.length - 2], j = null)), F[w] = p, N = !!M;
+	}
+	return console.timeEnd("triangulate"), console.log(c.length / 3), {
+		vertices: a,
+		indices: c,
+		uvs: s,
+		edges: o
+	};
+}
+//#endregion
+//#region src/events/camera-events.ts
+var nn = "camera-set-position", rn = "camera-focus-point", an = class extends CustomEvent {
+	constructor(e) {
+		super(nn, { detail: e });
+	}
+}, on = class extends CustomEvent {
+	constructor(e) {
+		super(rn, { detail: e });
+	}
+}, Y = new M(), X = new M(), Z = new M(), sn = new M(), cn = new M();
+async function ln(e, t, n) {
+	n.normalizeRotations();
+	let r = Math.min(n.distance, t);
+	return Y.set(...e), n.getPosition(X), Z.subVectors(Y, X), t = Math.min(Z.length() * 1.5, r), Z.normalize(), X.copy(Y).addScaledVector(Z, -r), n.setLookAt(X.x, X.y, X.z, Y.x, Y.y, Y.z, !0);
+}
+function un(e, t) {
+	t.normalizeRotations(), sn.set(...e), t.getTarget(Y), cn.subVectors(Y, sn), t.getPosition(X), X.sub(cn), t.setPosition(X.x, X.y, X.z), t.setTarget(sn.x, sn.y, sn.z);
+}
+var dn = class {
+	controls = null;
+	removeEventlisteners = null;
+	constructor() {
+		this.setControls = this.setControls.bind(this);
+	}
+	addEventListeners() {
+		let e = (e) => {
+			this.controls && un(e.detail, this.controls);
+		}, t = (e) => {
+			if (this.controls) {
+				let t = e.detail.callback;
+				ln(e.detail.point, e.detail.distance || 200, this.controls).then(() => {
+					t && t();
+				});
+			}
+		};
+		addEventListener(nn, e), addEventListener(rn, t), this.removeEventlisteners = () => {
+			removeEventListener(nn, e), removeEventListener(rn, t);
+		};
+	}
+	async setTarget(e) {
+		let t = this.controls;
+		return t ? (Y.set(...e), t.getPosition(X), Z.subVectors(Y, X), Z.normalize(), t.setLookAt(X.x, X.y, X.z, Y.x, Y.y, Y.z, !0)) : null;
+	}
+	setControls(e) {
+		this.controls = e, this.removeEventlisteners && this.removeEventlisteners(), this.addEventListeners();
+	}
+	dispose() {
+		this.controls = null, this.removeEventlisteners && this.removeEventlisteners();
+	}
+}, fn = "wellbore-selected", pn = "wellbore-added", mn = "wellbore-removed", hn = class extends CustomEvent {
+	constructor(e) {
+		super(fn, { detail: e });
+	}
+}, gn = class extends CustomEvent {
+	constructor(e) {
+		super(pn, { detail: e });
+	}
+}, _n = class extends CustomEvent {
+	constructor(e) {
+		super(mn, { detail: e });
+	}
+}, vn = new M(), yn = class {
+	map = /* @__PURE__ */ new Map();
+	constructor() {
+		this.onWellboreAdded = this.onWellboreAdded.bind(this), this.onWellboreRemoved = this.onWellboreRemoved.bind(this), addEventListener(pn, this.onWellboreAdded), addEventListener(mn, this.onWellboreRemoved);
+	}
+	onWellboreAdded(e) {
+		this.map.set(e.detail.id, {
+			wellboreId: e.detail.id,
+			object: e.detail.object
+		});
+	}
+	onWellboreRemoved(e) {
+		this.map.delete(e.detail.id);
+	}
+	getInfo(e) {
+		let t = this.map.get(e);
+		if (t) return t.object.getWorldPosition(vn), {
+			...t,
+			position: vn.toArray()
+		};
+	}
+	dispose() {
+		removeEventListener(pn, this.onWellboreAdded), removeEventListener(mn, this.onWellboreRemoved);
+	}
+}, bn = "+proj=longlat +ellps=WGS84 +datum=WGS84 +no_defs", xn = class {
+	utmDef;
+	originWgs84;
+	originUtm;
+	_projection;
+	constructor(e, t, n = "lnglat") {
+		this.utmDef = e, this._projection = L(bn, e), n === "lnglat" ? (this.originWgs84 = t, this.originUtm = this.wgs84ToUtm(t)) : (this.originWgs84 = this.utmToWgs84(t), this.originUtm = t);
+	}
+	utmToWgs84(e) {
+		return this._projection.inverse(e);
+	}
+	wgs84ToUtm(e) {
+		return this._projection.forward(e);
+	}
+	utmToWorld(e, t, n) {
+		return {
+			x: e - this.originUtm[0],
+			y: n,
+			z: this.originUtm[1] - t
+		};
+	}
+	worldToUtm(e, t, n) {
+		return {
+			easting: e + this.originUtm[0],
+			altitude: t,
+			northing: this.originUtm[1] - n
+		};
+	}
+	wgs84ToWorld(e, t, n = 0) {
+		let r = this.wgs84ToUtm([e, t]);
+		return this.utmToWorld(r[0], r[1], n);
+	}
+	worldToWgs84(e, t, n) {
+		let r = this.worldToUtm(e, t, n), i = this.utmToWgs84([r.easting, r.northing]);
+		return {
+			lng: i[0],
+			lat: i[1],
+			alt: t
+		};
+	}
+};
+function Sn(e) {
+	let [, t, n] = (/* @__PURE__ */ new RegExp(/^([0-9]{2})([N|S]?)$/)).exec(e) || [];
+	return `+proj=utm +zone=${t}${n === "S" ? " +south" : ""} +ellps=intl +towgs84=-87,-98,-121,0,0,0,0 +units=m +no_defs`;
+}
+function Cn([e, t]) {
+	if (t > 55 && t < 64 && e > 2 && e < 6) return "32N";
+	if (t > 71 && e >= 6 && e < 9) return "31N";
+	if (t > 71 && (e >= 9 && e < 12 || e >= 18 && e < 21)) return "33N";
+	if (t > 71 && (e >= 21 && e < 24 || e >= 30 && e < 33)) return "35N";
+	if (e >= -180 && e <= 180) {
+		let n = Math.floor((e + 180) / 6) % 60 + 1;
+		return t < 0 ? `${n}S` : `${n}N`;
+	}
+	throw Error(`getUtmZoneFromLatLng: Cannot figure out UTM zone from give Lat: ${t}, Lng: ${e}`);
+}
+//#endregion
+//#region src/sdk/utils/colors.ts
+var wn = (e) => `#${e.toString(16).padStart(6, "0")}`;
+function Tn() {
+	let e = "#";
+	for (let t = 0; t < 6; t++) e += "123456789ABCDEF"[Math.floor(Math.random() * 16)];
+	return e;
+}
+//#endregion
+//#region src/sdk/utils/conversions.ts
+function En(e) {
+	return e / 3.28084;
+}
+function Dn(e) {
+	return Math.PI / 180 * e;
+}
+var On = (e, t = 1, n = 1) => [e[0] / t * 2 - 1, -(e[1] / n) * 2 + 1], kn = (e, t = 1, n = 1) => [(e[0] + 1) / 2 * t, (1 - e[1]) / 2 * n], An = "#include <common>\n\nvarying vec2 vUv;\n\nvoid main() {\n  vUv = uv;\n  gl_Position = vec4(position, 1.0);\n}", jn = "#include <common>\n#include <packing>\n\nvarying vec2 vUv;\nuniform sampler2D depthTexture;\nuniform float cameraFar;\nuniform float cameraNear;\n\nfloat linearizeDepth(in float depth) {\n  float a = cameraFar / (cameraFar - cameraNear);\n  float b = cameraFar * cameraNear / (cameraNear - cameraFar);\n\n  return a + b / depth;\n}\n\nfloat linearizeLogDepth(in float depth) {\n  float z = exp2(depth * log2(cameraFar + 1.0)) - 1.0;\n  return linearizeDepth(z);\n}\n\nvoid main() {\n  float depth = texture(depthTexture, vUv).r;\n  float viewZ;\n  #if defined( USE_LOGARITHMIC_DEPTH_BUFFER ) || defined( USE_LOGDEPTHBUF ) \n  viewZ = linearizeLogDepth(depth);\n  #else\n  viewZ = depth;\n  #endif\n\n  gl_FragColor = packDepthToRGBA(viewZ);\n}", Mn = class extends S {
+	constructor() {
+		super({
+			vertexShader: An,
+			fragmentShader: jn,
+			uniforms: {
+				cameraNear: { value: 0 },
+				cameraFar: { value: 1 },
+				depthTexture: { value: null },
+				cameraWasPerspective: { value: null }
+			},
+			toneMapped: !1,
+			depthWrite: !1,
+			depthTest: !1
+		});
+	}
+}, Nn = 255 / 256, Pn = new Float32Array([
+	Nn,
+	Nn / 256,
+	Nn / 256 ** 2,
+	Nn / 256 ** 3
+]);
+function Fn(e, t, n, r) {
+	return e / 255 * Pn[0] + t / 255 * Pn[1] + n / 255 * Pn[2] + r / 255 * Pn[3];
+}
+//#endregion
+//#region src/sdk/utils/depth-reader.ts
+var In = new p(-1, 1, 1, -1, 0, 1), Ln = new Mn(), Rn = new b(), zn = new c(new h(2, 2), Ln), Q = null, $ = null;
+Rn.add(zn);
+async function Bn(e, t, n, r) {
+	if (!e) return null;
+	try {
+		let { width: i, height: a } = e;
+		if ((!Q || !$ || Q.width !== i || Q.height !== a) && (Q?.dispose(), $ = new Uint8Array(4 * i * a), Q = new ee(i, a, {
+			type: k,
+			format: g,
+			depthBuffer: !1,
+			stencilBuffer: !1
+		})), Ln.uniforms.depthTexture.value = e, Ln.uniforms.cameraNear.value = n.near, Ln.uniforms.cameraFar.value = n.far, Ln.uniforms.cameraWasPerspective.value = n.isPerspectiveCamera, t.setRenderTarget(Q), t.clear(), t.render(Rn, In), t.setRenderTarget(null), await t.readRenderTargetPixelsAsync(Q, 0, 0, i, a, $), r !== void 0 && Number.isFinite(r)) return Fn($[r], $[r + 1], $[r + 2], $[r + 3]) * 2 - 1;
+		{
+			let e = Array($.length / 4);
+			for (let t = 0; t < e.length; t++) {
+				let n = t * 4;
+				e[t] = Fn($[n], $[n + 1], $[n + 2], $[n + 3]) * 2 - 1;
+			}
+			return e;
+		}
+	} catch (e) {
+		return console.error(e), null;
+	}
+}
+//#endregion
+//#region src/sdk/utils/elevation-map.ts
+function Vn(e, t, n) {
+	return H(V(De(e, t), De(e, n)));
+}
+function Hn(e, t, n, r, i = 0, a = -1) {
+	let o = e.length / t, s = t - 1, c = o - 1, l = new Uint8Array(s * c * 4), u = 0, d = (n, r) => e[r * t + n];
+	for (let e = 0; e < c; e++) {
+		let t = e + 1, o = e + .5;
+		for (let c = 0; c < s; c++) {
+			let s = c + 1, f = c + .5, p = d(c, e);
+			if (p !== a) {
+				let a = d(c, t), m = d(s, e), h = d(s, t), g = (p + a + m + h) / 4, _ = [
+					c * n,
+					e * r,
+					p
+				], v = [
+					c * n,
+					t * r,
+					a
+				], y = [
+					s * n,
+					e * r,
+					m
+				], b = [
+					s * n,
+					t * r,
+					h
+				], x = [
+					f * n,
+					o * r,
+					g
+				], S = Vn(x, _, y), C = Vn(x, y, b), w = Vn(x, b, v), T = Vn(x, v, _), E = Pe(H([
+					S[0] + C[0] + w[0] + T[0],
+					S[2] + C[2] + w[2] + T[2],
+					S[1] + C[1] + w[1] + T[1]
+				]), [
+					0,
+					1,
+					0
+				], Math.PI / 180 * i), D = Math.floor((E[0] + 1) / 2 * 255), O = Math.floor((E[1] + 1) / 2 * 255), k = Math.floor((E[2] + 1) / 2 * 255);
+				l[u] = D, l[u + 1] = O, l[u + 2] = k, l[u + 3] = 255;
+			} else l[u] = 0, l[u + 1] = 0, l[u + 2] = 0, l[u + 3] = 0;
+			u += 4;
+		}
+	}
+	return l;
+}
+function Un(e, t, n) {
+	let r = new i(e, t, n);
+	return r.minFilter = o, r.magFilter = o, r.flipY = !0, r.anisotropy = 4, r.needsUpdate = !0, r;
+}
+function Wn(e, t, n) {
+	let r = new i(e, t, n, v, a);
+	return r.minFilter = o, r.magFilter = o, r.needsUpdate = !0, r.flipY = !0, r;
+}
+function Gn(e, t, n, r, i) {
+	let a = new Uint8Array(t * n * 2), o = (r, i) => {
+		let a = r < 0 ? 0 : r >= n ? n - 1 : r, o = i < 0 ? 0 : i >= t ? t - 1 : i;
+		return e[a * t + o];
+	};
+	for (let s = 0; s < n; s++) for (let n = 0; n < t; n++) {
+		let c = s * t + n, l = e[c], u = 0, d = 1e-4, f = 0;
+		if (l >= 0) {
+			let e = o(s - 1, n - 1), t = o(s - 1, n + 1), a = o(s + 1, n - 1), c = o(s + 1, n + 1), p = [
+				-r,
+				e - l,
+				-i
+			], m = [
+				r,
+				t - l,
+				-i
+			], h = [
+				-r,
+				a - l,
+				i
+			], g = [
+				r,
+				c - l,
+				i
+			];
+			if (e >= 0 && t >= 0) {
+				let e = V(m, p);
+				u += e[0], d += e[1], f += e[2];
+			}
+			if (t >= 0 && c >= 0) {
+				let e = V(g, m);
+				u += e[0], d += e[1], f += e[2];
+			}
+			if (a >= 0 && c >= 0) {
+				let e = V(h, g);
+				u += e[0], d += e[1], f += e[2];
+			}
+			if (c >= 0 && e >= 0) {
+				let e = V(p, h);
+				u += e[0], d += e[1], f += e[2];
+			}
+		}
+		let p = H([
+			u,
+			d,
+			f
+		]), m = c * 2;
+		a[m] = Math.round((p[0] + 1) / 2 * 255), a[m + 1] = Math.round((p[2] + 1) / 2 * 255);
+	}
+	return a;
+}
+function Kn(e, t, n) {
+	let r = new i(e, t, n, _, k);
+	return r.minFilter = o, r.magFilter = o, r.flipY = !0, r.needsUpdate = !0, r;
+}
+//#endregion
+//#region src/sdk/utils/glyphs.ts
+function qn(e) {
+	let t = new Map(e.chars.map((e, t) => [e.id, {
+		index: t,
+		spacing: e.xadvance
+	}])), n = (e) => {
+		let n = [], r = 0;
+		for (let i = 0; i < e.length; i++) {
+			let a = e.charCodeAt(i);
+			t.has(a) || (a = 32);
+			let o = t.get(a);
+			o && (n.push(o.index), r += o.spacing);
+		}
+		return {
+			indices: n,
+			width: r
+		};
+	}, r = (e) => {
+		e = Array.isArray(e) ? e : [e];
+		let t = [], r = [];
+		for (let i = 0; i < e.length; i++) {
+			let a = e[i], o = n(a), s = r.length;
+			r.push(...o.indices), t.push([
+				s,
+				r.length,
+				o.width
+			]);
+		}
+		r.length || r.push(0);
+		let a = r.length;
+		t.forEach((e) => r.push(...e));
+		let o = new i(new Uint16Array(r), r.length, 1, y, A);
+		return o.needsUpdate = !0, {
+			texture: o,
+			textPointersOffset: a,
+			textPointersCount: t.length
+		};
+	}, a = new D();
+	a.setName("GlyphData");
+	let o = [], s = [];
+	return e.chars.forEach((e) => {
+		o.push(new E(new N(e.x, e.y, e.width, e.height))), s.push(new E(new M(e.xoffset, e.yoffset, e.xadvance)));
+	}), a.add(o), a.add(s), a.add(new E(new j(e.common.scaleW, e.common.scaleH))), a.add(new E(e.info.size)), a.add(new E(e.distanceField.distanceRange)), a.add(new E(e.common.lineHeight)), a.add(new E(e.common.base)), {
+		glyphsCount: e.chars.length,
+		glyphData: a,
+		encodeText: n,
+		encodeTextTexture: r,
+		dispose: () => {
+			a.dispose();
+		}
+	};
+}
+//#endregion
+//#region src/sdk/utils/irapbin-parser.ts
+async function Jn(e, t = -1, n = null) {
+	let r = await e.arrayBuffer(), i = new DataView(r), a = {
+		ny: i.getInt32(8, !1),
+		xori: i.getFloat32(12, !1),
+		xmax: i.getFloat32(16, !1),
+		yori: i.getFloat32(20, !1),
+		ymax: i.getFloat32(24, !1),
+		xinc: i.getFloat32(28, !1),
+		yinc: i.getFloat32(32, !1),
+		nx: i.getInt32(44, !1),
+		rot: i.getFloat32(48, !1)
+	}, o = new Float32Array(a.nx * a.ny), s, c, l, u, d, f = 0, p = 100;
+	for (; p < i.byteLength;) {
+		c = i.getInt32(p), p += 4;
+		for (let e = 0; e < c; e += 4) s = i.getFloat32(p + e, !1), l = f % a.nx, u = a.ny - Math.floor(f / a.nx), d = (u - 1) * a.nx + l, o[d] = s < 1e-30 || s > 1e30 ? t : n ? n - s : s, f++;
+		p += c + 4;
+	}
+	return {
+		header: a,
+		data: o
+	};
+}
+//#endregion
+//#region src/sdk/utils/num-array.ts
+function Yn(e) {
+	return e.map((e) => -e);
+}
+function Xn(e, t) {
+	return e.map((e) => e * t);
+}
+//#endregion
+//#region src/sdk/utils/scene.ts
+function Zn(e, t, n) {
+	let r = (n) => {
+		if (n.userData[e] && n.userData[e] === t) return n;
+		if (n.children && n.children.length) for (let e = 0; e < n.children.length; e++) {
+			let t = r(n.children[e]);
+			if (t) return t;
+		}
+		return null;
+	};
+	return r(n);
+}
+//#endregion
+//#region src/sdk/utils/segments.ts
+function Qn(e, t, n) {
+	if (e.length === 0) return [];
+	e.sort((e, n) => t(e) - t(n));
+	let r = [], i = {
+		start: t(e[0]),
+		end: n(e[0])
+	};
+	for (let a = 1; a < e.length; a += 1) t(e[a]) === i.end ? i.end = n(e[a]) : (r.push(i), i = {
+		start: t(e[a]),
+		end: n(e[a])
+	});
+	return r.push(i), r;
+}
+//#endregion
+//#region src/sdk/utils/strings.ts
+function $n(e) {
+	let t = 0, n, r;
+	if (!e || e.length === 0) return t;
+	for (n = 0; n < e.length; n++) r = e.charCodeAt(n), t = (t << 5) - t + r, t |= 0;
+	return t;
+}
+function er(e) {
+	return e.replace(/(^|\s)\S/g, (e) => e.toUpperCase());
+}
+//#endregion
+//#region src/sdk/utils/typed-2d-array.ts
+var tr = class e {
+	data;
+	columns;
+	rows;
+	stride;
+	_rowLength;
+	_lerpFn = [];
+	arrayConstructor;
+	constructor(e, t, n = 1) {
+		this.data = e, this.columns = t, this.stride = n, this._rowLength = t * n, this.rows = this.data.length / this._rowLength, this.arrayConstructor = (e) => new this.data.constructor(e);
+	}
+	static readWriteBlock(t, n, r, i, a, o, s, c, l, u, d = null) {
+		if (!(t instanceof e && o instanceof e)) throw Error("Source and target must be of type Typed2dArray");
+		if (s < 0 || s + l > o.columns || c < 0 || c + u > o.rows) throw Error("Invalid target block dimensions!");
+		if (n < 0 || n + i > t.columns || r < 0 || r + a > t.rows) throw Error("Invalid source block dimensions!");
+		let f = Math.max(1, l - 1), p = Math.max(1, u - 1), m = Math.max(1, i - 1), h = Math.max(1, a - 1);
+		for (let e = 0; e < u; e++) {
+			let i = o.index(0, e + c), a = e / p * h + r;
+			for (let e = 0; e < l; e++) {
+				let r = i + (e + s) * o.stride, c = e / f * m + n, l = t.valueAt(c, a);
+				if (d && (l = d(l)), o.stride === 1) o.data[r] = l;
+				else if (Array.isArray(l)) for (let e = 0; e < l.length; e++) o.data[r + e] = l[e];
+			}
+		}
+		return this;
+	}
+	static logInterp(e, t, n, r, i, a) {
+		let o = (t * t - e * e) * i + e * e, s = (r * r - n * n) * i + n * n;
+		return Math.sqrt((s - o) * a + o);
+	}
+	static linearInterp(e, t, n, r, i, a) {
+		let o = (t - e) * i + e;
+		return ((r - n) * i + n - o) * a + o;
+	}
+	static nearestInterp(e, t, n, r, i, a) {
+		return a <= .5 ? i <= .5 ? e : t : i <= .5 ? n : r;
+	}
+	get width() {
+		return this.columns;
+	}
+	get height() {
+		return this.rows;
+	}
+	index(e, t) {
+		if (e < 0 || t < 0 || e >= this.columns || t >= this.rows) throw Error("Index out of bounds!");
+		return t * this._rowLength + e * this.stride;
+	}
+	positionOf(e) {
+		if (e < 0 || e > this.data.length) return;
+		let t = e % this.stride, n = Math.floor((e - t) / this._rowLength);
+		return {
+			row: n,
+			col: Math.floor((e - n * this._rowLength) / this.stride)
+		};
+	}
+	setInterpolator(...e) {
+		return this._lerpFn = e, this;
+	}
+	getInterpolator(t) {
+		return this._lerpFn.length > 0 ? this._lerpFn[Math.min(t, this._lerpFn.length - 1)] : e.linearInterp;
+	}
+	col(e, t) {
+		return this.readBlock(Math.floor(e), 0, 1, this.rows, void 0, void 0, t);
+	}
+	row(e, t) {
+		let n = this.index(0, Math.floor(e));
+		if (t) {
+			for (let e = 0; e < this._rowLength; e++) t[e] = this.data[n + e];
+			return t;
+		}
+		return this.data.subarray(n, n + this._rowLength);
+	}
+	setValue(e, t, ...n) {
+		let r = this.index(e, t);
+		for (let e = 0; e < Math.min(n.length, this.stride); e++) this.data[r + e] = n[e];
+		return this;
+	}
+	readBlock(e, t, n, r, i, a, o) {
+		if (e < 0 || e + n > this.columns || t < 0 || t + r > this.rows) throw Error("Invalid block dimensions!");
+		i = Number.isFinite(i) ? i : n, a = Number.isFinite(a) ? a : r, o ||= this.arrayConstructor(i * a * this.stride);
+		let s = Math.max(1, i - 1), c = Math.max(1, a - 1), l = Math.max(1, n - 1), u = Math.max(1, r - 1), d = 0;
+		for (let n = 0; n < a; n++) {
+			let r = n / c * u + t;
+			for (let t = 0; t < i; t++) {
+				let n = t / s * l + e, i = this.valueAt(n, r);
+				if (this.stride === 1) o[d++] = i;
+				else if (Array.isArray(i)) for (let e = 0; e < i.length; e++) o[d++] = i[e];
+			}
+		}
+		return o;
+	}
+	upscale(e, t) {
+		if (e < this.columns || t < this.rows) throw Error("New column and row size must be equal or bigger than the current sizes!");
+		let n = this.readBlock(0, 0, this.columns, this.rows, e, t);
+		return this.columns = e, this.rows = t, this._rowLength = e * this.stride, this.data = n, this;
+	}
+	writeBlock(e, t, n, r, i) {
+		if (i.length !== n * r * this.stride) throw Error("Incorrect number of values");
+		if (e < 0 || e + n > this.columns || t < 0 || t + r > this.rows) throw Error("Invalid block dimensions!");
+		let a = 0;
+		for (let o = t; o < t + r; o++) {
+			let t = this.index(e, o);
+			for (let e = 0; e < n; e++) {
+				let n = t + e * this.stride;
+				for (let e = 0; e < this.stride; e++) this.data[n + e] = i[a++];
+			}
+		}
+		return this;
+	}
+	fillBlock(e, t, n, r, i) {
+		if (e < 0 || e + n > this.columns || t < 0 || t + r > this.rows) throw Error("Invalid block dimensions!");
+		let a = (e, t, n) => {
+			this.data[n] = i;
+		};
+		typeof i == "function" ? a = (e, t, n) => {
+			let r = i(e, t, n);
+			if (Array.isArray(r) && r.length && r.length > 0) for (let e = 0; e < Math.min(r.length, this.stride); e++) this.data[n + e] = r[e];
+			else this.data[n] = r;
+		} : this.stride > 1 && Array.isArray(i) && (a = (e, t, n) => {
+			for (let e = 0; e < Math.min(i.length, this.stride); e++) this.data[n + e] = i[e];
+		});
+		for (let i = t; i < t + r; i++) {
+			let t = this.index(e, i);
+			for (let e = 0; e < n; e++) {
+				let n = t + e * this.stride;
+				a(e, i, n);
+			}
+		}
+		return this;
+	}
+	valueOf(e, t) {
+		let { stride: n, data: r } = this;
+		if (n > 1) {
+			e %= n, t ||= this.arrayConstructor(n);
+			for (let i = 0; i < n; i++) t[i] = r[e + i];
+			return t;
+		}
+		return r[e];
+	}
+	valueAt(e, t, n) {
+		let { columns: r, rows: i, stride: a, data: o } = this, s = e % 1, c = t % 1;
+		if (s > 0 || c > 0) {
+			let l = (e < 0 ? 0 : e >= r ? r - 1 : e) | 0, u = (t < 0 ? 0 : t >= i ? i - 1 : t) | 0, d = l === r - 1 ? l : l + 1, f = u === i - 1 ? u : u + 1, p = this.index(l, u), m = this.index(d, u), h = this.index(l, f), g = this.index(d, f);
+			if (a > 1) {
+				n ||= this.arrayConstructor(a);
+				for (let e = 0; e < a; e++) {
+					let t = this.getInterpolator(e);
+					n[e] = t(o[p++], o[m++], o[h++], o[g++], s, c);
+				}
+				return n;
+			}
+			return this.getInterpolator(0)(o[p], o[m], o[h], o[g], s, c);
+		}
+		let l = this.index(e, t);
+		if (a > 1) {
+			n ||= this.arrayConstructor(a);
+			for (let e = 0; e < a; e++) n[e] = o[l + e];
+			return n;
+		}
+		return o[l];
+	}
+	swapRows(e, t, n) {
+		n ||= this.arrayConstructor(this._rowLength), this.row(e, n);
+		let r = this.index(0, e), i = this.index(0, t);
+		for (let e = 0; e < this._rowLength; e++) this.data[r + e] = this.data[i + e], this.data[i + e] = n[e];
+		return this;
+	}
+	invertRows() {
+		let e = Math.floor(this.rows / 2), t = this.arrayConstructor(this._rowLength);
+		for (let n = this.rows - 1, r = 0; n > e; n--, r++) this.swapRows(n, r, t);
+		return this;
+	}
+	copyInto(e, t = 0, n = 0, r = this.columns - t, i = this.rows - n) {
+		if (e.length !== r * i * this.stride) throw Error("Target is not of the correct size!");
+		let a = 0;
+		for (let o = n; o < n + i; o++) {
+			let n = this.index(0, o);
+			for (let i = t; i < t + r; i++) {
+				let t = n + i * this.stride;
+				for (let n = 0; n < this.stride; n++) e[a++] = this.data[t + n];
+			}
+		}
+		return this;
+	}
+	toJsArray() {
+		let e = Array(this.rows);
+		for (let t = 0; t < this.rows; t++) {
+			let n = this.index(0, t);
+			e[t] = Array(this.columns);
+			for (let r = 0; r < this.columns; r++) if (this.stride > 1) {
+				e[t][r] = Array(this.stride);
+				for (let i = 0; i < this.stride; i++) e[t][r][i] = this.data[n + r * this.stride + i];
+			} else e[t][r] = this.data[n + r * this.stride];
+		}
+		return e;
+	}
+};
+//#endregion
+//#region src/sdk/utils/typed-array.ts
+function nr(e) {
+	let t = new Float32Array(e.length * 3);
+	for (let n = 0; n < e.length; n++) {
+		let r = n * 3;
+		t[r + 0] = e[n][0], t[r + 1] = e[n][1], t[r + 2] = e[n][2];
+	}
+	return t;
+}
+//#endregion
+//#region src/sdk/materials/shaderLib/oit.glsl
+var rr = "#ifdef USE_OIT\n\nuniform float oitDepthFar;          \nuniform vec2 oitScreenSize;         \nuniform sampler2D oitMinDepthTexture; \nuniform int oitSkipFront;           \nuniform float oitOcclusionThreshold; \n\nvec4 oitProcess(vec4 color) {\n  #ifdef OIT_OCCLUSION_PASS\n  \n  \n  \n  \n  \n  if(color.a < oitOcclusionThreshold)\n    discard;\n  return color;\n  #endif\n\n  \n  \n  float linZ = abs(vViewPosition.z) / oitDepthFar;\n\n  #ifdef OIT_DEPTH_PASS\n\n  \n  return vec4(linZ, 0.0, 0.0, 1.0);\n\n  #else\n\n  \n  \n  \n  vec2 uv = gl_FragCoord.xy / oitScreenSize;\n  float minZ = texture2D(oitMinDepthTexture, uv).r;\n  \n  \n  \n  \n  \n  \n  float tol = minZ * 1e-3 + 1e-6;\n  bool isFront = (linZ - minZ) <= tol;\n\n  #ifdef OIT_FRONT_PASS\n\n  \n  if(!isFront)\n    discard;\n  return color;\n\n  #else\n\n  \n  \n  if(isFront && oitSkipFront == 0)\n    discard;\n\n  float alpha = color.a;\n\n  \n  \n  \n  \n  \n  float b = -log(1.0 - clamp(alpha, 0.0, 0.9999));\n  return vec4(color.rgb * b, b);\n\n  #endif \n  #endif \n}\n\n#endif", ir = [
+	"color",
+	"emissive",
+	"emissiveIntensity",
+	"metalness",
+	"roughness"
+];
+function ar(e) {
+	return !!e && typeof e.getOitVariants == "function" && typeof e.getOitUniforms == "function";
+}
+function or(e) {
+	return e.isShaderMaterial === !0;
+}
+function sr(e) {
+	return typeof e == "object" && !!e && typeof e.copy == "function";
+}
+function cr() {
+	return {
+		oitDepthFar: new E(1),
+		oitScreenSize: new E(new j(1, 1)),
+		oitMinDepthTexture: new E(null),
+		oitSkipFront: new E(0),
+		oitOcclusionThreshold: new E(1)
+	};
+}
+var lr = {
+	depthMin: "OIT_DEPTH_PASS",
+	accum: null,
+	front: "OIT_FRONT_PASS",
+	occlusion: "OIT_OCCLUSION_PASS"
+};
+function ur(t, n, i) {
+	switch (t.transparent = !0, t.depthTest = !0, t.depthWrite = !1, t.blending = r, t.toneMapped = !1, i !== void 0 && (t.side = i), n) {
+		case "depthMin":
+			t.blendEquation = l, t.blendSrc = d, t.blendDst = d, t.blendEquationAlpha = l, t.blendSrcAlpha = d, t.blendDstAlpha = d;
+			break;
+		case "accum":
+			t.blendEquation = e, t.blendSrc = d, t.blendDst = d, t.blendEquationAlpha = e, t.blendSrcAlpha = d, t.blendDstAlpha = d;
+			break;
+		case "front":
+			t.blendEquation = e, t.blendSrc = T, t.blendDst = f, t.blendEquationAlpha = e, t.blendSrcAlpha = d, t.blendDstAlpha = f;
+			break;
+		case "occlusion":
+			t.transparent = !1, t.depthWrite = !0, t.colorWrite = !1, t.blending = u;
+			break;
+	}
+}
+function dr(e) {
+	let t = e;
+	return [
+		JSON.stringify(t.defines ?? {}),
+		+!!t.wireframe,
+		+!!t.flatShading,
+		t.uniformsGroups ? t.uniformsGroups.length : 0,
+		+!!e.vertexColors
+	].join("|");
+}
+function fr(e, t, n) {
+	let r = t, i = e, a = {
+		...r.defines ?? {},
+		USE_OIT: ""
+	}, o = lr[n];
+	o && (a[o] = ""), i.defines = a, "wireframe" in r && (i.wireframe = r.wireframe), "flatShading" in r && (i.flatShading = r.flatShading), r.uniformsGroups && (i.uniformsGroups = r.uniformsGroups), e.vertexColors = t.vertexColors, e.needsUpdate = !0;
+}
+function pr(e, t, n) {
+	let r;
+	if (or(e)) {
+		let t = new S();
+		t.copy(e), t.uniforms = e.uniforms, r = t;
+	} else r = e.clone();
+	if (n?.shareUniforms) {
+		let t = e, i = r;
+		for (let e of n.shareUniforms) i[e] = t[e];
+	}
+	return r.onBeforeCompile = e.onBeforeCompile, r.customProgramCacheKey = e.customProgramCacheKey, ur(r, t, n?.side), fr(r, e, t), r;
+}
+var mr = [
+	"depthMin",
+	"accum",
+	"front",
+	"occlusion"
+];
+function hr(e, t, n) {
+	let r = e, i = null, a = "", o = !or(e), c = e, l = o && n?.syncProperties ? n.syncProperties.filter((e) => e !== "opacity" && e in c) : [];
+	r.getOitUniforms = () => t, r.getOitVariants = () => {
+		if (!i) i = {
+			depthMin: pr(e, "depthMin", n),
+			accum: pr(e, "accum", n),
+			front: pr(e, "front", n),
+			occlusion: pr(e, "occlusion", n)
+		}, a = dr(e);
+		else {
+			let t = dr(e);
+			if (t !== a) {
+				a = t;
+				for (let t of mr) fr(i[t], e, t);
+			}
+		}
+		if (o) for (let t of mr) {
+			let n = i[t];
+			if (n.opacity = e.opacity, l.length) {
+				let e = n;
+				for (let t of l) {
+					let n = c[t], r = e[t];
+					sr(r) && sr(n) && r.constructor === n.constructor ? r.copy(n) : e[t] = n;
+				}
+			}
+		}
+		return i;
+	};
+	let u = e.dispose.bind(e);
+	return e.dispose = () => {
+		if (i) {
+			for (let e of mr) s.prototype.dispose.call(i[e]);
+			i = null;
+		}
+		u();
+	}, r;
+}
+function gr(e, t) {
+	let n = cr(), r = e.uniforms;
+	return r.oitDepthFar ??= n.oitDepthFar, r.oitScreenSize ??= n.oitScreenSize, r.oitMinDepthTexture ??= n.oitMinDepthTexture, r.oitSkipFront ??= n.oitSkipFront, r.oitOcclusionThreshold ??= n.oitOcclusionThreshold, hr(e, {
+		oitDepthFar: r.oitDepthFar,
+		oitScreenSize: r.oitScreenSize,
+		oitMinDepthTexture: r.oitMinDepthTexture,
+		oitSkipFront: r.oitSkipFront,
+		oitOcclusionThreshold: r.oitOcclusionThreshold
+	}, t);
+}
+var _r = /\bvoid\s+main\s*\(\s*\)\s*\{/;
+function vr(e) {
+	return /\bvViewPosition\b/.test(e);
+}
+function yr(e) {
+	let t = _r.exec(e);
+	if (!t) return null;
+	let n = t.index + t[0].length, r = 1;
+	for (let t = n; t < e.length; t++) {
+		let i = e[t];
+		if (i === "{") r++;
+		else if (i === "}" && (r--, r === 0)) return {
+			open: n,
+			close: t
+		};
+	}
+	return null;
+}
+function br(e, t, n) {
+	let r = _r.exec(e);
+	if (!r) return e;
+	let i = e.slice(0, r.index) + t + e.slice(r.index), a = yr(i);
+	return a ? i.slice(0, a.close) + n + i.slice(a.close) : i;
+}
+function xr(e, t) {
+	let n = cr(), r = or(e) ? e : null;
+	if (r) {
+		let e = r.uniforms;
+		e.oitDepthFar ??= n.oitDepthFar, e.oitScreenSize ??= n.oitScreenSize, e.oitMinDepthTexture ??= n.oitMinDepthTexture, e.oitSkipFront ??= n.oitSkipFront, e.oitOcclusionThreshold ??= n.oitOcclusionThreshold;
+	}
+	let i = e.onBeforeCompile;
+	return e.onBeforeCompile = function(e, t) {
+		i?.call(this, e, t), e.uniforms.oitDepthFar = n.oitDepthFar, e.uniforms.oitScreenSize = n.oitScreenSize, e.uniforms.oitMinDepthTexture = n.oitMinDepthTexture, e.uniforms.oitSkipFront = n.oitSkipFront, e.uniforms.oitOcclusionThreshold = n.oitOcclusionThreshold;
+		let r = !vr(e.fragmentShader), a = (r ? "#ifdef USE_OIT\nvarying vec3 vViewPosition;\n#endif\n" : "") + "#ifdef USE_OIT\n" + rr + "\n#endif\n";
+		e.fragmentShader = br(e.fragmentShader, a, "\n#ifdef USE_OIT\n  gl_FragColor = oitProcess(gl_FragColor);\n#endif\n"), r && (e.vertexShader = br(e.vertexShader, "#ifdef USE_OIT\nvarying vec3 vViewPosition;\n#endif\n", "\n#ifdef USE_OIT\n  vViewPosition = -(modelViewMatrix * vec4(position, 1.0)).xyz;\n#endif\n"));
+	}, e.needsUpdate = !0, hr(e, n, t);
+}
+//#endregion
+//#region src/sdk/materials/shaders/trajectory/fragment.glsl
+var Sr = "#define TRAJECTORY_MATERIAL\n\nuniform vec3 diffuse;\nuniform float opacity;\n\n#ifndef FLAT_SHADED\nvarying vec3 vNormal;\n#endif\nvarying vec3 vViewPosition;\n#include <common>\n#include <color_pars_fragment>\n#include <uv_pars_fragment>\n#include <map_pars_fragment>\n#include <fog_pars_fragment>\n#include <logdepthbuf_pars_fragment>\n#include <clipping_planes_pars_fragment>\n\nvec3 hue2rgb(in float H) {\n  float R = abs(H * 6. - 3.) - 1.;\n  float G = 2. - abs(H * 6. - 2.);\n  float B = 2. - abs(H * 6. - 4.);\n  return saturate(vec3(R, G, B));\n}\n\nvec3 hsl2rgb(in vec3 HSL) {\n  vec3 RGB = hue2rgb(HSL.x);\n  float C = (1. - abs(2. * HSL.z - 1.)) * HSL.y;\n  return (RGB - 0.5) * C + HSL.z;\n}\n\nvec3 rgb2hsv(in vec3 RGB) {\n  \n  vec4 P = (RGB.g < RGB.b) ? vec4(RGB.bg, -1.0, 2.0 / 3.0) : vec4(RGB.gb, 0.0, -1.0 / 3.0);\n  vec4 Q = (RGB.r < P.x) ? vec4(P.xyw, RGB.r) : vec4(RGB.r, P.yzx);\n  float C = Q.x - min(Q.w, Q.y);\n  float H = abs((Q.w - Q.y) / (6. * C + EPSILON) + Q.z);\n  return vec3(H, C, Q.x);\n}\n\nvec3 rgb2hsl(in vec3 RGB) {\n  vec3 HCV = rgb2hsv(RGB);\n  float L = HCV.z - HCV.y * 0.5;\n  float S = HCV.y / (1. - abs(L * 2. - 1.) + EPSILON);\n  return vec3(HCV.x, S, L);\n}\n\nvec3 hsv2rgb(in vec3 HSV) {\n  vec3 RGB = hue2rgb(HSV.x);\n  return ((RGB - 1.) * HSV.y + 1.) * HSV.z;\n}\n\n#ifdef USE_OIT\n#ifdef USE_OIT\n\nuniform float oitDepthFar;          \nuniform vec2 oitScreenSize;         \nuniform sampler2D oitMinDepthTexture; \nuniform int oitSkipFront;           \nuniform float oitOcclusionThreshold; \n\nvec4 oitProcess(vec4 color) {\n  #ifdef OIT_OCCLUSION_PASS\n  \n  \n  \n  \n  \n  if(color.a < oitOcclusionThreshold)\n    discard;\n  return color;\n  #endif\n\n  \n  \n  float linZ = abs(vViewPosition.z) / oitDepthFar;\n\n  #ifdef OIT_DEPTH_PASS\n\n  \n  return vec4(linZ, 0.0, 0.0, 1.0);\n\n  #else\n\n  \n  \n  \n  vec2 uv = gl_FragCoord.xy / oitScreenSize;\n  float minZ = texture2D(oitMinDepthTexture, uv).r;\n  \n  \n  \n  \n  \n  \n  float tol = minZ * 1e-3 + 1e-6;\n  bool isFront = (linZ - minZ) <= tol;\n\n  #ifdef OIT_FRONT_PASS\n\n  \n  if(!isFront)\n    discard;\n  return color;\n\n  #else\n\n  \n  \n  if(isFront && oitSkipFront == 0)\n    discard;\n\n  float alpha = color.a;\n\n  \n  \n  \n  \n  \n  float b = -log(1.0 - clamp(alpha, 0.0, 0.9999));\n  return vec4(color.rgb * b, b);\n\n  #endif \n  #endif \n}\n\n#endif\n#endif\n\nvoid main() {\n	#include <clipping_planes_fragment>\n\n  vec3 color = diffuse.rgb;\n\n  vec4 diffuseColor = vec4(color.rgb, opacity);\n\n	#include <logdepthbuf_fragment>\n	#include <map_fragment>\n	#include <color_fragment>\n  #include <normal_fragment_begin>\n\n  #ifdef DEPTH_SHADE\n  float ndv = clamp(dot(normalize(vNormal), normalize(vViewPosition)), 0.0, 1.0);\n  \n  \n  \n  \n  \n  \n  \n  float ndvAA = max(ndv, fwidth(ndv));\n  float depthFactor = pow(ndvAA, 0.8);\n  float darkenFactor = clamp(vViewPosition.z / 5000.0, 0.1, 0.8);\n  vec3 hsv = rgb2hsv(diffuseColor.rgb);\n  hsv.z = hsv.z * darkenFactor;\n  vec3 mixColor = hsv2rgb(hsv);\n  diffuseColor.rgb = mix(mixColor, diffuseColor.rgb, depthFactor);\n  #else\n  float alphaFactor = clamp(vViewPosition.z / 100000.0, 0.0, 0.9);\n\n  diffuseColor.a = 1.0 - alphaFactor;\n  #endif\n\n  gl_FragColor = diffuseColor.rgba;\n\n	#include <tonemapping_fragment>\n	#include <colorspace_fragment>\n	#include <fog_fragment>\n\n	#ifdef OPAQUE\n\n  gl_FragColor.a = 1.0;\n\n	#endif\n\n  #ifdef USE_OIT\n  gl_FragColor = oitProcess(gl_FragColor);\n  #endif\n}", Cr = "#define TRAJECTORY_MATERIAL\n\nvarying vec3 vViewPosition;\n\n#include <common>\n#include <batching_pars_vertex>\n#include <uv_pars_vertex>\n#include <envmap_pars_vertex>\n#include <color_pars_vertex>\n#include <fog_pars_vertex>\n#include <normal_pars_fragment>\n#include <logdepthbuf_pars_vertex>\n#include <clipping_planes_pars_vertex>\n\nvoid main() {\n\n	#include <uv_vertex>\n	#include <color_vertex>\n  #include <batching_vertex>\n  #include <beginnormal_vertex>\n  #include <defaultnormal_vertex>\n  #include <normal_vertex>\n\n	#include <begin_vertex>\n	#include <project_vertex>\n	#include <logdepthbuf_vertex>\n	#include <clipping_planes_vertex>\n\n  vViewPosition = - mvPosition.xyz;\n\n	#include <worldpos_vertex>\n	#include <fog_vertex>\n}", wr = class extends S {
+	isTubeMaterial = !0;
+	constructor(e) {
+		super({
+			vertexShader: Cr,
+			fragmentShader: Sr,
+			uniforms: O.clone(x.basic.uniforms),
+			defines: { DEPTH_SHADE: !0 },
+			clipping: !0,
+			fog: !0
+		}), e && this.setValues(e), gr(this);
+	}
+	get color() {
+		return this.uniforms.diffuse.value;
+	}
+	set color(e) {
+		this.uniforms.diffuse.value.set(e);
+	}
+}, Tr = new S({
+	vertexShader: "varying vec2 vUv;\n\nvoid main() {\n  vUv = uv;\n  gl_Position = projectionMatrix * modelViewMatrix * vec4(position, 1.0);\n\n}",
+	fragmentShader: "varying vec2 vUv;\n\nvoid main() {\n  \n  gl_FragColor = vec4(vUv, 1.0, 1.0);\n\n}"
+});
+//#endregion
+export { Ut as $, ze as $t, Tn as A, Ye as At, mn as B, Fe as Bt, Bn as C, le as Cn, dt as Ct, kn as D, ie as Dn, st as Dt, En as E, ae as En, ot as Et, yn as F, Ne as Ft, rn as G, Le as Gt, dn as H, Ie as Ht, gn as I, U as It, Zt as J, ke as Jt, nn as K, we as Kt, _n as L, Me as Lt, Sn as M, Je as Mt, Cn as N, Be as Nt, On as O, Qe as Ot, bn as P, Ee as Pt, Wt as Q, Ce as Qt, hn as R, V as Rt, Vn as S, ue as Sn, pt as St, Dn as T, ce as Tn, lt as Tt, on as U, He as Ut, fn as V, W as Vt, an as W, Ae as Wt, Qt as X, je as Xt, $t as Y, Ke as Yt, en as Z, Ue as Zt, Gn as _, ge as _n, ht as _t, ar as a, Te as an, Yt as at, Kn as b, fe as bn, q as bt, tr as c, B as cn, Ot as ct, Qn as d, xe as dn, Ct as dt, H as en, Gt as et, Zn as f, ve as fn, xt as ft, qn as g, me as gn, _t as gt, Jn as h, he as hn, gt as ht, gr as i, Re as in, Xt as it, xn as j, Xe as jt, wn as k, $e as kt, $n as l, ye as ln, Dt as lt, Yn as m, z as mn, vt as mt, wr as n, We as nn, qt as nt, xr as o, Ve as on, Et as ot, Xn as p, Se as pn, yt as pt, tn as q, Ge as qt, ir as r, Oe as rn, Kt as rt, nr as s, De as sn, kt as st, Tr as t, Pe as tn, Jt as tt, er as u, be as un, Tt as ut, Wn as v, _e as vn, J as vt, Mn as w, oe as wn, ft as wt, Hn as x, pe as xn, mt as xt, Un as y, de as yn, K as yt, pn as z, qe as zt };