/**
 * Compute the Minkowski-difference support point for two convex shapes.
 *
 * `support_{A−B}(d) = support_A(+d) − support_B(−d)`
 *
 * This is the bread-and-butter operation of both GJK and MPR — every
 * iteration of either algorithm calls it once with a search direction
 * to extend the simplex or portal. Factoring it lets the two
 * algorithms share the per-call scratch buffers (the support results
 * for A and B before the subtraction) so a build that imports both
 * doesn't carry duplicate state.
 *
 * The supplied direction need not be unit — we normalise here, since
 * the {@link AbstractShape3D#support} contract assumes a unit vector
 * and shape support implementations (sphere especially) don't bother
 * to renormalise internally.
 *
 * NOTE: the robust penetration query (`gjk_epa_penetration.js`) computes
 * its own Minkowski-difference support inline rather than calling this
 * helper — it is self-contained (its own GJK + EPA) and works on world-
 * space support providers, so it does not share this body-space path.
 *
 * @param {Float64Array|number[]} result  3-vector destination
 * @param {number} result_offset
 * @param {AbstractShape3D} shape_a
 * @param {AbstractShape3D} shape_b
 * @param {number} dir_x  search direction (any non-zero magnitude)
 * @param {number} dir_y
 * @param {number} dir_z
 */
export function minkowski_support(result: Float64Array | number[], result_offset: number, shape_a: AbstractShape3D, shape_b: AbstractShape3D, dir_x: number, dir_y: number, dir_z: number): void;
//# sourceMappingURL=minkowski_support.d.ts.map