@ifc-lite/renderer 1.38.1 → 1.40.0

package/dist/pointcloud/point-cloud-spatial-index.js

@@ -0,0 +1,536 @@
+/* This Source Code Form is subject to the terms of the Mozilla Public
+ * License, v. 2.0. If a copy of the MPL was not distributed with this
+ * file, You can obtain one at https://mozilla.org/MPL/2.0/. */
+/**
+ * Default cell edge, metres. Coarse relative to typical scan spacing
+ * (millimetres to a few centimetres) so a query rarely visits more than
+ * a handful of cells, while small enough that a query near building
+ * scale doesn't degenerate into "search almost everything".
+ */
+export const DEFAULT_POINTCLOUD_INDEX_CELL_SIZE = 0.5;
+/**
+ * Hard cap on how many points a single index will hold. Beyond this,
+ * further inserted points still upload to the GPU normally (rendering
+ * is unaffected) but are simply not indexed, so the measure tool can't
+ * snap to them. This is the "last resort" from the design brief: full,
+ * uncapped indexing is strongly preferred (snapping wants real points),
+ * so this only bites on genuinely extreme clouds — at ~20 bytes/point
+ * of CPU overhead (12 bytes retained positions + ~8 bytes grid), 30M
+ * points is already ~600 MB of additional retained memory.
+ */
+export const DEFAULT_MAX_INDEXED_POINTS = 30_000_000;
+/**
+ * Cap on the per-visited-cell neighborhood dilation radius, in cells
+ * (issue #1860 review finding 1). `toleranceAt(t)` GROWS with depth
+ * (it's a screen-space pixel tolerance projected to world units), so a
+ * fixed +-1 cell dilation (~0.5 * cellSize of perpendicular coverage)
+ * silently stops covering the true tolerance once
+ * `toleranceAt(t) > cellSize` — which for the measure tool's ~8px
+ * tolerance happens around t = 60-130 m depending on canvas/fov, i.e.
+ * exactly the zoomed-out site-scale scans where this matters most.
+ * `queryRay` instead computes `r = clamp(ceil(toleranceAt(t)/cellSize),
+ * 1, MAX_DILATION_RADIUS_CELLS)` at every visited cell and dilates by
+ * that many cells. Capped so a single visited cell never tests more
+ * than `(2*4+1)^3 = 729` cells worst case; beyond the cap the
+ * *effective* snap radius clamps at `MAX_DILATION_RADIUS_CELLS *
+ * cellSize` (2 m at the default 0.5 m cell size) instead of growing
+ * unbounded with depth.
+ */
+export const MAX_DILATION_RADIUS_CELLS = 4;
+/**
+ * Cell coordinates are packed RELATIVE to the first indexed point's cell
+ * (`cellOrigin*` below), clamped to ±`CELL_KEY_BIAS` cells per axis. The
+ * relative range must be small enough that the packed triple stays an
+ * EXACT f64 integer: with a per-axis range of 2^17 the maximum key is
+ * (2^17)^3 = 2^51 < 2^53, so distinct cells always get distinct keys.
+ * (The previous absolute-coordinate packing used a 2^21 range whose keys
+ * reached ~2^62 — beyond f64's 53-bit integer precision, silently
+ * merging every z-column of cells within ~1024 cells into one bucket,
+ * and additionally aliasing outright for georeferenced clouds beyond
+ * ±524 km. Merged buckets stayed *correct* — `testPoint` re-checks real
+ * positions — but degraded the query from O(cells) toward O(points).)
+ *
+ * ±2^16 relative cells at the default 0.5 m cell size covers ±32.7 km
+ * around the first point — beyond any physically plausible single scan.
+ * Points outside that window clamp onto the boundary cells (they merge
+ * buckets there, degrading gracefully instead of breaking).
+ */
+const CELL_KEY_BIAS = 1 << 16; // 65,536 cells = ±32.7 km at 0.5 m cells
+const CELL_KEY_RANGE = CELL_KEY_BIAS * 2; // 2^17 per axis → max key 2^51, f64-exact
+/**
+ * Absolute cap on DDA march steps per query (CodeRabbit CLI review,
+ * PR #1875). `maxSteps` otherwise scales with the ray's traversal of the
+ * cloud's bounding box, and `maxDistance` is `Infinity` whenever the
+ * cursor has no mesh under it — so a total-miss march across an
+ * un-rebased site-scale aerial cloud (50 km box) walked ~200k cells with
+ * up-to-729-cell neighborhoods on EVERY pointer move (measured 0.2-4.4 s
+ * per query). 8192 steps cover ≥2.4 km of ray travel from the box entry
+ * (≥ cellSize/√3 of t per step; ~4 km axis-aligned at 0.5 m cells) —
+ * far beyond snapping's useful range: the effective snap radius already
+ * clamps at `MAX_DILATION_RADIUS_CELLS * cellSize` (2 m), which is
+ * sub-pixel past ~1 km at any practical zoom, so points beyond the cap
+ * were unsnappable in practice anyway. Bounds worst-case query work
+ * independent of the cloud's geographic extent.
+ */
+const MAX_MARCH_CELLS = 8192;
+/** √3 — a cube cell's diagonal in units of its edge length. */
+const CELL_DIAGONAL = Math.sqrt(3);
+/** Clamp a relative cell coordinate into the packable per-axis window. */
+function clampRelCell(c) {
+    return c < -CELL_KEY_BIAS ? -CELL_KEY_BIAS : c >= CELL_KEY_BIAS ? CELL_KEY_BIAS - 1 : c;
+}
+/** Is `classId` visible under a normalized 8-word class bitmask?
+ *  (`undefined`/missing words default to visible, matching
+ *  `normalizeClassMask`.) */
+function classVisible(classMask, classId) {
+    if (!classMask)
+        return true;
+    const word = classMask[classId >> 5];
+    if (word === undefined)
+        return true;
+    return ((word >>> (classId & 31)) & 1) === 1;
+}
+/** Axis-aligned ray/box entry+exit distances, or null on a miss. */
+function rayBoxEntryExit(origin, dir, box) {
+    let tMin = -Infinity;
+    let tMax = Infinity;
+    const axes = ['x', 'y', 'z'];
+    for (const ax of axes) {
+        const o = origin[ax];
+        const d = dir[ax];
+        if (Math.abs(d) < 1e-12) {
+            if (o < box.min[ax] || o > box.max[ax])
+                return null;
+            continue;
+        }
+        let t1 = (box.min[ax] - o) / d;
+        let t2 = (box.max[ax] - o) / d;
+        if (t1 > t2) {
+            const tmp = t1;
+            t1 = t2;
+            t2 = tmp;
+        }
+        if (t1 > tMin)
+            tMin = t1;
+        if (t2 < tMax)
+            tMax = t2;
+        if (tMin > tMax)
+            return null;
+    }
+    if (tMax < 0)
+        return null;
+    return { tMin, tMax };
+}
+/**
+ * CPU spatial index for one point-cloud asset. Insert incrementally via
+ * `insertRange` as chunks stream in; query via `queryRay`. Not thread
+ * safe (single-threaded main-thread structure, matching the renderer).
+ */
+export class PointCloudSpatialIndex {
+    cellSize;
+    maxIndexedPoints;
+    cells = new Map();
+    chunks = [];
+    total = 0;
+    minX = Infinity;
+    minY = Infinity;
+    minZ = Infinity;
+    maxX = -Infinity;
+    maxY = -Infinity;
+    maxZ = -Infinity;
+    /**
+     * Cell coordinates of the first indexed point — the origin every packed
+     * cell key is relative to (see `CELL_KEY_BIAS`). Rebasing per index keeps
+     * keys f64-exact even for un-rebased georeferenced clouds (e.g. Swiss
+     * LV95 eastings ~2.6e6 m → absolute cell ~5.2e6, far outside any
+     * absolute packing window, but within ±2^16 cells of the cloud's own
+     * first point).
+     */
+    cellOriginX = 0;
+    cellOriginY = 0;
+    cellOriginZ = 0;
+    hasCellOrigin = false;
+    /** Pack ABSOLUTE cell coordinates into one exact-integer key. */
+    packKey(cx, cy, cz) {
+        const ux = clampRelCell(cx - this.cellOriginX) + CELL_KEY_BIAS;
+        const uy = clampRelCell(cy - this.cellOriginY) + CELL_KEY_BIAS;
+        const uz = clampRelCell(cz - this.cellOriginZ) + CELL_KEY_BIAS;
+        return (ux * CELL_KEY_RANGE + uy) * CELL_KEY_RANGE + uz;
+    }
+    constructor(cellSize = DEFAULT_POINTCLOUD_INDEX_CELL_SIZE, maxIndexedPoints = DEFAULT_MAX_INDEXED_POINTS) {
+        this.cellSize = cellSize > 0 && Number.isFinite(cellSize) ? cellSize : DEFAULT_POINTCLOUD_INDEX_CELL_SIZE;
+        this.maxIndexedPoints =
+            maxIndexedPoints > 0 && Number.isFinite(maxIndexedPoints)
+                ? Math.floor(maxIndexedPoints)
+                : DEFAULT_MAX_INDEXED_POINTS;
+    }
+    /** Total number of points currently indexed (may be less than the
+     *  asset's true point count once `maxIndexedPoints` is hit). */
+    get pointCount() {
+        return this.total;
+    }
+    /** True once further inserts are silently dropped (memory safety valve). */
+    get isCapped() {
+        return this.total >= this.maxIndexedPoints;
+    }
+    /**
+     * Insert the first `count` xyz triples of `positions` (renderer/world
+     * space — the same frame `queryRay` expects). Keeps `positions` (and
+     * `classifications`, when given) BY REFERENCE; the caller must not
+     * mutate them afterwards. A no-op past `maxIndexedPoints` (see class
+     * docs) — points beyond the cap render normally but are not indexed
+     * for picking. When a chunk CROSSES the cap, only the accepted prefix
+     * is retained (copied) so the cap genuinely bounds retained memory —
+     * keeping the whole source array by reference would retain e.g. a
+     * 100M-point one-shot chunk's full 1.2 GB for a 30M-point cap.
+     */
+    insertRange(positions, count, classifications) {
+        if (count <= 0 || this.total >= this.maxIndexedPoints)
+            return;
+        const usable = Math.min(count, this.maxIndexedPoints - this.total);
+        const startId = this.total;
+        const retainedPositions = usable < count ? positions.slice(0, usable * 3) : positions;
+        const retainedClasses = classifications
+            ? (usable < count ? classifications.slice(0, usable) : classifications)
+            : null;
+        this.chunks.push({ positions: retainedPositions, classifications: retainedClasses, count: usable, startId });
+        for (let i = 0; i < usable; i++) {
+            const o = i * 3;
+            const x = positions[o];
+            const y = positions[o + 1];
+            const z = positions[o + 2];
+            if (!Number.isFinite(x) || !Number.isFinite(y) || !Number.isFinite(z))
+                continue;
+            if (x < this.minX)
+                this.minX = x;
+            if (x > this.maxX)
+                this.maxX = x;
+            if (y < this.minY)
+                this.minY = y;
+            if (y > this.maxY)
+                this.maxY = y;
+            if (z < this.minZ)
+                this.minZ = z;
+            if (z > this.maxZ)
+                this.maxZ = z;
+            const cx = Math.floor(x / this.cellSize);
+            const cy = Math.floor(y / this.cellSize);
+            const cz = Math.floor(z / this.cellSize);
+            if (!this.hasCellOrigin) {
+                this.cellOriginX = cx;
+                this.cellOriginY = cy;
+                this.cellOriginZ = cz;
+                this.hasCellOrigin = true;
+            }
+            const key = this.packKey(cx, cy, cz);
+            let bucket = this.cells.get(key);
+            if (!bucket) {
+                bucket = [];
+                this.cells.set(key, bucket);
+            }
+            bucket.push(startId + i);
+        }
+        this.total += usable;
+    }
+    /** World-space bounds of every indexed point, or null when empty. */
+    getBounds() {
+        if (this.total === 0 || !Number.isFinite(this.minX))
+            return null;
+        return {
+            min: { x: this.minX, y: this.minY, z: this.minZ },
+            max: { x: this.maxX, y: this.maxY, z: this.maxZ },
+        };
+    }
+    /** Resolve a global point id to its owning chunk, or null. */
+    chunkFor(globalId) {
+        // Chunks are appended in id order, so `startId` is sorted ascending —
+        // binary search for the owning chunk (dense buckets can resolve
+        // thousands of ids per query; a linear chunk scan would multiply
+        // that by the chunk count, ~150 for a 30M-point stream).
+        const chunks = this.chunks;
+        let lo = 0;
+        let hi = chunks.length - 1;
+        while (lo < hi) {
+            const mid = (lo + hi + 1) >> 1;
+            if (chunks[mid].startId <= globalId)
+                lo = mid;
+            else
+                hi = mid - 1;
+        }
+        const c = chunks[lo];
+        if (c && globalId >= c.startId && globalId < c.startId + c.count)
+            return c;
+        // Unreachable: every id in `cells` was handed out by this instance.
+        return null;
+    }
+    testPoint(p, origin, dir, maxDistance, toleranceAt) {
+        const vx = p.x - origin.x;
+        const vy = p.y - origin.y;
+        const vz = p.z - origin.z;
+        // t = distance along the ray to the closest approach point (dir is
+        // assumed unit length — true for every ray this module receives,
+        // see raycast-engine.ts / camera-projection.ts unprojectToRay).
+        const t = vx * dir.x + vy * dir.y + vz * dir.z;
+        if (t < 0 || t > maxDistance)
+            return null; // behind camera, or past the caller's bound
+        const px = origin.x + dir.x * t;
+        const py = origin.y + dir.y * t;
+        const pz = origin.z + dir.z * t;
+        const dx = p.x - px;
+        const dy = p.y - py;
+        const dz = p.z - pz;
+        const perp = Math.sqrt(dx * dx + dy * dy + dz * dz);
+        if (perp > toleranceAt(t))
+            return null;
+        return { position: p, distance: t };
+    }
+    /**
+     * Test points in the dilated cell block around (cx,cy,cz), skipping
+     * cells already visited by an earlier step of the same query.
+     * `radiusCells` must cover `toleranceAt(t)` at the depth this cell is
+     * visited at — see `queryRay`'s per-step radius computation (#1860
+     * review finding 1: a fixed +-1 dilation under-covers tolerance at
+     * long range).
+     *
+     * When `slabAxis` is 0/1/2 the scan is restricted to the LEADING SLAB
+     * of the block along that axis (offset `slabDir * radiusCells`, the
+     * `(2r+1)^2` cells newly uncovered by a one-cell DDA advance) instead
+     * of the full `(2r+1)^3` block (hosted CodeRabbit review, PR #1875):
+     * consecutive DDA steps overlap ~90% of their blocks, and while the
+     * `visited` set kept the overlap from re-scanning buckets, every probe
+     * still paid `packKey` + `Set.has` — ~6M map operations for a capped
+     * worst-case march at radius 4. Since the DDA advances exactly one
+     * axis by exactly one cell per step, `block(new) \ block(old)` IS that
+     * leading slab whenever the radius is unchanged; `queryRay` passes
+     * `slabAxis: -1` (full block) for the first cell and whenever the
+     * radius changed between steps.
+     */
+    testCellNeighborhood(cx, cy, cz, radiusCells, origin, dir, maxDistance, toleranceAt, classMask, visited, best, slabAxis = -1, slabDir = 1) {
+        const r = radiusCells;
+        const lead = slabDir * r;
+        const xLo = slabAxis === 0 ? lead : -r;
+        const xHi = slabAxis === 0 ? lead : r;
+        const yLo = slabAxis === 1 ? lead : -r;
+        const yHi = slabAxis === 1 ? lead : r;
+        const zLo = slabAxis === 2 ? lead : -r;
+        const zHi = slabAxis === 2 ? lead : r;
+        for (let dx = xLo; dx <= xHi; dx++) {
+            for (let dy = yLo; dy <= yHi; dy++) {
+                for (let dz = zLo; dz <= zHi; dz++) {
+                    const key = this.packKey(cx + dx, cy + dy, cz + dz);
+                    // The `visited` dedup is only worth paying for FULL-block scans
+                    // (first cell / radius changes): a leading slab is disjoint from
+                    // every earlier block by construction — each block-centre axis
+                    // coordinate is monotone along the march, so the slab's fixed
+                    // coordinate `c + slabDir * r` lies strictly beyond every prior
+                    // block's extent (for the production monotone-radius case; a
+                    // non-monotone `toleranceAt` can at worst re-test a bucket,
+                    // which is idempotent — `testPoint` recomputes and `best` takes
+                    // the min). Skipping the Set here removes two hash operations
+                    // per probed cell — the dominant cost of long marches.
+                    if (slabAxis === -1) {
+                        if (visited.has(key))
+                            continue;
+                        visited.add(key);
+                    }
+                    const bucket = this.cells.get(key);
+                    if (!bucket)
+                        continue;
+                    for (const globalId of bucket) {
+                        const chunk = this.chunkFor(globalId);
+                        if (!chunk)
+                            continue;
+                        const local = globalId - chunk.startId;
+                        // Skip points the splat shader currently hides via the LAS
+                        // class visibility mask (#1783) — the measure tool must not
+                        // snap to invisible scan data. Classification-free chunks
+                        // are class 0, mirroring the GPU vertex packing.
+                        const classId = chunk.classifications ? chunk.classifications[local] : 0;
+                        if (!classVisible(classMask, classId))
+                            continue;
+                        const o = local * 3;
+                        const p = { x: chunk.positions[o], y: chunk.positions[o + 1], z: chunk.positions[o + 2] };
+                        const hit = this.testPoint(p, origin, dir, maxDistance, toleranceAt);
+                        if (hit && (!best.hit || hit.distance < best.hit.distance))
+                            best.hit = hit;
+                    }
+                }
+            }
+        }
+    }
+    /**
+     * Nearest indexed point to `ray` (origin + unit `dir`) within
+     * `toleranceAt(t)` world units of the ray axis at depth `t`,
+     * restricted to `[0, maxDistance]`. Returns the candidate with the
+     * SMALLEST `t` (nearest along the ray) among everything within
+     * tolerance — not necessarily the one closest to the ray's infinite
+     * line — matching how a real surface point would occlude anything
+     * behind it.
+     *
+     * O(cells touched) via an Amanatides & Woo DDA march from the ray's
+     * entry into the index's bounding box. `toleranceAt(t)` grows with
+     * depth, so each visited cell's neighborhood dilation radius is
+     * recomputed from `toleranceAt` at that cell's ray parameter —
+     * `clamp(ceil(toleranceAt(t)/cellSize), 1, MAX_DILATION_RADIUS_CELLS)`
+     * — instead of a fixed +-1 cell, so a point within the true
+     * screen-space tolerance is never missed just because it's more than
+     * half a cell off the ray's exact cell path at long range (#1860
+     * review finding 1). Marching stops one cell past the first
+     * tolerance hit (using the largest radius seen so far, conservative),
+     * since DDA visits cells in non-decreasing ray-parameter order.
+     */
+    queryRay(origin, dir, maxDistance, toleranceAt, 
+    /** Normalized 8-word LAS class visibility bitmask (#1783); points of
+     *  hidden classes are skipped. Omit/null for "everything visible". */
+    classMask) {
+        if (this.total === 0 || maxDistance <= 0)
+            return null;
+        const bounds = this.getBounds();
+        if (!bounds)
+            return null;
+        const cs = this.cellSize;
+        // Pad the coarse bounding-box cull by the MAX possible dilation
+        // radius (not just one cell): `bounds` is the exact (often
+        // near-zero-thickness, e.g. a flat wall scan) extent of the indexed
+        // points, so an UNPADDED box/ray test would reject a ray that
+        // passes close to — but not exactly through — the box, even though
+        // a point within tolerance sits just past its face. Since the
+        // per-cell dilation radius below can grow up to
+        // `MAX_DILATION_RADIUS_CELLS` cells at long range, the outer cull
+        // must be padded by the same amount or a ray whose only near-miss
+        // is right at the cloud's edge could be rejected before the march
+        // even starts.
+        const maxPad = MAX_DILATION_RADIUS_CELLS * cs;
+        const paddedBounds = {
+            min: { x: bounds.min.x - maxPad, y: bounds.min.y - maxPad, z: bounds.min.z - maxPad },
+            max: { x: bounds.max.x + maxPad, y: bounds.max.y + maxPad, z: bounds.max.z + maxPad },
+        };
+        const entry = rayBoxEntryExit(origin, dir, paddedBounds);
+        if (!entry)
+            return null;
+        const tMin = Math.max(0, entry.tMin);
+        const tMax = Math.min(maxDistance, entry.tMax);
+        if (tMax < tMin)
+            return null;
+        const startX = origin.x + dir.x * tMin;
+        const startY = origin.y + dir.y * tMin;
+        const startZ = origin.z + dir.z * tMin;
+        let cx = Math.floor(startX / cs);
+        let cy = Math.floor(startY / cs);
+        let cz = Math.floor(startZ / cs);
+        const stepX = dir.x > 0 ? 1 : dir.x < 0 ? -1 : 0;
+        const stepY = dir.y > 0 ? 1 : dir.y < 0 ? -1 : 0;
+        const stepZ = dir.z > 0 ? 1 : dir.z < 0 ? -1 : 0;
+        const axisTMax = (o, d, cell) => {
+            if (d === 0)
+                return Infinity;
+            const boundary = d > 0 ? (cell + 1) * cs : cell * cs;
+            return (boundary - o) / d;
+        };
+        const axisTDelta = (d) => (d === 0 ? Infinity : Math.abs(cs / d));
+        let tMaxX = axisTMax(origin.x, dir.x, cx);
+        let tMaxY = axisTMax(origin.y, dir.y, cy);
+        let tMaxZ = axisTMax(origin.z, dir.z, cz);
+        const tDeltaX = axisTDelta(dir.x);
+        const tDeltaY = axisTDelta(dir.y);
+        const tDeltaZ = axisTDelta(dir.z);
+        const best = { hit: null };
+        const visited = new Set();
+        let t = tMin;
+        // Largest dilation radius (in cells) used by any step so far — the
+        // early-break margin below must use this, not a fixed 1, since a
+        // hit found under a wide (long-range) radius could still have a
+        // nearer neighbor one radius-worth of cells further along the ray.
+        let maxRadiusUsed = 1;
+        // Safety cap: bounds the loop even if DDA step math misbehaves at a
+        // grazing angle (near-zero direction components with fp error), AND
+        // bounds worst-case work per query via the absolute `MAX_MARCH_CELLS`
+        // ceiling — without it a total-miss march across a site-scale cloud
+        // with `maxDistance = Infinity` (no mesh under the cursor) walked the
+        // whole bounding box on every pointer move (see MAX_MARCH_CELLS docs).
+        const maxSteps = Math.min(MAX_MARCH_CELLS, 8 + Math.ceil((tMax - tMin) / cs) * 3);
+        // Which axis (and direction) the DDA advanced to REACH the current
+        // cell, so the neighborhood scan can restrict itself to the block's
+        // newly uncovered leading slab (see `testCellNeighborhood`). -1 for
+        // the first cell (no previous block) and after a radius change
+        // (block shape changed, rescan it whole; `visited` dedups overlap).
+        // `toleranceAt` is monotone in production (constant in ortho, linear
+        // in perspective), so the radius changes at most 3 times per query.
+        let steppedAxis = -1;
+        let steppedDir = 1;
+        let prevRadius = 0;
+        for (let step = 0; step < maxSteps && t <= tMax; step++) {
+            // Dilation radius covering toleranceAt(t) at THIS cell's ray
+            // parameter — toleranceAt grows with depth, so a fixed +-1 cell
+            // (as before #1860 finding 1) silently under-covers tolerance
+            // once toleranceAt(t) exceeds one cell size.
+            const tolWorld = toleranceAt(Math.max(0, t));
+            const radius = Math.min(MAX_DILATION_RADIUS_CELLS, Math.max(1, Math.ceil(tolWorld / cs)));
+            if (radius > maxRadiusUsed)
+                maxRadiusUsed = radius;
+            const slabAxis = radius === prevRadius ? steppedAxis : -1;
+            this.testCellNeighborhood(cx, cy, cz, radius, origin, dir, tMax, toleranceAt, classMask, visited, best, slabAxis, steppedDir);
+            prevRadius = radius;
+            // DDA visits cells in non-decreasing t order, so once we have a
+            // hit and have advanced well past it, no later cell can hold a
+            // nearer point — stop early instead of walking to tMax. Using the
+            // largest radius seen so far (rather than the current step's) is
+            // conservative: a hit found under a wide dilation could still have
+            // a nearer point just beyond a narrower later step's smaller
+            // neighborhood. The margin accounts for the dilated block's full
+            // diagonal (CodeRabbit CLI review, PR #1875): a cell at offset
+            // (±r,±r,±r) is never on the march path itself, so a point inside
+            // it can project onto the ray up to (r + 1) * cs * √3 BEHIND this
+            // step's `t` — a straight `maxRadiusUsed * cs` margin could break
+            // before the off-axis corner cell holding the true nearest point
+            // was ever dilated into view.
+            const breakMargin = (maxRadiusUsed + 1) * cs * CELL_DIAGONAL;
+            if (best.hit && t > best.hit.distance + breakMargin)
+                break;
+            if (tMaxX < tMaxY) {
+                if (tMaxX < tMaxZ) {
+                    t = tMaxX;
+                    cx += stepX;
+                    tMaxX += tDeltaX;
+                    steppedAxis = 0;
+                    steppedDir = stepX < 0 ? -1 : 1;
+                }
+                else {
+                    t = tMaxZ;
+                    cz += stepZ;
+                    tMaxZ += tDeltaZ;
+                    steppedAxis = 2;
+                    steppedDir = stepZ < 0 ? -1 : 1;
+                }
+            }
+            else if (tMaxY < tMaxZ) {
+                t = tMaxY;
+                cy += stepY;
+                tMaxY += tDeltaY;
+                steppedAxis = 1;
+                steppedDir = stepY < 0 ? -1 : 1;
+            }
+            else {
+                t = tMaxZ;
+                cz += stepZ;
+                tMaxZ += tDeltaZ;
+                steppedAxis = 2;
+                steppedDir = stepZ < 0 ? -1 : 1;
+            }
+        }
+        return best.hit;
+    }
+    /** Drop every retained position array and grid bucket. Call when the
+     *  owning PointCloudNode is destroyed so nothing outlives its GPU
+     *  resources (see `destroyNode` in point-cloud-node.ts). */
+    dispose() {
+        this.cells.clear();
+        this.chunks = [];
+        this.total = 0;
+        this.minX = this.minY = this.minZ = Infinity;
+        this.maxX = this.maxY = this.maxZ = -Infinity;
+        this.cellOriginX = this.cellOriginY = this.cellOriginZ = 0;
+        this.hasCellOrigin = false;
+    }
+}
+//# sourceMappingURL=point-cloud-spatial-index.js.map

