math 0.0.3 → 0.1.0

package/dist/shapes/raycast3.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"raycast3.js","sources":["../../src/shapes/raycast3.ts"],"sourcesContent":["import type { Vec3 } from '../core/vec3';\nimport type { Box3 } from './box3';\n\n/**\n * Result of a ray-triangle intersection test\n * @see createIntersectsTriangleResult\n * @see intersectsTriangle\n */\nexport type IntersectsTriangleResult = {\n    fraction: number;\n    hit: boolean;\n    frontFacing: boolean;\n};\n\n/**\n * Creates a new IntersectsTriangleResult with default values.\n * @returns A new IntersectsTriangleResult.\n */\nexport function createIntersectsTriangleResult(): IntersectsTriangleResult {\n    return {\n        fraction: 0,\n        hit: false,\n        frontFacing: false,\n    };\n}\n\n/**\n * Ray-triangle intersection test.\n * Based on https://github.com/pmjoniak/GeometricTools/blob/master/GTEngine/Include/Mathematics/GteIntrRay3Triangle3.h\n *\n * @param out output object to store result (hit boolean, fraction, frontFacing)\n * @param origin ray origin\n * @param direction ray direction\n * @param length ray length\n * @param a first vertex of triangle\n * @param b second vertex of triangle\n * @param c third vertex of triangle\n * @param backfaceCulling if true, backfaces will not be considered hits\n */\nexport function intersectsTriangle(\n    out: IntersectsTriangleResult,\n    origin: Vec3,\n    direction: Vec3,\n    length: number,\n    a: Vec3,\n    b: Vec3,\n    c: Vec3,\n    backfaceCulling: boolean,\n): void {\n    // compute edge1 = b - a\n    const e1x = b[0] - a[0];\n    const e1y = b[1] - a[1];\n    const e1z = b[2] - a[2];\n\n    // compute edge2 = c - a\n    const e2x = c[0] - a[0];\n    const e2y = c[1] - a[1];\n    const e2z = c[2] - a[2];\n\n    // compute normal = edge1 × edge2\n    const nx = e1y * e2z - e1z * e2y;\n    const ny = e1z * e2x - e1x * e2z;\n    const nz = e1x * e2y - e1y * e2x;\n\n    // determine front vs back facing\n    const dx = direction[0];\n    const dy = direction[1];\n    const dz = direction[2];\n    let DdN = dx * nx + dy * ny + dz * nz;\n    let sign: number;\n\n    if (DdN > 0) {\n        // backface\n        if (backfaceCulling) {\n            out.hit = false;\n            out.fraction = 0;\n            out.frontFacing = false;\n            return;\n        }\n        sign = 1;\n    } else if (DdN < 0) {\n        // frontface\n        sign = -1;\n        DdN = -DdN;\n    } else {\n        // ray is parallel to triangle\n        out.hit = false;\n        out.fraction = 0;\n        out.frontFacing = false;\n        return;\n    }\n\n    // compute diff = origin - a\n    const diffx = origin[0] - a[0];\n    const diffy = origin[1] - a[1];\n    const diffz = origin[2] - a[2];\n\n    // compute barycentric coordinate b1\n    // DdQxE2 = sign * D · (diff × edge2)\n    const diffCrossE2x = diffy * e2z - diffz * e2y;\n    const diffCrossE2y = diffz * e2x - diffx * e2z;\n    const diffCrossE2z = diffx * e2y - diffy * e2x;\n    const DdQxE2 = sign * (dx * diffCrossE2x + dy * diffCrossE2y + dz * diffCrossE2z);\n\n    if (DdQxE2 < 0) {\n        out.hit = false;\n        out.fraction = 0;\n        out.frontFacing = false;\n        return;\n    }\n\n    // compute barycentric coordinate b2\n    // DdE1xQ = sign * D · (edge1 × diff)\n    const e1CrossDiffx = e1y * diffz - e1z * diffy;\n    const e1CrossDiffy = e1z * diffx - e1x * diffz;\n    const e1CrossDiffz = e1x * diffy - e1y * diffx;\n    const DdE1xQ = sign * (dx * e1CrossDiffx + dy * e1CrossDiffy + dz * e1CrossDiffz);\n\n    if (DdE1xQ < 0) {\n        out.hit = false;\n        out.fraction = 0;\n        out.frontFacing = false;\n        return;\n    }\n\n    // check if b1 + b2 > 1\n    if (DdQxE2 + DdE1xQ > DdN) {\n        out.hit = false;\n        out.fraction = 0;\n        out.frontFacing = false;\n        return;\n    }\n\n    // compute intersection distance\n    const QdN = -sign * (diffx * nx + diffy * ny + diffz * nz);\n\n    if (QdN < 0) {\n        out.hit = false;\n        out.fraction = 0;\n        out.frontFacing = false;\n        return;\n    }\n\n    const t = QdN / DdN;\n\n    // check if intersection is within ray length\n    if (t <= length) {\n        out.hit = true;\n        out.fraction = t / length;\n        out.frontFacing = sign < 0;\n    } else {\n        out.hit = false;\n        out.fraction = 0;\n        out.frontFacing = false;\n    }\n}\n\n/**\n * Test if a ray intersects an axis-aligned bounding box.\n * Uses slab-based algorithm that handles parallel rays correctly.\n *\n * @param origin ray origin\n * @param direction ray direction\n * @param length ray length\n * @param aabb AABB to test against\n * @returns true if ray intersects the AABB, false otherwise\n */\nexport function intersectsBox3(origin: Vec3, direction: Vec3, length: number, aabb: Box3): boolean {\n    let tmin = 0;\n    let tmax = length;\n\n    for (let i = 0; i < 3; i++) {\n        const d = direction[i];\n\n        if (Math.abs(d) < 1e-10) {\n            // ray is parallel to slab: check if origin is within slab\n            if (origin[i] < aabb[i] || origin[i] > aabb[i + 3]) {\n                return false;\n            }\n        } else {\n            // compute intersection times with slab\n            const invD = 1 / d;\n            let t0 = (aabb[i] - origin[i]) * invD;\n            let t1 = (aabb[i + 3] - origin[i]) * invD;\n\n            if (invD < 0) {\n                const temp = t0;\n                t0 = t1;\n                t1 = temp;\n            }\n\n            tmin = Math.max(tmin, t0);\n            tmax = Math.min(tmax, t1);\n\n            if (tmax < tmin) {\n                return false;\n            }\n        }\n    }\n\n    return true;\n}\n"],"names":[],"mappings":"AAcA;;;AAGG;SACa,8BAA8B,GAAA;IAC1C,OAAO;AACH,QAAA,QAAQ,EAAE,CAAC;AACX,QAAA,GAAG,EAAE,KAAK;AACV,QAAA,WAAW,EAAE,KAAK;KACrB;AACL;AAEA;;;;;;;;;;;;AAYG;SACa,kBAAkB,CAC9B,GAA6B,EAC7B,MAAY,EACZ,SAAe,EACf,MAAc,EACd,CAAO,EACP,CAAO,EACP,CAAO,EACP,eAAwB,EAAA;;IAGxB,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACvB,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACvB,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;;IAGvB,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACvB,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACvB,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;;IAGvB,MAAM,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;IAChC,MAAM,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;IAChC,MAAM,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;;AAGhC,IAAA,MAAM,EAAE,GAAG,SAAS,CAAC,CAAC,CAAC;AACvB,IAAA,MAAM,EAAE,GAAG,SAAS,CAAC,CAAC,CAAC;AACvB,IAAA,MAAM,EAAE,GAAG,SAAS,CAAC,CAAC,CAAC;AACvB,IAAA,IAAI,GAAG,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE;AACrC,IAAA,IAAI,IAAY;AAEhB,IAAA,IAAI,GAAG,GAAG,CAAC,EAAE;;QAET,IAAI,eAAe,EAAE;AACjB,YAAA,GAAG,CAAC,GAAG,GAAG,KAAK;AACf,YAAA,GAAG,CAAC,QAAQ,GAAG,CAAC;AAChB,YAAA,GAAG,CAAC,WAAW,GAAG,KAAK;YACvB;QACJ;QACA,IAAI,GAAG,CAAC;IACZ;AAAO,SAAA,IAAI,GAAG,GAAG,CAAC,EAAE;;QAEhB,IAAI,GAAG,EAAE;QACT,GAAG,GAAG,CAAC,GAAG;IACd;SAAO;;AAEH,QAAA,GAAG,CAAC,GAAG,GAAG,KAAK;AACf,QAAA,GAAG,CAAC,QAAQ,GAAG,CAAC;AAChB,QAAA,GAAG,CAAC,WAAW,GAAG,KAAK;QACvB;IACJ;;IAGA,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAC9B,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAC9B,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;;;IAI9B,MAAM,YAAY,GAAG,KAAK,GAAG,GAAG,GAAG,KAAK,GAAG,GAAG;IAC9C,MAAM,YAAY,GAAG,KAAK,GAAG,GAAG,GAAG,KAAK,GAAG,GAAG;IAC9C,MAAM,YAAY,GAAG,KAAK,GAAG,GAAG,GAAG,KAAK,GAAG,GAAG;AAC9C,IAAA,MAAM,MAAM,GAAG,IAAI,IAAI,EAAE,GAAG,YAAY,GAAG,EAAE,GAAG,YAAY,GAAG,EAAE,GAAG,YAAY,CAAC;AAEjF,IAAA,IAAI,MAAM,GAAG,CAAC,EAAE;AACZ,QAAA,GAAG,CAAC,GAAG,GAAG,KAAK;AACf,QAAA,GAAG,CAAC,QAAQ,GAAG,CAAC;AAChB,QAAA,GAAG,CAAC,WAAW,GAAG,KAAK;QACvB;IACJ;;;IAIA,MAAM,YAAY,GAAG,GAAG,GAAG,KAAK,GAAG,GAAG,GAAG,KAAK;IAC9C,MAAM,YAAY,GAAG,GAAG,GAAG,KAAK,GAAG,GAAG,GAAG,KAAK;IAC9C,MAAM,YAAY,GAAG,GAAG,GAAG,KAAK,GAAG,GAAG,GAAG,KAAK;AAC9C,IAAA,MAAM,MAAM,GAAG,IAAI,IAAI,EAAE,GAAG,YAAY,GAAG,EAAE,GAAG,YAAY,GAAG,EAAE,GAAG,YAAY,CAAC;AAEjF,IAAA,IAAI,MAAM,GAAG,CAAC,EAAE;AACZ,QAAA,GAAG,CAAC,GAAG,GAAG,KAAK;AACf,QAAA,GAAG,CAAC,QAAQ,GAAG,CAAC;AAChB,QAAA,GAAG,CAAC,WAAW,GAAG,KAAK;QACvB;IACJ;;AAGA,IAAA,IAAI,MAAM,GAAG,MAAM,GAAG,GAAG,EAAE;AACvB,QAAA,GAAG,CAAC,GAAG,GAAG,KAAK;AACf,QAAA,GAAG,CAAC,QAAQ,GAAG,CAAC;AAChB,QAAA,GAAG,CAAC,WAAW,GAAG,KAAK;QACvB;IACJ;;AAGA,IAAA,MAAM,GAAG,GAAG,CAAC,IAAI,IAAI,KAAK,GAAG,EAAE,GAAG,KAAK,GAAG,EAAE,GAAG,KAAK,GAAG,EAAE,CAAC;AAE1D,IAAA,IAAI,GAAG,GAAG,CAAC,EAAE;AACT,QAAA,GAAG,CAAC,GAAG,GAAG,KAAK;AACf,QAAA,GAAG,CAAC,QAAQ,GAAG,CAAC;AAChB,QAAA,GAAG,CAAC,WAAW,GAAG,KAAK;QACvB;IACJ;AAEA,IAAA,MAAM,CAAC,GAAG,GAAG,GAAG,GAAG;;AAGnB,IAAA,IAAI,CAAC,IAAI,MAAM,EAAE;AACb,QAAA,GAAG,CAAC,GAAG,GAAG,IAAI;AACd,QAAA,GAAG,CAAC,QAAQ,GAAG,CAAC,GAAG,MAAM;AACzB,QAAA,GAAG,CAAC,WAAW,GAAG,IAAI,GAAG,CAAC;IAC9B;SAAO;AACH,QAAA,GAAG,CAAC,GAAG,GAAG,KAAK;AACf,QAAA,GAAG,CAAC,QAAQ,GAAG,CAAC;AAChB,QAAA,GAAG,CAAC,WAAW,GAAG,KAAK;IAC3B;AACJ;AAEA;;;;;;;;;AASG;AACG,SAAU,cAAc,CAAC,MAAY,EAAE,SAAe,EAAE,MAAc,EAAE,IAAU,EAAA;IACpF,IAAI,IAAI,GAAG,CAAC;IACZ,IAAI,IAAI,GAAG,MAAM;AAEjB,IAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;AACxB,QAAA,MAAM,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC;QAEtB,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,KAAK,EAAE;;YAErB,IAAI,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE;AAChD,gBAAA,OAAO,KAAK;YAChB;QACJ;aAAO;;AAEH,YAAA,MAAM,IAAI,GAAG,CAAC,GAAG,CAAC;AAClB,YAAA,IAAI,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,IAAI,IAAI;AACrC,YAAA,IAAI,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,IAAI,IAAI;AAEzC,YAAA,IAAI,IAAI,GAAG,CAAC,EAAE;gBACV,MAAM,IAAI,GAAG,EAAE;gBACf,EAAE,GAAG,EAAE;gBACP,EAAE,GAAG,IAAI;YACb;YAEA,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC;YACzB,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC;AAEzB,YAAA,IAAI,IAAI,GAAG,IAAI,EAAE;AACb,gBAAA,OAAO,KAAK;YAChB;QACJ;IACJ;AAEA,IAAA,OAAO,IAAI;AACf;;;;"}

