Module splashsurf_lib::neighborhood_search

Simple neighborhood search based on spatial hashing

This module provides basic sequential and parallel neighborhood search implementations using spatial hashing. The algorithms return per-particle neighborhood list with indices of all particles that are within the given radius of the particle.

Structs

• FlatNeighborhoodList
  Stores particle neighborhood lists contiguously in memory using a second offset array
• NeighborhoodStats
  Stats of a neighborhood list

Traits

• NeighborhoodList
  Trait unifying different particle neighborhood list storage formats

Functions

• compute_neigborhood_stats
  Computes stats (avg. neighbors, histogram) of the given neighborhood list
• neighborhood_search_naive
  Performs a naive neighborhood search with O(N^2) complexity, only recommended for testing
• neighborhood_search_spatial_hashing
  Performs a neighborhood search (sequential implementation)
• neighborhood_search_spatial_hashing_filtered
  Performs a neighborhood search (sequential implementation, with filter)
• neighborhood_search_spatial_hashing_flat
  Performs a neighborhood search (sequential implementation, returning a FlatNeighborhoodList)
• neighborhood_search_spatial_hashing_flat_filtered
  Performs a neighborhood search (sequential implementation, with filter, returning a FlatNeighborhoodList)
• neighborhood_search_spatial_hashing_parallel
  Performs a neighborhood search (multi-threaded implementation)
• search
  Performs a neighborhood search, returning the indices of all neighboring particles in the given search radius per particle
• search_inplace
  Performs a neighborhood search inplace, stores the indices of all neighboring particles in the given search radius per particle in the given vector