| 1 |
/* |
| 2 |
* Copyright (c) 2005 The University of Notre Dame. All Rights Reserved. |
| 3 |
* |
| 4 |
* The University of Notre Dame grants you ("Licensee") a |
| 5 |
* non-exclusive, royalty free, license to use, modify and |
| 6 |
* redistribute this software in source and binary code form, provided |
| 7 |
* that the following conditions are met: |
| 8 |
* |
| 9 |
* 1. Redistributions of source code must retain the above copyright |
| 10 |
* notice, this list of conditions and the following disclaimer. |
| 11 |
* |
| 12 |
* 2. Redistributions in binary form must reproduce the above copyright |
| 13 |
* notice, this list of conditions and the following disclaimer in the |
| 14 |
* documentation and/or other materials provided with the |
| 15 |
* distribution. |
| 16 |
* |
| 17 |
* This software is provided "AS IS," without a warranty of any |
| 18 |
* kind. All express or implied conditions, representations and |
| 19 |
* warranties, including any implied warranty of merchantability, |
| 20 |
* fitness for a particular purpose or non-infringement, are hereby |
| 21 |
* excluded. The University of Notre Dame and its licensors shall not |
| 22 |
* be liable for any damages suffered by licensee as a result of |
| 23 |
* using, modifying or distributing the software or its |
| 24 |
* derivatives. In no event will the University of Notre Dame or its |
| 25 |
* licensors be liable for any lost revenue, profit or data, or for |
| 26 |
* direct, indirect, special, consequential, incidental or punitive |
| 27 |
* damages, however caused and regardless of the theory of liability, |
| 28 |
* arising out of the use of or inability to use software, even if the |
| 29 |
* University of Notre Dame has been advised of the possibility of |
| 30 |
* such damages. |
| 31 |
* |
| 32 |
* SUPPORT OPEN SCIENCE! If you use OpenMD or its source code in your |
| 33 |
* research, please cite the appropriate papers when you publish your |
| 34 |
* work. Good starting points are: |
| 35 |
* |
| 36 |
* [1] Meineke, et al., J. Comp. Chem. 26, 252-271 (2005). |
| 37 |
* [2] Fennell & Gezelter, J. Chem. Phys. 124, 234104 (2006). |
| 38 |
* [3] Sun, Lin & Gezelter, J. Chem. Phys. 128, 24107 (2008). |
| 39 |
* [4] Vardeman & Gezelter, in progress (2009). |
| 40 |
*/ |
| 41 |
|
| 42 |
#include "applications/hydrodynamics/RoughShell.hpp" |
| 43 |
#include "applications/hydrodynamics/ShapeBuilder.hpp" |
| 44 |
#include "brains/SimInfo.hpp" |
| 45 |
|
| 46 |
namespace OpenMD { |
| 47 |
|
| 48 |
RoughShell::RoughShell(StuntDouble* sd, SimInfo* info) : ApproximationModel(sd, info){ |
| 49 |
shape_=ShapeBuilder::createShape(sd); |
| 50 |
Globals* simParams = info->getSimParams(); |
| 51 |
if (simParams->haveBeadSize()) { |
| 52 |
sigma_ = simParams->getBeadSize(); |
| 53 |
}else { |
| 54 |
|
| 55 |
} |
| 56 |
} |
| 57 |
|
| 58 |
struct BeadLattice { |
| 59 |
Vector3d origin; |
| 60 |
RealType radius; |
| 61 |
bool interior; |
| 62 |
}; |
| 63 |
|
| 64 |
struct ExteriorFunctor : public std::unary_function<BeadLattice, bool>{ |
| 65 |
|
| 66 |
bool operator() (const BeadLattice& bead) { |
| 67 |
return !bead.interior; |
| 68 |
} |
| 69 |
|
| 70 |
}; |
| 71 |
|
| 72 |
struct InteriorFunctor : public std::unary_function<BeadLattice, bool>{ |
| 73 |
|
| 74 |
bool operator() (const BeadLattice& bead) { |
| 75 |
return bead.interior; |
| 76 |
} |
| 77 |
|
| 78 |
}; |
| 79 |
bool RoughShell::createBeads(std::vector<BeadParam>& beads) { |
| 80 |
std::pair<Vector3d, Vector3d> boxBoundary = shape_->getBoundingBox(); |
| 81 |
RealType firstMin = std::min(std::min(boxBoundary.first[0], boxBoundary.first[1]), boxBoundary.first[2]); |
| 82 |
RealType secondMax = std::max(std::max(boxBoundary.second[0], boxBoundary.second[1]), boxBoundary.second[2]); |
| 83 |
RealType len = secondMax - firstMin; |
| 84 |
int numLattices = static_cast<int>(len/sigma_) + 2; |
| 85 |
Grid3D<BeadLattice> grid(numLattices, numLattices, numLattices); |
| 86 |
|
| 87 |
//fill beads |
| 88 |
for (int i = 0; i < numLattices; ++i) { |
| 89 |
for (int j = 0; j < numLattices; ++j) { |
| 90 |
for (int k = 0; k < numLattices; ++k) { |
| 91 |
BeadLattice& currentBead = grid(i, j, k); |
| 92 |
currentBead.origin = Vector3d((i-1)*sigma_ + boxBoundary.first[0], (j-1) *sigma_ + boxBoundary.first[1], (k-1)*sigma_+ boxBoundary.first[2]); |
| 93 |
currentBead.radius = sigma_ / 2.0; |
| 94 |
currentBead.interior = shape_->isInterior(grid(i, j, k).origin); |
| 95 |
} |
| 96 |
} |
| 97 |
} |
| 98 |
|
| 99 |
//remove embedded beads |
| 100 |
for (int i = 0; i < numLattices; ++i) { |
| 101 |
for (int j = 0; j < numLattices; ++j) { |
| 102 |
for (int k = 0; k < numLattices; ++k) { |
| 103 |
std::vector<BeadLattice> neighborCells = grid.getAllNeighbors(i, j, k); |
| 104 |
//if one of its neighbor cells is exterior, current cell is on the surface |
| 105 |
|
| 106 |
if (grid(i, j, k).interior){ |
| 107 |
|
| 108 |
bool allNeighBorIsInterior = true; |
| 109 |
for (std::vector<BeadLattice>::iterator l = neighborCells.begin(); l != neighborCells.end(); ++l) { |
| 110 |
if (!l->interior) { |
| 111 |
allNeighBorIsInterior = false; |
| 112 |
break; |
| 113 |
} |
| 114 |
} |
| 115 |
|
| 116 |
if (allNeighBorIsInterior) |
| 117 |
continue; |
| 118 |
|
| 119 |
BeadParam surfaceBead; |
| 120 |
surfaceBead.atomName = "H"; |
| 121 |
surfaceBead.pos = grid(i, j, k).origin; |
| 122 |
surfaceBead.radius = grid(i, j, k).radius; |
| 123 |
beads.push_back(surfaceBead); |
| 124 |
|
| 125 |
} |
| 126 |
} |
| 127 |
} |
| 128 |
} |
| 129 |
|
| 130 |
return true; |
| 131 |
} |
| 132 |
|
| 133 |
} |
