| Geant4 Cross Reference |
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 G4VIntersectionLocator inline methods
27 //
28 // 27.10.07 - John Apostolakis, Tatiana Nikitina
29 // ---------------------------------------------------------------------------
30
31 inline G4double G4VIntersectionLocator::GetDeltaIntersectionFor()
32 {
33 return fiDeltaIntersection;
34 }
35
36 inline G4double G4VIntersectionLocator::GetEpsilonStepFor()
37 {
38 return fiEpsilonStep;
39 }
40
41 inline G4Navigator* G4VIntersectionLocator::GetNavigatorFor()
42 {
43 return fiNavigator;
44 }
45
46 inline G4ChordFinder* G4VIntersectionLocator::GetChordFinderFor()
47 {
48 return fiChordFinder;
49 }
50
51 inline G4int G4VIntersectionLocator::GetVerboseFor()
52 {
53 return fVerboseLevel;
54 }
55
56 inline G4bool G4VIntersectionLocator::GetAdjustementOfFoundIntersection()
57 {
58 return fUseNormalCorrection;
59 }
60
61 inline void G4VIntersectionLocator::
62 AddAdjustementOfFoundIntersection(G4bool UseCorrection )
63 {
64 fUseNormalCorrection = UseCorrection;
65 }
66
67 inline void G4VIntersectionLocator::SetEpsilonStepFor( G4double EpsilonStep )
68 {
69 fiEpsilonStep = EpsilonStep;
70 }
71
72 inline void G4VIntersectionLocator::
73 SetDeltaIntersectionFor( G4double deltaIntersection )
74 {
75 fiDeltaIntersection = deltaIntersection;
76 }
77
78 inline void G4VIntersectionLocator::SetNavigatorFor( G4Navigator* fNavigator )
79 {
80 fiNavigator = fNavigator;
81 }
82
83 inline void G4VIntersectionLocator::SetChordFinderFor(G4ChordFinder* fCFinder )
84 {
85 fiChordFinder = fCFinder;
86 }
87
88 inline void G4VIntersectionLocator::SetSafetyParametersFor(G4bool UseSafety )
89 {
90 fiUseSafety = UseSafety;
91 }
92
93 inline void G4VIntersectionLocator::SetVerboseFor(G4int fVerbose)
94 {
95 fVerboseLevel = fVerbose;
96 }
97
98 inline G4bool
99 G4VIntersectionLocator::IntersectChord( const G4ThreeVector& StartPointA,
100 const G4ThreeVector& EndPointB,
101 G4double& NewSafety,
102 G4double& PreviousSafety,
103 G4ThreeVector& PreviousSftOrigin,
104 G4double& LinearStepLength,
105 G4ThreeVector& IntersectionPoint,
106 G4bool* ptrCalledNavigator )
107 {
108 G4bool CalledNavigator = false;
109
110 // Calculate the direction and length of the chord AB
111
112 G4ThreeVector ChordAB_Vector = EndPointB - StartPointA;
113 G4double ChordAB_Length = ChordAB_Vector.mag(); // Magnitude (norm)
114 G4ThreeVector ChordAB_Dir = ChordAB_Vector.unit();
115 G4bool intersects;
116 G4ThreeVector OriginShift = StartPointA - PreviousSftOrigin ;
117 G4double MagSqShift = OriginShift.mag2() ;
118 G4double currentSafety;
119
120 if( MagSqShift >= sqr(PreviousSafety) )
121 {
122 currentSafety = 0.0 ;
123 }
124 else
125 {
126 currentSafety = PreviousSafety - std::sqrt(MagSqShift) ;
127 }
128
129 if( fiUseSafety && (ChordAB_Length <= currentSafety) )
130 {
131 // The Step is guaranteed to be taken
132
133 LinearStepLength = ChordAB_Length;
134 intersects = false;
135 NewSafety = currentSafety;
136 CalledNavigator = false;
137 }
138 else
139 {
140 // Check whether any volumes are encountered by the chord AB
141
142 LinearStepLength = GetNavigatorFor()->ComputeStep( StartPointA,
143 ChordAB_Dir, ChordAB_Length, NewSafety );
144 intersects = (LinearStepLength <= ChordAB_Length);
145 // G4Navigator contracts to return k_infinity if len==asked
146 // and it did not find a surface boundary at that length
147
148 LinearStepLength = std::min( LinearStepLength, ChordAB_Length);
149 CalledNavigator = true;
150
151 // Save the last calculated safety!
152
153 PreviousSftOrigin = StartPointA;
154 PreviousSafety = NewSafety;
155
156 if( intersects )
157 {
158 // Intersection Point of chord AB and either volume A's surface
159 // or a daughter volume's surface ..
160 IntersectionPoint = StartPointA + LinearStepLength * ChordAB_Dir;
161 }
162 }
163 if( ptrCalledNavigator != nullptr )
164 {
165 *ptrCalledNavigator = CalledNavigator;
166 }
167
168 return intersects;
169 }
170