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
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
|
/////////////////////////////////////////////////////////////
// //
// Copyright (c) 2007-2014 by The University of Queensland //
// Centre for Geoscience Computing //
// http://earth.uq.edu.au/centre-geoscience-computing //
// //
// Primary Business: Brisbane, Queensland, Australia //
// Licensed under the Open Software License version 3.0 //
// http://www.opensource.org/licenses/osl-3.0.php //
// //
/////////////////////////////////////////////////////////////
#include "HexAggregateInsertGenerator2DRand.h"
// --- System includes ---
#include <cmath>
#include <cstdlib>
#include <sys/time.h>
using std::ceil;
using std::sqrt;
using std::sin;
using std::cos;
// --- project includes ---
#include "sphere_fitting/Sphere2DFitter.h"
HexAggregateInsertGenerator2DRand::HexAggregateInsertGenerator2DRand()
{}
/*!
Constructor
\param rmin minimum particle radius
\param rmax maximum particle radius
\param ntries max. nr. of tries to insert particle
\param max_iter maximum iterations within the iterative solvers
\param prec max. error in iterative solvers
\param rprob probablility (0..1) that one of the particles is removed
*/
HexAggregateInsertGenerator2DRand::HexAggregateInsertGenerator2DRand(double rmin,
double rmax,
int tries,
int max_iter,
double prec,
double rprob) :
HexAggregateInsertGenerator2D(rmin,rmax,tries,max_iter,prec)
{
m_remove_prob=rprob;
struct timeval tv;
gettimeofday(&tv,NULL);
int random_seed=tv.tv_usec;
srand(random_seed);
}
/*!
seed the area with particles
\param vol a pointer to the packing volume
\param ntable a pointer to the neighbour table used
\param gid particle group id
\param tag the particle tag
*/
void HexAggregateInsertGenerator2DRand::seedParticles(AVolume2D* vol,MNTable2D*ntable ,int gid,int tag)
{
std::cout << "HexAggregateInsertGenerator2DRand::seedParticles" << std::endl;
// get bounding box
pair<Vector3,Vector3> bbx=vol->getBoundingBox();
double dx=(bbx.second.X()-bbx.first.X())-2.0*m_rmax;
double dy=(bbx.second.Y()-bbx.first.Y())-2.0*m_rmax;
// get index limits for seeding
int imax=int(ceil(dx/(m_rmax*2.0)));
int jmax=int(ceil(dy/(m_rmax*sqrt(3.0))));
// seed positions
for(int i=0;i<imax;i++){
for(int j=0;j<jmax;j++){
// get position
double px=bbx.first.X()+m_rmax+(double(i)+0.5*double(j%2))*m_rmax*2.0;
double py=bbx.first.Y()+m_rmax+double(j)*sqrt(3.0)*m_rmax;
// get dist to egde
double dex=(bbx.second.X()-px) < (px-bbx.first.X()) ? bbx.second.X()-px : px-bbx.first.X();
double dey=(bbx.second.Y()-py) < (py-bbx.first.Y()) ? bbx.second.Y()-py : py-bbx.first.Y();
double de=(dex<dey) ? dex : dey;
// check max rad.
if(de>m_rmin){
// calc random radius
double r;
if(de<m_rmax) {
r=m_rmin+((de-m_rmin)*((double)(rand())/(double)(RAND_MAX)));
} else {
r=m_rmin+((m_rmax-m_rmin)*((double)(rand())/(double)(RAND_MAX)));
}
Sphere S(Vector3(px,py,0.0),r);
bool fit=vol->isIn(S) && ntable->checkInsertable(S,gid);
if(fit){
// -- insert 7 smaller particles instead of 1 large
double rn=r/3.0; // new radii
// center sphere
Sphere Sc(Vector3(px,py,0.0),rn);
Sc.setTag(tag);
ntable->insertChecked(Sc,gid);
int Sc_id=Sc.Id();
// outer spheres
int Sk_id[6];
// generate random value
double rval=((double)(rand())/(double)(RAND_MAX));
int npart;
if(rval>m_remove_prob){
// if random value exceed removal probability - all 6 particles
npart = 6;
} else {
npart = 5;
Sk_id[5]=-1;
}
for(int k=0;k<npart;k++){
double phi=double(k)*1.04719551; // k*pi/3
double pxk=px+2.0000*rn*sin(phi);
double pyk=py+2.0000*rn*cos(phi);
Sphere Sk(Vector3(pxk,pyk,0.0),rn*0.9999);
if(vol->isIn(Sk) && ntable->checkInsertable(Sk,gid)){
Sk.setTag(tag);
ntable->insert(Sk,gid);
Sk_id[k]=Sk.Id();
ntable->insertBond(Sc_id,Sk_id[k],0); // bond between center and outer
} else {
Sk_id[k]=-1;
}
}
for(int k=0;k<npart;k++){
int k2=(k+1) % 6;
if((Sk_id[k]!=-1) && (Sk_id[k2]!=-1)) {
ntable->insertBond(Sk_id[k],Sk_id[k2],0);
}
}
}
}
}
}
}
/*!
seed the area with particles
\param vol a pointer to the packing volume
\param ntable a pointer to the neighbour table used
\param gid particle group id
\param tag the particle tag
*/
void HexAggregateInsertGenerator2DRand::fillIn(AVolume2D* vol,MNTable2D* ntable ,int gid,int tag)
{
Sphere nsph;
int total_tries=0;
int count_insert=0;
int nvol=vol->getNumberSubVolumes();
for(int ivol=0;ivol<nvol;ivol++){
int countfail=0; // number of failed attenpts since last successfull insertion
while(countfail<m_max_tries){
bool findfit=false;
Vector3 P=vol->getAPoint(ivol); // get random point within volume
multimap<double,const Sphere*> close_particles=ntable->getSpheresClosestTo(P,3); // get 3 nearest spheres
map<double,const Line2D*> close_lines=vol->getClosestPlanes(P,2); // get 2 nearest planes
map<double,const AGeometricObject*> geomap;
geomap.insert(close_particles.begin(),close_particles.end());
geomap.insert(close_lines.begin(),close_lines.end());
if(geomap.size()>=3){
map<double,const AGeometricObject*>::iterator iter=geomap.begin();
const AGeometricObject* GO1=iter->second;iter++;
const AGeometricObject* GO2=iter->second;iter++;
const AGeometricObject* GO3=iter->second;
nsph=FitSphere2D(GO1,GO2,GO3,P,m_max_iter,m_prec);
findfit=true;
}
if(findfit){
// check if within radius range
bool is_radius=(m_rmin<nsph.Radius()) && (m_rmax>nsph.Radius());
// check inside volume, intersections ...
bool fit=vol->isIn(nsph) && ntable->checkInsertable(nsph,gid);
if(fit && is_radius){ // acceptable particle
// -- insert 7 smaller particles instead of 1 large
double rn=nsph.Radius()/3.0; // new radii
double px=nsph.Center().X();
double py=nsph.Center().Y();
// center sphere
Sphere Sc(Vector3(px,py,0.0),rn);
Sc.setTag(tag);
ntable->insertChecked(Sc,gid);
int Sc_id=Sc.Id();
// outer sphere
int Sk_id[6];
// generate random value
double rval=((double)(rand())/(double)(RAND_MAX));
int npart;
if(rval>m_remove_prob){
// if random value exceed removal probability - all 6 particles
npart = 6;
} else {
npart = 5;
Sk_id[5]=-1;
}
for(int k=0;k<npart;k++){
double phi=double(k)*1.04719551; // k*pi/3
double pxk=px+2.0*rn*sin(phi);
double pyk=py+2.0*rn*cos(phi);
Sphere Sk(Vector3(pxk,pyk,0.0),rn*0.9999);
Sk.setTag(tag);
if(vol->isIn(Sk) && ntable->checkInsertable(Sk,gid)){
Sk.setTag(tag);
ntable->insert(Sk,gid);
Sk_id[k]=Sk.Id();
ntable->insertBond(Sc_id,Sk_id[k],0); // bond between center and outer
} else {
Sk_id[k]=-1;
}
}
for(int k=0;k<npart;k++){
int k2=(k+1) % 6;
if((Sk_id[k]!=-1) && (Sk_id[k2]!=-1)) {
ntable->insertBond(Sk_id[k],Sk_id[k2],0);
}
}
count_insert++;
if((count_insert%100)==0) std::cout << "inserted: " << count_insert << std::endl;
total_tries+=countfail;
if(countfail>m_max_tries/10) std::cout << countfail << " tries" << std::endl;
countfail=0; // reset failure counter
} else countfail++;
} else countfail++;
}
}
std::cout << "total tries: " << total_tries << std::endl;
}
|