Skip to content

**INPUT POINT HASHING**

Set TopicsSET TOPICAug 8, 2026Original source

“Hashing” in the ninja-context mean: filter input points - based on their distance to a given Niagara Grid 2D Cell.
IF a point is outside threshold distance: skip processing --- so each Grid2D cell processes only nearby points.
Technically, hashing is solved using Niagara “Neighbor Grid” structures
Practical advantage: less calculations. For example: we have 1000 points and 1000 grid cells. Without hashing, we need to perform 1000x1000 calculations each frame to process points. If we filter for nearby points - and on average, each Grid2D cell has 10 nearby points - we have to perform only 1000 x 10 calculations.

See Chapter 12.5 in the Manual “Point data processing is double hashed:”
See Param Descriptor P.1.1.10 “NeighborCellNumberXY”