src/math/ConvexHull.cpp

/* Copyright (c) 2010 The University of Notre Dame. All Rights Reserved.
 *
 * The University of Notre Dame grants you ("Licensee") a
 * non-exclusive, royalty free, license to use, modify and
 * redistribute this software in source and binary code form, provided
 * that the following conditions are met:
 *
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 *
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the
 *    distribution.
 *
 * This software is provided "AS IS," without a warranty of any
 * kind. All express or implied conditions, representations and
 * warranties, including any implied warranty of merchantability,
 * fitness for a particular purpose or non-infringement, are hereby
 * excluded.  The University of Notre Dame and its licensors shall not
 * be liable for any damages suffered by licensee as a result of
 * using, modifying or distributing the software or its
 * derivatives. In no event will the University of Notre Dame or its
 * licensors be liable for any lost revenue, profit or data, or for
 * direct, indirect, special, consequential, incidental or punitive
 * damages, however caused and regardless of the theory of liability,
 * arising out of the use of or inability to use software, even if the
 * University of Notre Dame has been advised of the possibility of
 * such damages.
 *
 * SUPPORT OPEN SCIENCE!  If you use OpenMD or its source code in your
 * research, please cite the appropriate papers when you publish your
 * work.  Good starting points are:
 *                                                                      
 * [1] Meineke, et al., J. Comp. Chem. 26, 252-271 (2005).             
 * [2] Fennell & Gezelter, J. Chem. Phys. 124, 234104 (2006).          
 * [3] Sun, Lin & Gezelter, J. Chem. Phys. 128, 234107 (2008).          
 * [4] Kuang & Gezelter,  J. Chem. Phys. 133, 164101 (2010).
 * [5] Vardeman, Stocker & Gezelter, J. Chem. Theory Comput. 7, 834 (2011). 
 *
 *  ConvexHull.cpp
 *
 *  Purpose: To calculate a convex hull.
 */

#ifdef IS_MPI
#include <mpi.h>
#endif

/* Standard includes independent of library */

#include <iostream>
#include <fstream>
#include <list>
#include <algorithm>
#include <iterator>
#include "math/ConvexHull.hpp"
#include "utils/simError.h"

#include "math/qhull.hpp"

#ifdef HAVE_QHULL
using namespace OpenMD;
using namespace std;

ConvexHull::ConvexHull() : Hull(), options_("qhull FA Qt Pp"), dim_(3) {
}