package/dist/pointcloud/point-cloud-spatial-index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"point-cloud-spatial-index.js","sourceRoot":"","sources":["../../src/pointcloud/point-cloud-spatial-index.ts"],"names":[],"mappings":"AAAA;;+DAE+D;AAwC/D;;;;;GAKG;AACH,MAAM,CAAC,MAAM,kCAAkC,GAAG,GAAG,CAAC;AAEtD;;;;;;;;;GASG;AACH,MAAM,CAAC,MAAM,0BAA0B,GAAG,UAAU,CAAC;AAErD;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,CAAC,MAAM,yBAAyB,GAAG,CAAC,CAAC;AAE3C;;;;;;;;;;;;;;;;;GAiBG;AACH,MAAM,aAAa,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,yCAAyC;AACxE,MAAM,cAAc,GAAG,aAAa,GAAG,CAAC,CAAC,CAAC,0CAA0C;AAEpF;;;;;;;;;;;;;;GAcG;AACH,MAAM,eAAe,GAAG,IAAI,CAAC;AAE7B,+DAA+D;AAC/D,MAAM,aAAa,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AAEnC,0EAA0E;AAC1E,SAAS,YAAY,CAAC,CAAS;IAC7B,OAAO,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,IAAI,aAAa,CAAC,CAAC,CAAC,aAAa,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAC1F,CAAC;AAoBD;;6BAE6B;AAC7B,SAAS,YAAY,CAAC,SAAyC,EAAE,OAAe;IAC9E,IAAI,CAAC,SAAS;QAAE,OAAO,IAAI,CAAC;IAC5B,MAAM,IAAI,GAAG,SAAS,CAAC,OAAO,IAAI,CAAC,CAAC,CAAC;IACrC,IAAI,IAAI,KAAK,SAAS;QAAE,OAAO,IAAI,CAAC;IACpC,OAAO,CAAC,CAAC,IAAI,KAAK,CAAC,OAAO,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;AAC/C,CAAC;AASD,oEAAoE;AACpE,SAAS,eAAe,CACtB,MAAY,EACZ,GAAS,EACT,GAA6B;IAE7B,IAAI,IAAI,GAAG,CAAC,QAAQ,CAAC;IACrB,IAAI,IAAI,GAAG,QAAQ,CAAC;IACpB,MAAM,IAAI,GAA8B,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;IACxD,KAAK,MAAM,EAAE,IAAI,IAAI,EAAE,CAAC;QACtB,MAAM,CAAC,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC;QACrB,MAAM,CAAC,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC;QAClB,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,KAAK,EAAE,CAAC;YACxB,IAAI,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBAAE,OAAO,IAAI,CAAC;YACpD,SAAS;QACX,CAAC;QACD,IAAI,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QAC/B,IAAI,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QAC/B,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;YACZ,MAAM,GAAG,GAAG,EAAE,CAAC;YACf,EAAE,GAAG,EAAE,CAAC;YACR,EAAE,GAAG,GAAG,CAAC;QACX,CAAC;QACD,IAAI,EAAE,GAAG,IAAI;YAAE,IAAI,GAAG,EAAE,CAAC;QACzB,IAAI,EAAE,GAAG,IAAI;YAAE,IAAI,GAAG,EAAE,CAAC;QACzB,IAAI,IAAI,GAAG,IAAI;YAAE,OAAO,IAAI,CAAC;IAC/B,CAAC;IACD,IAAI,IAAI,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC;IAC1B,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;AACxB,CAAC;AAED;;;;GAIG;AACH,MAAM,OAAO,sBAAsB;IAChB,QAAQ,CAAS;IACjB,gBAAgB,CAAS;IACzB,KAAK,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC7C,MAAM,GAAmB,EAAE,CAAC;IAC5B,KAAK,GAAG,CAAC,CAAC;IAEV,IAAI,GAAG,QAAQ,CAAC;IAChB,IAAI,GAAG,QAAQ,CAAC;IAChB,IAAI,GAAG,QAAQ,CAAC;IAChB,IAAI,GAAG,CAAC,QAAQ,CAAC;IACjB,IAAI,GAAG,CAAC,QAAQ,CAAC;IACjB,IAAI,GAAG,CAAC,QAAQ,CAAC;IAEzB;;;;;;;OAOG;IACK,WAAW,GAAG,CAAC,CAAC;IAChB,WAAW,GAAG,CAAC,CAAC;IAChB,WAAW,GAAG,CAAC,CAAC;IAChB,aAAa,GAAG,KAAK,CAAC;IAE9B,iEAAiE;IACzD,OAAO,CAAC,EAAU,EAAE,EAAU,EAAE,EAAU;QAChD,MAAM,EAAE,GAAG,YAAY,CAAC,EAAE,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,aAAa,CAAC;QAC/D,MAAM,EAAE,GAAG,YAAY,CAAC,EAAE,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,aAAa,CAAC;QAC/D,MAAM,EAAE,GAAG,YAAY,CAAC,EAAE,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,aAAa,CAAC;QAC/D,OAAO,CAAC,EAAE,GAAG,cAAc,GAAG,EAAE,CAAC,GAAG,cAAc,GAAG,EAAE,CAAC;IAC1D,CAAC;IAED,YACE,WAAmB,kCAAkC,EACrD,mBAA2B,0BAA0B;QAErD,IAAI,CAAC,QAAQ,GAAG,QAAQ,GAAG,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,kCAAkC,CAAC;QAC1G,IAAI,CAAC,gBAAgB;YACnB,gBAAgB,GAAG,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,gBAAgB,CAAC;gBACvD,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,gBAAgB,CAAC;gBAC9B,CAAC,CAAC,0BAA0B,CAAC;IACnC,CAAC;IAED;oEACgE;IAChE,IAAI,UAAU;QACZ,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED,4EAA4E;IAC5E,IAAI,QAAQ;QACV,OAAO,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,gBAAgB,CAAC;IAC7C,CAAC;IAED;;;;;;;;;;OAUG;IACH,WAAW,CAAC,SAAuB,EAAE,KAAa,EAAE,eAAmC;QACrF,IAAI,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,gBAAgB;YAAE,OAAO;QAC9D,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,gBAAgB,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;QACnE,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC;QAC3B,MAAM,iBAAiB,GAAG,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QACtF,MAAM,eAAe,GAAG,eAAe;YACrC,CAAC,CAAC,CAAC,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC;YACvE,CAAC,CAAC,IAAI,CAAC;QACT,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,SAAS,EAAE,iBAAiB,EAAE,eAAe,EAAE,eAAe,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC,CAAC;QAC7G,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAChC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAChB,MAAM,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;YACvB,MAAM,CAAC,GAAG,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC3B,MAAM,CAAC,GAAG,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC3B,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;gBAAE,SAAS;YAChF,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI;gBAAE,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;YACjC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI;gBAAE,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;YACjC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI;gBAAE,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;YACjC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI;gBAAE,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;YACjC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI;gBAAE,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;YACjC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI;gBAAE,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;YACjC,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC;YACzC,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC;YACzC,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC;YACzC,IAAI,CAAC,IAAI,CAAC,aAAa,EAAE,CAAC;gBACxB,IAAI,CAAC,WAAW,GAAG,EAAE,CAAC;gBACtB,IAAI,CAAC,WAAW,GAAG,EAAE,CAAC;gBACtB,IAAI,CAAC,WAAW,GAAG,EAAE,CAAC;gBACtB,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC;YAC5B,CAAC;YACD,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;YACrC,IAAI,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACjC,IAAI,CAAC,MAAM,EAAE,CAAC;gBACZ,MAAM,GAAG,EAAE,CAAC;gBACZ,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;YAC9B,CAAC;YACD,MAAM,CAAC,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC;QAC3B,CAAC;QACD,IAAI,CAAC,KAAK,IAAI,MAAM,CAAC;IACvB,CAAC;IAED,qEAAqE;IACrE,SAAS;QACP,IAAI,IAAI,CAAC,KAAK,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC;YAAE,OAAO,IAAI,CAAC;QACjE,OAAO;YACL,GAAG,EAAE,EAAE,CAAC,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE,IAAI,CAAC,IAAI,EAAE;YACjD,GAAG,EAAE,EAAE,CAAC,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE,IAAI,CAAC,IAAI,EAAE;SAClD,CAAC;IACJ,CAAC;IAED,8DAA8D;IACtD,QAAQ,CAAC,QAAgB;QAC/B,sEAAsE;QACtE,gEAAgE;QAChE,iEAAiE;QACjE,yDAAyD;QACzD,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;QAC3B,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,IAAI,EAAE,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;QAC3B,OAAO,EAAE,GAAG,EAAE,EAAE,CAAC;YACf,MAAM,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;YAC/B,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,OAAO,IAAI,QAAQ;gBAAE,EAAE,GAAG,GAAG,CAAC;;gBACzC,EAAE,GAAG,GAAG,GAAG,CAAC,CAAC;QACpB,CAAC;QACD,MAAM,CAAC,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC;QACrB,IAAI,CAAC,IAAI,QAAQ,IAAI,CAAC,CAAC,OAAO,IAAI,QAAQ,GAAG,CAAC,CAAC,OAAO,GAAG,CAAC,CAAC,KAAK;YAAE,OAAO,CAAC,CAAC;QAC3E,oEAAoE;QACpE,OAAO,IAAI,CAAC;IACd,CAAC;IAEO,SAAS,CACf,CAAO,EACP,MAAY,EACZ,GAAS,EACT,WAAmB,EACnB,WAAkC;QAElC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;QAC1B,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;QAC1B,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;QAC1B,mEAAmE;QACnE,iEAAiE;QACjE,gEAAgE;QAChE,MAAM,CAAC,GAAG,EAAE,GAAG,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC;QAC/C,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,WAAW;YAAE,OAAO,IAAI,CAAC,CAAC,4CAA4C;QACvF,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QAChC,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QAChC,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QAChC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;QACpB,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;QACpB,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;QACpB,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;QACpD,IAAI,IAAI,GAAG,WAAW,CAAC,CAAC,CAAC;YAAE,OAAO,IAAI,CAAC;QACvC,OAAO,EAAE,QAAQ,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC;IACtC,CAAC;IAED;;;;;;;;;;;;;;;;;;;;OAoBG;IACK,oBAAoB,CAC1B,EAAU,EACV,EAAU,EACV,EAAU,EACV,WAAmB,EACnB,MAAY,EACZ,GAAS,EACT,WAAmB,EACnB,WAAkC,EAClC,SAAyC,EACzC,OAAoB,EACpB,IAAsC,EACtC,WAA2B,CAAC,CAAC,EAC7B,UAAkB,CAAC;QAEnB,MAAM,CAAC,GAAG,WAAW,CAAC;QACtB,MAAM,IAAI,GAAG,OAAO,GAAG,CAAC,CAAC;QACzB,MAAM,GAAG,GAAG,QAAQ,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACvC,MAAM,GAAG,GAAG,QAAQ,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QACtC,MAAM,GAAG,GAAG,QAAQ,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACvC,MAAM,GAAG,GAAG,QAAQ,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QACtC,MAAM,GAAG,GAAG,QAAQ,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACvC,MAAM,GAAG,GAAG,QAAQ,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QACtC,KAAK,IAAI,EAAE,GAAG,GAAG,EAAE,EAAE,IAAI,GAAG,EAAE,EAAE,EAAE,EAAE,CAAC;YACnC,KAAK,IAAI,EAAE,GAAG,GAAG,EAAE,EAAE,IAAI,GAAG,EAAE,EAAE,EAAE,EAAE,CAAC;gBACnC,KAAK,IAAI,EAAE,GAAG,GAAG,EAAE,EAAE,IAAI,GAAG,EAAE,EAAE,EAAE,EAAE,CAAC;oBACnC,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC;oBACpD,gEAAgE;oBAChE,iEAAiE;oBACjE,+DAA+D;oBAC/D,8DAA8D;oBAC9D,gEAAgE;oBAChE,6DAA6D;oBAC7D,4DAA4D;oBAC5D,gEAAgE;oBAChE,8DAA8D;oBAC9D,uDAAuD;oBACvD,IAAI,QAAQ,KAAK,CAAC,CAAC,EAAE,CAAC;wBACpB,IAAI,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC;4BAAE,SAAS;wBAC/B,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;oBACnB,CAAC;oBACD,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;oBACnC,IAAI,CAAC,MAAM;wBAAE,SAAS;oBACtB,KAAK,MAAM,QAAQ,IAAI,MAAM,EAAE,CAAC;wBAC9B,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;wBACtC,IAAI,CAAC,KAAK;4BAAE,SAAS;wBACrB,MAAM,KAAK,GAAG,QAAQ,GAAG,KAAK,CAAC,OAAO,CAAC;wBACvC,2DAA2D;wBAC3D,4DAA4D;wBAC5D,0DAA0D;wBAC1D,iDAAiD;wBACjD,MAAM,OAAO,GAAG,KAAK,CAAC,eAAe,CAAC,CAAC,CAAC,KAAK,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;wBACzE,IAAI,CAAC,YAAY,CAAC,SAAS,EAAE,OAAO,CAAC;4BAAE,SAAS;wBAChD,MAAM,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC;wBACpB,MAAM,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;wBAC1F,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,WAAW,EAAE,WAAW,CAAC,CAAC;wBACrE,IAAI,GAAG,IAAI,CAAC,CAAC,IAAI,CAAC,GAAG,IAAI,GAAG,CAAC,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC;4BAAE,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;oBAC7E,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED;;;;;;;;;;;;;;;;;;;;OAoBG;IACH,QAAQ,CACN,MAAY,EACZ,GAAS,EACT,WAAmB,EACnB,WAAkC;IAClC;0EACsE;IACtE,SAA8B;QAE9B,IAAI,IAAI,CAAC,KAAK,KAAK,CAAC,IAAI,WAAW,IAAI,CAAC;YAAE,OAAO,IAAI,CAAC;QACtD,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;QAChC,IAAI,CAAC,MAAM;YAAE,OAAO,IAAI,CAAC;QAEzB,MAAM,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC;QACzB,gEAAgE;QAChE,2DAA2D;QAC3D,oEAAoE;QACpE,8DAA8D;QAC9D,mEAAmE;QACnE,8DAA8D;QAC9D,gDAAgD;QAChD,kEAAkE;QAClE,kEAAkE;QAClE,kEAAkE;QAClE,eAAe;QACf,MAAM,MAAM,GAAG,yBAAyB,GAAG,EAAE,CAAC;QAC9C,MAAM,YAAY,GAAG;YACnB,GAAG,EAAE,EAAE,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,EAAE;YACrF,GAAG,EAAE,EAAE,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,EAAE;SACtF,CAAC;QAEF,MAAM,KAAK,GAAG,eAAe,CAAC,MAAM,EAAE,GAAG,EAAE,YAAY,CAAC,CAAC;QACzD,IAAI,CAAC,KAAK;YAAE,OAAO,IAAI,CAAC;QACxB,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;QACrC,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;QAC/C,IAAI,IAAI,GAAG,IAAI;YAAE,OAAO,IAAI,CAAC;QAE7B,MAAM,MAAM,GAAG,MAAM,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC;QACvC,MAAM,MAAM,GAAG,MAAM,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC;QACvC,MAAM,MAAM,GAAG,MAAM,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC;QAEvC,IAAI,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,EAAE,CAAC,CAAC;QACjC,IAAI,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,EAAE,CAAC,CAAC;QACjC,IAAI,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,EAAE,CAAC,CAAC;QAEjC,MAAM,KAAK,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACjD,MAAM,KAAK,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACjD,MAAM,KAAK,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAEjD,MAAM,QAAQ,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,IAAY,EAAU,EAAE;YAC9D,IAAI,CAAC,KAAK,CAAC;gBAAE,OAAO,QAAQ,CAAC;YAC7B,MAAM,QAAQ,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,IAAI,GAAG,EAAE,CAAC;YACrD,OAAO,CAAC,QAAQ,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QAC5B,CAAC,CAAC;QACF,MAAM,UAAU,GAAG,CAAC,CAAS,EAAU,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;QAElF,IAAI,KAAK,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC1C,IAAI,KAAK,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC1C,IAAI,KAAK,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC1C,MAAM,OAAO,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAClC,MAAM,OAAO,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAClC,MAAM,OAAO,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAElC,MAAM,IAAI,GAAqC,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC;QAC7D,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,IAAI,CAAC,GAAG,IAAI,CAAC;QACb,mEAAmE;QACnE,iEAAiE;QACjE,gEAAgE;QAChE,mEAAmE;QACnE,IAAI,aAAa,GAAG,CAAC,CAAC;QAEtB,oEAAoE;QACpE,oEAAoE;QACpE,sEAAsE;QACtE,oEAAoE;QACpE,sEAAsE;QACtE,uEAAuE;QACvE,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,eAAe,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QAClF,mEAAmE;QACnE,oEAAoE;QACpE,oEAAoE;QACpE,+DAA+D;QAC/D,oEAAoE;QACpE,qEAAqE;QACrE,oEAAoE;QACpE,IAAI,WAAW,GAAmB,CAAC,CAAC,CAAC;QACrC,IAAI,UAAU,GAAW,CAAC,CAAC;QAC3B,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,QAAQ,IAAI,CAAC,IAAI,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC;YACxD,6DAA6D;YAC7D,gEAAgE;YAChE,8DAA8D;YAC9D,6CAA6C;YAC7C,MAAM,QAAQ,GAAG,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAC7C,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CACrB,yBAAyB,EACzB,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,QAAQ,GAAG,EAAE,CAAC,CAAC,CACtC,CAAC;YACF,IAAI,MAAM,GAAG,aAAa;gBAAE,aAAa,GAAG,MAAM,CAAC;YAEnD,MAAM,QAAQ,GAAG,MAAM,KAAK,UAAU,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC1D,IAAI,CAAC,oBAAoB,CACvB,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,EAAE,IAAI,EAAE,WAAW,EAAE,SAAS,EAAE,OAAO,EAAE,IAAI,EAC5E,QAAQ,EAAE,UAAU,CACrB,CAAC;YACF,UAAU,GAAG,MAAM,CAAC;YAEpB,gEAAgE;YAChE,+DAA+D;YAC/D,kEAAkE;YAClE,iEAAiE;YACjE,mEAAmE;YACnE,6DAA6D;YAC7D,iEAAiE;YACjE,+DAA+D;YAC/D,kEAAkE;YAClE,kEAAkE;YAClE,kEAAkE;YAClE,iEAAiE;YACjE,8BAA8B;YAC9B,MAAM,WAAW,GAAG,CAAC,aAAa,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,aAAa,CAAC;YAC7D,IAAI,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,GAAG,WAAW;gBAAE,MAAM;YAE3D,IAAI,KAAK,GAAG,KAAK,EAAE,CAAC;gBAClB,IAAI,KAAK,GAAG,KAAK,EAAE,CAAC;oBAClB,CAAC,GAAG,KAAK,CAAC;oBACV,EAAE,IAAI,KAAK,CAAC;oBACZ,KAAK,IAAI,OAAO,CAAC;oBACjB,WAAW,GAAG,CAAC,CAAC;oBAChB,UAAU,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAClC,CAAC;qBAAM,CAAC;oBACN,CAAC,GAAG,KAAK,CAAC;oBACV,EAAE,IAAI,KAAK,CAAC;oBACZ,KAAK,IAAI,OAAO,CAAC;oBACjB,WAAW,GAAG,CAAC,CAAC;oBAChB,UAAU,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAClC,CAAC;YACH,CAAC;iBAAM,IAAI,KAAK,GAAG,KAAK,EAAE,CAAC;gBACzB,CAAC,GAAG,KAAK,CAAC;gBACV,EAAE,IAAI,KAAK,CAAC;gBACZ,KAAK,IAAI,OAAO,CAAC;gBACjB,WAAW,GAAG,CAAC,CAAC;gBAChB,UAAU,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAClC,CAAC;iBAAM,CAAC;gBACN,CAAC,GAAG,KAAK,CAAC;gBACV,EAAE,IAAI,KAAK,CAAC;gBACZ,KAAK,IAAI,OAAO,CAAC;gBACjB,WAAW,GAAG,CAAC,CAAC;gBAChB,UAAU,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAClC,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC,GAAG,CAAC;IAClB,CAAC;IAED;;gEAE4D;IAC5D,OAAO;QACL,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QACnB,IAAI,CAAC,MAAM,GAAG,EAAE,CAAC;QACjB,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;QACf,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,GAAG,QAAQ,CAAC;QAC7C,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,GAAG,CAAC,QAAQ,CAAC;QAC9C,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,WAAW,GAAG,CAAC,CAAC;QAC3D,IAAI,CAAC,aAAa,GAAG,KAAK,CAAC;IAC7B,CAAC;CACF"}

