G4BrentLocator.hh

Go to the documentation of this file.
00001 //
00002 // ********************************************************************
00003 // * License and Disclaimer                                           *
00004 // *                                                                  *
00005 // * The  Geant4 software  is  copyright of the Copyright Holders  of *
00006 // * the Geant4 Collaboration.  It is provided  under  the terms  and *
00007 // * conditions of the Geant4 Software License,  included in the file *
00008 // * LICENSE and available at  http://cern.ch/geant4/license .  These *
00009 // * include a list of copyright holders.                             *
00010 // *                                                                  *
00011 // * Neither the authors of this software system, nor their employing *
00012 // * institutes,nor the agencies providing financial support for this *
00013 // * work  make  any representation or  warranty, express or implied, *
00014 // * regarding  this  software system or assume any liability for its *
00015 // * use.  Please see the license in the file  LICENSE  and URL above *
00016 // * for the full disclaimer and the limitation of liability.         *
00017 // *                                                                  *
00018 // * This  code  implementation is the result of  the  scientific and *
00019 // * technical work of the GEANT4 collaboration.                      *
00020 // * By using,  copying,  modifying or  distributing the software (or *
00021 // * any work based  on the software)  you  agree  to acknowledge its *
00022 // * use  in  resulting  scientific  publications,  and indicate your *
00023 // * acceptance of all terms of the Geant4 Software license.          *
00024 // ********************************************************************
00025 //
00026 //
00027 // $Id$
00028 //
00029 // Class G4BrentLocator
00030 //
00031 // class description:
00032 // 
00033 // Implementing the calculation of the intersection point with a boundary when
00034 // PropagationInField is used. Second order locator based on Brent Method
00035 // for finding the intersection point by means of a 'depth' algorithm in case
00036 // of slow progress (intersection is not found after 100 trials).
00037 
00038 // History:
00039 // -------
00040 // 27.10.08 - Tatiana Nikitina: First implementation using
00041 //                              LocateIntersectionPoint() from 
00042 //                              G4PropagatorInField class
00043 // ---------------------------------------------------------------------------
00044 
00045 #ifndef G4BRENTLOCATOR_HH
00046 #define G4BRENTLOCATOR_HH
00047 
00048 #include "G4VIntersectionLocator.hh"
00049 
00050 class G4BrentLocator : public G4VIntersectionLocator
00051 {
00052   public:  // with description 
00053  
00054     G4BrentLocator(G4Navigator *theNavigator);
00055       // Constructor
00056     ~G4BrentLocator();
00057       // Default destructor
00058 
00059     G4bool EstimateIntersectionPoint( 
00060          const  G4FieldTrack&       curveStartPointTangent,  // A
00061          const  G4FieldTrack&       curveEndPointTangent,    // B
00062          const  G4ThreeVector&      trialPoint,              // E
00063                 G4FieldTrack&       intersectPointTangent,   // Output
00064                 G4bool&             recalculatedEndPoint,    // Out
00065                 G4double&           fPreviousSafety,         // In/Out
00066                 G4ThreeVector&      fPreviousSftOrigin);     // In/Out
00067       // If such an intersection exists, this function calculates the
00068       // intersection point of the true path of the particle with the surface
00069       // of the current volume (or of one of its daughters). 
00070       // Should use lateral displacement as measure of convergence
00071 
00072   private:
00073 
00074     static const G4int max_depth=4;
00075     G4FieldTrack* ptrInterMedFT[max_depth+1];
00076       // Used to store intermediate tracks values in case of too slow progress
00077 
00078     G4int maxNumberOfStepsForIntersection;
00079     G4int maxNumberOfCallsToReIntegration;
00080     G4int maxNumberOfCallsToReIntegration_depth;
00081       //  Counters for Statistics about Location and ReIntegrations
00082 };
00083 
00084 #endif

Generated on Mon May 27 17:47:47 2013 for Geant4 by  doxygen 1.4.7