ViewVC Help
View File | Revision Log | Show Annotations | View Changeset | Root Listing
root/OpenMD/branches/development/src/math/ConvexHull.cpp
(Generate patch)

Comparing:
trunk/src/math/ConvexHull.cpp (file contents), Revision 1137 by chuckv, Tue May 29 22:50:14 2007 UTC vs.
branches/development/src/math/ConvexHull.cpp (file contents), Revision 1874 by gezelter, Wed May 15 15:09:35 2013 UTC

# Line 1 | Line 1
1 < /* Copyright (c) 2006 The University of Notre Dame. All Rights Reserved.
1 > /* Copyright (c) 2010 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
8 > * 1. Redistributions of source code must retain the above copyright
9   *    notice, this list of conditions and the following disclaimer.
10   *
11 < * 3. Redistributions in binary form must reproduce the above copyright
11 > * 2. Redistributions in binary form must reproduce the above copyright
12   *    notice, this list of conditions and the following disclaimer in the
13   *    documentation and/or other materials provided with the
14   *    distribution.
# Line 37 | Line 28
28   * University of Notre Dame has been advised of the possibility of
29   * such damages.
30   *
31 + * SUPPORT OPEN SCIENCE!  If you use OpenMD or its source code in your
32 + * research, please cite the appropriate papers when you publish your
33 + * work.  Good starting points are:
34 + *                                                                      
35 + * [1] Meineke, et al., J. Comp. Chem. 26, 252-271 (2005).            
36 + * [2] Fennell & Gezelter, J. Chem. Phys. 124, 234104 (2006).          
37 + * [3] Sun, Lin & Gezelter, J. Chem. Phys. 128, 234107 (2008).          
38 + * [4] Kuang & Gezelter,  J. Chem. Phys. 133, 164101 (2010).
39 + * [5] Vardeman, Stocker & Gezelter, J. Chem. Theory Comput. 7, 834 (2011).
40   *
41   *  ConvexHull.cpp
42   *
43 < *  Purpose: To calculate convexhull, hull volume libqhull.
44 < *
45 < *  Created by Charles F. Vardeman II on 11 Dec 2006.
46 < *  @author  Charles F. Vardeman II
47 < *  @version $Id: ConvexHull.cpp,v 1.2 2007-05-29 22:50:14 chuckv Exp $
48 < *
43 > *  Purpose: To calculate a convex hull.
44   */
45  
46 < #include "math/ConvexHull.hpp"
46 > /* Standard includes independent of library */
47 >
48   #include <iostream>
49   #include <fstream>
50 + #include <list>
51 + #include <algorithm>
52 + #include <iterator>
53 + #include "math/ConvexHull.hpp"
54 + #include "utils/simError.h"
55  
56 < char options[] = "qhull Qt FA";
57 < int dim_ = 3;
56 > #ifdef IS_MPI
57 > #include <mpi.h>
58 > #endif
59  
60 < using namespace oopse;
60 > #include "math/qhull.hpp"
61  
62 < ConvexHull::ConvexHull(){}
62 > #ifdef HAVE_QHULL
63 > using namespace OpenMD;
64 > using namespace std;
65  
66 + ConvexHull::ConvexHull() : Hull(), dim_(3), options_("qhull FA Qt Pp") {
67 + }
68  
69 < bool ConvexHull::genHull(std::vector<Vector3d> pos)
70 < {
71 <        FILE *outfile = stdout;
72 <        FILE *errfile = stderr;
73 <        facetT *facet;
74 <        int exitcode;
75 <        boolT ismalloc = False;
76 <        int curlong,totlong;
77 <        
78 <        int numpoints = pos.size();
73 <        
74 <        coordT points[numpoints][dim_];
75 <        
76 <        for (int i=0; i<numpoints; i++)
77 <        {
78 <     points[i][0] = pos[i][0];
79 <     points[i][1] = pos[i][1];
80 <     points[i][2] = pos[i][2];          
81 <        }
82 <  
69 > void ConvexHull::computeHull(vector<StuntDouble*> bodydoubles) {
70 >  
71 >  int numpoints = bodydoubles.size();
72 >  
73 >  Triangles_.clear();
74 >  
75 >  vertexT *vertex, **vertexp;
76 >  facetT *facet;
77 >  setT *vertices;
78 >  int curlong, totlong;
79  
80 +  vector<double> ptArray(numpoints*dim_);
81  
82 <        qh_initflags (options);
83 <    qh_init_B (points[0], numpoints, dim_, ismalloc);
84 <    qh_qhull();
85 <    qh_check_output();
86 <                                                        
87 <                                                        
88 <                                                        
89 <    qh_getarea(qh facet_list);
90 <    volume_ = qh totvol;                                                        
91 <        area_ = qh totarea;                                            
92 <                                                        
93 <                                                        
94 <                                                        
95 <    qh_freeqhull(!qh_ALL);
96 <        qh_memfreeshort (&curlong, &totlong);
97 <        if (curlong || totlong)
98 <                fprintf (errfile, "qhull internal warning (main): did not free %d bytes of long memory (%d pieces)\n",
99 <                                 totlong, curlong);
100 <        
82 >  // Copy the positon vector into a points vector for qhull.
83 >  vector<StuntDouble*>::iterator SD;
84 >  int i = 0;
85 >
86 >  for (SD =bodydoubles.begin(); SD != bodydoubles.end(); ++SD){
87 >    Vector3d pos = (*SD)->getPos();      
88 >    ptArray[dim_ * i] = pos.x();
89 >    ptArray[dim_ * i + 1] = pos.y();
90 >    ptArray[dim_ * i + 2] = pos.z();
91 >    i++;
92 >  }
93 >  
94 >  /* Clean up memory from previous convex hull calculations */
95 >  boolT ismalloc = False;
96 >  
97 >  /* compute the hull for our local points (or all the points for single
98 >     processor versions) */
99 >  if (qh_new_qhull(dim_, numpoints, &ptArray[0], ismalloc,
100 >                   const_cast<char *>(options_.c_str()), NULL, stderr)) {
101 >    
102 >    sprintf(painCave.errMsg, "ConvexHull: Qhull failed to compute convex hull");
103 >    painCave.isFatal = 1;
104 >    simError();
105 >    
106 >  } //qh_new_qhull
107  
105        return true;
106 }
108  
109 + #ifdef IS_MPI
110 +  //If we are doing the mpi version, set up some vectors for data communication
111 +  
112 +  int nproc = MPI::COMM_WORLD.Get_size();
113 +  int myrank = MPI::COMM_WORLD.Get_rank();
114 +  int localHullSites = 0;
115  
116 < RealType ConvexHull::getVolume()
117 < {
118 <        return volume_;
119 < }
116 >  vector<int> hullSitesOnProc(nproc, 0);
117 >  vector<int> coordsOnProc(nproc, 0);
118 >  vector<int> displacements(nproc, 0);
119 >  vector<int> vectorDisplacements(nproc, 0);
120  
121 < void ConvexHull::geomviewHull(const std::string& geomFileName)
122 < {
121 >  vector<double> coords;
122 >  vector<double> vels;
123 >  vector<int> indexMap;
124 >  vector<double> masses;
125  
126 <  std::ofstream newGeomFile;
126 >  FORALLvertices{
127 >    localHullSites++;
128 >    
129 >    int idx = qh_pointid(vertex->point);
130  
131 <  //create new .md file based on old .md file
120 <  newGeomFile.open(geomFileName.c_str());
131 >    indexMap.push_back(idx);
132  
133 +    coords.push_back(ptArray[dim_  * idx]);
134 +    coords.push_back(ptArray[dim_  * idx + 1]);
135 +    coords.push_back(ptArray[dim_  * idx + 2]);
136  
137 <  newGeomFile.close();
137 >    StuntDouble* sd = bodydoubles[idx];
138  
139 +    Vector3d vel = sd->getVel();
140 +    vels.push_back(vel.x());
141 +    vels.push_back(vel.y());
142 +    vels.push_back(vel.z());
143  
144 +    masses.push_back(sd->getMass());
145 +  }
146 +
147 +  MPI::COMM_WORLD.Allgather(&localHullSites, 1, MPI::INT, &hullSitesOnProc[0],
148 +                            1, MPI::INT);
149 +
150 +  int globalHullSites = 0;
151 +  for (int iproc = 0; iproc < nproc; iproc++){
152 +    globalHullSites += hullSitesOnProc[iproc];
153 +    coordsOnProc[iproc] = dim_ * hullSitesOnProc[iproc];
154 +  }
155 +
156 +  displacements[0] = 0;
157 +  vectorDisplacements[0] = 0;
158 +  
159 +  for (int iproc = 1; iproc < nproc; iproc++){
160 +    displacements[iproc] = displacements[iproc-1] + hullSitesOnProc[iproc-1];
161 +    vectorDisplacements[iproc] = vectorDisplacements[iproc-1] + coordsOnProc[iproc-1];
162 +  }
163 +
164 +  vector<double> globalCoords(dim_ * globalHullSites);
165 +  vector<double> globalVels(dim_ * globalHullSites);
166 +  vector<double> globalMasses(globalHullSites);
167 +
168 +  int count = coordsOnProc[myrank];
169 +  
170 +  MPI::COMM_WORLD.Allgatherv(&coords[0], count, MPI::DOUBLE, &globalCoords[0],
171 +                             &coordsOnProc[0], &vectorDisplacements[0],
172 +                             MPI::DOUBLE);
173 +
174 +  MPI::COMM_WORLD.Allgatherv(&vels[0], count, MPI::DOUBLE, &globalVels[0],
175 +                             &coordsOnProc[0], &vectorDisplacements[0],
176 +                             MPI::DOUBLE);
177 +
178 +  MPI::COMM_WORLD.Allgatherv(&masses[0], localHullSites, MPI::DOUBLE,
179 +                             &globalMasses[0], &hullSitesOnProc[0],
180 +                             &displacements[0], MPI::DOUBLE);
181 +
182 +  // Free previous hull
183 +  qh_freeqhull(!qh_ALL);
184 +  qh_memfreeshort(&curlong, &totlong);
185 +  if (curlong || totlong) {
186 +    sprintf(painCave.errMsg, "ConvexHull: qhull internal warning:\n"
187 +            "\tdid not free %d bytes of long memory (%d pieces)",
188 +            totlong, curlong);
189 +    painCave.isFatal = 1;
190 +    simError();
191 +  }
192 +  
193 +  if (qh_new_qhull(dim_, globalHullSites, &globalCoords[0], ismalloc,
194 +                   const_cast<char *>(options_.c_str()), NULL, stderr)){
195 +    
196 +    sprintf(painCave.errMsg,
197 +            "ConvexHull: Qhull failed to compute global convex hull");
198 +    painCave.isFatal = 1;
199 +    simError();
200 +    
201 +  } //qh_new_qhull
202 +
203 + #endif
204 +  // commented out below, so comment out here also.
205 +  // intPoint = qh interior_point;
206 +  // RealType calcvol = 0.0;
207 +  
208 +  qh_triangulate ();
209 +
210 +  FORALLfacets {  
211 +    Triangle face;
212 +    //Qhull sets the unit normal in facet->normal
213 +    Vector3d V3dNormal(facet->normal[0], facet->normal[1], facet->normal[2]);
214 +    face.setUnitNormal(V3dNormal);
215 +    
216 +    RealType faceArea = qh_facetarea(facet);
217 +    face.setArea(faceArea);
218 +    
219 +    vertices = qh_facet3vertex(facet);
220 +      
221 +    coordT *center = qh_getcenter(vertices);
222 +    Vector3d V3dCentroid(center[0], center[1], center[2]);
223 +    face.setCentroid(V3dCentroid);
224 +
225 +    Vector3d faceVel = V3Zero;
226 +    Vector3d p[3];
227 +    RealType faceMass = 0.0;
228 +
229 +    int ver = 0;
230 +
231 +    FOREACHvertex_(vertices){
232 +      int id = qh_pointid(vertex->point);
233 +      p[ver][0] = vertex->point[0];
234 +      p[ver][1] = vertex->point[1];
235 +      p[ver][2] = vertex->point[2];
236 +      Vector3d vel;
237 +      RealType mass;
238 +
239 + #ifdef IS_MPI
240 +      vel = Vector3d(globalVels[dim_ * id],
241 +                     globalVels[dim_ * id + 1],
242 +                     globalVels[dim_ * id + 2]);
243 +      mass = globalMasses[id];
244 +
245 +      // localID will be between 0 and hullSitesOnProc[myrank] if we
246 +      // own this guy.
247 +
248 +      int localID = id - displacements[myrank];
249 +
250 +
251 +      if (localID >= 0 && localID < hullSitesOnProc[myrank]){
252 +        face.addVertexSD(bodydoubles[indexMap[localID]]);
253 +      }else{
254 +        face.addVertexSD(NULL);
255 +      }
256 + #else
257 +      vel = bodydoubles[id]->getVel();
258 +      mass = bodydoubles[id]->getMass();
259 +      face.addVertexSD(bodydoubles[id]);      
260 + #endif  
261 +      faceVel = faceVel + vel;
262 +      faceMass = faceMass + mass;
263 +      ver++;      
264 +    } //Foreachvertex
265 +
266 +    face.addVertices(p[0], p[1], p[2]);
267 +    face.setFacetMass(faceMass);
268 +    face.setFacetVelocity(faceVel / RealType(3.0));
269 +    /*
270 +    RealType comparea = face.computeArea();
271 +    realT calcarea = qh_facetarea (facet);
272 +    Vector3d V3dCompNorm = -face.computeUnitNormal();
273 +    RealType thisOffset = ((0.0-p[0][0])*V3dCompNorm[0] + (0.0-p[0][1])*V3dCompNorm[1] + (0.0-p[0][2])*V3dCompNorm[2]);
274 +    RealType dist = facet->offset + intPoint[0]*V3dNormal[0] + intPoint[1]*V3dNormal[1] + intPoint[2]*V3dNormal[2];
275 +    cout << "facet offset and computed offset: " << facet->offset << "  " << thisOffset <<  endl;
276 +    calcvol +=  -dist*comparea/qh hull_dim;
277 +    */
278 +    Triangles_.push_back(face);
279 +    qh_settempfree(&vertices);      
280 +
281 +  } //FORALLfacets
282 +  
283 +  qh_getarea(qh facet_list);
284 +  volume_ = qh totvol;
285 +  area_ = qh totarea;
286 +    
287 +  qh_freeqhull(!qh_ALL);
288 +  qh_memfreeshort(&curlong, &totlong);
289 +  if (curlong || totlong) {
290 +    sprintf(painCave.errMsg, "ConvexHull: qhull internal warning:\n"
291 +            "\tdid not free %d bytes of long memory (%d pieces)",
292 +            totlong, curlong);
293 +    painCave.isFatal = 1;
294 +    simError();
295 +  }
296   }
297 +
298 + void ConvexHull::printHull(const string& geomFileName) {
299 +  
300 + #ifdef IS_MPI
301 +  if (worldRank == 0)  {
302 + #endif
303 +    FILE *newGeomFile;
304 +    
305 +    //create new .md file based on old .md file
306 +    newGeomFile = fopen(geomFileName.c_str(), "w");
307 +    qh_findgood_all(qh facet_list);
308 +    for (int i = 0; i < qh_PRINTEND; i++)
309 +      qh_printfacets(newGeomFile, qh PRINTout[i], qh facet_list, NULL, !qh_ALL);
310 +    
311 +    fclose(newGeomFile);
312 + #ifdef IS_MPI
313 +  }
314 + #endif
315 + }
316 + #endif //QHULL

Comparing:
trunk/src/math/ConvexHull.cpp (property svn:keywords), Revision 1137 by chuckv, Tue May 29 22:50:14 2007 UTC vs.
branches/development/src/math/ConvexHull.cpp (property svn:keywords), Revision 1874 by gezelter, Wed May 15 15:09:35 2013 UTC

# Line 0 | Line 1
1 + Author Id Revision Date

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines