/**
 * Compute bounding tetrahedron (3d simplex) for a given set of input points
 * The algorithm is pretty basic, it projects each point onto 4 planes and pushes planes away from origin to the furthest projected point
 * then, we take intersection points between those planes to get our bounding tetrahedron
 *
 * @see https://github.com/bryanmcnett/aabo/blob/master/aabo.cpp
 *
 * @author Alex Goldring
 * @copyright Company Named Limited (c) 2026
 *
 * @param {number[]|Float32Array|Float64Array} result
 * @param {number} result_offset
 * @param {number[]|Float32Array|Float64Array} input
 * @param {number} input_count
 * @param {number} padding Planar offset for each of the simple sides, positive padding value will create a larger simplex. Useful for ensuring that input points do not lie directly on the simplex planes
 */
export function compute_bounding_simplex_3d(result: number[] | Float32Array | Float64Array, result_offset: number, input: number[] | Float32Array | Float64Array, input_count: number, padding: number): void;
//# sourceMappingURL=compute_bounding_simplex_3d.d.ts.map