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.
Total donated
Undistributed
Share with your subscribers:
Recipients
How the donated funds are distributed
Support the dependencies of mikolalysenko/box-intersect
Bit twiddling hacks for JavaScript
Reuse typed arrays
Initialize an array of arrays to a constant
Bounds checked array
Generates an array of consecutive integers starting at 0
tap-producing test harness for node and browsers
Removes duplicates from a sorted array in place
Support the repos that depend on this repository
Top contributors
mikolalysenko
91 contributions
fenomas
1 contributions
Recent events
Kivach works on the Obyte network, and therefore you can track all donations.
No events yet