package/dist/shapes/segment2.js

@@ -0,0 +1,82 @@
+/**
+ * Calculates the closest point on a line segment to a given point
+ * @param out Output parameter for the closest point
+ * @param point The point
+ * @param a First endpoint of the segment
+ * @param b Second endpoint of the segment
+ */
+function closestPoint(out, point, a, b) {
+    const pqx = b[0] - a[0];
+    const pqz = b[1] - a[1];
+    const dx = point[0] - a[0];
+    const dz = point[1] - a[1];
+    const d = pqx * pqx + pqz * pqz;
+    let t = pqx * dx + pqz * dz;
+    if (d > 0)
+        t /= d;
+    if (t < 0)
+        t = 0;
+    else if (t > 1)
+        t = 1;
+    out[0] = a[0] + t * pqx;
+    out[1] = a[1] + t * pqz;
+    return out;
+}
+/**
+ * Tests whether the two closed segments a-b and c-d intersect. Collinear
+ * (overlapping) segments are treated as non-intersecting; touching at an
+ * endpoint counts as an intersection.
+ *
+ * @param a first endpoint of the first segment
+ * @param b second endpoint of the first segment
+ * @param c first endpoint of the second segment
+ * @param d second endpoint of the second segment
+ * @returns true if the segments intersect
+ */
+function intersects(a, b, c, d) {
+    const rx = b[0] - a[0];
+    const ry = b[1] - a[1];
+    const ex = d[0] - c[0];
+    const ey = d[1] - c[1];
+    const denom = rx * ey - ry * ex;
+    if (denom === 0)
+        return false; // parallel or collinear
+    const wx = c[0] - a[0];
+    const wy = c[1] - a[1];
+    const u = (wx * ey - wy * ex) / denom; // parameter along a-b
+    const v = (wx * ry - wy * rx) / denom; // parameter along c-d
+    return u >= 0 && u <= 1 && v >= 0 && v <= 1;
+}
+/**
+ * Computes the intersection point of the two closed segments a-b and c-d,
+ * writing it to `out`. Returns `out` when the segments intersect, or `null`
+ * when they do not (including parallel/collinear segments).
+ *
+ * @param out output parameter for the intersection point
+ * @param a first endpoint of the first segment
+ * @param b second endpoint of the first segment
+ * @param c first endpoint of the second segment
+ * @param d second endpoint of the second segment
+ * @returns out if the segments intersect, otherwise null
+ */
+function intersection(out, a, b, c, d) {
+    const rx = b[0] - a[0];
+    const ry = b[1] - a[1];
+    const ex = d[0] - c[0];
+    const ey = d[1] - c[1];
+    const denom = rx * ey - ry * ex;
+    if (denom === 0)
+        return null;
+    const wx = c[0] - a[0];
+    const wy = c[1] - a[1];
+    const u = (wx * ey - wy * ex) / denom;
+    const v = (wx * ry - wy * rx) / denom;
+    if (u < 0 || u > 1 || v < 0 || v > 1)
+        return null;
+    out[0] = a[0] + u * rx;
+    out[1] = a[1] + u * ry;
+    return out;
+}
+
+export { closestPoint, intersection, intersects };
+//# sourceMappingURL=segment2.js.map

