| 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,v 1.2 2008/10/29 14:31:55 gcosmo Exp $
|
|---|
| 28 | // GEANT4 tag $Name: geant4-09-02-cand-01 $
|
|---|
| 29 | //
|
|---|
| 30 | // Class G4BrentLocator
|
|---|
| 31 | //
|
|---|
| 32 | // class description:
|
|---|
| 33 | //
|
|---|
| 34 | // Implementing the calculation of the intersection point with a boundary when
|
|---|
| 35 | // PropagationInField is used. Second order locator based on Brent Method
|
|---|
| 36 | // for finding the intersection point by means of a 'depth' algorithm in case
|
|---|
| 37 | // of slow progress (intersection is not found after 100 trials).
|
|---|
| 38 |
|
|---|
| 39 | // History:
|
|---|
| 40 | // -------
|
|---|
| 41 | // 27.10.08 - Tatiana Nikitina: First implementation using
|
|---|
| 42 | // LocateIntersectionPoint() from
|
|---|
| 43 | // G4PropagatorInField class
|
|---|
| 44 | // ---------------------------------------------------------------------------
|
|---|
| 45 |
|
|---|
| 46 | #ifndef G4BRENTLOCATOR_HH
|
|---|
| 47 | #define G4BRENTLOCATOR_HH
|
|---|
| 48 |
|
|---|
| 49 | #include "G4VIntersectionLocator.hh"
|
|---|
| 50 |
|
|---|
| 51 | class G4BrentLocator : public G4VIntersectionLocator
|
|---|
| 52 | {
|
|---|
| 53 | public: // with description
|
|---|
| 54 |
|
|---|
| 55 | G4BrentLocator(G4Navigator *theNavigator);
|
|---|
| 56 | // Constructor
|
|---|
| 57 | ~G4BrentLocator();
|
|---|
| 58 | // Default destructor
|
|---|
| 59 |
|
|---|
| 60 | G4bool EstimateIntersectionPoint(
|
|---|
| 61 | const G4FieldTrack& curveStartPointTangent, // A
|
|---|
| 62 | const G4FieldTrack& curveEndPointTangent, // B
|
|---|
| 63 | const G4ThreeVector& trialPoint, // E
|
|---|
| 64 | G4FieldTrack& intersectPointTangent, // Output
|
|---|
| 65 | G4bool& recalculatedEndPoint, // Out
|
|---|
| 66 | G4double& fPreviousSafety, // In/Out
|
|---|
| 67 | G4ThreeVector& fPreviousSftOrigin); // In/Out
|
|---|
| 68 | // If such an intersection exists, this function calculates the
|
|---|
| 69 | // intersection point of the true path of the particle with the surface
|
|---|
| 70 | // of the current volume (or of one of its daughters).
|
|---|
| 71 | // Should use lateral displacement as measure of convergence
|
|---|
| 72 |
|
|---|
| 73 | private:
|
|---|
| 74 |
|
|---|
| 75 | static const G4int max_depth=4;
|
|---|
| 76 | G4FieldTrack* ptrInterMedFT[max_depth+1];
|
|---|
| 77 | // Used to store intermediate tracks values in case of too slow progress
|
|---|
| 78 |
|
|---|
| 79 | G4int maxNumberOfStepsForIntersection;
|
|---|
| 80 | G4int maxNumberOfCallsToReIntegration;
|
|---|
| 81 | G4int maxNumberOfCallsToReIntegration_depth;
|
|---|
| 82 | // Counters for Statistics about Location and ReIntegrations
|
|---|
| 83 | };
|
|---|
| 84 |
|
|---|
| 85 | #endif
|
|---|
