/
hashgrid.hxx
218 lines (183 loc) · 6.91 KB
/
hashgrid.hxx
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
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
/*
* Copyright (C) 2012, Tomas Davidovic (http://www.davidovic.cz)
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the "Software"),
* to deal in the Software without restriction, including without limitation
* the rights to use, copy, modify, merge, publish, distribute, sublicense,
* and/or sell copies of the Software, and to permit persons to whom
* the Software is furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included
* in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
* DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE
* OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*
* (The above is MIT License: http://en.wikipedia.org/wiki/MIT_License)
*/
#ifndef __HASHGRID_HXX__
#define __HASHGRID_HXX__
#include <vector>
#include <cmath>
#include <cstdio>
#include <cstring> // memset
#include "math.hxx"
class HashGrid
{
public:
void Reserve(int aNumCells)
{
mCellEnds.resize(aNumCells);
}
template<typename tParticle>
void Build(
const std::vector<tParticle> &aParticles,
float aRadius)
{
mRadius = aRadius;
mRadiusSqr = Sqr(mRadius);
mCellSize = mRadius * 2.f;
mInvCellSize = 1.f / mCellSize;
mBBoxMin = Vec3f( 1e36f);
mBBoxMax = Vec3f(-1e36f);
for(size_t i=0; i<aParticles.size(); i++)
{
const Vec3f &pos = aParticles[i].GetPosition();
for(int j=0; j<3; j++)
{
mBBoxMax = std::max(mBBoxMax.Get(j), pos.Get(j));
mBBoxMin = std::min(mBBoxMin.Get(j), pos.Get(j));
}
}
mIndices.resize(aParticles.size());
memset(&mCellEnds[0], 0, mCellEnds.size() * sizeof(int));
// set mCellEnds[x] to number of particles within x
for(size_t i=0; i<aParticles.size(); i++)
{
const Vec3f &pos = aParticles[i].GetPosition();
mCellEnds[GetCellIndex(pos)]++;
}
// run exclusive prefix sum to really get the cell starts
// mCellEnds[x] is now where the cell starts
int sum = 0;
for(size_t i=0; i<mCellEnds.size(); i++)
{
int temp = mCellEnds[i];
mCellEnds[i] = sum;
sum += temp;
}
for(size_t i=0; i<aParticles.size(); i++)
{
const Vec3f &pos = aParticles[i].GetPosition();
const int targetIdx = mCellEnds[GetCellIndex(pos)]++;
mIndices[targetIdx] = int(i);
}
// now mCellEnds[x] points to the index right after the last
// element of cell x
//// DEBUG
//for(size_t i=0; i<aParticles.size(); i++)
//{
// const Vec3f &pos = aParticles[i].GetPosition();
// Vec2i range = GetCellRange(GetCellIndex(pos));
// bool found = false;
// for(;range.x < range.y; range.x++)
// {
// if(mIndices[range.x] == i)
// found = true;
// }
// if(!found)
// printf("Error at particle %d\n", i);
//}
}
template<typename tParticle, typename tQuery>
void Process(
const std::vector<tParticle> &aParticles,
tQuery& aQuery)
{
const Vec3f queryPos = aQuery.GetPosition();
const Vec3f distMin = queryPos - mBBoxMin;
const Vec3f distMax = mBBoxMax - queryPos;
for(int i=0; i<3; i++)
{
if(distMin.Get(i) < 0.f) return;
if(distMax.Get(i) < 0.f) return;
}
const Vec3f cellPt = mInvCellSize * distMin;
const Vec3f coordF(
std::floor(cellPt.x),
std::floor(cellPt.y),
std::floor(cellPt.z));
const int px = int(coordF.x);
const int py = int(coordF.y);
const int pz = int(coordF.z);
const Vec3f fractCoord = cellPt - coordF;
const int pxo = px + (fractCoord.x < 0.5f ? -1 : +1);
const int pyo = py + (fractCoord.y < 0.5f ? -1 : +1);
const int pzo = pz + (fractCoord.z < 0.5f ? -1 : +1);
int found = 0;
for(int j=0; j<8; j++)
{
Vec2i activeRange;
switch(j)
{
case 0: activeRange = GetCellRange(GetCellIndex(Vec3i(px , py , pz ))); break;
case 1: activeRange = GetCellRange(GetCellIndex(Vec3i(px , py , pzo))); break;
case 2: activeRange = GetCellRange(GetCellIndex(Vec3i(px , pyo, pz ))); break;
case 3: activeRange = GetCellRange(GetCellIndex(Vec3i(px , pyo, pzo))); break;
case 4: activeRange = GetCellRange(GetCellIndex(Vec3i(pxo, py , pz ))); break;
case 5: activeRange = GetCellRange(GetCellIndex(Vec3i(pxo, py , pzo))); break;
case 6: activeRange = GetCellRange(GetCellIndex(Vec3i(pxo, pyo, pz ))); break;
case 7: activeRange = GetCellRange(GetCellIndex(Vec3i(pxo, pyo, pzo))); break;
}
for(; activeRange.x < activeRange.y; activeRange.x++)
{
const int particleIndex = mIndices[activeRange.x];
const tParticle &particle = aParticles[particleIndex];
const float distSqr =
(aQuery.GetPosition() - particle.GetPosition()).LenSqr();
if(distSqr <= mRadiusSqr)
aQuery.Process(particle);
}
}
}
private:
Vec2i GetCellRange(int aCellIndex) const
{
if(aCellIndex == 0) return Vec2i(0, mCellEnds[0]);
return Vec2i(mCellEnds[aCellIndex-1], mCellEnds[aCellIndex]);
}
int GetCellIndex(const Vec3i &aCoord) const
{
uint x = uint(aCoord.x);
uint y = uint(aCoord.y);
uint z = uint(aCoord.z);
return int(((x * 73856093) ^ (y * 19349663) ^
(z * 83492791)) % uint(mCellEnds.size()));
}
int GetCellIndex(const Vec3f &aPoint) const
{
const Vec3f distMin = aPoint - mBBoxMin;
const Vec3f coordF(
std::floor(mInvCellSize * distMin.x),
std::floor(mInvCellSize * distMin.y),
std::floor(mInvCellSize * distMin.z));
const Vec3i coordI = Vec3i(int(coordF.x), int(coordF.y), int(coordF.z));
return GetCellIndex(coordI);
}
private:
Vec3f mBBoxMin;
Vec3f mBBoxMax;
std::vector<int> mIndices;
std::vector<int> mCellEnds;
float mRadius;
float mRadiusSqr;
float mCellSize;
float mInvCellSize;
};
#endif //__HASHGRID_HXX__