package/dist/shapes/segment2.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"segment2.js","sources":["../../src/shapes/segment2.ts"],"sourcesContent":["import type { Vec2 } from '../core/vec2';\n\n/**\n * Calculates the closest point on a line segment to a given point\n * @param out Output parameter for the closest point\n * @param point The point\n * @param a First endpoint of the segment\n * @param b Second endpoint of the segment\n */\nexport function closestPoint(out: Vec2, point: Vec2, a: Vec2, b: Vec2): Vec2 {\n    const pqx = b[0] - a[0];\n    const pqz = b[1] - a[1];\n    const dx = point[0] - a[0];\n    const dz = point[1] - a[1];\n\n    const d = pqx * pqx + pqz * pqz;\n    let t = pqx * dx + pqz * dz;\n    if (d > 0) t /= d;\n    if (t < 0) t = 0;\n    else if (t > 1) t = 1;\n\n    out[0] = a[0] + t * pqx;\n    out[1] = a[1] + t * pqz;\n\n    return out;\n}\n\n/**\n * Tests whether the two closed segments a-b and c-d intersect. Collinear\n * (overlapping) segments are treated as non-intersecting; touching at an\n * endpoint counts as an intersection.\n *\n * @param a first endpoint of the first segment\n * @param b second endpoint of the first segment\n * @param c first endpoint of the second segment\n * @param d second endpoint of the second segment\n * @returns true if the segments intersect\n */\nexport function intersects(a: Vec2, b: Vec2, c: Vec2, d: Vec2): boolean {\n    const rx = b[0] - a[0];\n    const ry = b[1] - a[1];\n    const ex = d[0] - c[0];\n    const ey = d[1] - c[1];\n\n    const denom = rx * ey - ry * ex;\n    if (denom === 0) return false; // parallel or collinear\n\n    const wx = c[0] - a[0];\n    const wy = c[1] - a[1];\n    const u = (wx * ey - wy * ex) / denom; // parameter along a-b\n    const v = (wx * ry - wy * rx) / denom; // parameter along c-d\n\n    return u >= 0 && u <= 1 && v >= 0 && v <= 1;\n}\n\n/**\n * Computes the intersection point of the two closed segments a-b and c-d,\n * writing it to `out`. Returns `out` when the segments intersect, or `null`\n * when they do not (including parallel/collinear segments).\n *\n * @param out output parameter for the intersection point\n * @param a first endpoint of the first segment\n * @param b second endpoint of the first segment\n * @param c first endpoint of the second segment\n * @param d second endpoint of the second segment\n * @returns out if the segments intersect, otherwise null\n */\nexport function intersection(out: Vec2, a: Vec2, b: Vec2, c: Vec2, d: Vec2): Vec2 | null {\n    const rx = b[0] - a[0];\n    const ry = b[1] - a[1];\n    const ex = d[0] - c[0];\n    const ey = d[1] - c[1];\n\n    const denom = rx * ey - ry * ex;\n    if (denom === 0) return null;\n\n    const wx = c[0] - a[0];\n    const wy = c[1] - a[1];\n    const u = (wx * ey - wy * ex) / denom;\n    const v = (wx * ry - wy * rx) / denom;\n\n    if (u < 0 || u > 1 || v < 0 || v > 1) return null;\n\n    out[0] = a[0] + u * rx;\n    out[1] = a[1] + u * ry;\n    return out;\n}\n"],"names":[],"mappings":"AAEA;;;;;;AAMG;AACG,SAAU,YAAY,CAAC,GAAS,EAAE,KAAW,EAAE,CAAO,EAAE,CAAO,EAAA;IACjE,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACvB,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACvB,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAC1B,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAE1B,MAAM,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;IAC/B,IAAI,CAAC,GAAG,GAAG,GAAG,EAAE,GAAG,GAAG,GAAG,EAAE;IAC3B,IAAI,CAAC,GAAG,CAAC;QAAE,CAAC,IAAI,CAAC;IACjB,IAAI,CAAC,GAAG,CAAC;QAAE,CAAC,GAAG,CAAC;SACX,IAAI,CAAC,GAAG,CAAC;QAAE,CAAC,GAAG,CAAC;AAErB,IAAA,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG;AACvB,IAAA,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG;AAEvB,IAAA,OAAO,GAAG;AACd;AAEA;;;;;;;;;;AAUG;AACG,SAAU,UAAU,CAAC,CAAO,EAAE,CAAO,EAAE,CAAO,EAAE,CAAO,EAAA;IACzD,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACtB,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACtB,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACtB,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAEtB,MAAM,KAAK,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE;IAC/B,IAAI,KAAK,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IAE9B,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACtB,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AACtB,IAAA,MAAM,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,KAAK,CAAC;AACtC,IAAA,MAAM,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,KAAK,CAAC;AAEtC,IAAA,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;AAC/C;AAEA;;;;;;;;;;;AAWG;AACG,SAAU,YAAY,CAAC,GAAS,EAAE,CAAO,EAAE,CAAO,EAAE,CAAO,EAAE,CAAO,EAAA;IACtE,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACtB,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACtB,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACtB,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAEtB,MAAM,KAAK,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE;IAC/B,IAAI,KAAK,KAAK,CAAC;AAAE,QAAA,OAAO,IAAI;IAE5B,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACtB,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AACtB,IAAA,MAAM,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,KAAK;AACrC,IAAA,MAAM,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,KAAK;AAErC,IAAA,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC;AAAE,QAAA,OAAO,IAAI;AAEjD,IAAA,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE;AACtB,IAAA,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE;AACtB,IAAA,OAAO,GAAG;AACd;;;;"}

