forked from lijiext/lammps
git-svn-id: svn://svn.icms.temple.edu/lammps-ro/trunk@13302 f3b2605a-c512-4ea7-a41b-209d697bcdaa
This commit is contained in:
parent
3a3462678e
commit
7ba8d96ddb
|
@ -203,7 +203,7 @@ tallied. If the counts do not match the target value for the plane,
|
|||
the position of the cut is adjusted based on the local density. The
|
||||
low and high bounds are adjusted on each iteration, using new count
|
||||
information, so that they become closer together over time. Thus as
|
||||
the recustion progresses, the count of particles on either side of the
|
||||
the recursion progresses, the count of particles on either side of the
|
||||
plane gets closer to the target value.
|
||||
</P>
|
||||
<P>The density-dependent part of this algorithm is often an advantage
|
||||
|
|
|
@ -191,7 +191,7 @@ tallied. If the counts do not match the target value for the plane,
|
|||
the position of the cut is adjusted based on the local density. The
|
||||
low and high bounds are adjusted on each iteration, using new count
|
||||
information, so that they become closer together over time. Thus as
|
||||
the recustion progresses, the count of particles on either side of the
|
||||
the recursion progresses, the count of particles on either side of the
|
||||
plane gets closer to the target value.
|
||||
|
||||
The density-dependent part of this algorithm is often an advantage
|
||||
|
|
Loading…
Reference in New Issue