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 CheckPoint(Double_t x = 0, Double_t y = 0, Double_t z = 0, Option_t* option)
       static TClass* Class()
                 void CreateTree(const char* treename, const char* filename)
                 void Generate(UInt_t npoints = 1000000)
      virtual TClass* IsA() 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)
         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)

Data Members

    private:

      TGeoManager* fGeom     
            TTree* fTreePts  

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

--- 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.

 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

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

--- Geometry overlap checker based on sampling.

 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&)