/**
 * Perform linear optimization across the tree, similar to rotations, but we support somewhat arbitrary depth and all possible permutations
 * Note that the root does not move, but everything below the root is subject to change
 * @see "Fast Parallel Construction of High-Quality Bounding Volume Hierarchies" by Kerras, NVIDIA 2013
 * @param {BVH} bvh
 * @param {number} [root] where to start optimization, only nodes below this one will be considered
 * @param {number} [treelet_size] the larger the size - the more optimization opportunities, but it gets exponentially slower
 */
export function ebvh_optimize_treelet(bvh: BVH, root?: number, treelet_size?: number): void;
//# sourceMappingURL=ebvh_optimize_treelet.d.ts.map