| Geant4 Cross Reference |
1 // 1 //
2 // ******************************************* 2 // ********************************************************************
3 // * License and Disclaimer 3 // * License and Disclaimer *
4 // * 4 // * *
5 // * The Geant4 software is copyright of th 5 // * The Geant4 software is copyright of the Copyright Holders of *
6 // * the Geant4 Collaboration. It is provided 6 // * the Geant4 Collaboration. It is provided under the terms and *
7 // * conditions of the Geant4 Software License 7 // * conditions of the Geant4 Software License, included in the file *
8 // * LICENSE and available at http://cern.ch/ 8 // * LICENSE and available at http://cern.ch/geant4/license . These *
9 // * include a list of copyright holders. 9 // * include a list of copyright holders. *
10 // * 10 // * *
11 // * Neither the authors of this software syst 11 // * Neither the authors of this software system, nor their employing *
12 // * institutes,nor the agencies providing fin 12 // * institutes,nor the agencies providing financial support for this *
13 // * work make any representation or warran 13 // * work make any representation or warranty, express or implied, *
14 // * regarding this software system or assum 14 // * regarding this software system or assume any liability for its *
15 // * use. Please see the license in the file 15 // * use. Please see the license in the file LICENSE and URL above *
16 // * for the full disclaimer and the limitatio 16 // * for the full disclaimer and the limitation of liability. *
17 // * 17 // * *
18 // * This code implementation is the result 18 // * This code implementation is the result of the scientific and *
19 // * technical work of the GEANT4 collaboratio 19 // * technical work of the GEANT4 collaboration. *
20 // * By using, copying, modifying or distri 20 // * By using, copying, modifying or distributing the software (or *
21 // * any work based on the software) you ag 21 // * any work based on the software) you agree to acknowledge its *
22 // * use in resulting scientific publicati 22 // * use in resulting scientific publications, and indicate your *
23 // * acceptance of all terms of the Geant4 Sof 23 // * acceptance of all terms of the Geant4 Software license. *
24 // ******************************************* 24 // ********************************************************************
25 // 25 //
26 // Class G4VIntersectionLocator inline methods 26 // Class G4VIntersectionLocator inline methods
27 // 27 //
28 // 27.10.07 - John Apostolakis, Tatiana Nikiti 28 // 27.10.07 - John Apostolakis, Tatiana Nikitina
29 // ------------------------------------------- 29 // ---------------------------------------------------------------------------
30 30
31 inline G4double G4VIntersectionLocator::GetDel 31 inline G4double G4VIntersectionLocator::GetDeltaIntersectionFor()
32 { 32 {
33 return fiDeltaIntersection; 33 return fiDeltaIntersection;
34 } 34 }
35 35
36 inline G4double G4VIntersectionLocator::GetEps 36 inline G4double G4VIntersectionLocator::GetEpsilonStepFor()
37 { 37 {
38 return fiEpsilonStep; 38 return fiEpsilonStep;
39 } 39 }
40 40
41 inline G4Navigator* G4VIntersectionLocator::Ge 41 inline G4Navigator* G4VIntersectionLocator::GetNavigatorFor()
42 { 42 {
43 return fiNavigator; 43 return fiNavigator;
44 } 44 }
45 45
46 inline G4ChordFinder* G4VIntersectionLocator:: 46 inline G4ChordFinder* G4VIntersectionLocator::GetChordFinderFor()
47 { 47 {
48 return fiChordFinder; 48 return fiChordFinder;
49 } 49 }
50 50
51 inline G4int G4VIntersectionLocator::GetVerbos 51 inline G4int G4VIntersectionLocator::GetVerboseFor()
52 { 52 {
53 return fVerboseLevel; 53 return fVerboseLevel;
54 } 54 }
55 55
56 inline G4bool G4VIntersectionLocator::GetAdjus 56 inline G4bool G4VIntersectionLocator::GetAdjustementOfFoundIntersection()
57 { 57 {
58 return fUseNormalCorrection; 58 return fUseNormalCorrection;
59 } 59 }
60 60
61 inline void G4VIntersectionLocator:: 61 inline void G4VIntersectionLocator::
62 AddAdjustementOfFoundIntersection(G4bool UseCo 62 AddAdjustementOfFoundIntersection(G4bool UseCorrection )
63 { 63 {
64 fUseNormalCorrection = UseCorrection; 64 fUseNormalCorrection = UseCorrection;
65 } 65 }
66 66
67 inline void G4VIntersectionLocator::SetEpsilon 67 inline void G4VIntersectionLocator::SetEpsilonStepFor( G4double EpsilonStep )
68 { 68 {
69 fiEpsilonStep = EpsilonStep; 69 fiEpsilonStep = EpsilonStep;
70 } 70 }
71 71
72 inline void G4VIntersectionLocator:: 72 inline void G4VIntersectionLocator::
73 SetDeltaIntersectionFor( G4double deltaInterse 73 SetDeltaIntersectionFor( G4double deltaIntersection )
74 { 74 {
75 fiDeltaIntersection = deltaIntersection; 75 fiDeltaIntersection = deltaIntersection;
76 } 76 }
77 77
78 inline void G4VIntersectionLocator::SetNavigat 78 inline void G4VIntersectionLocator::SetNavigatorFor( G4Navigator* fNavigator )
79 { 79 {
80 fiNavigator = fNavigator; 80 fiNavigator = fNavigator;
81 } 81 }
82 82
83 inline void G4VIntersectionLocator::SetChordFi 83 inline void G4VIntersectionLocator::SetChordFinderFor(G4ChordFinder* fCFinder )
84 { 84 {
85 fiChordFinder = fCFinder; 85 fiChordFinder = fCFinder;
86 } 86 }
87 87
88 inline void G4VIntersectionLocator::SetSafetyP 88 inline void G4VIntersectionLocator::SetSafetyParametersFor(G4bool UseSafety )
89 { 89 {
90 fiUseSafety = UseSafety; 90 fiUseSafety = UseSafety;
91 } 91 }
92 92
93 inline void G4VIntersectionLocator::SetVerbose 93 inline void G4VIntersectionLocator::SetVerboseFor(G4int fVerbose)
94 { 94 {
95 fVerboseLevel = fVerbose; 95 fVerboseLevel = fVerbose;
96 } 96 }
97 97
98 inline G4bool 98 inline G4bool
99 G4VIntersectionLocator::IntersectChord( const 99 G4VIntersectionLocator::IntersectChord( const G4ThreeVector& StartPointA,
100 const 100 const G4ThreeVector& EndPointB,
101 G4doub 101 G4double& NewSafety,
102 G4doub 102 G4double& PreviousSafety,
103 G4Thre 103 G4ThreeVector& PreviousSftOrigin,
104 G4doub 104 G4double& LinearStepLength,
105 G4Thre 105 G4ThreeVector& IntersectionPoint,
106 G4bool 106 G4bool* ptrCalledNavigator )
107 { 107 {
108 G4bool CalledNavigator = false; 108 G4bool CalledNavigator = false;
109 109
110 // Calculate the direction and length of the 110 // Calculate the direction and length of the chord AB
111 111
112 G4ThreeVector ChordAB_Vector = EndPointB - 112 G4ThreeVector ChordAB_Vector = EndPointB - StartPointA;
113 G4double ChordAB_Length = ChordAB_Vect 113 G4double ChordAB_Length = ChordAB_Vector.mag(); // Magnitude (norm)
114 G4ThreeVector ChordAB_Dir = ChordAB_Vector. 114 G4ThreeVector ChordAB_Dir = ChordAB_Vector.unit();
115 G4bool intersects; 115 G4bool intersects;
116 G4ThreeVector OriginShift = StartPointA - Pr 116 G4ThreeVector OriginShift = StartPointA - PreviousSftOrigin ;
117 G4double MagSqShift = OriginShift.mag2() ; 117 G4double MagSqShift = OriginShift.mag2() ;
118 G4double currentSafety; 118 G4double currentSafety;
119 119
120 if( MagSqShift >= sqr(PreviousSafety) ) 120 if( MagSqShift >= sqr(PreviousSafety) )
121 { 121 {
122 currentSafety = 0.0 ; 122 currentSafety = 0.0 ;
123 } 123 }
124 else 124 else
125 { 125 {
126 currentSafety = PreviousSafety - std::sqrt 126 currentSafety = PreviousSafety - std::sqrt(MagSqShift) ;
127 } 127 }
128 128
129 if( fiUseSafety && (ChordAB_Length <= curren 129 if( fiUseSafety && (ChordAB_Length <= currentSafety) )
130 { 130 {
131 // The Step is guaranteed to be taken 131 // The Step is guaranteed to be taken
132 132
133 LinearStepLength = ChordAB_Length; 133 LinearStepLength = ChordAB_Length;
134 intersects = false; 134 intersects = false;
135 NewSafety = currentSafety; 135 NewSafety = currentSafety;
136 CalledNavigator = false; 136 CalledNavigator = false;
137 } 137 }
138 else 138 else
139 { 139 {
140 // Check whether any volumes are encounter 140 // Check whether any volumes are encountered by the chord AB
141 141
142 LinearStepLength = GetNavigatorFor()->Comp 142 LinearStepLength = GetNavigatorFor()->ComputeStep( StartPointA,
143 ChordAB_Dir, 143 ChordAB_Dir, ChordAB_Length, NewSafety );
144 intersects = (LinearStepLength <= ChordAB_ 144 intersects = (LinearStepLength <= ChordAB_Length);
145 // G4Navigator contracts to return k_in 145 // G4Navigator contracts to return k_infinity if len==asked
146 // and it did not find a surface bounda 146 // and it did not find a surface boundary at that length
147 147
148 LinearStepLength = std::min( LinearStepLen 148 LinearStepLength = std::min( LinearStepLength, ChordAB_Length);
149 CalledNavigator = true; 149 CalledNavigator = true;
150 150
151 // Save the last calculated safety! 151 // Save the last calculated safety!
152 152
153 PreviousSftOrigin = StartPointA; 153 PreviousSftOrigin = StartPointA;
154 PreviousSafety = NewSafety; 154 PreviousSafety = NewSafety;
155 155
156 if( intersects ) 156 if( intersects )
157 { 157 {
158 // Intersection Point of chord AB and e 158 // Intersection Point of chord AB and either volume A's surface
159 // or a 159 // or a daughter volume's surface ..
160 IntersectionPoint = StartPointA + Linea 160 IntersectionPoint = StartPointA + LinearStepLength * ChordAB_Dir;
161 } 161 }
162 } 162 }
163 if( ptrCalledNavigator != nullptr ) << 163 if( ptrCalledNavigator )
164 { 164 {
165 *ptrCalledNavigator = CalledNavigator; 165 *ptrCalledNavigator = CalledNavigator;
166 } 166 }
167 167
168 return intersects; 168 return intersects;
169 } 169 }
170 170