package/dist/shapes/sphere.js

@@ -0,0 +1,23 @@
+/**
+ * Creates a new sphere with a default center 0,0,0 and radius 1
+ * @returns A new sphere.
+ */
+function create() {
+    return { center: [0, 0, 0], radius: 1 };
+}
+/**
+ * Returns true if a point lies inside (or on the surface of) the sphere.
+ *
+ * @param sphere the sphere
+ * @param point the point to test
+ * @returns true if the point is within the sphere's radius
+ */
+function containsPoint(sphere, point) {
+    const dx = point[0] - sphere.center[0];
+    const dy = point[1] - sphere.center[1];
+    const dz = point[2] - sphere.center[2];
+    return dx * dx + dy * dy + dz * dz <= sphere.radius * sphere.radius;
+}
+
+export { containsPoint, create };
+//# sourceMappingURL=sphere.js.map

package/dist/shapes/sphere.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"sphere.js","sources":["../../src/shapes/sphere.ts"],"sourcesContent":["import type { Vec3 } from '../core/vec3';\n\n/** A sphere in 3D space */\nexport type Sphere = { center: Vec3; radius: number };\n\n/**\n * Creates a new sphere with a default center 0,0,0 and radius 1\n * @returns A new sphere.\n */\nexport function create(): Sphere {\n    return { center: [0, 0, 0], radius: 1 };\n}\n\n/**\n * Returns true if a point lies inside (or on the surface of) the sphere.\n *\n * @param sphere the sphere\n * @param point the point to test\n * @returns true if the point is within the sphere's radius\n */\nexport function containsPoint(sphere: Sphere, point: Vec3): boolean {\n    const dx = point[0] - sphere.center[0];\n    const dy = point[1] - sphere.center[1];\n    const dz = point[2] - sphere.center[2];\n    return dx * dx + dy * dy + dz * dz <= sphere.radius * sphere.radius;\n}\n"],"names":[],"mappings":"AAKA;;;AAGG;SACa,MAAM,GAAA;AAClB,IAAA,OAAO,EAAE,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE;AAC3C;AAEA;;;;;;AAMG;AACG,SAAU,aAAa,CAAC,MAAc,EAAE,KAAW,EAAA;AACrD,IAAA,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;AACtC,IAAA,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;AACtC,IAAA,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;AACtC,IAAA,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,MAAM,CAAC,MAAM,GAAG,MAAM,CAAC,MAAM;AACvE;;;;"}

package/dist/shapes/triangle2.js

@@ -0,0 +1,79 @@
+/**
+ * Returns the signed area of the triangle (a, b, c). The result is positive when
+ * the vertices wind counter-clockwise, negative when they wind clockwise, and
+ * zero when the three points are collinear.
+ *
+ * @param a the first vertex of the triangle.
+ * @param b the second vertex of the triangle.
+ * @param c the third vertex of the triangle.
+ * @returns the signed area.
+ */
+function signedArea(a, b, c) {
+    return ((b[0] - a[0]) * (c[1] - a[1]) - (c[0] - a[0]) * (b[1] - a[1])) / 2;
+}
+/**
+ * Returns the (non-negative) area of the triangle (a, b, c).
+ *
+ * @param a the first vertex of the triangle.
+ * @param b the second vertex of the triangle.
+ * @param c the third vertex of the triangle.
+ * @returns the absolute area.
+ */
+function area(a, b, c) {
+    return Math.abs(signedArea(a, b, c));
+}
+/**
+ * Computes the centroid of the triangle (a, b, c).
+ *
+ * @param out the output vector to store the result.
+ * @param a the first vertex of the triangle.
+ * @param b the second vertex of the triangle.
+ * @param c the third vertex of the triangle.
+ * @returns out.
+ */
+function centroid(out, a, b, c) {
+    out[0] = (a[0] + b[0] + c[0]) / 3;
+    out[1] = (a[1] + b[1] + c[1]) / 3;
+    return out;
+}
+/**
+ * Computes the axis-aligned bounding box of the triangle (a, b, c).
+ *
+ * @param out the output box to store the result.
+ * @param a the first vertex of the triangle.
+ * @param b the second vertex of the triangle.
+ * @param c the third vertex of the triangle.
+ * @returns out.
+ */
+function bounds(out, a, b, c) {
+    out[0] = Math.min(a[0], b[0], c[0]);
+    out[1] = Math.min(a[1], b[1], c[1]);
+    out[2] = Math.max(a[0], b[0], c[0]);
+    out[3] = Math.max(a[1], b[1], c[1]);
+    return out;
+}
+/**
+ * Tests whether a point lies inside the triangle (a, b, c). Works for either
+ * winding order; points on an edge or vertex are considered inside.
+ *
+ * @param a the first vertex of the triangle.
+ * @param b the second vertex of the triangle.
+ * @param c the third vertex of the triangle.
+ * @param point the point to test.
+ * @returns true if the point is inside (or on the boundary of) the triangle.
+ */
+function containsPoint(a, b, c, point) {
+    const px = point[0];
+    const py = point[1];
+    // Sign of the point relative to each directed edge. Inside iff the point is
+    // on the same side of all three (allowing zero for the boundary).
+    const d1 = (px - b[0]) * (a[1] - b[1]) - (a[0] - b[0]) * (py - b[1]);
+    const d2 = (px - c[0]) * (b[1] - c[1]) - (b[0] - c[0]) * (py - c[1]);
+    const d3 = (px - a[0]) * (c[1] - a[1]) - (c[0] - a[0]) * (py - a[1]);
+    const hasNeg = d1 < 0 || d2 < 0 || d3 < 0;
+    const hasPos = d1 > 0 || d2 > 0 || d3 > 0;
+    return !(hasNeg && hasPos);
+}
+
+export { area, bounds, centroid, containsPoint, signedArea };
+//# sourceMappingURL=triangle2.js.map

