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