class TGeoVoxelFinder: public TObject

 Default constructor

 Default constructor

copy constructor

assignment operator

 Destructor
   printf("deleting finder of %s\n", fVolume->GetName());

 build the array of bounding boxes of the nodes inside

 Initializes check list.

 convert a point from the local reference system of node id to reference
 system of mother volume

 Computes squared distance from POINT to the voxel(s) containing node INODE. Returns 0
 if POINT inside voxel(s).

--- Compute voxelization efficiency.

 create the list of nodes for which the bboxes overlap with inode's bbox

 Getindices for current slices on x, y, z

--- Return the list of extra candidates in a given X slice compared to
 another (left or right)

--- Return the list of extra candidates in a given Y slice compared to
 another (left or right)

--- Return the list of extra candidates in a given Z slice compared to
 another (left or right)

 Get extra candidates that are not contained in current check list
   UChar_t *bits = gGeoManager->GetBits();

 Get extra candidates that are contained in array1 but not in current check list
   UChar_t *bits = gGeoManager->GetBits();

 Get extra candidates that are contained in array1 but not in current check list
   UChar_t *bits = gGeoManager->GetBits();

 Returns list of new candidates in next voxel. If NULL, nowhere to
go next.

 get the list in the next voxel crossed by a ray

 get the list of daughter indices for which point is inside their bbox

 get the list of candidates in voxel (i,j,k) - no check

 get the list of new candidates for the next voxel crossed by current ray
   printf("### GetNextVoxel\n");

 return the list of nodes corresponding to one array of bits

 return the list of nodes corresponding to one array of bits

 make union of older bits with new array
   printf("Union - one slice\n");

 make union of older bits with new array
   printf("Union - two slices\n");

 make union of older bits with new array
   printf("Union - three slices\n");
   printf("n1=%i n2=%i n3=%i\n", n1,n2,n3);

 return the list of nodes corresponding to the intersection of two arrays of bits

 return the list of nodes corresponding to the intersection of two arrays of bits

 return the list of nodes corresponding to the intersection of three arrays of bits

 return the list of nodes corresponding to the intersection of three arrays of bits

 order bounding boxes along x, y, z

 Print the voxels.

 print the voxel containing point

 Voxelize attached volume according to option