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 1097 by chuckv, Thu Dec 14 19:32:32 2006 UTC vs.
Revision 1377 by gezelter, Wed Oct 21 02:49:43 2009 UTC

# Line 1 | Line 1
1 < /* Copyright (c) 2006 The University of Notre Dame. All Rights Reserved.
1 > /* Copyright (c) 2008, 2009 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
# Line 40 | Line 40
40   *
41   *  ConvexHull.cpp
42   *
43 < *  Purpose: To calculate convexhull, hull volume and radius
44 < *  using the CGAL library.
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.1 2006-12-14 19:32:32 chuckv Exp $
47 > *  @version $Id: ConvexHull.cpp,v 1.18 2009-10-21 02:49:43 gezelter Exp $
48   *
49   */
50  
51 < #include "math/ConvexHull.hpp"
51 > /* Standard includes independent of library */
52 >
53   #include <iostream>
54   #include <fstream>
55 + #include <list>
56 + #include <algorithm>
57 + #include <iterator>
58 + #include "math/ConvexHull.hpp"
59 + #include "utils/simError.h"
60  
61 + #ifdef IS_MPI
62 + #include <mpi.h>
63 + #endif
64  
65   using namespace oopse;
66  
67 + #ifdef HAVE_QHULL
68 + extern "C"
69 + {
70 + #include <qhull/qhull.h>
71 + #include <qhull/mem.h>
72 + #include <qhull/qset.h>
73 + #include <qhull/geom.h>
74 + #include <qhull/merge.h>
75 + #include <qhull/poly.h>
76 + #include <qhull/io.h>
77 + #include <qhull/stat.h>
78 + }
79  
80 + /* Old options Qt Qu Qg QG0 FA */
81 + /* More old opts Qc Qi Pp*/
82  
83 + ConvexHull::ConvexHull() : Hull(), dim_(3), options_("qhull Qt Pp") {
84 + }
85  
86 < bool ConvexHull::genHull(std::vector<Vector3d> pos)
87 < {
86 > void ConvexHull::computeHull(std::vector<StuntDouble*> bodydoubles) {
87 >
88 >  int numpoints = bodydoubles.size();
89  
90 <  std::vector<Point_3> points;
91 <  points.reserve(pos.size());
92 <  // Copy the positon vector into a points vector for cgal.
93 <  for (int i = 0; i < pos.size(); ++i)
94 <    {
95 <      Point_3 pt(pos[i][0],pos[i][1],pos[i][2]);
96 <      points.push_back(pt);
97 <    }
90 >  Triangles_.clear();
91 >  
92 >  vertexT *vertex, **vertexp;
93 >  facetT *facet;
94 >  setT *vertices;
95 >  int curlong, totlong;
96 >  
97 >  std::vector<double> ptArray(numpoints*3);
98 >  std::vector<bool> isSurfaceID(numpoints);
99  
100 <  // compute convex hull
101 <  CGAL::convex_hull_3(points.begin(), points.end(), ch_object);
102 <  // Make sure hull is a polyhedron
103 <  if ( CGAL::assign(ch_polyhedron, ch_object) )
104 <    {
105 <      return true;
106 <    }
107 <  else
108 <    {
109 <      return false;
110 <    }
111 < }
100 >  // Copy the positon vector into a points vector for qhull.
101 >  std::vector<StuntDouble*>::iterator SD;
102 >  int i = 0;
103 >  for (SD =bodydoubles.begin(); SD != bodydoubles.end(); ++SD){
104 >    Vector3d pos = (*SD)->getPos();      
105 >    ptArray[dim_ * i] = pos.x();
106 >    ptArray[dim_ * i + 1] = pos.y();
107 >    ptArray[dim_ * i + 2] = pos.z();
108 >    i++;
109 >  }
110 >  
111 >  boolT ismalloc = False;
112 >  /* Clean up memory from previous convex hull calculations*/
113 >  
114 >  if (qh_new_qhull(dim_, numpoints, &ptArray[0], ismalloc,
115 >                   const_cast<char *>(options_.c_str()), NULL, stderr)) {
116  
117 < RealType ConvexHull::getVolume()
118 < {
119 <        /*
120 <  std::list<Point> L;
121 <  L.push_front(Point(0,0,0));
92 <  L.push_front(Point(1,0,0));
93 <  L.push_front(Point(0,1,0));
117 >    sprintf(painCave.errMsg, "ConvexHull: Qhull failed to compute convex hull");
118 >    painCave.isFatal = 1;
119 >    simError();
120 >    
121 >  } //qh_new_qhull
122  
95 –  Triangulation T(L.begin(), L.end());
123  
124 <  int n = T.number_of_vertices();
124 > #ifdef IS_MPI
125 >  //If we are doing the mpi version, set up some vectors for data communication
126 >  
127 >  int nproc = MPI::COMM_WORLD.Get_size();
128 >  int myrank = MPI::COMM_WORLD.Get_rank();
129 >  int localHullSites = 0;
130 >  int* hullSitesOnProc = new int[nproc];
131 >  int* coordsOnProc = new int[nproc];
132 >  int* displacements = new int[nproc];
133 >  int* vectorDisplacements = new int[nproc];
134  
135 <  // insertion from a vector :
136 <  std::vector<Point> V(3);
137 <  V[0] = Point(0,0,1);
138 <  V[1] = Point(1,1,1);
103 <  V[2] = Point(2,2,2);
135 >  std::vector<double> coords;
136 >  std::vector<double> vels;
137 >  std::vector<int> objectIDs;
138 >  std::vector<double> masses;
139  
140 <  n = n + T.insert(V.begin(), V.end());
140 >  FORALLvertices{
141 >    localHullSites++;
142 >    
143 >    int idx = qh_pointid(vertex->point);
144 >    coords.push_back(ptArray[dim_  * idx]);
145 >    coords.push_back(ptArray[dim_  * idx + 1]);
146 >    coords.push_back(ptArray[dim_  * idx + 2]);
147  
148 <  assert( n == 6 );       // 6 points have been inserted
108 <  assert( T.is_valid() ); // checking validity of T
148 >    StuntDouble* sd = bodydoubles[idx];
149  
150 <  double sum_v = 0;
151 <  for(Triangulation::Cell_iterator c_it = T.cells_begin(); c_it != T.cells_end(); ++c_it)
152 <    {
153 <      sum_v += T.tetrahedron(c_it).volume();
114 <    }
115 <  std::cout << "sum_v " << sum_v << std::endl;
116 < */
117 <        return 0.0;
118 < }
150 >    Vector3d vel = sd->getVel();
151 >    vels.push_back(vel.x());
152 >    vels.push_back(vel.y());
153 >    vels.push_back(vel.z());
154  
155 < void ConvexHull::geomviewHull(const std::string& geomFileName)
156 < {
155 >    masses.push_back(sd->getMass());
156 >  }
157  
123 –  std::ofstream newGeomFile;
158  
125 –  //create new .md file based on old .md file
126 –  newGeomFile.open(geomFileName.c_str());
159  
160 <  // Write polyhedron in Object File Format (OFF).
161 <  CGAL::set_ascii_mode( std::cout);
130 <  newGeomFile << "OFF" << std::endl << ch_polyhedron.size_of_vertices() << ' '
131 <  << ch_polyhedron.size_of_facets() << " 0" << std::endl;
132 <  std::copy( ch_polyhedron.points_begin(), ch_polyhedron.points_end(),
133 <             std::ostream_iterator<Point_3>( newGeomFile, "\n"));
134 <  for (  Facet_iterator i = ch_polyhedron.facets_begin(); i != ch_polyhedron.facets_end(); ++i)
135 <    {
136 <      Halfedge_facet_circulator j = i->facet_begin();
137 <      // Facets in polyhedral surfaces are at least triangles.
138 <      CGAL_assertion( CGAL::circulator_size(j) >= 3);
139 <      newGeomFile << CGAL::circulator_size(j) << ' ';
140 <      do
141 <        {
142 <          newGeomFile << ' ' << std::distance(ch_polyhedron.vertices_begin(), j->vertex());
143 <        }
144 <      while ( ++j != i->facet_begin());
145 <      newGeomFile << std::endl;
146 <    }
160 >  MPI::COMM_WORLD.Allgather(&localHullSites, 1, MPI::INT, &hullSitesOnProc[0],
161 >                            1, MPI::INT);
162  
163 <  newGeomFile.close();
163 >  int globalHullSites = 0;
164 >  for (int iproc = 0; iproc < nproc; iproc++){
165 >    globalHullSites += hullSitesOnProc[iproc];
166 >    coordsOnProc[iproc] = dim_ * hullSitesOnProc[iproc];
167 >  }
168  
169 +  displacements[0] = 0;
170 +  vectorDisplacements[0] = 0;
171 +  
172 +  for (int iproc = 1; iproc < nproc; iproc++){
173 +    displacements[iproc] = displacements[iproc-1] + hullSitesOnProc[iproc-1];
174 +    vectorDisplacements[iproc] = vectorDisplacements[iproc-1] + coordsOnProc[iproc-1];
175 +  }
176  
177 +  std::vector<double> globalCoords(dim_ * globalHullSites);
178 +  std::vector<double> globalVels(dim_ * globalHullSites);
179 +  std::vector<double> globalMasses(globalHullSites);
180 +
181 +  int count = coordsOnProc[myrank];
182 +  
183 +  MPI::COMM_WORLD.Allgatherv(&coords[0], count, MPI::DOUBLE, &globalCoords[0],
184 +                             &coordsOnProc[0], &vectorDisplacements[0],
185 +                             MPI::DOUBLE);
186 +
187 +  MPI::COMM_WORLD.Allgatherv(&vels[0], count, MPI::DOUBLE, &globalVels[0],
188 +                             &coordsOnProc[0], &vectorDisplacements[0],
189 +                             MPI::DOUBLE);
190 +
191 +  MPI::COMM_WORLD.Allgatherv(&masses[0], localHullSites, MPI::DOUBLE,
192 +                             &globalMasses[0], &hullSitesOnProc[0],
193 +                             &displacements[0], MPI::DOUBLE);
194 +
195 +  // Free previous hull
196 +  qh_freeqhull(!qh_ALL);
197 +  qh_memfreeshort(&curlong, &totlong);
198 +  if (curlong || totlong)
199 +    std::cerr << "qhull internal warning (main): did not free %d bytes of long memory (%d pieces) "
200 +              << totlong << curlong << std::endl;
201 +  
202 +  if (qh_new_qhull(dim_, globalHullSites, &globalCoords[0], ismalloc,
203 +                   const_cast<char *>(options_.c_str()), NULL, stderr)){
204 +    
205 +    sprintf(painCave.errMsg, "ConvexHull: Qhull failed to compute global convex hull");
206 +    painCave.isFatal = 1;
207 +    simError();
208 +    
209 +  } //qh_new_qhull
210 +
211 + #endif
212 +
213 +  FORALLfacets {  
214 +    Triangle face;
215 +
216 +    Vector3d V3dNormal(facet->normal[0], facet->normal[1], facet->normal[2]);
217 +    face.setNormal(V3dNormal);
218 +    
219 +    RealType faceArea = qh_facetarea(facet);
220 +    face.setArea(faceArea);
221 +    
222 +    vertices = qh_facet3vertex(facet);
223 +      
224 +    coordT *center = qh_getcenter(vertices);
225 +    Vector3d V3dCentroid(center[0], center[1], center[2]);
226 +    face.setCentroid(V3dCentroid);
227 +
228 +    Vector3d faceVel = V3Zero;
229 +    Vector3d p[3];
230 +    RealType faceMass = 0.0;
231 +
232 +    int ver = 0;
233 +
234 +    FOREACHvertex_(vertices){
235 +      int id = qh_pointid(vertex->point);
236 +      p[ver][0] = vertex->point[0];
237 +      p[ver][1] = vertex->point[1];
238 +      p[ver][2] = vertex->point[2];
239 +      
240 +      Vector3d vel;
241 +      RealType mass;
242 +
243 + #ifdef IS_MPI
244 +      vel = Vector3d(globalVels[dim_ * id],
245 +                     globalVels[dim_ * id + 1],
246 +                     globalVels[dim_ * id + 2]);
247 +      mass = globalMasses[id];
248 +
249 +      // localID will be between 0 and hullSitesOnProc[myrank] if we
250 +      // own this guy.
251 +
252 +      int localID = id - displacements[myrank];
253 +
254 +      if (localID >= 0 && localID < hullSitesOnProc[myrank])
255 +        face.addVertexSD(bodydoubles[localID]);
256 +      
257 + #else
258 +      vel = bodydoubles[id]->getVel();
259 +      mass = bodydoubles[id]->getMass();
260 +      face.addVertexSD(bodydoubles[id]);      
261 + #endif
262 +        
263 +      faceVel = faceVel + vel;
264 +      faceMass = faceMass + mass;
265 +      ver++;      
266 +    } //Foreachvertex
267 +
268 +    face.addVertices(p[0], p[1], p[2]);
269 +    face.setFacetMass(faceMass);
270 +    face.setFacetVelocity(faceVel/3.0);
271 +    Triangles_.push_back(face);
272 +    qh_settempfree(&vertices);      
273 +
274 +  } //FORALLfacets
275 +  
276 +  qh_getarea(qh facet_list);
277 +  volume_ = qh totvol;
278 +  area_ = qh totarea;
279 +
280 + #ifdef IS_MPI
281 +  delete [] hullSitesOnProc;
282 +  delete [] coordsOnProc;
283 +  delete [] displacements;
284 +  delete [] vectorDisplacements;
285 + #endif
286 +  
287 +  qh_freeqhull(!qh_ALL);
288 +  qh_memfreeshort(&curlong, &totlong);
289 +  if (curlong || totlong)
290 +    std::cerr << "qhull internal warning (main): did not free %d bytes of long memory (%d pieces) "
291 +              << totlong << curlong << std::endl;    
292   }
293 +
294 + void ConvexHull::printHull(const std::string& geomFileName) {
295 +  FILE *newGeomFile;
296 +  
297 +  //create new .md file based on old .md file
298 +  newGeomFile = fopen(geomFileName.c_str(), "w");
299 +  qh_findgood_all(qh facet_list);
300 +  for (int i = 0; i < qh_PRINTEND; i++)
301 +    qh_printfacets(newGeomFile, qh PRINTout[i], qh facet_list, NULL, !qh_ALL);
302 +  
303 +  fclose(newGeomFile);
304 + }
305 + #endif //QHULL

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines