← All resources

The Bounding Simplex: A SIMD-Era Rejection Primitive

Auto-discovered

Paper Advanced

Bryan McNett

Visit resource ↗

Description

The Bounding Simplex: A SIMD-Era Rejection Primitive is Bryan McNett's paper presenting a broad-phase rejection volume using d+1 half-spaces instead of the 2d planes of an axis-aligned bounding box. It targets spatial databases where conservative overlap tests run millions of times per query.

McNett shows the simplex is costly on scalar CPUs but favorable past a crossover SIMD width where early-out stops hiding plane count. He recommends axes {X, Y, -(X+Y)} for stability and shows intersecting opposing simplices yields an AABB with two corners removed.

Advanced readers in collision detection and SIMD-heavy engines need comfort with half-space bounds.

Free PDF at mcnett.org with 2D figures comparing box, sphere, and simplex storage.

Emerging citation interest among engine programmers optimizing wide-SIMD culling pipelines.

Link last verified accessible on 2026-09-27.