← 최신 프로덕트

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.

오픈소스

81 스타 · GitHub외부 사이트

github.com 방문외부 사이트

반응 (1)

비슷한 프로덕트

설명이 비슷한 순

  1. A hash array-mapped trie implementation in C

    github.com

    A hash array-mapped trie implementation in C

    Hacker News171점

  2. 1990s Game Dev Algorithms for Distributed Systems

    docs.merca.earth

    Classic 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.

    Hacker News12점

  3. A portable hash map in C

    github.com

    A small, portable, linear probing hash map

    Hacker News176점

  4. Spark

    sparkjs.dev

    An advanced 3D Gaussian Splatting renderer for Three.js

    Hacker News377점

  5. Compute polynomials twice as fast

    thomasahle.com

    A few years ago my coauthor and I was wondering if we could reduce the number of multiplications used for hashing algorithms.

    Hacker News139점