@weasel-js/geom 1.12.0 → 1.13.0

package/dist/nd/index.d.ts

@@ -92,4 +92,43 @@ declare function resolveSnap<M>(problem: SnapProblem<M>): SnapResolution<M>;
  */
 declare function stepLine(about: Vec, toward: Vec, basis: readonly [Vec, Vec], step: number): Flat;
 
-export { type Flat, type ProbeRole, type SnapCandidate, type SnapProbe, type SnapProblem, type SnapResolution, type SnapTier, type Vec, closestBetweenFlats, closestOnFlat, flatDim, intersectFlats, resolveSnap, stepLine };
+/** Traversals over a `BvhTree`. Each takes its buffers from a `Scratch`,
+ *  so a query allocates nothing unless a visit re-enters the tree. */
+
+/** A half-space bounded by a plane: a point `x` is inside when
+ *  `dot(normal, x) + offset >= 0`. */
+interface HalfSpace {
+    normal: ArrayLike<number>;
+    offset: number;
+}
+
+/** Box layout: [min_0..min_{d-1}, max_0..max_{d-1}]. */
+type BoxN = ArrayLike<number>;
+/** A bounding volume hierarchy keyed by `K`, made by {@link createBvh}. */
+interface Bvh<K> {
+    readonly dim: number;
+    readonly size: number;
+    /** False (and not stored) when any coordinate is non-finite or min > max.
+     *  Inserting a key already present updates it. */
+    insert(key: K, box: BoxN): boolean;
+    /** False, keeping the old box, when the key is absent or the box invalid. */
+    update(key: K, box: BoxN): boolean;
+    remove(key: K): boolean;
+    /** Tighten every node box after updates that only moved items in place. */
+    refit(): void;
+    /** Rebuild the hierarchy top-down from the current boxes. */
+    rebuild(): void;
+    /** visit returns false to stop. In every query, changing the tree from inside
+     *  a visit (insert, update, remove, refit, rebuild) is undefined. */
+    queryBox(box: BoxN, visit: (key: K) => boolean | void): void;
+    queryPoint(p: ArrayLike<number>, visit: (key: K) => boolean | void): void;
+    /** Leaves in nondecreasing order of box entry distance t (t >= 0, t <= tMax). */
+    raycast(origin: ArrayLike<number>, dir: ArrayLike<number>, visit: (key: K, t: number) => boolean | void, tMax?: number): void;
+    /** Leaves whose box is not wholly outside any half-space (conservative). */
+    queryHalfSpaces(planes: readonly HalfSpace[], visit: (key: K) => boolean | void): void;
+}
+/** A BVH over `dim`-dimensional boxes, built top-down from `entries` when
+ *  given. Entries with an invalid box are skipped. */
+declare function createBvh<K>(dim: number, entries?: Iterable<readonly [K, BoxN]>): Bvh<K>;
+
+export { type BoxN, type Bvh, type Flat, type HalfSpace, type ProbeRole, type SnapCandidate, type SnapProbe, type SnapProblem, type SnapResolution, type SnapTier, type Vec, closestBetweenFlats, closestOnFlat, createBvh, flatDim, intersectFlats, resolveSnap, stepLine };