Geant4  10.00.p01
G4PropagatorInField.cc
Go to the documentation of this file.
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 //
28 //
29 // This class implements an algorithm to track a particle in a
30 // non-uniform magnetic field. It utilises an ODE solver (with
31 // the Runge - Kutta method) to evolve the particle, and drives it
32 // until the particle has traveled a set distance or it enters a new
33 // volume.
34 //
35 // 14.10.96 John Apostolakis, design and implementation
36 // 17.03.97 John Apostolakis, renaming new set functions being added
37 //
38 // $Id: G4PropagatorInField.cc 69711 2013-05-13 09:22:17Z gcosmo $
39 // GEANT4 tag $ Name: $
40 // ---------------------------------------------------------------------------
41 
42 #include <iomanip>
43 
44 #include "G4PropagatorInField.hh"
45 #include "G4ios.hh"
46 #include "G4SystemOfUnits.hh"
47 #include "G4ThreeVector.hh"
48 #include "G4VPhysicalVolume.hh"
49 #include "G4Navigator.hh"
50 #include "G4GeometryTolerance.hh"
52 #include "G4ChordFinder.hh"
53 #include "G4MultiLevelLocator.hh"
54 
56 //
57 // Constructors and destructor
58 
60  G4FieldManager *detectorFieldMgr,
61  G4VIntersectionLocator *vLocator )
62  :
63  fMax_loop_count(1000),
64  fUseSafetyForOptimisation(true), // (false) is less sensitive to incorrect safety
65  fZeroStepThreshold( 0.0 ), // length of what is recognised as 'zero' step
66  fDetectorFieldMgr(detectorFieldMgr),
67  fpTrajectoryFilter( 0 ),
68  fNavigator(theNavigator),
69  fCurrentFieldMgr(detectorFieldMgr),
70  fSetFieldMgr(false),
71  End_PointAndTangent(G4ThreeVector(0.,0.,0.),
72  G4ThreeVector(0.,0.,0.),0.0,0.0,0.0,0.0,0.0),
73  fParticleIsLooping(false),
74  fNoZeroStep(0),
75  fVerboseLevel(0)
76 {
78  else { fEpsilonStep= 1.0e-5; }
84  fLargestAcceptableStep = 1000.0 * meter;
85 
87  fPreviousSafety= 0.0;
90 
91 #ifdef G4DEBUG_FIELD
92  G4cout << " PiF: Zero Step Threshold set to "
94  << " mm." << G4endl;
95  G4cout << " PiF: Value of kCarTolerance = "
96  << kCarTolerance / millimeter
97  << " mm. " << G4endl;
98 #endif
99 
100  // Definding Intersection Locator and his parameters
101  if(vLocator==0){
102  fIntersectionLocator= new G4MultiLevelLocator(theNavigator);
103  fAllocatedLocator=true;
104  }else{
105  fIntersectionLocator=vLocator;
106  fAllocatedLocator=false;
107  }
108  RefreshIntersectionLocator(); // Copy all relevant parameters
109 }
110 
112 {
114 }
115 
116 // Update the IntersectionLocator with current parameters
117 void
119 {
124 }
126 //
127 // Compute the next geometric Step
128 
129 G4double
131  G4FieldTrack& pFieldTrack,
132  G4double CurrentProposedStepLength,
133  G4double& currentSafety, // IN/OUT
134  G4VPhysicalVolume* pPhysVol)
135 {
136  // If CurrentProposedStepLength is too small for finding Chords
137  // then return with no action (for now - TODO: some action)
138  //
139  if(CurrentProposedStepLength<kCarTolerance)
140  {
141  return kInfinity;
142  }
143 
144  // Introducing smooth trajectory display (jacek 01/11/2002)
145  //
146  if (fpTrajectoryFilter)
147  {
149  }
150 
151  // Parameters for adaptive Runge-Kutta integration
152 
153  G4double h_TrialStepSize; // 1st Step Size
154  G4double TruePathLength = CurrentProposedStepLength;
155  G4double StepTaken = 0.0;
156  G4double s_length_taken, epsilon ;
157  G4bool intersects;
158  G4bool first_substep = true;
159 
160  G4double NewSafety;
161  fParticleIsLooping = false;
162 
163  // If not yet done,
164  // Set the field manager to the local one if the volume has one,
165  // or to the global one if not
166  //
168  // For the next call, the field manager must again be set
169  fSetFieldMgr= false;
170 
171  // Values for Intersection Locator has to be updated on each call for the
172  // case that CurrentFieldManager has changed from the one of previous step
174 
175  G4FieldTrack CurrentState(pFieldTrack);
176  G4FieldTrack OriginalState = CurrentState;
177 
178  // If the Step length is "infinite", then an approximate-maximum Step
179  // length (used to calculate the relative accuracy) must be guessed.
180  //
181  if( CurrentProposedStepLength >= fLargestAcceptableStep )
182  {
183  G4ThreeVector StartPointA, VelocityUnit;
184  StartPointA = pFieldTrack.GetPosition();
185  VelocityUnit = pFieldTrack.GetMomentumDir();
186 
187  G4double trialProposedStep = 1.e2 * ( 10.0 * cm +
189  GetSolid()->DistanceToOut(StartPointA, VelocityUnit) );
190  CurrentProposedStepLength= std::min( trialProposedStep,
192  }
193  epsilon = fCurrentFieldMgr->GetDeltaOneStep() / CurrentProposedStepLength;
194  // G4double raw_epsilon= epsilon;
197  if( epsilon < epsilonMin ) epsilon = epsilonMin;
198  if( epsilon > epsilonMax ) epsilon = epsilonMax;
199  SetEpsilonStep( epsilon );
200 
201  // G4cout << "G4PiF: Epsilon of current step - raw= " << raw_epsilon
202  // << " final= " << epsilon << G4endl;
203 
204  // Shorten the proposed step in case of earlier problems (zero steps)
205  //
207  {
208  G4double stepTrial;
209 
210  stepTrial= fFull_CurveLen_of_LastAttempt;
211  if( (stepTrial <= 0.0) && (fLast_ProposedStepLength > 0.0) )
212  stepTrial= fLast_ProposedStepLength;
213 
214  G4double decreaseFactor = 0.9; // Unused default
216  && (stepTrial > 100.0*fZeroStepThreshold) )
217  {
218  // Attempt quick convergence
219  //
220  decreaseFactor= 0.25;
221  }
222  else
223  {
224  // We are in significant difficulties, probably at a boundary that
225  // is either geometrically sharp or between very different materials.
226  // Careful decreases to cope with tolerance are required.
227  //
228  if( stepTrial > 100.0*fZeroStepThreshold )
229  decreaseFactor = 0.35; // Try decreasing slower
230  else if( stepTrial > 30.0*fZeroStepThreshold )
231  decreaseFactor= 0.5; // Try yet slower decrease
232  else if( stepTrial > 10.0*fZeroStepThreshold )
233  decreaseFactor= 0.75; // Try even slower decreases
234  else
235  decreaseFactor= 0.9; // Try very slow decreases
236  }
237  stepTrial *= decreaseFactor;
238 
239 #ifdef G4DEBUG_FIELD
240  G4cout << " G4PropagatorInField::ComputeStep(): " << G4endl
241  << " Decreasing step - "
242  << " decreaseFactor= " << std::setw(8) << decreaseFactor
243  << " stepTrial = " << std::setw(18) << stepTrial << " "
244  << " fZeroStepThreshold = " << fZeroStepThreshold << G4endl;
245  PrintStepLengthDiagnostic(CurrentProposedStepLength, decreaseFactor,
246  stepTrial, pFieldTrack);
247 #endif
248  if( stepTrial == 0.0 ) // Change to make it < 0.1 * kCarTolerance ??
249  {
250  std::ostringstream message;
251  message << "Particle abandoned due to lack of progress in field."
252  << G4endl
253  << " Properties : " << pFieldTrack << G4endl
254  << " Attempting a zero step = " << stepTrial << G4endl
255  << " while attempting to progress after " << fNoZeroStep
256  << " trial steps. Will abandon step.";
257  G4Exception("G4PropagatorInField::ComputeStep()", "GeomNav1002",
258  JustWarning, message);
259  fParticleIsLooping= true;
260  return 0; // = stepTrial;
261  }
262  if( stepTrial < CurrentProposedStepLength )
263  CurrentProposedStepLength = stepTrial;
264  }
265  fLast_ProposedStepLength = CurrentProposedStepLength;
266 
267  G4int do_loop_count = 0;
268  do
269  {
270  G4FieldTrack SubStepStartState = CurrentState;
271  G4ThreeVector SubStartPoint = CurrentState.GetPosition();
272 
273  if( !first_substep) {
274  fNavigator->LocateGlobalPointWithinVolume( SubStartPoint );
275  }
276 
277  // How far to attempt to move the particle !
278  //
279  h_TrialStepSize = CurrentProposedStepLength - StepTaken;
280 
281  // Integrate as far as "chord miss" rule allows.
282  //
283  s_length_taken = GetChordFinder()->AdvanceChordLimited(
284  CurrentState, // Position & velocity
285  h_TrialStepSize,
286  fEpsilonStep,
289  );
290  // CurrentState is now updated with the final position and velocity.
291 
292  fFull_CurveLen_of_LastAttempt = s_length_taken;
293 
294  G4ThreeVector EndPointB = CurrentState.GetPosition();
295  G4ThreeVector InterSectionPointE;
296  G4double LinearStepLength;
297 
298  // Intersect chord AB with geometry
299  intersects= IntersectChord( SubStartPoint, EndPointB,
300  NewSafety, LinearStepLength,
301  InterSectionPointE );
302  // E <- Intersection Point of chord AB and either volume A's surface
303  // or a daughter volume's surface ..
304 
305  if( first_substep ) {
306  currentSafety = NewSafety;
307  } // Updating safety in other steps is potential future extention
308 
309  if( intersects )
310  {
311  G4FieldTrack IntersectPointVelct_G(CurrentState); // FT-Def-Construct
312 
313  // Find the intersection point of AB true path with the surface
314  // of vol(A), if it exists. Start with point E as first "estimate".
315  G4bool recalculatedEndPt= false;
316 
317  G4bool found_intersection = fIntersectionLocator->
318  EstimateIntersectionPoint( SubStepStartState, CurrentState,
319  InterSectionPointE, IntersectPointVelct_G,
320  recalculatedEndPt,fPreviousSafety,fPreviousSftOrigin);
321  intersects = intersects && found_intersection;
322  if( found_intersection ) {
323  End_PointAndTangent= IntersectPointVelct_G; // G is our EndPoint ...
324  StepTaken = TruePathLength = IntersectPointVelct_G.GetCurveLength()
325  - OriginalState.GetCurveLength();
326  } else {
327  // intersects= false; // "Minor" chords do not intersect
328  if( recalculatedEndPt ){
329  CurrentState= IntersectPointVelct_G;
330  }
331  }
332  }
333  if( !intersects )
334  {
335  StepTaken += s_length_taken;
336  // For smooth trajectory display (jacek 01/11/2002)
337  if (fpTrajectoryFilter) {
339  }
340  }
341  first_substep = false;
342 
343 #ifdef G4DEBUG_FIELD
345  printStatus( SubStepStartState, // or OriginalState,
346  CurrentState, CurrentProposedStepLength,
347  NewSafety, do_loop_count, pPhysVol );
348  }
349  if( (fVerboseLevel > 1) && (do_loop_count > fMax_loop_count-10 )) {
350  if( do_loop_count == fMax_loop_count-9 ){
351  G4cout << " G4PropagatorInField::ComputeStep(): " << G4endl
352  << " Difficult track - taking many sub steps." << G4endl;
353  }
354  printStatus( SubStepStartState, CurrentState, CurrentProposedStepLength,
355  NewSafety, do_loop_count, pPhysVol );
356  }
357 #endif
358 
359  do_loop_count++;
360 
361  } while( (!intersects )
362  && (StepTaken + kCarTolerance < CurrentProposedStepLength)
363  && ( do_loop_count < fMax_loop_count ) );
364 
365  if( do_loop_count >= fMax_loop_count )
366  {
367  fParticleIsLooping = true;
368 
369  if ( fVerboseLevel > 0 )
370  {
371  G4cout << " G4PropagateInField::ComputeStep(): " << G4endl
372  << " Killing looping particle "
373  // << " of " << energy << " energy "
374  << " after " << do_loop_count << " field substeps "
375  << " totaling " << StepTaken / mm << " mm " ;
376  if( pPhysVol )
377  G4cout << " in volume " << pPhysVol->GetName() ;
378  else
379  G4cout << " in unknown or null volume. " ;
380  G4cout << G4endl;
381  }
382  }
383 
384  if( !intersects )
385  {
386  // Chord AB or "minor chords" do not intersect
387  // B is the endpoint Step of the current Step.
388  //
389  End_PointAndTangent = CurrentState;
390  TruePathLength = StepTaken;
391  }
392 
393  // Set pFieldTrack to the return value
394  //
395  pFieldTrack = End_PointAndTangent;
396 
397 #ifdef G4VERBOSE
398  // Check that "s" is correct
399  //
400  if( std::fabs(OriginalState.GetCurveLength() + TruePathLength
401  - End_PointAndTangent.GetCurveLength()) > 3.e-4 * TruePathLength )
402  {
403  std::ostringstream message;
404  message << "Curve length mis-match between original state "
405  << "and proposed endpoint of propagation." << G4endl
406  << " The curve length of the endpoint should be: "
407  << OriginalState.GetCurveLength() + TruePathLength << G4endl
408  << " and it is instead: "
410  << " A difference of: "
411  << OriginalState.GetCurveLength() + TruePathLength
413  << " Original state = " << OriginalState << G4endl
414  << " Proposed state = " << End_PointAndTangent;
415  G4Exception("G4PropagatorInField::ComputeStep()",
416  "GeomNav0003", FatalException, message);
417  }
418 #endif
419 
420  // In particular anomalous cases, we can get repeated zero steps
421  // In order to correct this efficiently, we identify these cases
422  // and only take corrective action when they occur.
423  //
424  if( ( (TruePathLength < fZeroStepThreshold)
425  && ( TruePathLength+kCarTolerance < CurrentProposedStepLength )
426  )
427  || ( TruePathLength < 0.5*kCarTolerance )
428  )
429  {
430  fNoZeroStep++;
431  }
432  else{
433  fNoZeroStep = 0;
434  }
435 
437  {
438  fParticleIsLooping = true;
439  std::ostringstream message;
440  message << "Particle is stuck; it will be killed." << G4endl
441  << " Zero progress for " << fNoZeroStep << " attempted steps."
442  << G4endl
443  << " Proposed Step is " << CurrentProposedStepLength
444  << " but Step Taken is "<< fFull_CurveLen_of_LastAttempt << G4endl;
445  if( pPhysVol )
446  message << " in volume " << pPhysVol->GetName() ;
447  else
448  message << " in unknown or null volume. " ;
449  G4Exception("G4PropagatorInField::ComputeStep()",
450  "GeomNav1002", JustWarning, message);
451  fNoZeroStep = 0;
452  }
453 
454  return TruePathLength;
455 }
456 
458 //
459 // Dumps status of propagator.
460 
461 void
463  const G4FieldTrack& CurrentFT,
464  G4double requestStep,
465  G4double safety,
466  G4int stepNo,
467  G4VPhysicalVolume* startVolume)
468 {
469  const G4int verboseLevel=fVerboseLevel;
470  const G4ThreeVector StartPosition = StartFT.GetPosition();
471  const G4ThreeVector StartUnitVelocity = StartFT.GetMomentumDir();
472  const G4ThreeVector CurrentPosition = CurrentFT.GetPosition();
473  const G4ThreeVector CurrentUnitVelocity = CurrentFT.GetMomentumDir();
474 
475  G4double step_len = CurrentFT.GetCurveLength() - StartFT.GetCurveLength();
476 
477  G4int oldprec; // cout/cerr precision settings
478 
479  if( ((stepNo == 0) && (verboseLevel <3)) || (verboseLevel >= 3) )
480  {
481  oldprec = G4cout.precision(4);
482  G4cout << std::setw( 6) << " "
483  << std::setw( 25) << " Current Position and Direction" << " "
484  << G4endl;
485  G4cout << std::setw( 5) << "Step#"
486  << std::setw(10) << " s " << " "
487  << std::setw(10) << "X(mm)" << " "
488  << std::setw(10) << "Y(mm)" << " "
489  << std::setw(10) << "Z(mm)" << " "
490  << std::setw( 7) << " N_x " << " "
491  << std::setw( 7) << " N_y " << " "
492  << std::setw( 7) << " N_z " << " " ;
493  G4cout << std::setw( 7) << " Delta|N|" << " "
494  << std::setw( 9) << "StepLen" << " "
495  << std::setw(12) << "StartSafety" << " "
496  << std::setw( 9) << "PhsStep" << " ";
497  if( startVolume )
498  { G4cout << std::setw(18) << "NextVolume" << " "; }
499  G4cout.precision(oldprec);
500  G4cout << G4endl;
501  }
502  if((stepNo == 0) && (verboseLevel <=3))
503  {
504  // Recurse to print the start values
505  //
506  printStatus( StartFT, StartFT, -1.0, safety, -1, startVolume);
507  }
508  if( verboseLevel <= 3 )
509  {
510  if( stepNo >= 0)
511  { G4cout << std::setw( 4) << stepNo << " "; }
512  else
513  { G4cout << std::setw( 5) << "Start" ; }
514  oldprec = G4cout.precision(8);
515  G4cout << std::setw(10) << CurrentFT.GetCurveLength() << " ";
516  G4cout.precision(8);
517  G4cout << std::setw(10) << CurrentPosition.x() << " "
518  << std::setw(10) << CurrentPosition.y() << " "
519  << std::setw(10) << CurrentPosition.z() << " ";
520  G4cout.precision(4);
521  G4cout << std::setw( 7) << CurrentUnitVelocity.x() << " "
522  << std::setw( 7) << CurrentUnitVelocity.y() << " "
523  << std::setw( 7) << CurrentUnitVelocity.z() << " ";
524  G4cout.precision(3);
525  G4cout << std::setw( 7)
526  << CurrentFT.GetMomentum().mag()-StartFT.GetMomentum().mag() << " ";
527  G4cout << std::setw( 9) << step_len << " ";
528  G4cout << std::setw(12) << safety << " ";
529  if( requestStep != -1.0 )
530  { G4cout << std::setw( 9) << requestStep << " "; }
531  else
532  { G4cout << std::setw( 9) << "Init/NotKnown" << " "; }
533  if( startVolume != 0)
534  { G4cout << std::setw(12) << startVolume->GetName() << " "; }
535  G4cout.precision(oldprec);
536  G4cout << G4endl;
537  }
538  else // if( verboseLevel > 3 )
539  {
540  // Multi-line output
541 
542  G4cout << "Step taken was " << step_len
543  << " out of PhysicalStep = " << requestStep << G4endl;
544  G4cout << "Final safety is: " << safety << G4endl;
545  G4cout << "Chord length = " << (CurrentPosition-StartPosition).mag()
546  << G4endl;
547  G4cout << G4endl;
548  }
549 }
550 
552 //
553 // Prints Step diagnostics
554 
555 void
557  G4double CurrentProposedStepLength,
558  G4double decreaseFactor,
559  G4double stepTrial,
560  const G4FieldTrack& )
561 {
562  G4int iprec= G4cout.precision(8);
563  G4cout << " " << std::setw(12) << " PiF: NoZeroStep "
564  << " " << std::setw(20) << " CurrentProposed len "
565  << " " << std::setw(18) << " Full_curvelen_last"
566  << " " << std::setw(18) << " last proposed len "
567  << " " << std::setw(18) << " decrease factor "
568  << " " << std::setw(15) << " step trial "
569  << G4endl;
570 
571  G4cout << " " << std::setw(10) << fNoZeroStep << " "
572  << " " << std::setw(20) << CurrentProposedStepLength
573  << " " << std::setw(18) << fFull_CurveLen_of_LastAttempt
574  << " " << std::setw(18) << fLast_ProposedStepLength
575  << " " << std::setw(18) << decreaseFactor
576  << " " << std::setw(15) << stepTrial
577  << G4endl;
578  G4cout.precision( iprec );
579 
580 }
581 
582 // Access the points which have passed through the filter. The
583 // points are stored as ThreeVectors for the initial impelmentation
584 // only (jacek 30/10/2002)
585 // Responsibility for deleting the points lies with
586 // SmoothTrajectoryPoint, which is the points' final
587 // destination. The points pointer is set to NULL, to ensure that
588 // the points are not re-used in subsequent steps, therefore THIS
589 // METHOD MUST BE CALLED EXACTLY ONCE PER STEP. (jacek 08/11/2002)
590 
591 std::vector<G4ThreeVector>*
593 {
594  // NB, GimmeThePointsAndForgetThem really forgets them, so it can
595  // only be called (exactly) once for each step.
596 
597  if (fpTrajectoryFilter)
598  {
600  }
601  else
602  {
603  return 0;
604  }
605 }
606 
607 void
609 {
610  fpTrajectoryFilter = filter;
611 }
612 
614 {
615  // Goal: Clear all memory of previous steps, cached information
616 
617  fParticleIsLooping= false;
618  fNoZeroStep= 0;
619 
621  G4ThreeVector(0.,0.,0.),
622  0.0,0.0,0.0,0.0,0.0);
625 
627  fPreviousSafety= 0.0;
628 }
629 
631 FindAndSetFieldManager( G4VPhysicalVolume* pCurrentPhysicalVolume)
632 {
633  G4FieldManager* currentFieldMgr;
634 
635  currentFieldMgr = fDetectorFieldMgr;
636  if( pCurrentPhysicalVolume)
637  {
638  G4FieldManager *pRegionFieldMgr= 0, *localFieldMgr = 0;
639  G4LogicalVolume* pLogicalVol= pCurrentPhysicalVolume->GetLogicalVolume();
640 
641  if( pLogicalVol ) {
642  // Value for Region, if any, Overrides
643  G4Region* pRegion= pLogicalVol->GetRegion();
644  if( pRegion ) {
645  pRegionFieldMgr= pRegion->GetFieldManager();
646  if( pRegionFieldMgr )
647  currentFieldMgr= pRegionFieldMgr;
648  }
649 
650  // 'Local' Value from logical volume, if any, Overrides
651  localFieldMgr= pLogicalVol->GetFieldManager();
652  if ( localFieldMgr )
653  currentFieldMgr = localFieldMgr;
654  }
655  }
656  fCurrentFieldMgr= currentFieldMgr;
657 
658  // Flag that field manager has been set.
659  fSetFieldMgr= true;
660 
661  return currentFieldMgr;
662 }
663 
665 {
666  G4int oldval= fVerboseLevel;
667  fVerboseLevel= level;
668 
669  // Forward the verbose level 'reduced' to ChordFinder,
670  // MagIntegratorDriver ... ?
671  //
673  integrDriver->SetVerboseLevel( fVerboseLevel - 2 );
674  G4cout << "Set Driver verbosity to " << fVerboseLevel - 2 << G4endl;
675 
676  return oldval;
677 }
static const double cm
Definition: G4SIunits.hh:106
G4FieldManager * fCurrentFieldMgr
void SetEpsilonStep(G4double newEps)
G4VCurvedTrajectoryFilter * fpTrajectoryFilter
static const G4double kInfinity
Definition: geomdefs.hh:42
G4double GetCurveLength() const
std::vector< G4ThreeVector > * GimmeTrajectoryVectorAndForgetIt() const
CLHEP::Hep3Vector G4ThreeVector
void SetVerboseLevel(G4int newLevel)
virtual void TakeIntermediatePoint(G4ThreeVector newPoint)=0
void PrintStepLengthDiagnostic(G4double currentProposedStepLength, G4double decreaseFactor, G4double stepTrial, const G4FieldTrack &aFieldTrack)
G4double GetSurfaceTolerance() const
const G4ThreeVector & GetMomentumDir() const
G4double GetDeltaOneStep() const
std::vector< G4ThreeVector > * GimmeThePointsAndForgetThem()
G4PropagatorInField(G4Navigator *theNavigator, G4FieldManager *detectorFieldMgr, G4VIntersectionLocator *vLocator=0)
void SetChordFinderFor(G4ChordFinder *fCFinder)
G4Region * GetRegion() const
int G4int
Definition: G4Types.hh:78
G4ThreeVector fPreviousSftOrigin
G4int SetVerboseLevel(G4int verbose)
G4FieldManager * GetFieldManager() const
G4ThreeVector GetPosition() const
G4GLOB_DLL std::ostream G4cout
const G4String & GetName() const
static const double meter
Definition: G4SIunits.hh:72
bool G4bool
Definition: G4Types.hh:79
G4double GetMaximumEpsilonStep() const
G4FieldManager * FindAndSetFieldManager(G4VPhysicalVolume *pCurrentPhysVol)
void G4Exception(const char *originOfException, const char *exceptionCode, G4ExceptionSeverity severity, const char *comments)
Definition: G4Exception.cc:41
G4FieldManager * GetFieldManager() const
G4double AdvanceChordLimited(G4FieldTrack &yCurrent, G4double stepInitial, G4double epsStep_Relative, const G4ThreeVector latestSafetyOrigin, G4double lasestSafetyRadius)
static const double micrometer
Definition: G4SIunits.hh:90
G4double ComputeStep(G4FieldTrack &pFieldTrack, G4double pCurrentProposedStepLength, G4double &pNewSafety, G4VPhysicalVolume *pPhysVol=0)
G4double GetDeltaIntersection() const
G4LogicalVolume * GetLogicalVolume() const
T max(const T t1, const T t2)
brief Return the largest of the two arguments
G4ChordFinder * GetChordFinder()
T min(const T t1, const T t2)
brief Return the smallest of the two arguments
G4FieldManager * fDetectorFieldMgr
G4bool IntersectChord(const G4ThreeVector &StartPointA, const G4ThreeVector &EndPointB, G4double &NewSafety, G4double &LinearStepLength, G4ThreeVector &IntersectionPoint)
void SetTrajectoryFilter(G4VCurvedTrajectoryFilter *filter)
static const double millimeter
Definition: G4SIunits.hh:76
#define G4endl
Definition: G4ios.hh:61
void SetSafetyParametersFor(G4bool UseSafety)
G4FieldTrack End_PointAndTangent
G4ThreeVector GetMomentum() const
double G4double
Definition: G4Types.hh:76
G4MagInt_Driver * GetIntegrationDriver()
static const double mm
Definition: G4SIunits.hh:102
G4VPhysicalVolume * GetWorldVolume() const
void SetEpsilonStepFor(G4double EpsilonStep)
static G4GeometryTolerance * GetInstance()
virtual void LocateGlobalPointWithinVolume(const G4ThreeVector &position)
Definition: G4Navigator.cc:550
G4VIntersectionLocator * fIntersectionLocator
void SetDeltaIntersectionFor(G4double deltaIntersection)
void printStatus(const G4FieldTrack &startFT, const G4FieldTrack &currentFT, G4double requestStep, G4double safety, G4int step, G4VPhysicalVolume *startVolume)
G4double GetMinimumEpsilonStep() const