hash_repel

For each query position, the push away from the indexed points within a radius of it, searched through the spatial hash the hash and hash_starts kernels build. Each neighbour strictly inside the radius pushes along the unit direction from itself to the query, scaled by 1 - distance / radius; the query takes the mean over its neighbours. With skip_self 1 the point whose index is the query's and every point standing on the query are left out. The walk visits the points in the same order on every run. Exact.

It reads pts, order and range (the index), qpts (xyz a query) and domain_count, which it binds in every variant: a slot at or past the live count takes a zero push. It writes push, one vec3<f32> a query. core.neighbours computes its repel push with it when no cone is given.