Tree-less 3d Friends-of-Friends using Spatial Hashing

13 May 2018Peter E. Creasey

I describe a fast algorithm for the identification of connected sets of points where the point-wise connections are determined by a fixed spatial distance - a task commonly referred to in the cosmological simulation community as Friends-of-Friends (FOF) group finding. This technique sorts particles into fine cells sufficiently compact to guarantee their cohabitants are linked, and uses locality sensitive hashing to search for neighbouring (blocks of) cells... (read more)

PDF Abstract

Code


No code implementations yet. Submit your code now

Tasks


Results from the Paper


  Submit results from this paper to get state-of-the-art GitHub badges and help the community compare results to other papers.

Methods used in the Paper


METHOD TYPE
🤖 No Methods Found Help the community by adding them if they're not listed; e.g. Deep Residual Learning for Image Recognition uses ResNet