Detecting collision between 500k circles below 5ms
1D/2D/3D Hierarchical Spatial Hash Grid written in C. I created a flexible collision engine for broad detection in C that's also pretty fast.
Open source
Reactions (1)
Similar products
by description similarity
A hash array-mapped trie implementation in C
1990s Game Dev Algorithms for Distributed Systems
docs.merca.earthClassic physics engine algorithms — SAT collision detection and Morton Z-curve indexing — become viable on-chain primitives only where the execution model supports dynamic object access at runtime. Here's why EVM, Solana, and Aptos can't run them, and Sui can.
A portable hash map in C
github.comA small, portable, linear probing hash map
Spark
sparkjs.devAn advanced 3D Gaussian Splatting renderer for Three.js
Compute polynomials twice as fast
thomasahle.comA few years ago my coauthor and I was wondering if we could reduce the number of multiplications used for hashing algorithms.