Gaussian splatting renders 3D scenes by projecting Gaussian kernels onto the image plane. The kernel is exponential — exp(-x²) — because Gaussians are Gaussians. The exponential never reaches zero, which means every Gaussian technically contributes to every pixel, requiring careful culling to keep rendering tractable.
Mueller, Winter, and Steinberger replace the exponential with a polynomial approximation clipped by ReLU. The polynomial has compact support — it reaches exactly zero at a finite radius — which means culling is no longer an approximation. Gaussians beyond the polynomial's support contribute nothing, and the renderer can skip them without error.
The result: 4 to 15% performance improvement with negligible impact on image quality. The gain comes entirely from more aggressive culling. The exponential kernel requires a threshold-based cutoff — discard Gaussians contributing less than ε — and the threshold choice trades quality for speed. The polynomial kernel eliminates the tradeoff: the mathematically exact boundary enables provably lossless culling.
The structural insight: the Gaussian kernel was chosen for mathematical elegance, not computational efficiency. Exponentials are smooth, analytically tractable, closed under convolution. But rendering is not analysis. Rendering needs to know which primitives affect which pixels, and a function that never reaches zero makes that question unanswerable without arbitrary thresholds. Replacing mathematical elegance with computational pragmatism — a polynomial that does reach zero — turns an approximate operation into an exact one. The less beautiful function is the more useful one.