| 1 |
gezelter |
1412 |
/* |
| 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 |
gezelter |
1665 |
* [4] Kuang & Gezelter, J. Chem. Phys. 133, 164101 (2010). |
| 40 |
|
|
* [5] Vardeman, Stocker & Gezelter, J. Chem. Theory Comput. 7, 834 (2011). |
| 41 |
gezelter |
1412 |
*/ |
| 42 |
|
|
|
| 43 |
|
|
#include "selection/HullFinder.hpp" |
| 44 |
|
|
#include "primitives/Molecule.hpp" |
| 45 |
|
|
#include "math/ConvexHull.hpp" |
| 46 |
|
|
|
| 47 |
|
|
namespace OpenMD { |
| 48 |
|
|
|
| 49 |
|
|
HullFinder::HullFinder(SimInfo* info) : info_(info) { |
| 50 |
|
|
|
| 51 |
|
|
nStuntDoubles_ = info_->getNGlobalAtoms() + info_->getNGlobalRigidBodies(); |
| 52 |
|
|
stuntdoubles_.resize(nStuntDoubles_); |
| 53 |
|
|
|
| 54 |
|
|
SimInfo::MoleculeIterator mi; |
| 55 |
|
|
Molecule* mol; |
| 56 |
gezelter |
1769 |
StuntDouble* sd; |
| 57 |
gezelter |
1412 |
Molecule::IntegrableObjectIterator ioi; |
| 58 |
|
|
Molecule::AtomIterator ai; |
| 59 |
|
|
Atom* atom; |
| 60 |
|
|
Molecule::RigidBodyIterator rbIter; |
| 61 |
|
|
RigidBody* rb; |
| 62 |
|
|
|
| 63 |
|
|
for (mol = info_->beginMolecule(mi); mol != NULL; |
| 64 |
|
|
mol = info_->nextMolecule(mi)) { |
| 65 |
|
|
|
| 66 |
|
|
// Hull is constructed from all known integrable objects. |
| 67 |
gezelter |
1769 |
for (sd = mol->beginIntegrableObject(ioi); |
| 68 |
|
|
sd != NULL; |
| 69 |
|
|
sd = mol->nextIntegrableObject(ioi)) { |
| 70 |
|
|
localSites_.push_back(sd); |
| 71 |
gezelter |
1412 |
} |
| 72 |
|
|
|
| 73 |
|
|
// selection can include atoms (which may be a subset of the IOs) |
| 74 |
|
|
for(atom = mol->beginAtom(ai); atom != NULL; |
| 75 |
|
|
atom = mol->nextAtom(ai)) { |
| 76 |
|
|
stuntdoubles_[atom->getGlobalIndex()] = atom; |
| 77 |
|
|
} |
| 78 |
|
|
|
| 79 |
|
|
// and rigid bodies |
| 80 |
|
|
for (rb = mol->beginRigidBody(rbIter); rb != NULL; |
| 81 |
|
|
rb = mol->nextRigidBody(rbIter)) { |
| 82 |
|
|
stuntdoubles_[rb->getGlobalIndex()] = rb; |
| 83 |
|
|
} |
| 84 |
|
|
|
| 85 |
chuckv |
1438 |
} |
| 86 |
|
|
#ifdef HAVE_QHULL |
| 87 |
|
|
surfaceMesh_ = new ConvexHull(); |
| 88 |
chuckv |
1439 |
#endif |
| 89 |
|
|
} |
| 90 |
|
|
|
| 91 |
|
|
OpenMDBitSet HullFinder::findHull() { |
| 92 |
|
|
Snapshot* currSnapshot = info_->getSnapshotManager()->getCurrentSnapshot(); |
| 93 |
|
|
OpenMDBitSet bsResult(nStuntDoubles_); |
| 94 |
|
|
#ifdef HAVE_QHULL |
| 95 |
|
|
surfaceMesh_->computeHull(localSites_); |
| 96 |
chuckv |
1438 |
#else |
| 97 |
|
|
sprintf( painCave.errMsg, |
| 98 |
gezelter |
1618 |
"HullFinder : Hull calculation is not possible without libqhull.\n" |
| 99 |
|
|
"\tPlease rebuild OpenMD with qhull enabled."); |
| 100 |
chuckv |
1438 |
painCave.severity = OPENMD_ERROR; |
| 101 |
|
|
painCave.isFatal = 1; |
| 102 |
|
|
simError(); |
| 103 |
|
|
#endif |
| 104 |
chuckv |
1439 |
|
| 105 |
gezelter |
1412 |
std::vector<Triangle> sMesh = surfaceMesh_->getMesh(); |
| 106 |
|
|
int nTriangles = sMesh.size(); |
| 107 |
|
|
// Loop over the mesh faces |
| 108 |
|
|
std::vector<Triangle>::iterator face; |
| 109 |
|
|
std::vector<StuntDouble*>::iterator vertex; |
| 110 |
|
|
|
| 111 |
gezelter |
1803 |
// This will work in parallel because the triangles returned by the mesh |
| 112 |
|
|
// have a NULL stuntDouble if this processor doesn't own the |
| 113 |
|
|
|
| 114 |
gezelter |
1412 |
for (face = sMesh.begin(); face != sMesh.end(); ++face) { |
| 115 |
|
|
Triangle thisTriangle = *face; |
| 116 |
|
|
std::vector<StuntDouble*> vertexSDs = thisTriangle.getVertices(); |
| 117 |
|
|
for (vertex = vertexSDs.begin(); vertex != vertexSDs.end(); ++vertex) { |
| 118 |
|
|
if ((*vertex) != NULL) { |
| 119 |
|
|
bsResult.setBitOn((*vertex)->getGlobalIndex()); |
| 120 |
|
|
} |
| 121 |
|
|
} |
| 122 |
|
|
} |
| 123 |
|
|
return bsResult; |
| 124 |
|
|
} |
| 125 |
|
|
|
| 126 |
|
|
} |