package/dist/shapes/triangle2.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"triangle2.js","sources":["../../src/shapes/triangle2.ts"],"sourcesContent":["import type { Vec2 } from '../core/vec2';\nimport type { Box2 } from './box2';\n\n/**\n * Returns the signed area of the triangle (a, b, c). The result is positive when\n * the vertices wind counter-clockwise, negative when they wind clockwise, and\n * zero when the three points are collinear.\n *\n * @param a the first vertex of the triangle.\n * @param b the second vertex of the triangle.\n * @param c the third vertex of the triangle.\n * @returns the signed area.\n */\nexport function signedArea(a: Vec2, b: Vec2, c: Vec2): number {\n    return ((b[0] - a[0]) * (c[1] - a[1]) - (c[0] - a[0]) * (b[1] - a[1])) / 2;\n}\n\n/**\n * Returns the (non-negative) area of the triangle (a, b, c).\n *\n * @param a the first vertex of the triangle.\n * @param b the second vertex of the triangle.\n * @param c the third vertex of the triangle.\n * @returns the absolute area.\n */\nexport function area(a: Vec2, b: Vec2, c: Vec2): number {\n    return Math.abs(signedArea(a, b, c));\n}\n\n/**\n * Computes the centroid of the triangle (a, b, c).\n *\n * @param out the output vector to store the result.\n * @param a the first vertex of the triangle.\n * @param b the second vertex of the triangle.\n * @param c the third vertex of the triangle.\n * @returns out.\n */\nexport function centroid(out: Vec2, a: Vec2, b: Vec2, c: Vec2): Vec2 {\n    out[0] = (a[0] + b[0] + c[0]) / 3;\n    out[1] = (a[1] + b[1] + c[1]) / 3;\n    return out;\n}\n\n/**\n * Computes the axis-aligned bounding box of the triangle (a, b, c).\n *\n * @param out the output box to store the result.\n * @param a the first vertex of the triangle.\n * @param b the second vertex of the triangle.\n * @param c the third vertex of the triangle.\n * @returns out.\n */\nexport function bounds(out: Box2, a: Vec2, b: Vec2, c: Vec2): Box2 {\n    out[0] = Math.min(a[0], b[0], c[0]);\n    out[1] = Math.min(a[1], b[1], c[1]);\n    out[2] = Math.max(a[0], b[0], c[0]);\n    out[3] = Math.max(a[1], b[1], c[1]);\n    return out;\n}\n\n/**\n * Tests whether a point lies inside the triangle (a, b, c). Works for either\n * winding order; points on an edge or vertex are considered inside.\n *\n * @param a the first vertex of the triangle.\n * @param b the second vertex of the triangle.\n * @param c the third vertex of the triangle.\n * @param point the point to test.\n * @returns true if the point is inside (or on the boundary of) the triangle.\n */\nexport function containsPoint(a: Vec2, b: Vec2, c: Vec2, point: Vec2): boolean {\n    const px = point[0];\n    const py = point[1];\n\n    // Sign of the point relative to each directed edge. Inside iff the point is\n    // on the same side of all three (allowing zero for the boundary).\n    const d1 = (px - b[0]) * (a[1] - b[1]) - (a[0] - b[0]) * (py - b[1]);\n    const d2 = (px - c[0]) * (b[1] - c[1]) - (b[0] - c[0]) * (py - c[1]);\n    const d3 = (px - a[0]) * (c[1] - a[1]) - (c[0] - a[0]) * (py - a[1]);\n\n    const hasNeg = d1 < 0 || d2 < 0 || d3 < 0;\n    const hasPos = d1 > 0 || d2 > 0 || d3 > 0;\n\n    return !(hasNeg && hasPos);\n}\n"],"names":[],"mappings":"AAGA;;;;;;;;;AASG;SACa,UAAU,CAAC,CAAO,EAAE,CAAO,EAAE,CAAO,EAAA;IAChD,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;AAC9E;AAEA;;;;;;;AAOG;SACa,IAAI,CAAC,CAAO,EAAE,CAAO,EAAE,CAAO,EAAA;AAC1C,IAAA,OAAO,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;AACxC;AAEA;;;;;;;;AAQG;AACG,SAAU,QAAQ,CAAC,GAAS,EAAE,CAAO,EAAE,CAAO,EAAE,CAAO,EAAA;IACzD,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IACjC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;AACjC,IAAA,OAAO,GAAG;AACd;AAEA;;;;;;;;AAQG;AACG,SAAU,MAAM,CAAC,GAAS,EAAE,CAAO,EAAE,CAAO,EAAE,CAAO,EAAA;IACvD,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACnC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACnC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACnC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;AACnC,IAAA,OAAO,GAAG;AACd;AAEA;;;;;;;;;AASG;AACG,SAAU,aAAa,CAAC,CAAO,EAAE,CAAO,EAAE,CAAO,EAAE,KAAW,EAAA;AAChE,IAAA,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC;AACnB,IAAA,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC;;;AAInB,IAAA,MAAM,EAAE,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AACpE,IAAA,MAAM,EAAE,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AACpE,IAAA,MAAM,EAAE,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AAEpE,IAAA,MAAM,MAAM,GAAG,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC;AACzC,IAAA,MAAM,MAAM,GAAG,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC;AAEzC,IAAA,OAAO,EAAE,MAAM,IAAI,MAAM,CAAC;AAC9B;;;;"}

