Finding bounding boxes with interval math

Explores how to automatically compute bounding boxes for arbitrary implicit surface / signed distance field functions using interval arithmetic. Starting with half-space searches, the post walks through progressively harder cases — axis-aligned shapes, rotated shapes, and near-identity transforms — showing where interval arithmetic succeeds and where it breaks down due to dependency problems. The post concludes that affine arithmetic is the correct solution for the general case.