source: trunk/source/geometry/navigation/include/G4SimpleLocator.hh@ 1323

Last change on this file since 1323 was 1228, checked in by garnier, 16 years ago

update geant4.9.3 tag

File size: 3.5 KB
Line 
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,v 1.2 2008/10/29 14:31:55 gcosmo Exp $
28// GEANT4 tag $Name: geant4-09-03 $
29//
30//
31// Class G4SimpleLocator
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; the difference compared to G4MultiLevelLocator is that
39// no 'depth' algorithm is used in case of slow progress for finding the
40// intersection point.
41
42// History:
43// -------
44// 27.10.08 - Tatiana Nikitina: Derived from LocateIntersectionPoint() from
45// G4PropagatorInField class
46// ---------------------------------------------------------------------------
47
48#ifndef G4SIMPLELOCATOR_HH
49#define G4SIMPLELOCATOR_HH
50
51#include "G4VIntersectionLocator.hh"
52
53class G4SimpleLocator : public G4VIntersectionLocator
54{
55 public: // with description
56
57 G4SimpleLocator(G4Navigator *theNavigator);
58 // Constructor
59 ~G4SimpleLocator();
60 // Default destructor
61
62 G4bool EstimateIntersectionPoint(
63 const G4FieldTrack& curveStartPointTangent, // A
64 const G4FieldTrack& curveEndPointTangent, // B
65 const G4ThreeVector& trialPoint, // E
66 G4FieldTrack& intersectPointTangent, // Output
67 G4bool& recalculatedEndPoint, // Out
68 G4double& fPreviousSafety, // In/Out
69 G4ThreeVector& fPreviousSftOrigin); // In/Out
70 // If such an intersection exists, this function calculates the
71 // intersection point of the true path of the particle with the surface
72 // of the current volume (or of one of its daughters).
73 // Should use lateral displacement as measure of convergence
74};
75
76#endif
Note: See TracBrowser for help on using the repository browser.