package/dist/shapes/triangle3.js

@@ -0,0 +1,60 @@
+/**
+ * Computes the axis-aligned bounding box of a triangle defined by three vertices.
+ * @param out the output box to store the result.
+ * @param a the first vertex of the triangle.
+ * @param b the second vertex of the triangle.
+ * @param c the third vertex of the triangle.
+ * @returns the output box containing the axis-aligned bounding box of the triangle.
+ */
+function bounds(out, a, b, c) {
+    out[0] = Math.min(a[0], b[0], c[0]);
+    out[1] = Math.min(a[1], b[1], c[1]);
+    out[2] = Math.min(a[2], b[2], c[2]);
+    out[3] = Math.max(a[0], b[0], c[0]);
+    out[4] = Math.max(a[1], b[1], c[1]);
+    out[5] = Math.max(a[2], b[2], c[2]);
+    return out;
+}
+/**
+ * Computes the normal vector of a triangle defined by three vertices.
+ * @param out the output vector to store the result.
+ * @param a the first vertex of the triangle.
+ * @param b the second vertex of the triangle.
+ * @param c the third vertex of the triangle.
+ * @returns the output vector containing the normal of the triangle.
+ */
+function normal(out, a, b, c) {
+    const abx = b[0] - a[0];
+    const aby = b[1] - a[1];
+    const abz = b[2] - a[2];
+    const acx = c[0] - a[0];
+    const acy = c[1] - a[1];
+    const acz = c[2] - a[2];
+    out[0] = aby * acz - abz * acy;
+    out[1] = abz * acx - abx * acz;
+    out[2] = abx * acy - aby * acx;
+    const length = Math.sqrt(out[0] * out[0] + out[1] * out[1] + out[2] * out[2]);
+    if (length > 0) {
+        out[0] /= length;
+        out[1] /= length;
+        out[2] /= length;
+    }
+    return out;
+}
+/**
+ * Computes the centroid of a triangle defined by three vertices.
+ * @param out the output vector to store the result.
+ * @param a the first vertex of the triangle.
+ * @param b the second vertex of the triangle.
+ * @param c the third vertex of the triangle.
+ * @returns the output vector containing the centroid of the triangle.
+ */
+function centroid(out, a, b, c) {
+    out[0] = (a[0] + b[0] + c[0]) / 3;
+    out[1] = (a[1] + b[1] + c[1]) / 3;
+    out[2] = (a[2] + b[2] + c[2]) / 3;
+    return out;
+}
+
+export { bounds, centroid, normal };
+//# sourceMappingURL=triangle3.js.map

package/dist/shapes/triangle3.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"triangle3.js","sources":["../../src/shapes/triangle3.ts"],"sourcesContent":["import type { Vec3 } from '../core/vec3';\nimport type { Box3 } from './box3';\n\n/**\n * Computes the axis-aligned bounding box of a triangle defined by three vertices.\n * @param out the output box to store the result.\n * @param a the first vertex of the triangle.\n * @param b the second vertex of the triangle.\n * @param c the third vertex of the triangle.\n * @returns the output box containing the axis-aligned bounding box of the triangle.\n */\nexport function bounds(out: Box3, a: Vec3, b: Vec3, c: Vec3): Box3 {\n    out[0] = Math.min(a[0], b[0], c[0]);\n    out[1] = Math.min(a[1], b[1], c[1]);\n    out[2] = Math.min(a[2], b[2], c[2]);\n\n    out[3] = Math.max(a[0], b[0], c[0]);\n    out[4] = Math.max(a[1], b[1], c[1]);\n    out[5] = Math.max(a[2], b[2], c[2]);\n\n    return out;\n}\n\n/**\n * Computes the normal vector of a triangle defined by three vertices.\n * @param out the output vector to store the result.\n * @param a the first vertex of the triangle.\n * @param b the second vertex of the triangle.\n * @param c the third vertex of the triangle.\n * @returns the output vector containing the normal of the triangle.\n */\nexport function normal(out: Vec3, a: Vec3, b: Vec3, c: Vec3): Vec3 {\n    const abx = b[0] - a[0];\n    const aby = b[1] - a[1];\n    const abz = b[2] - a[2];\n\n    const acx = c[0] - a[0];\n    const acy = c[1] - a[1];\n    const acz = c[2] - a[2];\n\n    out[0] = aby * acz - abz * acy;\n    out[1] = abz * acx - abx * acz;\n    out[2] = abx * acy - aby * acx;\n\n    const length = Math.sqrt(out[0] * out[0] + out[1] * out[1] + out[2] * out[2]);\n\n    if (length > 0) {\n        out[0] /= length;\n        out[1] /= length;\n        out[2] /= length;\n    }\n\n    return out;\n}\n\n/**\n * Computes the centroid of a triangle defined by three vertices.\n * @param out the output vector to store the result.\n * @param a the first vertex of the triangle.\n * @param b the second vertex of the triangle.\n * @param c the third vertex of the triangle.\n * @returns the output vector containing the centroid of the triangle.\n */\nexport function centroid(out: Vec3, a: Vec3, b: Vec3, c: Vec3): Vec3 {\n    out[0] = (a[0] + b[0] + c[0]) / 3;\n    out[1] = (a[1] + b[1] + c[1]) / 3;\n    out[2] = (a[2] + b[2] + c[2]) / 3;\n\n    return out;\n}\n"],"names":[],"mappings":"AAGA;;;;;;;AAOG;AACG,SAAU,MAAM,CAAC,GAAS,EAAE,CAAO,EAAE,CAAO,EAAE,CAAO,EAAA;IACvD,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACnC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACnC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAEnC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACnC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACnC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;AAEnC,IAAA,OAAO,GAAG;AACd;AAEA;;;;;;;AAOG;AACG,SAAU,MAAM,CAAC,GAAS,EAAE,CAAO,EAAE,CAAO,EAAE,CAAO,EAAA;IACvD,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACvB,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACvB,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAEvB,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACvB,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACvB,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAEvB,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;IAC9B,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;IAC9B,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAE9B,IAAA,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;AAE7E,IAAA,IAAI,MAAM,GAAG,CAAC,EAAE;AACZ,QAAA,GAAG,CAAC,CAAC,CAAC,IAAI,MAAM;AAChB,QAAA,GAAG,CAAC,CAAC,CAAC,IAAI,MAAM;AAChB,QAAA,GAAG,CAAC,CAAC,CAAC,IAAI,MAAM;IACpB;AAEA,IAAA,OAAO,GAAG;AACd;AAEA;;;;;;;AAOG;AACG,SAAU,QAAQ,CAAC,GAAS,EAAE,CAAO,EAAE,CAAO,EAAE,CAAO,EAAA;IACzD,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IACjC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IACjC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;AAEjC,IAAA,OAAO,GAAG;AACd;;;;"}

