1 /**************************************************************************
2 * Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *
4 * Author: The ALICE Off-line Project. *
5 * Contributors are mentioned in the code where appropriate. *
7 * Permission to use, copy, modify and distribute this software and its *
8 * documentation strictly for non-commercial purposes is hereby granted *
9 * without fee, provided that the above copyright notice appears in all *
10 * copies and that both the copyright notice and this permission notice *
11 * appear in the supporting documentation. The authors make no claims *
12 * about the suitability of this software for any purpose. It is *
13 * provided "as is" without express or implied warranty. *
14 **************************************************************************/
18 Revision 1.5 2000/10/04 18:50:05 morsch
19 In Init(): (*fDpxD)[fNsec-1]=fDpx;
21 Revision 1.4 2000/10/03 21:48:07 morsch
22 Adopt to const declaration of some of the methods in AliSegmentation.
24 Revision 1.3 2000/06/29 12:34:09 morsch
25 AliMUONSegmentation class has been made independent of AliMUONChamber. This makes
26 it usable with any other geometry class. The link to the object to which it belongs is
27 established via an index. This assumes that there exists a global geometry manager
28 from which the pointer to the parent object can be obtained (in our case gAlice).
30 Revision 1.2 2000/06/15 07:58:48 morsch
31 Code from MUON-dev joined
33 Revision 1.1.2.1 2000/06/09 21:38:15 morsch
34 AliMUONSegmentationV04 code from AliMUONSegResV04.cxx
38 /////////////////////////////////////////////////////
39 // Segmentation and Response classes version 04 //
40 /////////////////////////////////////////////////////
43 #include "AliMUONSegmentationV04.h"
44 #include "AliMUONChamber.h"
50 //___________________________________________
51 ClassImp(AliMUONSegmentationV04)
54 void AliMUONSegmentationV04::Init(Int_t chamber)
56 printf("\n Initialise Segmentation V04 \n");
58 // Fill the arrays fCx (x-contour) and fNpxS (ix-contour) for each sector
59 // These arrays help in converting from real to pad co-ordinates and
62 // Segmentation is defined by rectangular modules approximating
63 // concentric circles as shown below
65 // PCB module size in cm
66 const Float_t kDxPCB=40, kDyPCB=40;
67 // PCB distribution (7 rows with 1+3 segmentation regions)
68 const Int_t kpcb[7][4] = {{1, 2, 2, 2},
80 // 3 3 3 2 2 | 2 2 3 3 3
81 // 3 3 3 2 2 2 | 2 2 2 3 3 3
82 // 3 3 2 2 1 1 | 1 1 2 2 3 3
83 // 3 3 2 2 1 1 1 | 1 1 1 2 2 3 3
84 // 3 3 2 2 1 1 0 | 0 1 1 2 2 3 3
85 // ------------------------------
86 // 3 3 2 2 1 1 0 | 0 1 1 2 2 3 3
87 // 3 3 2 2 1 1 1 | 1 1 1 2 2 3 3
88 // 3 3 2 2 1 1 | 1 1 2 2 3 3
89 // 3 3 3 2 2 2 | 2 2 2 3 3 3
90 // 3 3 3 2 2 | 2 2 3 3 3
94 // number of pad rows per PCB
96 Int_t nPyPCB=Int_t(kDyPCB/fDpy);
98 // maximum number of pad rows
101 // Calculate padsize along x
102 (*fDpxD)[fNsec-1]=fDpx;
104 for (Int_t i=fNsec-2; i>=0; i--){
105 (*fDpxD)[i]=(*fDpxD)[fNsec-1]/(*fNDiv)[i];
109 // fill the arrays defining the pad segmentation boundaries
111 // loop over pcb module rows
113 for (Int_t irow=0; irow<7; irow++) {
115 // loop over pads along the anode wires
116 for (Int_t i=0; i<=nPyPCB; i++) {
117 // iy counts the padrow
119 // Loop over sectors (isec=0 is the dead space surounding the beam pipe)
120 for (Int_t isec=0; isec<4; isec++) {
122 fNpxS[0][iy]=kpcb[irow][0]*Int_t(kDxPCB/(*fDpxD)[0]);
123 fCx[0][iy]=kpcb[irow][0]*kDxPCB;
125 fNpxS[isec][iy]=fNpxS[isec-1][iy]
126 +kpcb[irow][isec]*Int_t(kDxPCB/(*fDpxD)[isec]);
128 fCx[isec][iy]=fCx[isec-1][iy]
129 +kpcb[irow][isec]*kDxPCB;
132 } // pad raws in module
135 AliMUON *pMUON = (AliMUON *) gAlice->GetModule("MUON");
136 fChamber=&(pMUON->Chamber(chamber));
140 void AliMUONSegmentationV04::GiveTestPoints(Int_t &n, Float_t *x, Float_t *y) const
142 // Returns test point on the pad plane.
143 // Used during determination of the segmoid correction of the COG-method
145 x[0]=(fCx[1][1]+fCx[0][1])/2/TMath::Sqrt(2.);
147 x[1]=(fCx[2][1]+fCx[1][1])/2/TMath::Sqrt(2.);
149 x[2]=(fCx[3][1]+fCx[2][1])/2/TMath::Sqrt(2.);