mikolalysenko/box-intersect

This library finds intersections between boxes in any dimension, supporting both self-intersection detection and bipartite intersection queries. It's optimized for performance with O((n+m) log^d(n+m)) time complexity and memory pooling, making it ideal for collision detection, polygon clipping, and geometric processing in applications like games, CAD software, or computational geometry tools.