Geant4 Cross Reference

Cross-Referencing   Geant4
Geant4/geometry/navigation/include/G4SimpleLocator.hh

Version: [ ReleaseNotes ] [ 1.0 ] [ 1.1 ] [ 2.0 ] [ 3.0 ] [ 3.1 ] [ 3.2 ] [ 4.0 ] [ 4.0.p1 ] [ 4.0.p2 ] [ 4.1 ] [ 4.1.p1 ] [ 5.0 ] [ 5.0.p1 ] [ 5.1 ] [ 5.1.p1 ] [ 5.2 ] [ 5.2.p1 ] [ 5.2.p2 ] [ 6.0 ] [ 6.0.p1 ] [ 6.1 ] [ 6.2 ] [ 6.2.p1 ] [ 6.2.p2 ] [ 7.0 ] [ 7.0.p1 ] [ 7.1 ] [ 7.1.p1 ] [ 8.0 ] [ 8.0.p1 ] [ 8.1 ] [ 8.1.p1 ] [ 8.1.p2 ] [ 8.2 ] [ 8.2.p1 ] [ 8.3 ] [ 8.3.p1 ] [ 8.3.p2 ] [ 9.0 ] [ 9.0.p1 ] [ 9.0.p2 ] [ 9.1 ] [ 9.1.p1 ] [ 9.1.p2 ] [ 9.1.p3 ] [ 9.2 ] [ 9.2.p1 ] [ 9.2.p2 ] [ 9.2.p3 ] [ 9.2.p4 ] [ 9.3 ] [ 9.3.p1 ] [ 9.3.p2 ] [ 9.4 ] [ 9.4.p1 ] [ 9.4.p2 ] [ 9.4.p3 ] [ 9.4.p4 ] [ 9.5 ] [ 9.5.p1 ] [ 9.5.p2 ] [ 9.6 ] [ 9.6.p1 ] [ 9.6.p2 ] [ 9.6.p3 ] [ 9.6.p4 ] [ 10.0 ] [ 10.0.p1 ] [ 10.0.p2 ] [ 10.0.p3 ] [ 10.0.p4 ] [ 10.1 ] [ 10.1.p1 ] [ 10.1.p2 ] [ 10.1.p3 ] [ 10.2 ] [ 10.2.p1 ] [ 10.2.p2 ] [ 10.2.p3 ] [ 10.3 ] [ 10.3.p1 ] [ 10.3.p2 ] [ 10.3.p3 ] [ 10.4 ] [ 10.4.p1 ] [ 10.4.p2 ] [ 10.4.p3 ] [ 10.5 ] [ 10.5.p1 ] [ 10.6 ] [ 10.6.p1 ] [ 10.6.p2 ] [ 10.6.p3 ] [ 10.7 ] [ 10.7.p1 ] [ 10.7.p2 ] [ 10.7.p3 ] [ 10.7.p4 ] [ 11.0 ] [ 11.0.p1 ] [ 11.0.p2 ] [ 11.0.p3, ] [ 11.0.p4 ] [ 11.1 ] [ 11.1.1 ] [ 11.1.2 ] [ 11.1.3 ] [ 11.2 ] [ 11.2.1 ] [ 11.2.2 ] [ 11.3.0 ] 

  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 // Class G4SimpleLocator 
 27 //
 28 // class description:
 29 // 
 30 // Implementing the calculation of the intersection point with a boundary when
 31 // PropagationInField is used. Derived from method LocateIntersectionPoint()
 32 // from G4PropagatorInField, it is based on a linear method for finding the
 33 // intersection point; the difference compared to G4MultiLevelLocator is that
 34 // no 'depth' algorithm is used in case of slow progress for finding the
 35 // intersection point.
 36 
 37 // 27.10.08 - Tatiana Nikitina: Derived from LocateIntersectionPoint() from 
 38 //                              G4PropagatorInField class
 39 // ---------------------------------------------------------------------------
 40 
 41 #ifndef G4SIMPLELOCATOR_HH
 42 #define G4SIMPLELOCATOR_HH
 43 
 44 #include "G4VIntersectionLocator.hh"
 45 
 46 class G4SimpleLocator : public G4VIntersectionLocator
 47 {
 48    public:  // with description 
 49  
 50      G4SimpleLocator(G4Navigator* aNavigator);
 51        // Constructor
 52      ~G4SimpleLocator() override;
 53        // Default destructor
 54 
 55      G4bool EstimateIntersectionPoint( 
 56          const  G4FieldTrack&       curveStartPointTangent,           // A
 57          const  G4FieldTrack&       curveEndPointTangent,             // B
 58          const  G4ThreeVector&      trialPoint,                       // E
 59                 G4FieldTrack&       intersectPointTangent,            // Output
 60           G4bool&             recalculatedEndPoint,             // Out
 61                 G4double&           fPreviousSafety,                  // In/Out
 62                 G4ThreeVector&      fPreviousSftOrigin) override;     // In/Out
 63       // If such an intersection exists, this function calculates the
 64       // intersection point of the true path of the particle with the surface
 65       // of the current volume (or of one of its daughters). 
 66       // Should use lateral displacement as measure of convergence
 67 };
 68 
 69 #endif
 70