|
| | EdenGrowth (const double &=1.0) |
| | Create an Eden growth structure.
|
| | EdenGrowth (const Vector &, const double &) |
| | Create an Eden growth structure.
|
| | EdenGrowth (const QVector< Vector > &, const double &) |
| | Create an Eden growth structure.
|
| | EdenGrowth (const ParticleSet &) |
| | Create an Eden growth structure.
|
|
| ~EdenGrowth () |
| | Empty.
|
| virtual void | Step () |
| | Add a new particle to the cluster.
|
| virtual void | Step (int) |
| | Perform several growth steps.
|
| void | AddCell (const Vector &) |
| | Add a new particle to the cluster.
|
|
QVector< int > | GetIndices () const |
| | Return the indices.
|
| Public Member Functions inherited from ParticleSet |
|
| ParticleSet () |
| | Empty constructor.
|
| | ParticleSet (const double &) |
| | Create an empty set of particles.
|
| | ParticleSet (const Vector &, const double &) |
| | Create a set of particles.
|
| | ParticleSet (const QVector< Vector > &, const double &) |
| | Create a set of particles.
|
|
int | Size () const |
| | Return the number of particles.
|
| Sphere | At (int) const |
| | Get the k-th particle.
|
|
double | Radius () const |
| | Return the radius of the particles.
|
|
QVector< Vector > | GetCenters () const |
| | Return the centers of the particles.
|
| Sphere | GetSphere () const |
| | Computes the bounding sphere of the centers of the particles.
|
| Box | GetBox () const |
| | Computes the bounding box of the centers of the particles.
|
| void | Append (const Vector &) |
| | Add a new particle to the set.
|
| bool | Intersect (const Sphere &) const |
| | Check the intersection between the cluster and a sphere.
|
| bool | Intersect (const Box &) const |
| | Check the intersection between the cluster and a box.
|
| int EdenGrowth::GrowthSites |
( |
const Vector & | q, |
|
|
Vector * | sites ) const |
|
protectedvirtual |
Find candidate growth directions from a particle.
This function has an O(n) complexity.
The particles at a distance less than 4r from the candidate are first gathered in a subset, which is the only one checked for collisions. The size of this subset is not bounded, it is stored in an array which initially reserves room for 43 particles. This value is the worst case of a dense packing: the minimum distance between two particles is \( 2r(1+\epsilon) = 2.15r \) with \( \epsilon = 0.075 \), and a face-centered cubic packing with this spacing has, around the candidate, 12 particles at distance 2.15r, 6 at 3.04r and 24 at 3.72r, i.e. 1 + 12 + 6 + 24 = 43 particles at a distance less than 4r (the next shell is at 4.3r). The array grows if this number is exceeded.
- Parameters
-
| q | Position of the candidate particle. |
| sites | Array of returned growth positions. |
- Returns
- the number of candidate growth directions.