English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Open

I describe a fast algorithm for the identification of connected sets ofpoints where the point-wise connections are determined by a fixed spatialdistance - a task commonly referred to in the cosmological simulation communityas Friends-of-Friends (FOF) group finding. This technique sorts particles intofine cells sufficiently compact to guarantee their cohabitants are linked, anduses locality sensitive hashing to search for neighbouring (blocks of) cells.Tests on N-body simulations of up to a billion particles exhibit speedincreases of factors up to 20x compared with FOF via trees (a factor around 8is typical), and is consistently complete in less than the time of a k-d treeconstruction, giving it an intrinsic advantage over tree-based methods. Thecode is open-source and available online at https://github.com/pec27/hfof .

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