SPHSolver3D/grid.cpp at main · Balvald/SPHSolver3D · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
//
//  Florian Probst
//  E-Mail: probstf@informatik.uni-freiburg.de / derbalvald@gmail.com
//

#include "grid.h"
#include "particles.h"

#ifdef _OPENMP
#include <omp.h>
#endif

void UniformGrid::find_neighbors(Particles &particles, double radius)
{
    #ifdef _OPENMP
    #pragma omp parallel for schedule(dynamic, 64)
    #endif
    for (int i = 0; i < particles.positions.cols(); i++)
    {
        particles.neighbors[i] = queryNeighbors(particles.positions, i, radius);
    }
}

void SpatialHashGrid::find_neighbors(Particles &particles, double radius)
{
    #ifdef _OPENMP
    #pragma omp parallel for schedule(dynamic, 64)
    #endif
    for (int i = 0; i < particles.positions.cols(); i++)
    {
        particles.neighbors[i] = queryNeighbors(particles.positions, i, radius);
    }
}

void SortedHashGrid::find_neighbors(Particles &particles, double radius)
{
    #ifdef _OPENMP
    #pragma omp parallel for schedule(dynamic, 64)
    #endif
    for (int i = 0; i < particles.positions.cols(); i++)
    {
        particles.neighbors[i] = queryNeighbors(particles.positions, i, radius);
    }
}

void SpatialHashGrid_Ihmsen::find_neighbors(Particles &particles, double radius)
{
    #ifdef _OPENMP
    #pragma omp parallel for schedule(dynamic, 64)
    #endif
    for (int i = 0; i < particles.positions.cols(); i++)
    {
        queryNeighbors(particles.positions, i, radius, particles.neighbors[i]);
    }
}

void SortedHashGrid_Ihmsen::find_neighbors(Particles &particles, double radius)
{
    #ifdef _OPENMP
    #pragma omp parallel for schedule(dynamic, 64)
    #endif
    for (int i = 0; i < particles.positions.cols(); i++)
    {
        particles.neighbors[i] = queryNeighbors(particles.positions, i, radius);
    }
}

void UniformGrid_Morton::find_neighbors(Particles &particles, double radius)
{
    #ifdef _OPENMP
    #pragma omp parallel for schedule(dynamic, 64)
    #endif
    for (int i = 0; i < particles.positions.cols(); i++)
    {
        particles.neighbors[i] = queryNeighbors(particles.positions, i, radius);
    }
}

void BoundingVolumeHierarchy_SAH::find_neighbors(Particles &particles, double radius)
{
    #ifdef _OPENMP
    #pragma omp parallel for schedule(dynamic, 64)
    #endif
    for (int i = 0; i < particles.positions.cols(); i++)
    {
        // not implemented
    }
}