| Geant4 Cross Reference |
1 // 1 //
2 // ******************************************* 2 // ********************************************************************
3 // * License and Disclaimer << 3 // * DISCLAIMER *
4 // * 4 // * *
5 // * The Geant4 software is copyright of th << 5 // * The following disclaimer summarizes all the specific disclaimers *
6 // * the Geant4 Collaboration. It is provided << 6 // * of contributors to this software. The specific disclaimers,which *
7 // * conditions of the Geant4 Software License << 7 // * govern, are listed with their locations in: *
8 // * LICENSE and available at http://cern.ch/ << 8 // * http://cern.ch/geant4/license *
9 // * include a list of copyright holders. <<
10 // * 9 // * *
11 // * Neither the authors of this software syst 10 // * Neither the authors of this software system, nor their employing *
12 // * institutes,nor the agencies providing fin 11 // * institutes,nor the agencies providing financial support for this *
13 // * work make any representation or warran 12 // * work make any representation or warranty, express or implied, *
14 // * regarding this software system or assum 13 // * regarding this software system or assume any liability for its *
15 // * use. Please see the license in the file << 14 // * use. *
16 // * for the full disclaimer and the limitatio <<
17 // * 15 // * *
18 // * This code implementation is the result << 16 // * This code implementation is the intellectual property of the *
19 // * technical work of the GEANT4 collaboratio << 17 // * GEANT4 collaboration. *
20 // * By using, copying, modifying or distri << 18 // * By copying, distributing or modifying the Program (or any work *
21 // * any work based on the software) you ag << 19 // * based on the Program) you indicate your acceptance of this *
22 // * use in resulting scientific publicati << 20 // * statement, and all its terms. *
23 // * acceptance of all terms of the Geant4 Sof <<
24 // ******************************************* 21 // ********************************************************************
25 // 22 //
26 // G4LineSection implementation <<
27 // 23 //
28 // Created: J.Apostolakis, 1999 << 24 // $Id: G4LineSection.cc,v 1.6 2001/12/04 15:10:01 grichine Exp $
29 // ------------------------------------------- << 25 // GEANT4 tag $Name: geant4-04-01 $
>> 26 //
>> 27 // typedef double G4double;
30 28
31 #include "G4LineSection.hh" 29 #include "G4LineSection.hh"
32 30
33 G4LineSection::G4LineSection( const G4ThreeVec 31 G4LineSection::G4LineSection( const G4ThreeVector& PntA,
34 const G4ThreeVec << 32 const G4ThreeVector& PntB )
35 : EndpointA(PntA), VecAtoB(PntB-PntA) << 33 : EndpointA(PntA),
>> 34 VecAtoB(PntB-PntA)
36 { 35 {
37 fABdistanceSq = VecAtoB.mag2(); << 36 fABdistanceSq = VecAtoB.mag2() ;
>> 37 /*
>> 38 G4double distABsquared = VecAtoB.mag2() ;
>> 39 if ( distABsquared == 0.0)
>> 40 {
>> 41 G4Exception("Equal points in G4LineSection::G4LineSection: line->point ?") ;
>> 42 }
>> 43 else
>> 44 {
>> 45 inverse_square_distAB=1.0 / distABsquared ;
>> 46 }
>> 47 */
38 } 48 }
39 49
40 G4double G4LineSection::Dist( const G4ThreeVec << 50 G4double G4LineSection::Dist( G4ThreeVector OtherPnt ) const
41 { 51 {
42 G4double dist_sq; 52 G4double dist_sq;
43 G4ThreeVector VecAZ; 53 G4ThreeVector VecAZ;
44 G4double sq_VecAZ, inner_prod, unit_projecti 54 G4double sq_VecAZ, inner_prod, unit_projection ;
45 55
46 VecAZ= OtherPnt - EndpointA; 56 VecAZ= OtherPnt - EndpointA;
47 sq_VecAZ = VecAZ.mag2(); 57 sq_VecAZ = VecAZ.mag2();
48 58
49 inner_prod= VecAtoB.dot( VecAZ ); 59 inner_prod= VecAtoB.dot( VecAZ );
50 60
51 // Determine Projection(AZ on AB) / Length 61 // Determine Projection(AZ on AB) / Length(AB)
52 // 62 //
53 if( fABdistanceSq != 0.0 ) 63 if( fABdistanceSq != 0.0 )
54 { 64 {
55 // unit_projection= inner_prod * InvsqDis 65 // unit_projection= inner_prod * InvsqDistAB();
56 unit_projection = inner_prod/fABdistanceSq 66 unit_projection = inner_prod/fABdistanceSq;
57 67
58 if( (0. <= unit_projection ) && (unit_proj 68 if( (0. <= unit_projection ) && (unit_projection <= 1.0 ) )
59 { 69 {
60 dist_sq= sq_VecAZ - unit_projection * i 70 dist_sq= sq_VecAZ - unit_projection * inner_prod ;
61 } 71 }
62 else 72 else
63 { 73 {
64 // The perpendicular from the point to t 74 // The perpendicular from the point to the line AB meets the line
65 // in a point outside the line segment! 75 // in a point outside the line segment!
66 76
67 if( unit_projection < 0. ) // A is the c 77 if( unit_projection < 0. ) // A is the closest point
68 { 78 {
69 dist_sq= sq_VecAZ; 79 dist_sq= sq_VecAZ;
70 } 80 }
71 else // B is the c 81 else // B is the closest point
72 { 82 {
73 G4ThreeVector EndpointB = EndpointA << 83 G4ThreeVector EndpointB = EndpointA + VecAtoB;
74 G4ThreeVector VecBZ = OtherPnt - 84 G4ThreeVector VecBZ = OtherPnt - EndpointB;
75 dist_sq = VecBZ.mag2(); 85 dist_sq = VecBZ.mag2();
76 } 86 }
77 } 87 }
78 } 88 }
79 else 89 else
80 { 90 {
81 dist_sq = (OtherPnt - EndpointA).mag2() ; 91 dist_sq = (OtherPnt - EndpointA).mag2() ;
82 } 92 }
83 if( dist_sq < 0.0 ) << 93 if( dist_sq < 0.0 ) dist_sq = 0.0 ;
84 { <<
85 dist_sq = 0.0 ; <<
86 } <<
87 94
88 return std::sqrt(dist_sq) ; << 95 return sqrt(dist_sq) ;
89 } 96 }
>> 97
>> 98 G4double G4LineSection::Distline( const G4ThreeVector& OtherPnt,
>> 99 const G4ThreeVector& LinePntA,
>> 100 const G4ThreeVector& LinePntB )
>> 101 {
>> 102 G4LineSection LineAB( LinePntA, LinePntB ); // Line from A to B
>> 103
>> 104 return LineAB.Dist( OtherPnt );
>> 105 }
>> 106
>> 107
90 108