void ConvexHull::computeHull(vector<StuntDouble*> bodydoubles) { 
  
  int numpoints = bodydoubles.size();
  
  Triangles_.clear();
  
  vertexT *vertex, **vertexp;
  facetT *facet;
  setT *vertices;
  int curlong, totlong;

  vector<double> ptArray(numpoints*dim_);

  // Copy the positon vector into a points vector for qhull.
  vector<StuntDouble*>::iterator SD;
  int i = 0;
 
  for (SD =bodydoubles.begin(); SD != bodydoubles.end(); ++SD){
    Vector3d pos = (*SD)->getPos();      
    ptArray[dim_ * i] = pos.x();
    ptArray[dim_ * i + 1] = pos.y();
    ptArray[dim_ * i + 2] = pos.z();
    i++;
  }
  
  /* Clean up memory from previous convex hull calculations */
  boolT ismalloc = False;
  
  /* compute the hull for our local points (or all the points for single
     processor versions) */
  if (qh_new_qhull(dim_, numpoints, &ptArray[0], ismalloc,
                   const_cast<char *>(options_.c_str()), NULL, stderr)) {
    
    sprintf(painCave.errMsg, "ConvexHull: Qhull failed to compute convex hull");
    painCave.isFatal = 1;
    simError();
    
  } //qh_new_qhull


#ifdef IS_MPI
  //If we are doing the mpi version, set up some vectors for data communication
  
  int nproc;
  int myrank;
  
  MPI_Comm_size( MPI_COMM_WORLD, &nproc);
  MPI_Comm_rank( MPI_COMM_WORLD, &myrank);

  int localHullSites = 0;

  vector<int> hullSitesOnProc(nproc, 0);
  vector<int> coordsOnProc(nproc, 0);
  vector<int> displacements(nproc, 0);
  vector<int> vectorDisplacements(nproc, 0);

  vector<double> coords;
  vector<double> vels;
  vector<int> indexMap;
  vector<double> masses;

  FORALLvertices{
    localHullSites++;
    
    int idx = qh_pointid(vertex->point);

    indexMap.push_back(idx);

    coords.push_back(ptArray[dim_  * idx]);
    coords.push_back(ptArray[dim_  * idx + 1]);
    coords.push_back(ptArray[dim_  * idx + 2]);

    StuntDouble* sd = bodydoubles[idx];

    Vector3d vel = sd->getVel();
    vels.push_back(vel.x());
    vels.push_back(vel.y());
    vels.push_back(vel.z());

    masses.push_back(sd->getMass());
  }

  MPI_Allgather(&localHullSites, 1, MPI_INT, &hullSitesOnProc[0],
                1, MPI_INT, MPI_COMM_WORLD);

  int globalHullSites = 0;
  for (int iproc = 0; iproc < nproc; iproc++){
    globalHullSites += hullSitesOnProc[iproc];
    coordsOnProc[iproc] = dim_ * hullSitesOnProc[iproc];
  }

  displacements[0] = 0;
  vectorDisplacements[0] = 0;
  
  for (int iproc = 1; iproc < nproc; iproc++){
    displacements[iproc] = displacements[iproc-1] + hullSitesOnProc[iproc-1];
    vectorDisplacements[iproc] = vectorDisplacements[iproc-1] + coordsOnProc[iproc-1]; 
  }

  vector<double> globalCoords(dim_ * globalHullSites);
  vector<double> globalVels(dim_ * globalHullSites);
  vector<double> globalMasses(globalHullSites);

  int count = coordsOnProc[myrank];
  
  MPI_Allgatherv(&coords[0], count, MPI_DOUBLE, &globalCoords[0],
                 &coordsOnProc[0], &vectorDisplacements[0], 
                 MPI_DOUBLE, MPI_COMM_WORLD);
  
  MPI_Allgatherv(&vels[0], count, MPI_DOUBLE, &globalVels[0], 
                 &coordsOnProc[0], &vectorDisplacements[0],
                 MPI_DOUBLE, MPI_COMM_WORLD);
  
  MPI_Allgatherv(&masses[0], localHullSites, MPI_DOUBLE,
                 &globalMasses[0], &hullSitesOnProc[0], 
                 &displacements[0], MPI_DOUBLE, MPI_COMM_WORLD);
  
  // Free previous hull
  qh_freeqhull(!qh_ALL);
  qh_memfreeshort(&curlong, &totlong);
  if (curlong || totlong) {
    sprintf(painCave.errMsg, "ConvexHull: qhull internal warning:\n"
            "\tdid not free %d bytes of long memory (%d pieces)", 
            totlong, curlong);
    painCave.isFatal = 1;
    simError();
  }
  
  if (qh_new_qhull(dim_, globalHullSites, &globalCoords[0], ismalloc,
                   const_cast<char *>(options_.c_str()), NULL, stderr)){
    
    sprintf(painCave.errMsg, 
            "ConvexHull: Qhull failed to compute global convex hull");
    painCave.isFatal = 1;
    simError();
    
  } //qh_new_qhull

#endif
  // commented out below, so comment out here also.
  // intPoint = qh interior_point;
  // RealType calcvol = 0.0;
  
  qh_triangulate ();

  FORALLfacets {  
    Triangle face;
    //Qhull sets the unit normal in facet->normal
    Vector3d V3dNormal(facet->normal[0], facet->normal[1], facet->normal[2]);
    face.setUnitNormal(V3dNormal);
    
    RealType faceArea = qh_facetarea(facet);
    face.setArea(faceArea);
    
    vertices = qh_facet3vertex(facet);
      
    coordT *center = qh_getcenter(vertices);
    Vector3d V3dCentroid(center[0], center[1], center[2]);
    face.setCentroid(V3dCentroid);

    Vector3d faceVel = V3Zero;
    Vector3d p[3];
    RealType faceMass = 0.0;

    int ver = 0;

    FOREACHvertex_(vertices){
      int id = qh_pointid(vertex->point);
      p[ver][0] = vertex->point[0];
      p[ver][1] = vertex->point[1];
      p[ver][2] = vertex->point[2];
      Vector3d vel;
      RealType mass;

#ifdef IS_MPI
      vel = Vector3d(globalVels[dim_ * id],
                     globalVels[dim_ * id + 1], 
                     globalVels[dim_ * id + 2]);
      mass = globalMasses[id];

      // localID will be between 0 and hullSitesOnProc[myrank] if we
      // own this guy.

      int localID = id - displacements[myrank];


      if (localID >= 0 && localID < hullSitesOnProc[myrank]){
        face.addVertexSD(bodydoubles[indexMap[localID]]);
      }else{
        face.addVertexSD(NULL);
      }
#else
      vel = bodydoubles[id]->getVel();
      mass = bodydoubles[id]->getMass();
      face.addVertexSD(bodydoubles[id]);      
#endif  
      faceVel = faceVel + vel;
      faceMass = faceMass + mass;
      ver++;      
    } //Foreachvertex

    face.addVertices(p[0], p[1], p[2]);
    face.setFacetMass(faceMass);
    face.setFacetVelocity(faceVel / RealType(3.0));
    /*
    RealType comparea = face.computeArea();
    realT calcarea = qh_facetarea (facet);
    Vector3d V3dCompNorm = -face.computeUnitNormal();
    RealType thisOffset = ((0.0-p[0][0])*V3dCompNorm[0] + (0.0-p[0][1])*V3dCompNorm[1] + (0.0-p[0][2])*V3dCompNorm[2]);
    RealType dist = facet->offset + intPoint[0]*V3dNormal[0] + intPoint[1]*V3dNormal[1] + intPoint[2]*V3dNormal[2];
    cout << "facet offset and computed offset: " << facet->offset << "  " << thisOffset <<  endl;
    calcvol +=  -dist*comparea/qh hull_dim;
    */
    Triangles_.push_back(face);
    qh_settempfree(&vertices);      

  } //FORALLfacets
  
  qh_getarea(qh facet_list);
  volume_ = qh totvol;
  area_ = qh totarea;
     
  qh_freeqhull(!qh_ALL);
  qh_memfreeshort(&curlong, &totlong);
  if (curlong || totlong) {
    sprintf(painCave.errMsg, "ConvexHull: qhull internal warning:\n"
            "\tdid not free %d bytes of long memory (%d pieces)", 
            totlong, curlong);
    painCave.isFatal = 1;
    simError();
  }
}

