| 1 |
chuckv |
2633 |
/* Copyright (c) 2006 The University of Notre Dame. All Rights Reserved. |
| 2 |
|
|
* |
| 3 |
|
|
* The University of Notre Dame grants you ("Licensee") a |
| 4 |
|
|
* non-exclusive, royalty free, license to use, modify and |
| 5 |
|
|
* redistribute this software in source and binary code form, provided |
| 6 |
|
|
* that the following conditions are met: |
| 7 |
|
|
* |
| 8 |
|
|
* 1. Acknowledgement of the program authors must be made in any |
| 9 |
|
|
* publication of scientific results based in part on use of the |
| 10 |
|
|
* program. An acceptable form of acknowledgement is citation of |
| 11 |
|
|
* the article in which the program was described (Matthew |
| 12 |
|
|
* A. Meineke, Charles F. Vardeman II, Teng Lin, Christopher |
| 13 |
|
|
* J. Fennell and J. Daniel Gezelter, "OOPSE: An Object-Oriented |
| 14 |
|
|
* Parallel Simulation Engine for Molecular Dynamics," |
| 15 |
|
|
* J. Comput. Chem. 26, pp. 252-271 (2005)) |
| 16 |
|
|
* |
| 17 |
|
|
* 2. Redistributions of source code must retain the above copyright |
| 18 |
|
|
* notice, this list of conditions and the following disclaimer. |
| 19 |
|
|
* |
| 20 |
|
|
* 3. Redistributions in binary form must reproduce the above copyright |
| 21 |
|
|
* notice, this list of conditions and the following disclaimer in the |
| 22 |
|
|
* documentation and/or other materials provided with the |
| 23 |
|
|
* distribution. |
| 24 |
|
|
* |
| 25 |
|
|
* This software is provided "AS IS," without a warranty of any |
| 26 |
|
|
* kind. All express or implied conditions, representations and |
| 27 |
|
|
* warranties, including any implied warranty of merchantability, |
| 28 |
|
|
* fitness for a particular purpose or non-infringement, are hereby |
| 29 |
|
|
* excluded. The University of Notre Dame and its licensors shall not |
| 30 |
|
|
* be liable for any damages suffered by licensee as a result of |
| 31 |
|
|
* using, modifying or distributing the software or its |
| 32 |
|
|
* derivatives. In no event will the University of Notre Dame or its |
| 33 |
|
|
* licensors be liable for any lost revenue, profit or data, or for |
| 34 |
|
|
* direct, indirect, special, consequential, incidental or punitive |
| 35 |
|
|
* damages, however caused and regardless of the theory of liability, |
| 36 |
|
|
* arising out of the use of or inability to use software, even if the |
| 37 |
|
|
* University of Notre Dame has been advised of the possibility of |
| 38 |
|
|
* such damages. |
| 39 |
|
|
* |
| 40 |
|
|
* |
| 41 |
|
|
* sphericalLattice.cpp |
| 42 |
|
|
* |
| 43 |
|
|
* Created by Charles F. Vardeman II on 17 Feb 2006. |
| 44 |
|
|
* @author Charles F. Vardeman II |
| 45 |
|
|
* @version $Id: shapedLattice.cpp,v 1.1 2006-03-17 16:10:19 chuckv Exp $ |
| 46 |
|
|
* |
| 47 |
|
|
*/ |
| 48 |
|
|
|
| 49 |
|
|
|
| 50 |
|
|
#include "lattice/shapedLattice.hpp" |
| 51 |
|
|
#include "math/Vector3.hpp" |
| 52 |
|
|
#include "brains/Register.hpp" |
| 53 |
|
|
#include "lattice/LatticeFactory.hpp" |
| 54 |
|
|
|
| 55 |
|
|
namespace oopse{ |
| 56 |
|
|
shapedLattice::shapedLattice(double latticeConstant, |
| 57 |
|
|
std::string latticeType) { |
| 58 |
|
|
latticeConstant_ = latticeConstant; |
| 59 |
|
|
latticeType_ = latticeType; |
| 60 |
|
|
registerLattice(); |
| 61 |
|
|
simpleLattice_ = LatticeFactory::getInstance()->createLattice(latticeType); |
| 62 |
|
|
if (simpleLattice_ == NULL){ |
| 63 |
|
|
std::cerr << "shapedLattice:: Error creating lattice" << std::endl; |
| 64 |
|
|
exit(1); |
| 65 |
|
|
} |
| 66 |
|
|
|
| 67 |
|
|
//Set the lattice constant |
| 68 |
|
|
std::vector<double> lc; |
| 69 |
|
|
lc.push_back(latticeConstant_); |
| 70 |
|
|
simpleLattice_->setLatticeConstant(lc); |
| 71 |
|
|
origin_[0]=0.0; |
| 72 |
|
|
origin_[1]=0.0; |
| 73 |
|
|
origin_[2]=0.0; |
| 74 |
|
|
} |
| 75 |
|
|
|
| 76 |
|
|
|
| 77 |
|
|
|
| 78 |
|
|
void shapedLattice::setGridDimension(Vector3d dimension){ |
| 79 |
|
|
dimension_ = dimension; |
| 80 |
|
|
// Find number of unit cells in each direction |
| 81 |
|
|
beginNx_ = -(int) ceil(dimension_[0]/latticeConstant_) ; |
| 82 |
|
|
beginNy_ = -(int) ceil(dimension_[1]/latticeConstant_) ; |
| 83 |
|
|
beginNz_ = -(int) ceil(dimension_[2]/latticeConstant_) ; |
| 84 |
|
|
endNx_ = (int) ceil(dimension_[0]/latticeConstant_); |
| 85 |
|
|
endNy_ = (int) ceil(dimension_[1]/latticeConstant_); |
| 86 |
|
|
endNz_ = (int) ceil(dimension_[2]/latticeConstant_); |
| 87 |
|
|
|
| 88 |
|
|
} |
| 89 |
|
|
|
| 90 |
|
|
|
| 91 |
|
|
|
| 92 |
|
|
void shapedLattice::setGridDimension(Vector3d dimension, Vector3d origin){ |
| 93 |
|
|
dimension_ = dimension; |
| 94 |
|
|
origin_ = origin; |
| 95 |
|
|
// Find number of unit cells in each direction |
| 96 |
|
|
beginNx_ = -(int) ceil(dimension_[0]/latticeConstant_) + (int) floor(origin[0]); |
| 97 |
|
|
beginNy_ = -(int) ceil(dimension_[1]/latticeConstant_) + (int) floor(origin[1]); |
| 98 |
|
|
beginNz_ = -(int) ceil(dimension_[2]/latticeConstant_) + (int) floor(origin[2]); |
| 99 |
|
|
endNx_ = (int) ceil(dimension_[0]/latticeConstant_) + (int) floor(origin[0]); |
| 100 |
|
|
endNy_ = (int) ceil(dimension_[1]/latticeConstant_) + (int) floor(origin[1]); |
| 101 |
|
|
endNz_ = (int) ceil(dimension_[2]/latticeConstant_) + (int) floor(origin[2]); |
| 102 |
|
|
|
| 103 |
|
|
} |
| 104 |
|
|
|
| 105 |
|
|
std::vector<Vector3d> shapedLattice::getPoints(){ |
| 106 |
|
|
std::vector<Vector3d> latticePos; |
| 107 |
|
|
|
| 108 |
|
|
int numMolPerCell = simpleLattice_->getNumSitesPerCell(); |
| 109 |
|
|
for(int i = beginNx_; i < endNx_; i++) { |
| 110 |
|
|
for(int j = beginNy_; j < endNy_; j++) { |
| 111 |
|
|
for(int k = beginNz_; k < endNz_; k++) { |
| 112 |
|
|
//get the position of the cell sites |
| 113 |
|
|
simpleLattice_->getLatticePointsPos(latticePos, i, j, k); |
| 114 |
|
|
|
| 115 |
|
|
for(int l = 0; l < numMolPerCell; l++) { |
| 116 |
|
|
|
| 117 |
|
|
if (isInterior(latticePos[l])){ |
| 118 |
|
|
coords_.push_back(latticePos[l]); |
| 119 |
|
|
} |
| 120 |
|
|
} |
| 121 |
|
|
} |
| 122 |
|
|
} |
| 123 |
|
|
} |
| 124 |
|
|
|
| 125 |
|
|
return coords_; |
| 126 |
|
|
|
| 127 |
|
|
} |
| 128 |
|
|
} |
