///////////////////////////////////////////////////////////// // // // Copyright (c) 2007-2017 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.apache.org/licenses/LICENSE-2.0 // // // ///////////////////////////////////////////////////////////// #include "HexAggregateInsertGenerator2DRand.h" // --- System includes --- #include #include #include 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 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;im_rmin){ // calc random radius double r; if(deisIn(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;kisIn(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;kinsertBond(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;ivolgetAPoint(ivol); // get random point within volume multimap close_particles=ntable->getSpheresClosestTo(P,3); // get 3 nearest spheres map close_lines=vol->getClosestPlanes(P,2); // get 2 nearest planes map geomap; geomap.insert(close_particles.begin(),close_particles.end()); geomap.insert(close_lines.begin(),close_lines.end()); if(geomap.size()>=3){ map::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_rminnsph.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;kisIn(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;kinsertBond(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; }