2022-09-05 06:44:41 +00:00
|
|
|
/*------------------------------- phasicFlow ---------------------------------
|
|
|
|
O C enter of
|
|
|
|
O O E ngineering and
|
|
|
|
O O M ultiscale modeling of
|
|
|
|
OOOOOOO F luid flow
|
|
|
|
------------------------------------------------------------------------------
|
|
|
|
Copyright (C): www.cemf.ir
|
|
|
|
email: hamid.r.norouzi AT gmail.com
|
|
|
|
------------------------------------------------------------------------------
|
|
|
|
Licence:
|
|
|
|
This file is part of phasicFlow code. It is a free software for simulating
|
|
|
|
granular and multiphase flows. You can redistribute it and/or modify it under
|
|
|
|
the terms of GNU General Public License v3 or any other later versions.
|
|
|
|
|
|
|
|
phasicFlow is distributed to help others in their research in the field of
|
|
|
|
granular and multiphase flows, but WITHOUT ANY WARRANTY; without even the
|
|
|
|
implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
|
|
|
|
|
|
|
|
-----------------------------------------------------------------------------*/
|
|
|
|
|
|
|
|
|
2022-12-09 22:02:54 +00:00
|
|
|
#include "positionRandom.hpp"
|
|
|
|
#include "uniformRandomReal.hpp"
|
|
|
|
#include "NBSLevel0.hpp"
|
|
|
|
#include "unsortedPairs.hpp"
|
|
|
|
#include "box.hpp"
|
2022-09-05 06:44:41 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
namespace pFlow
|
|
|
|
{
|
|
|
|
|
2022-10-27 10:49:53 +00:00
|
|
|
using SearchType = NBSLevel0<DefaultExecutionSpace> ;
|
2022-09-05 06:44:41 +00:00
|
|
|
using ContainerType = unsortedPairs<DefaultExecutionSpace, int32>;
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
int32 findCollisions(
|
|
|
|
ContainerType& pairs,
|
|
|
|
int32Vector_HD& flags);
|
|
|
|
|
|
|
|
int32 findCollisions(int32 num, realx3Vector_HD& points, real diam)
|
|
|
|
{
|
|
|
|
int32 res =0;
|
|
|
|
for(auto i=0; i<num;i++)
|
|
|
|
{
|
|
|
|
for(auto j=i+1; j<num; j++)
|
|
|
|
{
|
|
|
|
if(sphereSphereCheck(points[i],points[j],diam,diam))res++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return res;
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
bool pFlow::positionRandom::positionOnePass(int32 pass, int32 startNum)
|
|
|
|
{
|
|
|
|
|
|
|
|
realVector_D diameter(startNum , diameter_);
|
|
|
|
int32Vector_HD flagHD(startNum, 0);
|
|
|
|
realx3Vector_HD positionHD(startNum);
|
|
|
|
|
2022-09-10 12:42:12 +00:00
|
|
|
auto minP = region_->minPoint();
|
|
|
|
auto maxP = region_->maxPoint();
|
2022-09-05 06:44:41 +00:00
|
|
|
|
|
|
|
SearchType search(
|
2022-09-10 12:42:12 +00:00
|
|
|
box(minP, maxP),
|
2022-09-05 06:44:41 +00:00
|
|
|
diameter_,
|
|
|
|
positionHD.deviceVectorAll(),
|
|
|
|
diameter.deviceVectorAll());
|
|
|
|
|
|
|
|
ContainerType pairs(3*startNum);
|
|
|
|
|
2022-12-24 11:30:00 +00:00
|
|
|
REPORT(1)<< "Positioning "<<
|
2022-09-05 06:44:41 +00:00
|
|
|
greenText("(Pass #"<< pass+1<<")")<<
|
2022-12-24 11:30:00 +00:00
|
|
|
": started with "<< startNum <<" points."<<endREPORT;
|
2022-09-05 06:44:41 +00:00
|
|
|
|
2022-09-10 12:42:12 +00:00
|
|
|
fillPoints(startNum, positionHD, flagHD);
|
2022-09-05 06:44:41 +00:00
|
|
|
|
2022-10-27 10:49:53 +00:00
|
|
|
search.broadSearch(pairs, range(0, startNum));
|
2022-09-05 06:44:41 +00:00
|
|
|
|
|
|
|
|
|
|
|
int32 numCollisions = findCollisions(pairs, flagHD);
|
|
|
|
|
|
|
|
|
2022-12-24 11:30:00 +00:00
|
|
|
REPORT(2)<< "Positioned " << cyanText(startNum - numCollisions) <<
|
|
|
|
" without collision \n"<<endREPORT;
|
2022-09-05 06:44:41 +00:00
|
|
|
|
|
|
|
if(startNum-numCollisions >= numPoints_ )
|
|
|
|
{
|
|
|
|
|
2022-12-24 11:30:00 +00:00
|
|
|
REPORT(1)<<"Selected "<< cyanText(numPoints_)<< " for the final field.\n"<<endREPORT;
|
2022-09-05 06:44:41 +00:00
|
|
|
|
|
|
|
positionHD.syncViews();
|
|
|
|
position_.clear();
|
|
|
|
int32 n=0;
|
|
|
|
for(int32 i=0; i<startNum; i++)
|
|
|
|
{
|
|
|
|
if(flagHD[i] == 0 )
|
|
|
|
{
|
|
|
|
position_.push_back( positionHD[i]);
|
|
|
|
n++;
|
|
|
|
if(n==numPoints_)break;
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
return false;
|
|
|
|
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
bool pFlow::positionRandom::positionPointsRandom()
|
|
|
|
{
|
|
|
|
|
|
|
|
position_.clear();
|
|
|
|
|
|
|
|
if(numPoints_ == 0)return true;
|
|
|
|
|
|
|
|
size_t pass = 0;
|
|
|
|
int32 startNum = numPoints_;
|
|
|
|
|
|
|
|
while ( pass <maxIterations_)
|
|
|
|
{
|
|
|
|
if( positionOnePass(pass, startNum) )return true;
|
|
|
|
startNum = 1.1*startNum+1;
|
|
|
|
pass++;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
fatalErrorInFunction<<
|
|
|
|
" cannot position "<< numPoints_ << " in the domain in " << maxIterations_ << " iterations.\n" <<
|
|
|
|
" you may increase maxIterations for positioning points.\n";
|
|
|
|
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool pFlow::positionRandom::inCollision
|
|
|
|
(
|
|
|
|
const realx3 &cntr,
|
|
|
|
real diam
|
|
|
|
)
|
|
|
|
{
|
|
|
|
for(const auto& cp: position_)
|
|
|
|
{
|
|
|
|
if( length(cp-cntr) <= diam ) return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
pFlow::positionRandom::positionRandom
|
|
|
|
(
|
|
|
|
const dictionary& dict
|
|
|
|
)
|
|
|
|
:
|
|
|
|
positionParticles(dict),
|
|
|
|
prDict_
|
|
|
|
(
|
|
|
|
dict.subDict("positionRandomInfo")
|
|
|
|
),
|
|
|
|
diameter_
|
|
|
|
(
|
|
|
|
prDict_.getVal<real>("diameter")
|
|
|
|
),
|
|
|
|
numPoints_
|
|
|
|
(
|
|
|
|
prDict_.getVal<size_t>("numPoints")
|
|
|
|
),
|
|
|
|
maxIterations_
|
|
|
|
(
|
|
|
|
prDict_.getValOrSet("maxIterations", 10)
|
|
|
|
),
|
|
|
|
position_
|
|
|
|
(
|
|
|
|
maxNumberOfParticles_, RESERVE()
|
|
|
|
)
|
|
|
|
{
|
|
|
|
|
|
|
|
reportInterval_ = max(numPoints_/numReports_, static_cast<size_t>(2));
|
|
|
|
|
|
|
|
if( !positionPointsRandom() )
|
|
|
|
{
|
|
|
|
fatalExit;
|
|
|
|
}
|
2022-09-10 12:42:12 +00:00
|
|
|
|
|
|
|
if(!region_)
|
|
|
|
{
|
|
|
|
fatalErrorInFunction<<"You must provided a region (box, cylinder, ...) for positioning particles in dictionary "<<
|
|
|
|
dict.globalName()<<endl;
|
|
|
|
fatalExit;
|
|
|
|
}
|
|
|
|
|
2022-09-05 06:44:41 +00:00
|
|
|
}
|
|
|
|
|
2022-09-10 12:42:12 +00:00
|
|
|
void pFlow::positionRandom::fillPoints(
|
2022-09-05 06:44:41 +00:00
|
|
|
uint numPoints,
|
|
|
|
realx3Vector_HD& points,
|
|
|
|
int32Vector_HD& flags )
|
|
|
|
{
|
|
|
|
|
|
|
|
uniformRandomReal rand;
|
|
|
|
|
2022-09-10 12:42:12 +00:00
|
|
|
auto minP = region_().minPoint();
|
|
|
|
auto maxP = region_().maxPoint();
|
2022-09-05 06:44:41 +00:00
|
|
|
|
|
|
|
for(size_t i=0; i<numPoints; i++)
|
|
|
|
{
|
|
|
|
if(flags[i] == 0)
|
|
|
|
{
|
2022-09-10 12:42:12 +00:00
|
|
|
bool loop=true;
|
|
|
|
size_t n=0;
|
|
|
|
while (loop)
|
|
|
|
{
|
|
|
|
|
|
|
|
auto pos = rand(minP, maxP);
|
|
|
|
if( region_().isInside(pos))
|
|
|
|
{
|
|
|
|
points[i] =pos;
|
|
|
|
loop = false;
|
|
|
|
}
|
|
|
|
n++;
|
|
|
|
|
|
|
|
if(n>100)
|
|
|
|
{
|
|
|
|
fatalErrorInFunction<<
|
|
|
|
"could not find a point inside region"<<region_->name()<<endl;
|
|
|
|
fatalExit;
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
|
2022-09-05 06:44:41 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
points.modifyOnHost();
|
|
|
|
points.syncViews();
|
|
|
|
}
|
|
|
|
|
|
|
|
pFlow::int32 pFlow::findCollisions(
|
|
|
|
ContainerType& pairs,
|
|
|
|
int32Vector_HD& flags)
|
|
|
|
{
|
|
|
|
auto allPairs = pairs.getPairs();
|
|
|
|
auto num = pairs.capacity();
|
|
|
|
auto dFlags = flags.deviceVector();
|
|
|
|
|
|
|
|
|
|
|
|
int32 numCollisions = 0;
|
|
|
|
|
|
|
|
Kokkos::parallel_reduce(
|
|
|
|
"positionRandom::findCollisions",
|
|
|
|
num,
|
|
|
|
LAMBDA_HD(int32 i, int32& valueToUpdate){
|
|
|
|
if(allPairs.isValid(i))
|
|
|
|
{
|
|
|
|
auto pair = allPairs.getPair(i);
|
|
|
|
if( dFlags[pair.first] ==0 )
|
|
|
|
{
|
|
|
|
dFlags[pair.first] = 1;
|
|
|
|
valueToUpdate++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}, numCollisions);
|
|
|
|
|
|
|
|
flags.modifyOnDevice();
|
|
|
|
flags.syncViews();
|
|
|
|
|
|
|
|
return numCollisions;
|
|
|
|
}
|
|
|
|
|
|
|
|
|