1 |
kstocke1 |
1701 |
/* |
2 |
|
|
* Copyright (c) 2006 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 |
gezelter |
1850 |
* [3] Sun, Lin & Gezelter, J. Chem. Phys. 128, 234107 (2008). |
39 |
kstocke1 |
1701 |
* [4] Kuang & Gezelter, J. Chem. Phys. 133, 164101 (2010). |
40 |
gezelter |
1828 |
* [4] Vardeman, Stocker & Gezelter, J. Chem. Theory Comput. 7, 834 (2011). |
41 |
|
|
*/ |
42 |
|
|
|
43 |
|
|
/* |
44 |
kstocke1 |
1701 |
* Created by Kelsey M. Stocker on 2/9/12. |
45 |
|
|
* @author Kelsey M. Stocker |
46 |
|
|
* @version $Id: shapedLatticeRod.cpp 1665 2011-11-22 20:38:56Z gezelter $ |
47 |
|
|
* |
48 |
|
|
*/ |
49 |
|
|
|
50 |
|
|
#include "lattice/shapedLattice.hpp" |
51 |
|
|
#include "shapedLatticeRod.hpp" |
52 |
|
|
#include <cmath> |
53 |
|
|
|
54 |
|
|
using namespace std; |
55 |
|
|
namespace OpenMD { |
56 |
|
|
|
57 |
|
|
shapedLatticeRod::shapedLatticeRod(RealType latticeConstant, |
58 |
|
|
std::string latticeType, |
59 |
gezelter |
1828 |
RealType radius, |
60 |
|
|
RealType length) : shapedLattice(latticeConstant, latticeType){ |
61 |
kstocke1 |
1701 |
|
62 |
|
|
rodRadius_= radius; |
63 |
|
|
rodLength_= length; |
64 |
|
|
Vector3d dimension; |
65 |
|
|
dimension[0] = 3.0*radius; |
66 |
|
|
dimension[1] = 3.0*radius; |
67 |
|
|
dimension[2] = length + 3.0*radius; |
68 |
|
|
cerr << "using dimension = " << dimension << "\n"; |
69 |
|
|
setGridDimension(dimension); |
70 |
|
|
cerr << "done!\n"; |
71 |
|
|
Vector3d origin; |
72 |
|
|
origin[0] = 0; |
73 |
|
|
origin[1] = 0; |
74 |
|
|
origin[2] = 0; |
75 |
|
|
setOrigin(origin); |
76 |
|
|
} |
77 |
|
|
|
78 |
|
|
/** |
79 |
gezelter |
1828 |
* Determines whether a point lies within a spherically-capped |
80 |
|
|
* nanorod at origin (0,0,0) |
81 |
kstocke1 |
1701 |
* |
82 |
|
|
*/ |
83 |
|
|
bool shapedLatticeRod::isInterior(Vector3d point){ |
84 |
|
|
|
85 |
|
|
RealType x, y, z, distance, delta_z; |
86 |
|
|
|
87 |
|
|
distance = 0; |
88 |
|
|
|
89 |
|
|
x = point[0]; |
90 |
|
|
y = point[1]; |
91 |
|
|
z = point[2]; |
92 |
|
|
|
93 |
|
|
if ( abs(z) >= rodLength_/2.0 ) { |
94 |
|
|
delta_z = abs(z) - rodLength_/2.0; |
95 |
|
|
distance = sqrt((x*x) + (y*y) + (delta_z*delta_z)); |
96 |
|
|
} else { |
97 |
|
|
distance = sqrt((x*x) + (y*y)); |
98 |
|
|
} |
99 |
|
|
|
100 |
|
|
bool isIT=false; |
101 |
|
|
if ( distance <= rodRadius_ ) { |
102 |
|
|
isIT=true; |
103 |
|
|
} |
104 |
|
|
return isIT; |
105 |
|
|
} |
106 |
|
|
|
107 |
|
|
} |