TGeoChecker

class TGeoChecker : public TObject

    public:

          TGeoChecker TGeoChecker()
          TGeoChecker TGeoChecker(TGeoManager* geom)
          TGeoChecker TGeoChecker(const char* treename, const char* filename)
          TGeoChecker TGeoChecker(const TGeoChecker&)
         virtual void ~TGeoChecker()
                 void CheckGeometry(Int_t nrays, Double_t startx, Double_t starty, Double_t startz) const
                 void CheckOverlaps(const TGeoVolume* vol, Double_t ovlp = 0.1, Option_t* option) const
                 void CheckPoint(Double_t x = 0, Double_t y = 0, Double_t z = 0, Option_t* option)
             Double_t CheckVoxels(TGeoVolume* vol, TGeoVoxelFinder* voxels, Double_t* xyz, Int_t npoints)
       static TClass* Class()
                 void CreateTree(const char* treename, const char* filename)
                 void Generate(UInt_t npoints = 1000000)
      virtual TClass* IsA() const
                TH2F* LegoPlot(Int_t ntheta = 60, Double_t themin = 0., Double_t themax = 180., Int_t nphi = 90, Double_t phimin = 0., Double_t phimax = 360., Double_t rmin = 0., Double_t rmax = 9999999, Option_t* option)
                 void PrintOverlaps() const
                 void RandomPoints(TGeoVolume* vol, Int_t npoints, Option_t* option)
                 void RandomRays(Int_t nrays, Double_t startx, Double_t starty, Double_t startz)
                 void Raytrace(Double_t* startpoint, UInt_t npoints = 1000000)
            TGeoNode* SamplePoints(Int_t npoints, Double_t& dist, Double_t epsil, const char* g3path)
                 void ShootRay(Double_t* start, Double_t dirx, Double_t diry, Double_t dirz, Double_t* array, Int_t& nelem, Int_t& dim, Double_t* enpoint = 0) const
         virtual void ShowMembers(TMemberInspector& insp, char* parent)
                 void ShowPoints(Option_t* option)
         virtual void Streamer(TBuffer& b)
                 void StreamerNVirtual(TBuffer& b)
                 void Test(Int_t npoints, Option_t* option)
                 void TestOverlaps(const char* path)
               Bool_t TestVoxels(TGeoVolume* vol, Int_t npoints = 1000000)
             Double_t Weight(Double_t precision = 0.01, Option_t* option = "v")

Data Members

    private:

      TGeoManager* fGeom     pointer to geometry manager
            TTree* fTreePts  tree of points
       TGeoVolume* fVsafe    volume to which a safety sphere node was added

Class Description

 A simple geometry checker. Points can be randomly generated inside the
 bounding  box of a node. For each point the distance to the nearest surface
 and the corresponting point on that surface are computed. These points are
 stored in a tree and can be directly visualized within ROOT
 A second algoritm is shooting multiple rays from a given point to a geometry
 branch and storing the intersection points with surfaces in same tree.
 Rays can be traced backwords in order to find overlaps by comparing direct
 and inverse points.

/*

*/

 Default constructor

 Constructor for a given geometry

 constructor

 Destructor

 Shoot nrays with random directions from starting point (startx, starty, startz)
 in the reference frame of this volume. Track each ray until exiting geometry, then
 shoot backwards from exiting point and compare boundary crossing points.

 Check illegal overlaps for volume VOL within a limit OVLP.

 Print the current list of overlaps held by the manager class.

--- Draw point (x,y,z) over the picture of the daughers of the volume containing this point.
   Generates a report regarding the path to the node containing this point and the distance to
   the closest boundary.

 Generate a lego plot fot the top volume, according to option.

 Draw random points in the bounding box of a volume.

 Randomly shoot nrays from point (startx,starty,startz) and plot intersections
 with surfaces for current top node.

 shoot npoints randomly in a box of 1E-5 arround current point.
 return minimum distance to points outside
 make sure that path to current node is updated
 get the response of tgeo

 Shoot one ray from start point with direction (dirx,diry,dirz). Fills input array
 with points just after boundary crossings.
   Int_t array_dimension = 3*dim;

 Check time of finding "Where am I" for n points.

--- Geometry overlap checker based on sampling.

 Estimate weight of top level volume with a precision SIGMA(W)/W
 better than PRECISION. Option can be "v" - verbose (default).

 count voxel timing

 Returns optimal voxelization type for volume vol.
   kFALSE - cartesian
   kTRUE  - cylindrical

 These points are stored in a tree and can be directly visualized within ROOT.

/*

*/

 Points are randomly generated inside the
 bounding  box of a node. For each point the distance to the nearest surface
 and the corresponding point on that surface are computed.

/*

*/

 A second algoritm is shooting multiple rays from a given point to a geometry
 branch and storing the intersection points with surfaces in same tree.
 Rays can be traced backwords in order to find overlaps by comparing direct
 and inverse points.

/*

*/

/*

*/

Inline Functions

            TClass* Class()
            TClass* IsA() const
               void ShowMembers(TMemberInspector& insp, char* parent)
               void Streamer(TBuffer& b)
               void StreamerNVirtual(TBuffer& b)
        TGeoChecker TGeoChecker(const TGeoChecker&)