2// ********************************************************************
3// * License and Disclaimer *
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. *
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. *
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// ********************************************************************
26// Class G4VIntersectionLocator inline methods
28// 27.10.07 - John Apostolakis, Tatiana Nikitina
29// ---------------------------------------------------------------------------
31inline G4double G4VIntersectionLocator::GetDeltaIntersectionFor()
33 return fiDeltaIntersection;
36inline G4double G4VIntersectionLocator::GetEpsilonStepFor()
41inline G4Navigator* G4VIntersectionLocator::GetNavigatorFor()
46inline G4ChordFinder* G4VIntersectionLocator::GetChordFinderFor()
51inline G4int G4VIntersectionLocator::GetVerboseFor()
56inline G4bool G4VIntersectionLocator::GetAdjustementOfFoundIntersection()
58 return fUseNormalCorrection;
61inline void G4VIntersectionLocator::
62AddAdjustementOfFoundIntersection(G4bool UseCorrection )
64 fUseNormalCorrection = UseCorrection;
67inline void G4VIntersectionLocator::SetEpsilonStepFor( G4double EpsilonStep )
69 fiEpsilonStep = EpsilonStep;
72inline void G4VIntersectionLocator::
73SetDeltaIntersectionFor( G4double deltaIntersection )
75 fiDeltaIntersection = deltaIntersection;
78inline void G4VIntersectionLocator::SetNavigatorFor( G4Navigator* fNavigator )
80 fiNavigator = fNavigator;
83inline void G4VIntersectionLocator::SetChordFinderFor(G4ChordFinder* fCFinder )
85 fiChordFinder = fCFinder;
88inline void G4VIntersectionLocator::SetSafetyParametersFor(G4bool UseSafety )
90 fiUseSafety = UseSafety;
93inline void G4VIntersectionLocator::SetVerboseFor(G4int fVerbose)
95 fVerboseLevel = fVerbose;
99G4VIntersectionLocator::IntersectChord( const G4ThreeVector& StartPointA,
100 const G4ThreeVector& EndPointB,
102 G4double& PreviousSafety,
103 G4ThreeVector& PreviousSftOrigin,
104 G4double& LinearStepLength,
105 G4ThreeVector& IntersectionPoint,
106 G4bool* ptrCalledNavigator )
108 G4bool CalledNavigator = false;
110 // Calculate the direction and length of the chord AB
112 G4ThreeVector ChordAB_Vector = EndPointB - StartPointA;
113 G4double ChordAB_Length = ChordAB_Vector.mag(); // Magnitude (norm)
114 G4ThreeVector ChordAB_Dir = ChordAB_Vector.unit();
116 G4ThreeVector OriginShift = StartPointA - PreviousSftOrigin ;
117 G4double MagSqShift = OriginShift.mag2() ;
118 G4double currentSafety;
120 if( MagSqShift >= sqr(PreviousSafety) )
122 currentSafety = 0.0 ;
126 currentSafety = PreviousSafety - std::sqrt(MagSqShift) ;
129 if( fiUseSafety && (ChordAB_Length <= currentSafety) )
131 // The Step is guaranteed to be taken
133 LinearStepLength = ChordAB_Length;
135 NewSafety = currentSafety;
136 CalledNavigator = false;
140 // Check whether any volumes are encountered by the chord AB
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
148 LinearStepLength = std::min( LinearStepLength, ChordAB_Length);
149 CalledNavigator = true;
151 // Save the last calculated safety!
153 PreviousSftOrigin = StartPointA;
154 PreviousSafety = NewSafety;
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;
163 if( ptrCalledNavigator )
165 *ptrCalledNavigator = CalledNavigator;