package/dist/src/color/color.d.ts

@@ -0,0 +1,50 @@
+export * from './parse.js';
+/** A linear-sRGB color: [r, g, b] floats in [0, 1]. */
+export type Color = [r: number, g: number, b: number];
+/** Accepted input types for creating or parsing a Color. */
+export type ColorInput = string | number | [number, number, number];
+/** Create a new Color initialized to black [0, 0, 0]. */
+export declare function create(): Color;
+/** Create a new Color with the given linear r, g, b values. */
+export declare function fromValues(r: number, g: number, b: number): Color;
+/** Create a new Color that is a copy of `c`. */
+export declare function clone(c: Color): Color;
+/** Copy the values from `src` into `out`. Returns `out`. */
+export declare function copy(out: Color, src: Color): Color;
+/** Set the linear r, g, b components of `out` directly. Returns `out`. */
+export declare function set(out: Color, r: number, g: number, b: number): Color;
+/** Set all three channels of `out` to the same linear value `s` (a gray). Returns `out`. */
+export declare function setScalar(out: Color, s: number): Color;
+/**
+ * Set `out` from an sRGB gamma-encoded [r, g, b] array with values in [0, 1].
+ * Converts from sRGB gamma space to linear. Returns `out`.
+ */
+export declare function setFromSRGB(out: Color, srgb: [number, number, number]): Color;
+/** Create a new Color from an sRGB gamma-encoded [r, g, b] array with values in [0, 1]. */
+export declare function fromSRGB(srgb: [number, number, number]): Color;
+/** Write the sRGB gamma-encoded [r, g, b] of a linear Color into `out` (values [0, 1]). */
+export declare function toSRGB(out: [number, number, number], c: Color): [number, number, number];
+/** Create a CSS `rgb(...)` string in sRGB gamma space (for HTML/canvas use). */
+export declare function toCSS(c: Color): string;
+/** Convert to a 0xRRGGBB integer in sRGB gamma space. */
+export declare function toHex(c: Color): number;
+/** Convert to a 6-digit sRGB hex string without a leading '#', e.g. 'ff8800'. */
+export declare function toHexString(c: Color): string;
+/** Add `a + b` component-wise into `out`. Returns `out`. */
+export declare function add(out: Color, a: Color, b: Color): Color;
+/** Add scalar `s` to each channel of `a` into `out`. Returns `out`. */
+export declare function addScalar(out: Color, a: Color, s: number): Color;
+/** Subtract `a - b` component-wise into `out`. Returns `out`. */
+export declare function sub(out: Color, a: Color, b: Color): Color;
+/** Multiply `a * b` component-wise into `out` (tinting). Returns `out`. */
+export declare function multiply(out: Color, a: Color, b: Color): Color;
+/** Scale each channel of `a` by `s` into `out` (brightness). Returns `out`. */
+export declare function multiplyScalar(out: Color, a: Color, s: number): Color;
+/** Linearly interpolate from `a` to `b` by `t` into `out` (physically-correct blend). Returns `out`. */
+export declare function lerp(out: Color, a: Color, b: Color, t: number): Color;
+/** Clamp each channel of `c` to [0, 1] into `out`. Returns `out`. */
+export declare function clamp(out: Color, c: Color): Color;
+/** Whether `a` and `b` are equal, within an optional per-channel `epsilon` (default exact). */
+export declare function equals(a: Color, b: Color, epsilon?: number): boolean;
+/** Relative luminance in [0, 1] (Rec. 709 weights, on linear light). */
+export declare function luminance(c: Color): number;

package/dist/src/color/colorspace.d.ts

@@ -0,0 +1,15 @@
+import type { Color } from './color.js';
+/** Convert a single sRGB gamma-encoded channel [0, 1] to linear light [0, 1]. */
+export declare function srgbToLinear(c: number): number;
+/** Convert a single linear light channel [0, 1] to sRGB gamma-encoded [0, 1]. */
+export declare function linearToSrgb(c: number): number;
+/**
+ * Convert a linear-sRGB Color to linear Display-P3 primaries, into `out`. Returns `out`.
+ * (Both spaces share the sRGB transfer curve; this changes only the primaries.)
+ */
+export declare function linearSrgbToLinearDisplayP3(out: Color, c: Color): Color;
+/**
+ * Convert a linear Display-P3 Color to linear-sRGB primaries, into `out`. Returns `out`.
+ * Colors outside the sRGB gamut yield channels outside [0, 1] — clamp if needed.
+ */
+export declare function linearDisplayP3ToLinearSrgb(out: Color, c: Color): Color;

package/dist/src/color/hsl.d.ts

@@ -0,0 +1,28 @@
+import type { Color } from './color.js';
+/** A hue-saturation-lightness color: [h, s, l], all in [0, 1] (hue wraps). */
+export type HSL = [hue: number, saturation: number, lightness: number];
+/** Create a new HSL initialized to [0, 0, 0] (black). */
+export declare function create(): HSL;
+/** Create a new HSL with the given h, s, l values (all in [0, 1]). */
+export declare function fromValues(h: number, s: number, l: number): HSL;
+/** Create a new HSL that is a copy of `a`. */
+export declare function clone(a: HSL): HSL;
+/** Copy the values from `src` into `out`. Returns `out`. */
+export declare function copy(out: HSL, src: HSL): HSL;
+/** Set the h, s, l components of `out` directly. Returns `out`. */
+export declare function set(out: HSL, h: number, s: number, l: number): HSL;
+/** Write the HSL of a linear Color into `out`. Returns `out`. */
+export declare function fromColor(out: HSL, c: Color): HSL;
+/** Write the linear Color of an HSL into `out`. Returns `out`. */
+export declare function toColor(out: Color, a: HSL): Color;
+/**
+ * Interpolate from `a` to `b` by `t` into `out`, taking the shortest path around
+ * the hue wheel (so e.g. 350°→10° passes through 0°, not all the way back).
+ * Returns `out`.
+ */
+export declare function lerp(out: HSL, a: HSL, b: HSL, t: number): HSL;
+/**
+ * Offset `a` by (dh, ds, dl) into `out`: hue wraps into [0, 1), saturation and
+ * lightness are clamped to [0, 1]. Returns `out`.
+ */
+export declare function offset(out: HSL, a: HSL, dh: number, ds: number, dl: number): HSL;

package/dist/src/color/index.d.ts

@@ -0,0 +1,5 @@
+export * as color from './color.js';
+export * as colorspace from './colorspace.js';
+export * as hsl from './hsl.js';
+export type { Color, ColorInput } from './color.js';
+export type { HSL } from './hsl.js';

