Geant4  10.01.p03
G4SimpleLocator.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: G4SimpleLocator.hh 66356 2012-12-18 09:02:32Z gcosmo $
28 //
29 //
30 // Class G4SimpleLocator
31 //
32 // class description:
33 //
34 // Implementing the calculation of the intersection point with a boundary when
35 // PropagationInField is used. Derived from method LocateIntersectionPoint()
36 // from G4PropagatorInField, it is based on a linear method for finding the
37 // intersection point; the difference compared to G4MultiLevelLocator is that
38 // no 'depth' algorithm is used in case of slow progress for finding the
39 // intersection point.
40 
41 // History:
42 // -------
43 // 27.10.08 - Tatiana Nikitina: Derived from LocateIntersectionPoint() from
44 // G4PropagatorInField class
45 // ---------------------------------------------------------------------------
46 
47 #ifndef G4SIMPLELOCATOR_HH
48 #define G4SIMPLELOCATOR_HH
49 
51 
53 {
54  public: // with description
55 
56  G4SimpleLocator(G4Navigator *theNavigator);
57  // Constructor
59  // Default destructor
60 
62  const G4FieldTrack& curveStartPointTangent, // A
63  const G4FieldTrack& curveEndPointTangent, // B
64  const G4ThreeVector& trialPoint, // E
65  G4FieldTrack& intersectPointTangent, // Output
66  G4bool& recalculatedEndPoint, // Out
67  G4double& fPreviousSafety, // In/Out
69  // If such an intersection exists, this function calculates the
70  // intersection point of the true path of the particle with the surface
71  // of the current volume (or of one of its daughters).
72  // Should use lateral displacement as measure of convergence
73 };
74 
75 #endif
CLHEP::Hep3Vector G4ThreeVector
G4bool EstimateIntersectionPoint(const G4FieldTrack &curveStartPointTangent, const G4FieldTrack &curveEndPointTangent, const G4ThreeVector &trialPoint, G4FieldTrack &intersectPointTangent, G4bool &recalculatedEndPoint, G4double &fPreviousSafety, G4ThreeVector &fPreviousSftOrigin)
bool G4bool
Definition: G4Types.hh:79
#define fPreviousSftOrigin
#define fPreviousSafety
double G4double
Definition: G4Types.hh:76
G4SimpleLocator(G4Navigator *theNavigator)