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

pruneVoids now (rather clumsily) loads tree information; rejects voids that are not leaf nodes

Browse source
This commit is contained in:
P.M. Sutter 2013-03-28 20:37:28 -05:00
parent afb562d419
commit 2bc3b3ef27
1 changed files with 40 additions and 1 deletions
Download patch file Download diff file Expand all files Collapse all files

41
c_tools/stacking/pruneVoids.cpp
View file

@ -40,6 +40,9 @@
#include <netcdfcpp.h> #include <netcdfcpp.h>
#include "pruneVoids_conf.h" #include "pruneVoids_conf.h"
#include <vector> #include <vector>
#include "assert.h"
#include "voidTree.hpp"
#include "loadZobov.hpp"
#define LIGHT_SPEED 299792.458 #define LIGHT_SPEED 299792.458
#define MPC2Z 100./LIGHT_SPEED #define MPC2Z 100./LIGHT_SPEED
@ -70,6 +73,7 @@ typedef struct voidStruct {
float center[3], barycenter[3]; float center[3], barycenter[3];
int accepted; int accepted;
int voidType; int voidType;
int parentID, numChildren;
gsl_vector *eval; gsl_vector *eval;
gsl_matrix *evec; gsl_matrix *evec;
} VOID; } VOID;
@ -306,6 +310,27 @@ int main(int argc, char **argv) {
fclose(fp); fclose(fp);
free(temp); free(temp);
// load voids *again* using Guilhem's code so we can get tree
printf(" Re-loading voids and building tree..\n");
ZobovRep zobovCat;
if (!loadZobov(args.voidDesc_arg, args.zone2Part_arg,
args.void2Zone_arg,
0, zobovCat)) {
printf("Error loading catalog!\n");
return -1;
}
VoidTree *tree;
tree = new VoidTree(zobovCat);
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
for (iVoid = 0; iVoid < numVoids; iVoid++) {
voidID = voids[iVoid].voidID;
voids[iVoid].parentID = tree->getParent(voidID);
voids[iVoid].numChildren = tree->getChildren(voidID).size();
}
// check boundaries // check boundaries
printf(" Computing void properties...\n"); printf(" Computing void properties...\n");
@ -541,6 +566,7 @@ int main(int argc, char **argv) {
int numCentral = 0; int numCentral = 0;
int numEdge = 0; int numEdge = 0;
int numNearZ = 0; int numNearZ = 0;
int numAreParents = 0;
int numTooSmall = 0; int numTooSmall = 0;
printf(" Picking winners and losers...\n"); printf(" Picking winners and losers...\n");
@ -607,7 +633,20 @@ int main(int argc, char **argv) {
} }
} }
voids.resize(iGood); voids.resize(iGood);
printf(" 4th filter: rejected %d too close to low redshift boundaries\n", numNearZ); printf(" 4th filter: rejected %d below redshift boundaries\n", numNearZ);
numAreParents = 0;
iGood = 0;
for (iVoid = 0; iVoid < voids.size(); iVoid++) {
if (voids[iVoid].numChildren > 0) {
numAreParents++;
} else {
voids[iGood++] = voids[iVoid];
}
}
voids.resize(iGood);
printf(" 5th filter: rejected %d that are not leaf nodes\n", numAreParents);
for (iVoid = 0; iVoid < voids.size(); iVoid++) { for (iVoid = 0; iVoid < voids.size(); iVoid++) {
if (voids[iVoid].centralDen > args.maxCentralDen_arg) { if (voids[iVoid].centralDen > args.maxCentralDen_arg) {