Geant4  10.01
G4BrentLocator.hh
Go to the documentation of this file.
1 //
2 // ********************************************************************
3 // * License and Disclaimer *
4 // * *
5 // * The Geant4 software is copyright of the Copyright Holders of *
6 // * the Geant4 Collaboration. It is provided under the terms and *
7 // * conditions of the Geant4 Software License, included in the file *
8 // * LICENSE and available at http://cern.ch/geant4/license . These *
9 // * include a list of copyright holders. *
10 // * *
11 // * Neither the authors of this software system, nor their employing *
12 // * institutes,nor the agencies providing financial support for this *
13 // * work make any representation or warranty, express or implied, *
14 // * regarding this software system or assume any liability for its *
15 // * use. Please see the license in the file LICENSE and URL above *
16 // * for the full disclaimer and the limitation of liability. *
17 // * *
18 // * This code implementation is the result of the scientific and *
19 // * technical work of the GEANT4 collaboration. *
20 // * By using, copying, modifying or distributing the software (or *
21 // * any work based on the software) you agree to acknowledge its *
22 // * use in resulting scientific publications, and indicate your *
23 // * acceptance of all terms of the Geant4 Software license. *
24 // ********************************************************************
25 //
26 //
27 // $Id: G4BrentLocator.hh 66356 2012-12-18 09:02:32Z gcosmo $
28 //
29 // Class G4BrentLocator
30 //
31 // class description:
32 //
33 // Implementing the calculation of the intersection point with a boundary when
34 // PropagationInField is used. Second order locator based on Brent Method
35 // for finding the intersection point by means of a 'depth' algorithm in case
36 // of slow progress (intersection is not found after 100 trials).
37 
38 // History:
39 // -------
40 // 27.10.08 - Tatiana Nikitina: First implementation using
41 // LocateIntersectionPoint() from
42 // G4PropagatorInField class
43 // ---------------------------------------------------------------------------
44 
45 #ifndef G4BRENTLOCATOR_HH
46 #define G4BRENTLOCATOR_HH
47 
49 
51 {
52  public: // with description
53 
54  G4BrentLocator(G4Navigator *theNavigator);
55  // Constructor
57  // Default destructor
58 
60  const G4FieldTrack& curveStartPointTangent, // A
61  const G4FieldTrack& curveEndPointTangent, // B
62  const G4ThreeVector& trialPoint, // E
63  G4FieldTrack& intersectPointTangent, // Output
64  G4bool& recalculatedEndPoint, // Out
65  G4double& fPreviousSafety, // In/Out
67  // If such an intersection exists, this function calculates the
68  // intersection point of the true path of the particle with the surface
69  // of the current volume (or of one of its daughters).
70  // Should use lateral displacement as measure of convergence
71 
72  private:
73 
74  static const G4int max_depth=4;
75  G4FieldTrack* ptrInterMedFT[max_depth+1];
76  // Used to store intermediate tracks values in case of too slow progress
77 
81  // Counters for Statistics about Location and ReIntegrations
82 };
83 
84 #endif
CLHEP::Hep3Vector G4ThreeVector
G4FieldTrack * ptrInterMedFT[max_depth+1]
int G4int
Definition: G4Types.hh:78
G4int maxNumberOfStepsForIntersection
G4int maxNumberOfCallsToReIntegration_depth
bool G4bool
Definition: G4Types.hh:79
G4bool EstimateIntersectionPoint(const G4FieldTrack &curveStartPointTangent, const G4FieldTrack &curveEndPointTangent, const G4ThreeVector &trialPoint, G4FieldTrack &intersectPointTangent, G4bool &recalculatedEndPoint, G4double &fPreviousSafety, G4ThreeVector &fPreviousSftOrigin)
#define fPreviousSftOrigin
#define fPreviousSafety
static const G4int max_depth
double G4double
Definition: G4Types.hh:76
G4int maxNumberOfCallsToReIntegration
G4BrentLocator(G4Navigator *theNavigator)