void ConvexHull::printHull(const string& geomFileName) {
  
#ifdef IS_MPI
  if (worldRank == 0)  {
#endif
    FILE *newGeomFile;
    
    //create new .md file based on old .md file
    newGeomFile = fopen(geomFileName.c_str(), "w");
    qh_findgood_all(qh facet_list);
    for (int i = 0; i < qh_PRINTEND; i++)
      qh_printfacets(newGeomFile, qh PRINTout[i], qh facet_list, NULL, !qh_ALL);
    
    fclose(newGeomFile);
#ifdef IS_MPI
  }
#endif
}
#endif //QHULL
Revision:	2071
Committed:	Sat Mar 7 21:41:51 2015 UTC (10 years, 1 month ago) by gezelter
File size:	9943 byte(s)
Log Message:	Reducing the number of warnings when using g++ to compile.
#	User	Rev	Content
1	gezelter	1411	/* Copyright (c) 2010 The University of Notre Dame. All Rights Reserved.
2	chuckv	1097	*
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	gezelter	1390	* 1. Redistributions of source code must retain the above copyright
9	chuckv	1097	* notice, this list of conditions and the following disclaimer.
10			*
11	gezelter	1390	* 2. Redistributions in binary form must reproduce the above copyright
12	chuckv	1097	* notice, this list of conditions and the following disclaimer in the
13			* documentation and/or other materials provided with the
14			* distribution.
15			*
16			* This software is provided "AS IS," without a warranty of any
17			* kind. All express or implied conditions, representations and
18			* warranties, including any implied warranty of merchantability,
19			* fitness for a particular purpose or non-infringement, are hereby
20			* excluded. The University of Notre Dame and its licensors shall not
21			* be liable for any damages suffered by licensee as a result of
22			* using, modifying or distributing the software or its
23			* derivatives. In no event will the University of Notre Dame or its
24			* licensors be liable for any lost revenue, profit or data, or for
25			* direct, indirect, special, consequential, incidental or punitive
26			* damages, however caused and regardless of the theory of liability,
27			* arising out of the use of or inability to use software, even if the
28			* University of Notre Dame has been advised of the possibility of
29			* such damages.
30			*
31	gezelter	1390	* 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	gezelter	1879	* [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	gezelter	1782	* [4] Kuang & Gezelter, J. Chem. Phys. 133, 164101 (2010).
39	gezelter	1879	* [5] Vardeman, Stocker & Gezelter, J. Chem. Theory Comput. 7, 834 (2011).
40	chuckv	1097	*
41			* ConvexHull.cpp
42			*
43	gezelter	1879	* Purpose: To calculate a convex hull.
44	chuckv	1097	*/
45
46	gezelter	1938	#ifdef IS_MPI
47			#include <mpi.h>
48			#endif
49
50	chuckv	1242	/* Standard includes independent of library */
51	chuckv	1374
52	chuckv	1097	#include <iostream>
53			#include <fstream>
54	chuckv	1188	#include <list>
55			#include <algorithm>
56			#include <iterator>
57	chuckv	1141	#include "math/ConvexHull.hpp"
58	chuckv	1188	#include "utils/simError.h"
59	chuckv	1293
60	gezelter	1782	#include "math/qhull.hpp"
61	chuckv	1293
62	chuckv	1374	#ifdef HAVE_QHULL
63	gezelter	1782	using namespace OpenMD;
64	gezelter	1879	using namespace std;
65	chuckv	1293
66	gezelter	2071	ConvexHull::ConvexHull() : Hull(), options_("qhull FA Qt Pp"), dim_(3) {
67	chuckv	1374	}
68	chuckv	1293
69	gezelter	1879	void ConvexHull::computeHull(vector<StuntDouble*> bodydoubles) {
70
71	chuckv	1374	int numpoints = bodydoubles.size();
72	gezelter	1879
73	chuckv	1374	Triangles_.clear();
74	chuckv	1242
75	chuckv	1293	vertexT vertex, *vertexp;
76			facetT *facet;
77			setT *vertices;
78	chuckv	1374	int curlong, totlong;
79	chuckv	1293
80	gezelter	1879	vector<double> ptArray(numpoints*dim_);
81
82	chuckv	1293	// Copy the positon vector into a points vector for qhull.
83	gezelter	1879	vector<StuntDouble*>::iterator SD;
84	chuckv	1293	int i = 0;
85	gezelter	1879
86	chuckv	1374	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	chuckv	1242
94	gezelter	1411	/* Clean up memory from previous convex hull calculations */
95	chuckv	1293	boolT ismalloc = False;
96	chuckv	1308
97	gezelter	1411	/* compute the hull for our local points (or all the points for single
98			processor versions) */
99	chuckv	1302	if (qh_new_qhull(dim_, numpoints, &ptArray[0], ismalloc,
100	chuckv	1374	const_cast<char *>(options_.c_str()), NULL, stderr)) {
101	gezelter	1411
102	chuckv	1374	sprintf(painCave.errMsg, "ConvexHull: Qhull failed to compute convex hull");
103			painCave.isFatal = 1;
104			simError();
105
106	chuckv	1293	} //qh_new_qhull
107
108
109			#ifdef IS_MPI
110	chuckv	1374	//If we are doing the mpi version, set up some vectors for data communication
111	chuckv	1242
112	gezelter	1969	int nproc;
113			int myrank;
114
115			MPI_Comm_size( MPI_COMM_WORLD, &nproc);
116			MPI_Comm_rank( MPI_COMM_WORLD, &myrank);
117
118	chuckv	1374	int localHullSites = 0;
119	chuckv	1293
120	gezelter	1879	vector<int> hullSitesOnProc(nproc, 0);
121			vector<int> coordsOnProc(nproc, 0);
122			vector<int> displacements(nproc, 0);
123			vector<int> vectorDisplacements(nproc, 0);
124	gezelter	1384
125	gezelter	1879	vector<double> coords;
126			vector<double> vels;
127			vector<int> indexMap;
128			vector<double> masses;
129	chuckv	1374
130			FORALLvertices{
131			localHullSites++;
132	chuckv	1242
133	chuckv	1374	int idx = qh_pointid(vertex->point);
134	gezelter	1378
135			indexMap.push_back(idx);
136
137	chuckv	1374	coords.push_back(ptArray[dim_ * idx]);
138			coords.push_back(ptArray[dim_ * idx + 1]);
139			coords.push_back(ptArray[dim_ * idx + 2]);
140	chuckv	1293
141	chuckv	1374	StuntDouble* sd = bodydoubles[idx];
142	chuckv	1188
143	chuckv	1374	Vector3d vel = sd->getVel();
144			vels.push_back(vel.x());
145			vels.push_back(vel.y());
146			vels.push_back(vel.z());
147	chuckv	1188
148	chuckv	1374	masses.push_back(sd->getMass());
149			}
150	chuckv	1188
151	gezelter	1969	MPI_Allgather(&localHullSites, 1, MPI_INT, &hullSitesOnProc[0],
152			1, MPI_INT, MPI_COMM_WORLD);
153	chuckv	1307
154	chuckv	1374	int globalHullSites = 0;
155	gezelter	1376	for (int iproc = 0; iproc < nproc; iproc++){
156	chuckv	1374	globalHullSites += hullSitesOnProc[iproc];
157			coordsOnProc[iproc] = dim_ * hullSitesOnProc[iproc];
158	chuckv	1302	}
159	chuckv	1293
160	chuckv	1374	displacements[0] = 0;
161			vectorDisplacements[0] = 0;
162	chuckv	1316
163	gezelter	1376	for (int iproc = 1; iproc < nproc; iproc++){
164	chuckv	1374	displacements[iproc] = displacements[iproc-1] + hullSitesOnProc[iproc-1];
165			vectorDisplacements[iproc] = vectorDisplacements[iproc-1] + coordsOnProc[iproc-1];
166	chuckv	1293	}
167
168	gezelter	1879	vector<double> globalCoords(dim_ * globalHullSites);
169			vector<double> globalVels(dim_ * globalHullSites);
170			vector<double> globalMasses(globalHullSites);
171	gezelter	1377
172	chuckv	1374	int count = coordsOnProc[myrank];
173	chuckv	1365
174	gezelter	1969	MPI_Allgatherv(&coords[0], count, MPI_DOUBLE, &globalCoords[0],
175			&coordsOnProc[0], &vectorDisplacements[0],
176			MPI_DOUBLE, MPI_COMM_WORLD);
177
178			MPI_Allgatherv(&vels[0], count, MPI_DOUBLE, &globalVels[0],
179			&coordsOnProc[0], &vectorDisplacements[0],
180			MPI_DOUBLE, MPI_COMM_WORLD);
181
182			MPI_Allgatherv(&masses[0], localHullSites, MPI_DOUBLE,
183			&globalMasses[0], &hullSitesOnProc[0],
184			&displacements[0], MPI_DOUBLE, MPI_COMM_WORLD);
185
186	chuckv	1293	// Free previous hull
187	chuckv	1242	qh_freeqhull(!qh_ALL);
188			qh_memfreeshort(&curlong, &totlong);
189	gezelter	1411	if (curlong \|\| totlong) {
190			sprintf(painCave.errMsg, "ConvexHull: qhull internal warning:\n"
191			"\tdid not free %d bytes of long memory (%d pieces)",
192			totlong, curlong);
193			painCave.isFatal = 1;
194			simError();
195			}
196	chuckv	1374
197			if (qh_new_qhull(dim_, globalHullSites, &globalCoords[0], ismalloc,
198			const_cast<char *>(options_.c_str()), NULL, stderr)){
199
200	gezelter	1879	sprintf(painCave.errMsg,
201			"ConvexHull: Qhull failed to compute global convex hull");
202	chuckv	1374	painCave.isFatal = 1;
203			simError();
204
205	chuckv	1293	} //qh_new_qhull
206
207			#endif
208	gezelter	1879	// commented out below, so comment out here also.
209			// intPoint = qh interior_point;
210			// RealType calcvol = 0.0;
211
212			qh_triangulate ();
213	gezelter	1782
214	chuckv	1374	FORALLfacets {
215			Triangle face;
216	chuckv	1404	//Qhull sets the unit normal in facet->normal
217	chuckv	1374	Vector3d V3dNormal(facet->normal[0], facet->normal[1], facet->normal[2]);
218	chuckv	1404	face.setUnitNormal(V3dNormal);
219	chuckv	1371
220	chuckv	1374	RealType faceArea = qh_facetarea(facet);
221			face.setArea(faceArea);
222
223			vertices = qh_facet3vertex(facet);
224	chuckv	1293
225	chuckv	1374	coordT *center = qh_getcenter(vertices);
226			Vector3d V3dCentroid(center[0], center[1], center[2]);
227			face.setCentroid(V3dCentroid);
228	chuckv	1304
229	chuckv	1374	Vector3d faceVel = V3Zero;
230			Vector3d p[3];
231			RealType faceMass = 0.0;
232	gezelter	1377
233	chuckv	1374	int ver = 0;
234	chuckv	1293
235	chuckv	1374	FOREACHvertex_(vertices){
236			int id = qh_pointid(vertex->point);
237			p[ver][0] = vertex->point[0];
238			p[ver][1] = vertex->point[1];
239			p[ver][2] = vertex->point[2];
240			Vector3d vel;
241			RealType mass;
242	chuckv	1293
243	chuckv	1302	#ifdef IS_MPI
244	chuckv	1374	vel = Vector3d(globalVels[dim_ * id],
245			globalVels[dim_ * id + 1],
246			globalVels[dim_ * id + 2]);
247			mass = globalMasses[id];
248
249	gezelter	1377	// localID will be between 0 and hullSitesOnProc[myrank] if we
250			// own this guy.
251
252	chuckv	1374	int localID = id - displacements[myrank];
253	gezelter	1377
254	chuckv	1410
255			if (localID >= 0 && localID < hullSitesOnProc[myrank]){
256	gezelter	1378	face.addVertexSD(bodydoubles[indexMap[localID]]);
257	chuckv	1410	}else{
258			face.addVertexSD(NULL);
259			}
260	chuckv	1307	#else
261	chuckv	1374	vel = bodydoubles[id]->getVel();
262			mass = bodydoubles[id]->getMass();
263			face.addVertexSD(bodydoubles[id]);
264	gezelter	1411	#endif
265	chuckv	1374	faceVel = faceVel + vel;
266			faceMass = faceMass + mass;
267			ver++;
268			} //Foreachvertex
269	chuckv	1302
270	chuckv	1374	face.addVertices(p[0], p[1], p[2]);
271			face.setFacetMass(faceMass);
272	gezelter	1782	face.setFacetVelocity(faceVel / RealType(3.0));
273	chuckv	1404	/*
274			RealType comparea = face.computeArea();
275			realT calcarea = qh_facetarea (facet);
276			Vector3d V3dCompNorm = -face.computeUnitNormal();
277			RealType thisOffset = ((0.0-p[0][0])V3dCompNorm[0] + (0.0-p[0][1])V3dCompNorm[1] + (0.0-p[0][2])*V3dCompNorm[2]);
278			RealType dist = facet->offset + intPoint[0]V3dNormal[0] + intPoint[1]V3dNormal[1] + intPoint[2]*V3dNormal[2];
279	gezelter	1879	cout << "facet offset and computed offset: " << facet->offset << " " << thisOffset << endl;
280	chuckv	1404	calcvol += -dist*comparea/qh hull_dim;
281			*/
282	chuckv	1374	Triangles_.push_back(face);
283			qh_settempfree(&vertices);
284
285			} //FORALLfacets
286
287			qh_getarea(qh facet_list);
288			volume_ = qh totvol;
289			area_ = qh totarea;
290	gezelter	1879
291	chuckv	1374	qh_freeqhull(!qh_ALL);
292			qh_memfreeshort(&curlong, &totlong);
293	gezelter	1411	if (curlong \|\| totlong) {
294			sprintf(painCave.errMsg, "ConvexHull: qhull internal warning:\n"
295			"\tdid not free %d bytes of long memory (%d pieces)",
296			totlong, curlong);
297			painCave.isFatal = 1;
298			simError();
299			}
300	chuckv	1097	}
301
302	gezelter	1879	void ConvexHull::printHull(const string& geomFileName) {
303
304	gezelter	1384	#ifdef IS_MPI
305			if (worldRank == 0) {
306			#endif
307	gezelter	1879	FILE *newGeomFile;
308
309			//create new .md file based on old .md file
310			newGeomFile = fopen(geomFileName.c_str(), "w");
311			qh_findgood_all(qh facet_list);
312			for (int i = 0; i < qh_PRINTEND; i++)
313			qh_printfacets(newGeomFile, qh PRINTout[i], qh facet_list, NULL, !qh_ALL);
314
315			fclose(newGeomFile);
316	gezelter	1384	#ifdef IS_MPI
317			}
318			#endif
319	chuckv	1097	}
320	chuckv	1242	#endif //QHULL