source: trunk/source/geometry/navigation/include/G4MultiLevelLocator.hh@ 1358

Last change on this file since 1358 was 1347, checked in by garnier, 15 years ago

geant4 tag 9.4

File size: 3.7 KB
RevLine 
[985]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//
[1347]27// $Id: G4MultiLevelLocator.hh,v 1.3 2010/07/13 15:59:42 gcosmo Exp $
28// GEANT4 tag $Name: geant4-09-04-ref-00 $
[985]29//
30//
31// Class G4MultiLevelLocator
32//
33// class description:
34//
35// Implementing the calculation of the intersection point with a boundary when
36// PropagationInField is used. Derived from method LocateIntersectionPoint()
37// from G4PropagatorInField, it is based on a linear method for finding the
38// intersection point by means of a 'depth' algorithm in case of slow progress
39// (intersection is not found after 100 trials).
40
41// History:
42// -------
43// 27.10.08 - Tatiana Nikitina: Derived from LocateIntersectionPoint() from
44// G4PropagatorInField class
45// ---------------------------------------------------------------------------
46
47#ifndef G4MULTILEVELLOCATOR_HH
48#define G4MULTILEVELLOCATOR_HH
49
50#include "G4VIntersectionLocator.hh"
51
52class G4MultiLevelLocator : public G4VIntersectionLocator
53{
54 public: // with description
55
56 G4MultiLevelLocator(G4Navigator *theNavigator);
57 // Constructor
58 ~G4MultiLevelLocator();
59 // Default destructor
60
61 G4bool EstimateIntersectionPoint(
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
68 G4ThreeVector& fPreviousSftOrigin); // 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 private:
75
76 static const G4int max_depth=4;
77
78 G4FieldTrack* ptrInterMedFT[max_depth+1];
79 // Used to store intermediate tracks values in case of too slow progress
80};
81
82#endif
Note: See TracBrowser for help on using the repository browser.