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

Merge branch 'master' of https://bitbucket.org/cosmicvoids/void_identification

Browse source
This commit is contained in:
Guilhem Lavaux 2012-11-30 07:36:00 -05:00
commit 5783109225
14 changed files with 455 additions and 247 deletions
Download patch file Download diff file Expand all files Collapse all files

3
c_tools/mock/generateFromCatalog.cpp
View file

@ -334,7 +334,8 @@ void generateSurfaceMask(generateFromCatalog_info& args ,
// TEST - insert mock galaxies along spheres of survey redshift boundaries
fp = fopen("mock_sphere.txt", "w");
for (int p = 0; p < full_mask_list.size(); p++) {
for (int p = 0; p < 0; p++) {
//for (int p = 0; p < full_mask_list.size(); p++) {
vec3 v = mask.pix2vec(full_mask_list[p]);
Position p;

6
c_tools/mock/generateMock.cpp
View file

@ -23,10 +23,6 @@ using boost::format;
#define LIGHT_SPEED 299792.458
typedef boost::function2<void, SimuData*, double*> MetricFunctor;
static double cubic(double a)
{
return a*a*a;
}
@ -217,8 +213,6 @@ void generateOutput(SimuData *data, int axis,
f.beginCheckpoint();
for (uint32_t i = 0; i < data->NumPart; i++)
{
//printf("HELLO %d %d\n", i, data->Id[i]);
//f.writeReal32(data->Id[i]);
f.writeInt64(uniqueID[i]);
}
f.endCheckpoint();

25
c_tools/stacking/pruneVoids.cpp
View file

@ -40,6 +40,7 @@ typedef struct voidStruct {
float vol, coreDens, zoneVol, densCon, voidProb, radius;
int voidID, numPart, numZones, coreParticle, zoneNumPart;
float maxRadius, nearestMock, centralDen, redshift, redshiftInMpc;
float nearestEdge;
float center[3], barycenter[3];
int accepted;
} VOID;
@ -349,6 +350,7 @@ int main(int argc, char **argv) {
voids[iVoid].centralDen = centralDen / (4./3. * M_PI * pow(centralRad, 3./2.));
// compute maximum extent
/*
if (args_info.isObservation_flag) {
maxDist = 0.;
for (p = 0; p < voids[iVoid].numPart; p++) {
@ -364,6 +366,7 @@ int main(int argc, char **argv) {
}
voids[iVoid].maxRadius = sqrt(maxDist)/2.;
} else {
*/
maxDist = 0.;
for (p = 0; p < voids[iVoid].numPart; p++) {
@ -379,7 +382,7 @@ int main(int argc, char **argv) {
if (dist2 > maxDist) maxDist = dist2;
}
voids[iVoid].maxRadius = sqrt(maxDist);
}
// }
if (args_info.isObservation_flag) {
// compute distance from center to nearest mock
@ -405,8 +408,9 @@ int main(int argc, char **argv) {
pow(voids[iVoid].barycenter[2] - boxLen[2]/2.,2));
voids[iVoid].redshiftInMpc = voids[iVoid].redshiftInMpc;
redshift = voids[iVoid].redshiftInMpc;
nearestEdge = fmin(fabs(redshift-args_info.zMin_arg*LIGHT_SPEED/100.),
fabs(redshift-args_info.zMax_arg*LIGHT_SPEED/100.));
nearestEdge = fabs(redshift-args_info.zMax_arg*LIGHT_SPEED/100.);
//nearestEdge = fmin(fabs(redshift-args_info.zMin_arg*LIGHT_SPEED/100.),
// fabs(redshift-args_info.zMax_arg*LIGHT_SPEED/100.));
voids[iVoid].redshift = voids[iVoid].redshiftInMpc/LIGHT_SPEED*100.;
} else {
@ -436,9 +440,7 @@ int main(int argc, char **argv) {
}
}
if (nearestEdge < voids[iVoid].nearestMock) {
voids[iVoid].nearestMock = nearestEdge;
}
voids[iVoid].nearestEdge = nearestEdge;
} // iVoid
printf(" Picking winners and losers...\n");
@ -448,7 +450,7 @@ int main(int argc, char **argv) {
for (iVoid = 0; iVoid < numVoids; iVoid++) {
if (voids[iVoid].densCon < 1.5) {
//voids[iVoid].accepted = 0;
// voids[iVoid].accepted = -4;
}
if (voids[iVoid].centralDen > args_info.maxCentralDen_arg) {
@ -474,6 +476,15 @@ int main(int argc, char **argv) {
voids[iVoid].accepted = -2;
}
// *alwas* clean out near edges since there are no mocks there
if (tolerance*voids[iVoid].maxRadius > voids[iVoid].nearestEdge) {
voids[iVoid].accepted = -3;
}
// assume the lower z-boundary is "soft" in observations
if (voids[iVoid].redshift < args_info.zMin_arg) {
voids[iVoid].accepted = -3;
}
}
numKept = 0;