package/dist/src/color/parse.d.ts

@@ -0,0 +1,15 @@
+import type { Color, ColorInput } from './color.js';
+/**
+ * Parse any supported color input and write the result into `out`. Returns `out`.
+ *
+ * Supported inputs:
+ *   - CSS hex strings:       '#f00', '#ff0000'
+ *   - CSS rgb():             'rgb(255, 0, 0)', 'rgb(100%, 0%, 0%)'
+ *   - CSS hsl():             'hsl(0, 100%, 50%)'
+ *   - 0xRRGGBB integers:     0xff0000 (sRGB gamma)
+ *   - Named CSS colors:      'red', 'lime', 'deepskyblue', ...
+ *   - [r, g, b] array:       treated as already-linear [0, 1]
+ */
+export declare function setFromColorInput(out: Color, input: ColorInput): Color;
+/** Parse any supported color input into a new Color, or null if unrecognised. */
+export declare function fromColorInput(input: ColorInput): Color | null;

package/dist/src/core/angle.d.ts

@@ -0,0 +1,29 @@
+export declare const DEGREES_TO_RADIANS: number;
+export declare const RADIANS_TO_DEGREES: number;
+/**
+ * Converts Degrees To Radians
+ *
+ * @param a Angle in Degrees
+ */
+export declare function degreesToRadians(degrees: number): number;
+/**
+ * Converts Radians To Degrees
+ *
+ * @param a Angle in Radians
+ */
+export declare function radiansToDegrees(radians: number): number;
+/**
+ * Wraps an angle (in radians) into the range (-π, π].
+ *
+ * @param a the angle to wrap
+ * @returns the angle wrapped into (-π, π]
+ */
+export declare function wrapAngle(a: number): number;
+/**
+ * Calculates the shortest signed difference between two angles (in radians).
+ *
+ * @param current the current angle
+ * @param target the target angle
+ * @returns the shortest signed difference in (-π, π]
+ */
+export declare function deltaAngle(current: number, target: number): number;

package/dist/src/core/arrays.d.ts

@@ -0,0 +1,4 @@
+export type MutableArrayLike<T> = {
+    [index: number]: T;
+    length: number;
+};

package/dist/src/core/euler.d.ts

@@ -0,0 +1,78 @@
+import type { Mat4 } from './mat4.js';
+import type { Quat } from './quat.js';
+/** Euler orders */
+export type EulerOrder = 'xyz' | 'xzy' | 'yxz' | 'yzx' | 'zxy' | 'zyx';
+/** A Euler in 3D space, with an optional order (default is 'xyz') */
+export type Euler = [x: number, y: number, z: number, order?: EulerOrder];
+/**
+ * Creates a new Euler with default values (0, 0, 0, 'xyz').
+ */
+export declare function create(): Euler;
+/**
+ * Creates a new Euler from the given values.
+ * @param x The x rotation in radians.
+ * @param y The y rotation in radians.
+ * @param z The z rotation in radians.
+ * @param order The order of rotation.
+ * @returns A new Euler.
+ */
+export declare function fromValues(x: number, y: number, z: number, order: EulerOrder): Euler;
+/**
+ * Sets a given Euler from the given values.
+ * @param x The x rotation in radians.
+ * @param y The y rotation in radians.
+ * @param z The z rotation in radians.
+ * @param order The order of rotation.
+ * @returns The output Euler.
+ */
+export declare function set(out: Euler, x: number, y: number, z: number, order: EulerOrder): Euler;
+/**
+ * Sets Euler angle radians from given degrees
+ * @param out The output Euler.
+ * @param x The x rotation in degrees.
+ * @param y The y rotation in degrees.
+ * @param z The z rotation in degrees.
+ * @param order The order of rotation.
+ * @returns The output Euler.
+ */
+export declare function fromDegrees(out: Euler, x: number, y: number, z: number, order: EulerOrder): Euler;
+/**
+ * Sets the Euler angles from a rotation matrix.
+ * @param out The output Euler.
+ * @param rotationMatrix The input rotation matrix.
+ * @param order The order of the Euler angles.
+ * @returns The output Euler.
+ */
+export declare function fromRotationMat4(out: Euler, rotationMatrix: Mat4, order?: EulerOrder): Euler;
+/**
+ * Returns whether or not the euler angles have exactly the same elements in the same position (when compared with ===)
+ *
+ * @param a The first euler.
+ * @param b The second euler.
+ * @returns True if the euler angles are equal, false otherwise.
+ */
+export declare function exactEquals(a: Euler, b: Euler): boolean;
+/**
+ * Returns whether or not the euler angles have approximately the same elements in the same position.
+ *
+ * @param a The first euler.
+ * @param b The second euler.
+ * @returns True if the euler angles are equal, false otherwise.
+ */
+export declare function equals(a: Euler, b: Euler): boolean;
+/**
+ * Sets the Euler angles from a quaternion.
+ * @param out The output Euler.
+ * @param q The input quaternion. Assumed to be normalized (unit length).
+ * @param order The order of the Euler.
+ * @returns The output Euler
+ */
+export declare function fromQuat(out: Euler, q: Quat, order: EulerOrder): Euler;
+/**
+ * Reorders the Euler based on the specified order.
+ * @param out The output Euler.
+ * @param a The input Euler.
+ * @param order The order of the Euler.
+ * @returns The output Euler.
+ */
+export declare function reorder(out: Euler, a: Euler, order: EulerOrder): Euler;

package/dist/src/core/index.d.ts

@@ -0,0 +1,27 @@
+export * from './scalar.js';
+export * from './angle.js';
+export type { MutableArrayLike } from './arrays.js';
+export * as vec2 from './vec2.js';
+export type { Vec2 } from './vec2.js';
+export * as vec3 from './vec3.js';
+export type { Vec3 } from './vec3.js';
+export * as vec4 from './vec4.js';
+export type { Vec4 } from './vec4.js';
+export * as euler from './euler.js';
+export type { Euler, EulerOrder } from './euler.js';
+export * as quat from './quat.js';
+export type { Quat } from './quat.js';
+export * as quat2 from './quat2.js';
+export type { Quat2 } from './quat2.js';
+export * as mat2 from './mat2.js';
+export type { Mat2 } from './mat2.js';
+export * as mat2d from './mat2d.js';
+export type { Mat2d } from './mat2d.js';
+export * as mat3 from './mat3.js';
+export type { Mat3 } from './mat3.js';
+export * as mat4 from './mat4.js';
+export type { Mat4 } from './mat4.js';
+export * as spherical from './spherical.js';
+export type { Spherical } from './spherical.js';
+export * as polar from './polar.js';
+export type { Polar } from './polar.js';