Logo ROOT  
Reference Guide
TGeoVoxelFinder.h
Go to the documentation of this file.
1// @(#)root/geom:$Id$
2// Author: Andrei Gheata 04/02/02
3
4/*************************************************************************
5 * Copyright (C) 1995-2000, Rene Brun and Fons Rademakers. *
6 * All rights reserved. *
7 * *
8 * For the licensing terms see $ROOTSYS/LICENSE. *
9 * For the list of contributors see $ROOTSYS/README/CREDITS. *
10 *************************************************************************/
11
12#ifndef ROOT_TGeoVoxelFinder
13#define ROOT_TGeoVoxelFinder
14
15#include "TObject.h"
16
17class TGeoVolume;
18struct TGeoStateInfo;
19
21{
22public:
26};
27
28private:
31
32protected:
33 TGeoVolume *fVolume; // volume to which applies
34
35 Int_t fIbx; // number of different boundaries on X axis
36 Int_t fIby; // number of different boundaries on Y axis
37 Int_t fIbz; // number of different boundaries on Z axis
38 Int_t fNboxes; // length of boxes array
39 Int_t fNox; // length of array of X offsets
40 Int_t fNoy; // length of array of Y offsets
41 Int_t fNoz; // length of array of Z offsets
42 Int_t fNex; // length of array of X extra offsets
43 Int_t fNey; // length of array of Y extra offsets
44 Int_t fNez; // length of array of Z extra offsets
45 Int_t fNx; // length of array of X voxels
46 Int_t fNy; // length of array of Y voxels
47 Int_t fNz; // length of array of Z voxels
48 Int_t fPriority[3]; // priority for each axis
49 Double_t *fBoxes; //[fNboxes] list of bounding boxes
50 Double_t *fXb; //[fIbx] ordered array of X box boundaries
51 Double_t *fYb; //[fIby] ordered array of Y box boundaries
52 Double_t *fZb; //[fIbz] ordered array of Z box boundaries
53 Int_t *fOBx; //[fNox] offsets of daughter indices for slices X
54 Int_t *fOBy; //[fNoy] offsets of daughter indices for slices Y
55 Int_t *fOBz; //[fNoz] offsets of daughter indices for slices Z
56 Int_t *fOEx; //[fNox] offsets of extra indices for slices X
57 Int_t *fOEy; //[fNoy] offsets of extra indices for slices Y
58 Int_t *fOEz; //[fNoz] offsets of extra indices for slices Z
59 Int_t *fExtraX; //[fNex] indices of extra daughters in X slices
60 Int_t *fExtraY; //[fNey] indices of extra daughters in Y slices
61 Int_t *fExtraZ; //[fNez] indices of extra daughters in Z slices
62 Int_t *fNsliceX; //[fNox] number of candidates in X slice
63 Int_t *fNsliceY; //[fNoy] number of candidates in Y slice
64 Int_t *fNsliceZ; //[fNoz] number of candidates in Z slice
65 UChar_t *fIndcX; //[fNx] array of slices bits on X
66 UChar_t *fIndcY; //[fNy] array of slices bits on Y
67 UChar_t *fIndcZ; //[fNz] array of slices bits on Z
68
69 void BuildVoxelLimits();
70 Int_t *GetExtraX(Int_t islice, Bool_t left, Int_t &nextra) const;
71 Int_t *GetExtraY(Int_t islice, Bool_t left, Int_t &nextra) const;
72 Int_t *GetExtraZ(Int_t islice, Bool_t left, Int_t &nextra) const;
73 Bool_t GetIndices(const Double_t *point, TGeoStateInfo &td);
74 Int_t GetPriority(Int_t iaxis) const {return fPriority[iaxis];}
76 Int_t *GetValidExtra(Int_t *list, Int_t &ncheck, TGeoStateInfo &td);
77 Int_t *GetValidExtra(Int_t n1, UChar_t *array1, Int_t *list, Int_t &ncheck, TGeoStateInfo &td);
78 Int_t *GetValidExtra(Int_t n1, UChar_t *array1, Int_t n2, UChar_t *array2, Int_t *list, Int_t &ncheck, TGeoStateInfo &td);
80 Bool_t Intersect(Int_t n1, UChar_t *array1, Int_t &nf, Int_t *result);
81 Bool_t Intersect(Int_t n1, UChar_t *array1, Int_t n2, UChar_t *array2,
82 Int_t &nf, Int_t *result);
83 Bool_t Intersect(Int_t n1, UChar_t *array1, Int_t n2, UChar_t *array2,
84 Int_t n3, UChar_t *array3, Int_t &nf, Int_t *result);
86 Bool_t IntersectAndStore(Int_t n1, UChar_t *array1, Int_t n2, UChar_t *array2, TGeoStateInfo &td);
87 Bool_t IntersectAndStore(Int_t n1, UChar_t *array1, Int_t n2, UChar_t *array2,
88 Int_t n3, UChar_t *array3, TGeoStateInfo &td);
89 void SortAll(Option_t *option="");
90 Bool_t Union(Int_t n1, UChar_t *array1, TGeoStateInfo &td);
91 Bool_t Union(Int_t n1, UChar_t *array1, Int_t n2, UChar_t *array2, TGeoStateInfo &td);
92 Bool_t Union(Int_t n1, UChar_t *array1, Int_t n2, UChar_t *array2,
93 Int_t n3, UChar_t *array3, TGeoStateInfo &td);
94public :
97 virtual ~TGeoVoxelFinder();
98 void DaughterToMother(Int_t id, const Double_t *local, Double_t *master) const;
99 virtual Double_t Efficiency();
100 virtual Int_t *GetCheckList(const Double_t *point, Int_t &nelem, TGeoStateInfo &td);
101 Int_t *GetCheckList(Int_t &nelem, TGeoStateInfo &td) const;
102 virtual Int_t *GetNextCandidates(const Double_t *point, Int_t &ncheck, TGeoStateInfo &td);
103 virtual void FindOverlaps(Int_t inode) const;
106 Double_t *GetBoxes() const {return fBoxes;}
107 Bool_t IsSafeVoxel(const Double_t *point, Int_t inode, Double_t minsafe) const;
108 virtual void Print(Option_t *option="") const;
109 void PrintVoxelLimits(const Double_t *point) const;
112 virtual Int_t *GetNextVoxel(const Double_t *point, const Double_t *dir, Int_t &ncheck, TGeoStateInfo &td);
113 virtual void SortCrossedVoxels(const Double_t *point, const Double_t *dir, TGeoStateInfo &td);
114 virtual void Voxelize(Option_t *option="");
115
116 ClassDef(TGeoVoxelFinder, 4) // voxel finder class
117};
118
119#endif
int Int_t
Definition: CPyCppyy.h:43
unsigned char UChar_t
Definition: RtypesCore.h:38
bool Bool_t
Definition: RtypesCore.h:63
double Double_t
Definition: RtypesCore.h:59
const Bool_t kTRUE
Definition: RtypesCore.h:100
const char Option_t
Definition: RtypesCore.h:66
#define ClassDef(name, id)
Definition: Rtypes.h:325
#define BIT(n)
Definition: Rtypes.h:85
TGeoVolume, TGeoVolumeMulti, TGeoVolumeAssembly are the volume classes.
Definition: TGeoVolume.h:49
Finder class handling voxels.
Bool_t IsInvalid() const
TGeoVoxelFinder(const TGeoVoxelFinder &)=delete
Bool_t Union(Int_t n1, UChar_t *array1, TGeoStateInfo &td)
make union of older bits with new array printf("Union - one slice\n");
Int_t GetPriority(Int_t iaxis) const
void SetNeedRebuild(Bool_t flag=kTRUE)
virtual Int_t * GetCheckList(const Double_t *point, Int_t &nelem, TGeoStateInfo &td)
get the list of daughter indices for which point is inside their bbox
virtual Int_t * GetNextVoxel(const Double_t *point, const Double_t *dir, Int_t &ncheck, TGeoStateInfo &td)
get the list of new candidates for the next voxel crossed by current ray printf("### GetNextVoxel\n")...
virtual ~TGeoVoxelFinder()
Destructor.
virtual void Voxelize(Option_t *option="")
Voxelize attached volume according to option If the volume is an assembly, make sure the bbox is comp...
void DaughterToMother(Int_t id, const Double_t *local, Double_t *master) const
convert a point from the local reference system of node id to reference system of mother volume
Bool_t Intersect(Int_t n1, UChar_t *array1, Int_t &nf, Int_t *result)
return the list of nodes corresponding to one array of bits
virtual Int_t * GetNextCandidates(const Double_t *point, Int_t &ncheck, TGeoStateInfo &td)
Returns list of new candidates in next voxel.
Double_t * fBoxes
Bool_t GetIndices(const Double_t *point, TGeoStateInfo &td)
Get indices for current slices on x, y, z.
Double_t * GetBoxes() const
void SortAll(Option_t *option="")
order bounding boxes along x, y, z
TGeoVoxelFinder & operator=(const TGeoVoxelFinder &)=delete
Bool_t IsSafeVoxel(const Double_t *point, Int_t inode, Double_t minsafe) const
Computes squared distance from POINT to the voxel(s) containing node INODE.
Int_t * GetExtraY(Int_t islice, Bool_t left, Int_t &nextra) const
Return the list of extra candidates in a given Y slice compared to another (left or right)
void BuildVoxelLimits()
build the array of bounding boxes of the nodes inside
Int_t * GetVoxelCandidates(Int_t i, Int_t j, Int_t k, Int_t &ncheck, TGeoStateInfo &td)
get the list of candidates in voxel (i,j,k) - no check
void SetInvalid(Bool_t flag=kTRUE)
virtual void FindOverlaps(Int_t inode) const
create the list of nodes for which the bboxes overlap with inode's bbox
void PrintVoxelLimits(const Double_t *point) const
print the voxel containing point
Bool_t NeedRebuild() const
Int_t GetNcandidates(TGeoStateInfo &td) const
virtual Double_t Efficiency()
Compute voxelization efficiency.
virtual void Print(Option_t *option="") const
Print the voxels.
virtual void SortCrossedVoxels(const Double_t *point, const Double_t *dir, TGeoStateInfo &td)
get the list in the next voxel crossed by a ray
TGeoVolume * fVolume
Int_t * GetExtraZ(Int_t islice, Bool_t left, Int_t &nextra) const
Return the list of extra candidates in a given Z slice compared to another (left or right)
Int_t * GetExtraX(Int_t islice, Bool_t left, Int_t &nextra) const
Return the list of extra candidates in a given X slice compared to another (left or right)
Int_t * GetValidExtra(Int_t *list, Int_t &ncheck, TGeoStateInfo &td)
Get extra candidates that are not contained in current check list.
Bool_t IntersectAndStore(Int_t n1, UChar_t *array1, TGeoStateInfo &td)
return the list of nodes corresponding to one array of bits
TGeoVoxelFinder()
Default constructor.
Mother of all ROOT objects.
Definition: TObject.h:37
R__ALWAYS_INLINE Bool_t TestBit(UInt_t f) const
Definition: TObject.h:187
void SetBit(UInt_t f, Bool_t set)
Set or unset the user status bits as specified in f.
Definition: TObject.cxx:696
Statefull info for the current geometry level.
Definition: TGeoStateInfo.h:21