| 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 // Implementation of G4EnclosingCylinder, a ut <<
27 // for a quick check of geometry. <<
28 // 26 //
29 // Author: David C. Williams (davidw@scipp.ucs << 27 // $Id: G4EnclosingCylinder.cc,v 1.11 2010/07/12 15:25:37 gcosmo Exp $
>> 28 // GEANT4 tag $Name: geant4-09-04 $
>> 29 //
>> 30 //
>> 31 // --------------------------------------------------------------------
>> 32 // GEANT 4 class source file
>> 33 //
>> 34 //
>> 35 // G4EnclosingCylinder.cc
>> 36 //
>> 37 // Implementation of a utility class for a quick check of geometry.
>> 38 //
30 // ------------------------------------------- 39 // --------------------------------------------------------------------
31 40
32 #include "G4EnclosingCylinder.hh" 41 #include "G4EnclosingCylinder.hh"
33 #include "G4PhysicalConstants.hh" <<
34 #include "G4ReduciblePolygon.hh" 42 #include "G4ReduciblePolygon.hh"
35 #include "G4GeometryTolerance.hh" 43 #include "G4GeometryTolerance.hh"
36 44
>> 45 //
37 // Constructor 46 // Constructor
38 // 47 //
39 G4EnclosingCylinder::G4EnclosingCylinder( cons << 48 G4EnclosingCylinder::G4EnclosingCylinder( const G4ReduciblePolygon *rz,
40 49 G4bool thePhiIsOpen,
41 50 G4double theStartPhi,
42 51 G4double theTotalPhi )
43 : startPhi(theStartPhi), totalPhi(theTotalPh 52 : startPhi(theStartPhi), totalPhi(theTotalPhi),
>> 53 rx1(0.), ry1(0.), dx1(0.), dy1(0.),
>> 54 rx2(0.), ry2(0.), dx2(0.), dy2(0.),
44 concave(theTotalPhi > pi) 55 concave(theTotalPhi > pi)
45 { 56 {
46 // 57 //
47 // Obtain largest r and smallest and largest 58 // Obtain largest r and smallest and largest z
48 // 59 //
49 radius = rz->Amax(); 60 radius = rz->Amax();
50 zHi = rz->Bmax(); 61 zHi = rz->Bmax();
51 zLo = rz->Bmin(); 62 zLo = rz->Bmin();
52 63
53 G4double kCarTolerance = G4GeometryTolerance 64 G4double kCarTolerance = G4GeometryTolerance::GetInstance()
54 ->GetSurfaceToleran 65 ->GetSurfaceTolerance();
55 // 66 //
56 // Save phi info 67 // Save phi info
57 // 68 //
58 phiIsOpen = thePhiIsOpen; 69 phiIsOpen = thePhiIsOpen;
59 if ( phiIsOpen ) 70 if ( phiIsOpen )
60 { 71 {
61 rx1 = std::cos(startPhi); 72 rx1 = std::cos(startPhi);
62 ry1 = std::sin(startPhi); 73 ry1 = std::sin(startPhi);
63 dx1 = +ry1*10*kCarTolerance; 74 dx1 = +ry1*10*kCarTolerance;
64 dy1 = -rx1*10*kCarTolerance; 75 dy1 = -rx1*10*kCarTolerance;
65 76
66 rx2 = std::cos(startPhi+totalPhi); 77 rx2 = std::cos(startPhi+totalPhi);
67 ry2 = std::sin(startPhi+totalPhi); 78 ry2 = std::sin(startPhi+totalPhi);
68 dx2 = -ry2*10*kCarTolerance; 79 dx2 = -ry2*10*kCarTolerance;
69 dy2 = +rx2*10*kCarTolerance; 80 dy2 = +rx2*10*kCarTolerance;
70 } 81 }
71 82
72 // 83 //
73 // Add safety 84 // Add safety
74 // 85 //
75 radius += 10*kCarTolerance; 86 radius += 10*kCarTolerance;
76 zLo -= 10*kCarTolerance; 87 zLo -= 10*kCarTolerance;
77 zHi += 10*kCarTolerance; 88 zHi += 10*kCarTolerance;
78 } 89 }
79 90
>> 91 //
80 // Fake default constructor - sets only member 92 // Fake default constructor - sets only member data and allocates memory
81 // for usage restri 93 // for usage restricted to object persistency.
82 // 94 //
83 G4EnclosingCylinder::G4EnclosingCylinder( __vo 95 G4EnclosingCylinder::G4EnclosingCylinder( __void__& )
84 : radius(0.), zLo(0.), zHi(0.), phiIsOpen(fals << 96 : radius(0.), zLo(0.), zHi(0.), phiIsOpen(0.), startPhi(0.), totalPhi(0.),
>> 97 rx1(0.), ry1(0.), dx1(0.), dy1(0.), rx2(0.), ry2(0.), dx2(0.), dy2(0.),
85 concave(false) 98 concave(false)
86 { 99 {
87 } 100 }
88 101
>> 102 //
>> 103 // Destructor
>> 104 //
>> 105 G4EnclosingCylinder::~G4EnclosingCylinder()
>> 106 {
>> 107 }
>> 108
>> 109
>> 110 //
89 // Outside 111 // Outside
90 // 112 //
91 // Decide very rapidly if the point is outside 113 // Decide very rapidly if the point is outside the cylinder
92 // 114 //
93 // If one is not certain, return false 115 // If one is not certain, return false
94 // 116 //
95 G4bool G4EnclosingCylinder::MustBeOutside( con << 117 G4bool G4EnclosingCylinder::MustBeOutside( const G4ThreeVector &p ) const
96 { 118 {
97 if (p.perp() > radius) return true; 119 if (p.perp() > radius) return true;
98 if (p.z() < zLo) return true; 120 if (p.z() < zLo) return true;
99 if (p.z() > zHi) return true; 121 if (p.z() > zHi) return true;
100 122
101 if (phiIsOpen) 123 if (phiIsOpen)
102 { 124 {
103 if (concave) 125 if (concave)
104 { 126 {
105 if ( ((p.x()-dx1)*ry1 - (p.y()-dy1)*rx1) 127 if ( ((p.x()-dx1)*ry1 - (p.y()-dy1)*rx1) < 0) return false;
106 if ( ((p.x()-dx2)*ry2 - (p.y()-dy2)*rx2) 128 if ( ((p.x()-dx2)*ry2 - (p.y()-dy2)*rx2) > 0) return false;
107 } 129 }
108 else 130 else
109 { 131 {
110 if ( ((p.x()-dx1)*ry1 - (p.y()-dy1)*rx1) 132 if ( ((p.x()-dx1)*ry1 - (p.y()-dy1)*rx1) > 0) return true;
111 if ( ((p.x()-dx2)*ry2 - (p.y()-dy2)*rx2) 133 if ( ((p.x()-dx2)*ry2 - (p.y()-dy2)*rx2) < 0) return true;
112 } 134 }
113 } 135 }
114 136
115 return false; 137 return false;
116 } 138 }
117 << 139
>> 140
>> 141 //
118 // Misses 142 // Misses
119 // 143 //
120 // Decide very rapidly if the trajectory is go 144 // Decide very rapidly if the trajectory is going to miss the cylinder
121 // 145 //
122 // If one is not sure, return false 146 // If one is not sure, return false
123 // 147 //
124 G4bool G4EnclosingCylinder::ShouldMiss( const << 148 G4bool G4EnclosingCylinder::ShouldMiss( const G4ThreeVector &p,
125 const << 149 const G4ThreeVector &v ) const
126 { 150 {
127 if (!MustBeOutside(p)) return false; 151 if (!MustBeOutside(p)) return false;
128 152
129 G4double cross = p.x()*v.y() - p.y()*v.x(); 153 G4double cross = p.x()*v.y() - p.y()*v.x();
130 if (cross > radius) return true; 154 if (cross > radius) return true;
131 155
132 if (p.perp() > radius) 156 if (p.perp() > radius)
133 { 157 {
134 G4double dot = p.x()*v.x() + p.y()*v.y(); 158 G4double dot = p.x()*v.x() + p.y()*v.y();
135 if (dot > 0) return true; 159 if (dot > 0) return true;
136 } 160 }
137 161
138 return false; 162 return false;
139 } 163 }
140 164