36 int main(
int argc,
char** argv )
39 int fail = MPI_Init( &argc, &argv );
43 argv[0] = argv[argc - argc];
47 po.
addOpt<
int >(
"ints,i",
"Number of intervals on each side of scd mesh", &
ints );
48 po.
addOpt<
int >(
"leaf,l",
"Maximum number of elements per leaf", &
leaf );
50 po.
addOpt<
int >(
"npoints,n",
"Number of query points", &
npoints );
58 fail = MPI_Finalize();
76 std::ostringstream opts;
77 opts <<
"MAX_DEPTH=" <<
max_depth <<
";MAX_PER_LEAF=" <<
leaf;
104 std::ostringstream opts;
105 opts <<
"MAX_DEPTH=" <<
max_depth <<
";MAX_PER_LEAF=" <<
leaf;
122 CartVect box_del, test_pt, test_res;
124 box_del =
box.bMax -
box.bMin;
126 double denom = 1.0 / (double)RAND_MAX;
130 for(
int i = 0; i <
npoints; i++ )
133 double rx = (double)rand() * denom, ry = (double)rand() * denom, rz = (double)rand() * denom;
134 test_pt =
box.bMin +
CartVect( rx * box_del[0], ry * box_del[1], rz * box_del[2] );
143 std::cout <<
"Traversal stats:" << std::endl;
148 std::cout <<
"Tree information: " << std::endl;
158 if(
dim > 1 ) high[1] = n - 1;
159 if(
dim > 2 ) high[2] = n - 1;