Why Hash Grids Beat Sparse Trees for Particle Simulation, From the Author
Michael_Moroz_ · x · 2026-09-10
Following up on his VRChat fluid simulation, the author explains the technical choice: hash-based particle simulation beats sparse tree grids because sparse trees require indirections to find neighbors, while hash grids' only downside is hash collisions — and with latency as the bottleneck, hash grids win.
He's also improving the isosurface ray tracer with more PBR-style rendering and basic screen-space effects, currently only in bounded mode; making it performant in boundless hash-sparse mode remains an open problem.
More from Fun
- ChatGPT keeps telling tech-support users to email 404 Media's Jason Koebler — petrusenko_max · 2026-10-27
- "Samsung puts mics in my TV = OK; me putting mics in the OpenAI office = not OK" — djcows · 2026-10-27
- Professor's quip: the future of work is AI doing the job and humans updating résumés — prof_kamilov · 2026-10-27
- 'AGI is literally loading and you're working on yourself' — the AGI anxiety meme — theteknosaur · 2026-10-27
- Man with AI-generated deck predicts AI bubble: the conference meme — SuB8u · 2026-10-27
- Viral meme: free Google AI Mode dwarfs $20 ChatGPT in Reddit comparison — Macegolem · 2026-10-27