From 9d06382740843b4412606a3614e8c74a9ebf2c9a Mon Sep 17 00:00:00 2001
From: sjplimp <sjplimp@f3b2605a-c512-4ea7-a41b-209d697bcdaa>
Date: Mon, 18 Nov 2013 14:37:00 +0000
Subject: [PATCH] git-svn-id: svn://svn.icms.temple.edu/lammps-ro/trunk@11019
f3b2605a-c512-4ea7-a41b-209d697bcdaa
---
src/VORONOI/compute_voronoi_atom.cpp | 2 ++
1 file changed, 2 insertions(+)
diff --git a/src/VORONOI/compute_voronoi_atom.cpp b/src/VORONOI/compute_voronoi_atom.cpp
index d551fbee68..9c122ced16 100644
--- a/src/VORONOI/compute_voronoi_atom.cpp
+++ b/src/VORONOI/compute_voronoi_atom.cpp
@@ -294,6 +294,7 @@ void ComputeVoronoi::processCell(voronoicell_neighbor &c, int i)
// count only faces above area threshold
c.face_areas(narea);
have_narea = true;
+ voro[i][1] = 0.0;
for (j=0; j<narea.size(); ++j)
if (narea[j] > fthresh) voro[i][1] += 1.0;
} else {
@@ -306,6 +307,7 @@ void ComputeVoronoi::processCell(voronoicell_neighbor &c, int i)
voro[i][2] = c.surface_area();
} else if (surface == VOROSURF_GROUP) {
if (!have_narea) c.face_areas(narea);
+ voro[i][2] = 0.0;
// loop over all faces (neighbors) and check if they are in the surface group
for (j=0; j<voro[i][1]; ++j)
if (mask[neigh[j]] & sgroupbit) voro[i][2] += narea[j];
--
GitLab