package/dist/pointcloud/point-cloud-uniforms.d.ts

@@ -1,6 +1,18 @@
 import type { PointCloudNode } from './point-cloud-node.js';
 export type PointColorMode = 'rgb' | 'classification' | 'intensity' | 'height' | 'fixed' | 'deviation';
 export type PointSizeMode = 'fixed-px' | 'adaptive-world' | 'attenuated';
+/** Number of u32 words in the 256-bit LAS class-visibility mask. */
+export declare const CLASS_MASK_WORDS = 8;
+/**
+ * Normalize the public `classMask` option into the 8-word (256-bit)
+ * uniform layout. Accepts:
+ *   - `undefined`          → all classes visible
+ *   - `number` (legacy)    → bits 0..31 as given; classes 32..255 stay
+ *                            visible, matching the old 32-bit semantics
+ *   - `ArrayLike<number>`  → up to 8 words, LSB-first; missing or
+ *                            non-finite words default to all-visible
+ */
+export declare function normalizeClassMask(mask: number | ArrayLike<number> | undefined): Uint32Array;
 export declare const COLOR_MODE_INDEX: Record<PointColorMode, number>;
 export declare const SIZE_MODE_INDEX: Record<PointSizeMode, number>;
 export interface PointUniformInputs {
@@ -18,8 +30,8 @@ export interface PointUniformInputs {
     heightMax: number;
     viewportW: number;
     viewportH: number;
-    /** Per-ASPRS-class visibility bitmask (32 bits = LAS 1.4 classes). */
-    classMask: number;
+    /** 256-bit LAS class-visibility mask, 8 u32 words LSB-first (#1783). */
+    classMask: Uint32Array;
     /** Preview stride — 1 = full density, N = render every Nth point. */
     previewStride: number;
     /** BIM ↔ scan deviation heatmap range (metres). */

package/dist/pointcloud/point-cloud-uniforms.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"point-cloud-uniforms.d.ts","sourceRoot":"","sources":["../../src/pointcloud/point-cloud-uniforms.ts"],"names":[],"mappings":"AAaA,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AAE5D,MAAM,MAAM,cAAc,GACtB,KAAK,GACL,gBAAgB,GAChB,WAAW,GACX,QAAQ,GACR,OAAO,GACP,WAAW,CAAC;AAEhB,MAAM,MAAM,aAAa,GAAG,UAAU,GAAG,gBAAgB,GAAG,YAAY,CAAC;AAEzE,eAAO,MAAM,gBAAgB,EAAE,MAAM,CAAC,cAAc,EAAE,MAAM,CAO3D,CAAC;AAEF,eAAO,MAAM,eAAe,EAAE,MAAM,CAAC,aAAa,EAAE,MAAM,CAIzD,CAAC;AAEF,MAAM,WAAW,kBAAkB;IACjC,QAAQ,EAAE,YAAY,CAAC;IACvB,UAAU,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;IAC7C,SAAS,EAAE,cAAc,CAAC;IAC1B,QAAQ,EAAE,aAAa,CAAC;IACxB,SAAS,EAAE,MAAM,CAAC;IAClB,WAAW,EAAE,MAAM,CAAC;IACpB,UAAU,EAAE,OAAO,CAAC;IACpB,aAAa,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;IACxC,WAAW,EAAE,MAAM,CAAC;IACpB,cAAc,EAAE,OAAO,CAAC;IACxB,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,EAAE,MAAM,CAAC;IAClB,sEAAsE;IACtE,SAAS,EAAE,MAAM,CAAC;IAClB,qEAAqE;IACrE,aAAa,EAAE,MAAM,CAAC;IACtB,mDAAmD;IACnD,qBAAqB,EAAE,MAAM,CAAC;IAC9B,kBAAkB,EAAE,MAAM,CAAC;CAC5B;AAED;;;;;GAKG;AACH,wBAAgB,uBAAuB,CACrC,MAAM,EAAE,SAAS,EACjB,OAAO,EAAE,YAAY,EACrB,UAAU,EAAE,WAAW,EACvB,IAAI,EAAE,cAAc,EACpB,MAAM,EAAE,kBAAkB,GACzB,IAAI,CAwDN"}
+{"version":3,"file":"point-cloud-uniforms.d.ts","sourceRoot":"","sources":["../../src/pointcloud/point-cloud-uniforms.ts"],"names":[],"mappings":"AAaA,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AAG5D,MAAM,MAAM,cAAc,GACtB,KAAK,GACL,gBAAgB,GAChB,WAAW,GACX,QAAQ,GACR,OAAO,GACP,WAAW,CAAC;AAEhB,MAAM,MAAM,aAAa,GAAG,UAAU,GAAG,gBAAgB,GAAG,YAAY,CAAC;AAEzE,oEAAoE;AACpE,eAAO,MAAM,gBAAgB,IAAI,CAAC;AAElC;;;;;;;;GAQG;AACH,wBAAgB,kBAAkB,CAChC,IAAI,EAAE,MAAM,GAAG,SAAS,CAAC,MAAM,CAAC,GAAG,SAAS,GAC3C,WAAW,CAYb;AAED,eAAO,MAAM,gBAAgB,EAAE,MAAM,CAAC,cAAc,EAAE,MAAM,CAO3D,CAAC;AAEF,eAAO,MAAM,eAAe,EAAE,MAAM,CAAC,aAAa,EAAE,MAAM,CAIzD,CAAC;AAEF,MAAM,WAAW,kBAAkB;IACjC,QAAQ,EAAE,YAAY,CAAC;IACvB,UAAU,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;IAC7C,SAAS,EAAE,cAAc,CAAC;IAC1B,QAAQ,EAAE,aAAa,CAAC;IACxB,SAAS,EAAE,MAAM,CAAC;IAClB,WAAW,EAAE,MAAM,CAAC;IACpB,UAAU,EAAE,OAAO,CAAC;IACpB,aAAa,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;IACxC,WAAW,EAAE,MAAM,CAAC;IACpB,cAAc,EAAE,OAAO,CAAC;IACxB,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,EAAE,MAAM,CAAC;IAClB,wEAAwE;IACxE,SAAS,EAAE,WAAW,CAAC;IACvB,qEAAqE;IACrE,aAAa,EAAE,MAAM,CAAC;IACtB,mDAAmD;IACnD,qBAAqB,EAAE,MAAM,CAAC;IAC9B,kBAAkB,EAAE,MAAM,CAAC;CAC5B;AAED;;;;;GAKG;AACH,wBAAgB,uBAAuB,CACrC,MAAM,EAAE,SAAS,EACjB,OAAO,EAAE,YAAY,EACrB,UAAU,EAAE,WAAW,EACvB,IAAI,EAAE,cAAc,EACpB,MAAM,EAAE,kBAAkB,GACzB,IAAI,CAqEN"}