guilhem_lavaux/vide_public
0
0
Fork 0
mirror of https://bitbucket.org/cosmicvoids/vide_public.git synced 2025-07-05 07:41:11 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions

better pruning of bad voids

Browse source
This commit is contained in:
P.M. Sutter 2013-04-11 09:50:32 -05:00
parent 765b39ac63
commit 96a96f9680
1 changed files with 33 additions and 21 deletions
Download patch file Download diff file Expand all files Collapse all files

18
c_tools/stacking/pruneVoids.cpp
View file

@ -190,6 +190,13 @@ int main(int argc, char **argv) {
ranges[2][0] = f_info.get_att("range_z_min")->as_double(0); ranges[2][0] = f_info.get_att("range_z_min")->as_double(0);
ranges[2][1] = f_info.get_att("range_z_max")->as_double(0); ranges[2][1] = f_info.get_att("range_z_max")->as_double(0);
printf(" Range xmin %e\n", ranges[0][0]);
printf(" Range xmax %e\n", ranges[0][1]);
printf(" Range ymin %e\n", ranges[1][0]);
printf(" Range ymax %e\n", ranges[1][1]);
printf(" Range zmin %e\n", ranges[2][0]);
printf(" Range zmax %e\n", ranges[2][1]);
boxLen[0] = ranges[0][1] - ranges[0][0]; boxLen[0] = ranges[0][1] - ranges[0][0];
boxLen[1] = ranges[1][1] - ranges[1][0]; boxLen[1] = ranges[1][1] - ranges[1][0];
boxLen[2] = ranges[2][1] - ranges[2][0]; boxLen[2] = ranges[2][1] - ranges[2][0];
@ -271,6 +278,8 @@ int main(int argc, char **argv) {
voids[i-1].isLeaf = true; voids[i-1].isLeaf = true;
voids[i-1].hasHighCentralDen = false; voids[i-1].hasHighCentralDen = false;
voids[i-1].numChildren = 0;
voids[i-1].parentID = -1;
voids[i-1].eval = gsl_vector_alloc(3); voids[i-1].eval = gsl_vector_alloc(3);
voids[i-1].evec = gsl_matrix_alloc(3,3); voids[i-1].evec = gsl_matrix_alloc(3,3);
@ -329,6 +338,7 @@ int main(int argc, char **argv) {
free(temp); free(temp);
// load voids *again* using Guilhem's code so we can get tree // load voids *again* using Guilhem's code so we can get tree
if (!args.isObservation_flag) {
printf(" Re-loading voids and building tree..\n"); printf(" Re-loading voids and building tree..\n");
ZobovRep zobovCat; ZobovRep zobovCat;
if (!loadZobov(args.voidDesc_arg, args.zone2Part_arg, if (!loadZobov(args.voidDesc_arg, args.zone2Part_arg,
@ -340,7 +350,6 @@ int main(int argc, char **argv) {
VoidTree *tree; VoidTree *tree;
tree = new VoidTree(zobovCat); tree = new VoidTree(zobovCat);
zobovCat.allZones.erase(zobovCat.allZones.begin(), zobovCat.allZones.end()); zobovCat.allZones.erase(zobovCat.allZones.begin(), zobovCat.allZones.end());
//zobovCat.allZones.erase(zobovCat.allVoids.begin(), zobovCat.allVoids.end());
// copy tree information to our own data structures // copy tree information to our own data structures
for (iVoid = 0; iVoid < numVoids; iVoid++) { for (iVoid = 0; iVoid < numVoids; iVoid++) {
@ -348,6 +357,7 @@ int main(int argc, char **argv) {
voids[iVoid].parentID = tree->getParent(voidID); voids[iVoid].parentID = tree->getParent(voidID);
voids[iVoid].numChildren = tree->getChildren(voidID).size(); voids[iVoid].numChildren = tree->getChildren(voidID).size();
} }
} // end re-load
// check boundaries // check boundaries
printf(" Computing void properties...\n"); printf(" Computing void properties...\n");
@ -606,7 +616,8 @@ int main(int argc, char **argv) {
// toss out voids that are obviously wrong // toss out voids that are obviously wrong
int iGood = 0; int iGood = 0;
for (iVoid = 0; iVoid < voids.size(); iVoid++) { for (iVoid = 0; iVoid < voids.size(); iVoid++) {
if (voids[iVoid].densCon > 1.e4) { if (voids[iVoid].densCon > 1.e4 || isnan(voids[iVoid].vol) ||
isinf(voids[iVoid].vol)) {
numWrong++; numWrong++;
} else { } else {
voids[iGood++] = voids[iVoid]; voids[iGood++] = voids[iVoid];
@ -630,7 +641,8 @@ int main(int argc, char **argv) {
iGood = 0; iGood = 0;
for (iVoid = 0; iVoid < voids.size(); iVoid++) { for (iVoid = 0; iVoid < voids.size(); iVoid++) {
// *always* clean out near edges since there are no mocks there // *always* clean out near edges since there are no mocks there
if (tolerance*voids[iVoid].maxRadius > voids[iVoid].nearestEdge) { if (tolerance*voids[iVoid].maxRadius > voids[iVoid].nearestEdge ||
tolerance*voids[iVoid].radius > voids[iVoid].nearestEdge) {
numNearZ++; numNearZ++;
} else { } else {
voids[iGood++] = voids[iVoid]; voids[iGood++] = voids[iVoid];