Octree *
new_Octant(Octree *parentp, Octree **childpp, int bitv, int level)
{
register Octree *childp;
fastf_t delta = modl_radius / pow_Of_2( level );
register float *origin = parentp->o_points->c_point;
/* Create child node, filling in parent's pointer. */
if ( ! NewOctree( *childpp ) )
{
Malloc_Bomb(sizeof(Octree));
fatal_error = TRUE;
return OCTREE_NULL;
}
/* Fill in fields in child node. */
childp = *childpp;
childp->o_bitv = bitv;
childp->o_temp = ABSOLUTE_ZERO; /* Unclaimed by temperature. */
childp->o_triep = TRIE_NULL; /* Unclaimed by region. */
childp->o_sibling = OCTREE_NULL; /* End of sibling chain. */
childp->o_child = OCTREE_NULL; /* No children yet. */
/* Create list node for origin of leaf octant. */
if ( ! NewPoint( childp->o_points ) )
{
Malloc_Bomb(sizeof(PtList));
fatal_error = TRUE;
return OCTREE_NULL;
}
childp->o_points->c_next = PTLIST_NULL; /* End of pt. chain. */
/* Compute origin relative to parent, based on bit vector. */
if ( bitv & 1<<X )
childp->o_points->c_point[X] = origin[X] + delta;
else
childp->o_points->c_point[X] = origin[X] - delta;
if ( bitv & 1<<Y )
childp->o_points->c_point[Y] = origin[Y] + delta;
else
childp->o_points->c_point[Y] = origin[Y] - delta;
if ( bitv & 1<<Z )
childp->o_points->c_point[Z] = origin[Z] + delta;
else
childp->o_points->c_point[Z] = origin[Z] - delta;
return childp;
}
int main()
{
lng i, j, k, cpt=0,NmbVer, NmbTri, NmbItm, MshIdx, ver, dim, ref, idx, (*TriTab)[3], buf[ BufSiz ], inc=50;
long long OctIdx;
double crd1[3] = {0,0,0}, crd2[3] = {0.002928, 0.079575, 0.006978}, crd3[3] = {-.0054, .1488, -.0067};
double dis, (*VerTab)[3], MinCrd[3], MaxCrd[3], IncCrd[3], AvgDis=0;
time_t t, t2, MinTim = INT_MAX, MaxTim = 0;
/*---------------------------------------*/
/* Open, allocate and read the mesh file */
/*---------------------------------------*/
t = clock();
puts("\nRead mesh");
if(!(MshIdx = GmfOpenMesh("test.meshb", GmfRead, &ver, &dim)))
{
puts("Cannot open test.meshb.");
return(1);
}
NmbVer = GmfStatKwd(MshIdx, GmfVertices);
NmbTri = GmfStatKwd(MshIdx, GmfTriangles);
printf("vertices = %d, triangles = %d, dimension = %d, version = %d\n", NmbVer, NmbTri, dim, ver);
if( !NmbVer || (dim != 3) )
{
puts("Incompatible mesh.");
return(1);
}
VerTab = malloc((NmbVer+1) * 3 * sizeof(double));
GmfGotoKwd(MshIdx, GmfVertices);
GmfGetBlock(MshIdx, GmfVertices, GmfDouble, &VerTab[1][0], &VerTab[2][0], GmfDouble, &VerTab[1][1], &VerTab[2][1], \
GmfDouble, &VerTab[1][2], &VerTab[2][2], GmfLong, &ref, &ref);
if(NmbTri)
{
TriTab = malloc((NmbTri+1) * 3 * sizeof(lng));
GmfGotoKwd(MshIdx, GmfTriangles);
GmfGetBlock(MshIdx, GmfTriangles, GmfLong, &TriTab[1][0], &TriTab[2][0], GmfLong, &TriTab[1][1], &TriTab[2][1], \
GmfLong, &TriTab[1][2], &TriTab[2][2], GmfLong, &ref, &ref);
}
GmfCloseMesh(MshIdx);
printf(" %g s\n", (double)(clock() - t) / CLOCKS_PER_SEC);
/*---------------------------------------------------------*/
/* Build an octree from this mesh and perform some queries */
/*---------------------------------------------------------*/
puts("\nBuild the octree : ");
t = clock();
OctIdx = NewOctree(NmbVer, VerTab[1], VerTab[2], NmbTri, TriTab[1], TriTab[2]);
printf(" %g s\n", (double)(clock() - t) / CLOCKS_PER_SEC);
for(i=0;i<3;i++)
{
MinCrd[i] = crd2[i] - .0001;
MaxCrd[i] = crd2[i] + .0001;
}
puts("\nSearch for vertices in a bounding box :");
NmbItm = GetBoundingBox(OctIdx, TypVer, BufSiz, buf, MinCrd, MaxCrd);
for(i=0;i<NmbItm;i++)
printf(" vertex : %d\n", buf[i]);
puts("\nSearch for the closest vertex from a given point :");
idx = GetNearest(OctIdx, TypVer, crd1, &dis, 0.);
printf(" closest vertex = %d, distance = %g\n", idx, dis);
if(NmbTri)
{
puts("\nSearch for triangles in a bounding box :");
NmbItm = GetBoundingBox(OctIdx, TypTri, BufSiz, buf, MinCrd, MaxCrd);
for(i=0;i<NmbItm;i++)
printf(" triangle : %d\n", buf[i]);
puts("\nSearch for the closest triangle from a given point :");
idx = GetNearest(OctIdx, TypTri, crd1, &dis, 0.);
printf(" closest triangle = %d, distance = %g\n", idx, dis);
for(i=1;i<=NmbVer;i++)
for(j=0;j<3;j++)
if(VerTab[i][j] < MinCrd[j])
MinCrd[j] = VerTab[i][j];
else if(VerTab[i][j] > MaxCrd[j])
MaxCrd[j] = VerTab[i][j];
for(i=0;i<3;i++)
IncCrd[i] = (MaxCrd[i] - MinCrd[i]) / inc;
crd1[0] = MinCrd[0];
t = clock();
for(i=0;i<inc;i++)
{
crd1[1] = MinCrd[1];
for(j=0;j<inc;j++)
{
crd1[2] = MinCrd[2];
for(k=0;k<inc;k++)
{
t2 = clock();
idx = GetNearest(OctIdx, TypTri, crd1, &dis, .005);
t2 = clock() - t2;
MinTim = MIN(MinTim, t2);
MaxTim = MAX(MaxTim, t2);
AvgDis += dis;
crd1[2] += IncCrd[2];
}
crd1[1] += IncCrd[1];
}
crd1[0] += IncCrd[0];
}
printf("nb samples = %d, mean dist = %g, total time = %g s, min time = %g s, max time = %g s\n", \
inc*inc*inc, AvgDis / (inc*inc*inc), (double)(clock() - t) / CLOCKS_PER_SEC, \
(double)MinTim / CLOCKS_PER_SEC, (double)MaxTim / CLOCKS_PER_SEC);
}
/*------------------*/
/* Cleanup memories */
/*------------------*/
printf("\nFree octree %lld\n", OctIdx);
printf(" memory used = %zd bytes\n", FreeOctree(OctIdx));
free(VerTab);
if(NmbTri)
free(TriTab);
return(0);
}