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/18 11:42:06 morsch
19 - AliMUONRawCluster contains z-position.
20 - Some clean-up of useless print statements during initialisations.
22 Revision 1.4 2000/10/03 21:48:07 morsch
23 Adopt to const declaration of some of the methods in AliSegmentation.
25 Revision 1.3 2000/06/29 12:34:09 morsch
26 AliMUONSegmentation class has been made independent of AliMUONChamber. This makes
27 it usable with any other geometry class. The link to the object to which it belongs is
28 established via an index. This assumes that there exists a global geometry manager
29 from which the pointer to the parent object can be obtained (in our case gAlice).
31 Revision 1.2 2000/06/15 07:58:48 morsch
32 Code from MUON-dev joined
34 Revision 1.1.2.1 2000/06/09 21:38:46 morsch
35 AliMUONSegmentationV05 code from AliMUONSegResV05.cxx
39 /////////////////////////////////////////////////////
40 // Segmentation and Response classes version 05 //
41 /////////////////////////////////////////////////////
44 #include "AliMUONSegmentationV05.h"
46 #include "AliMUONChamber.h"
50 //___________________________________________
51 ClassImp(AliMUONSegmentationV05)
54 void AliMUONSegmentationV05::Init(Int_t chamber)
57 // Fill the arrays fCx (x-contour) and fNpxS (ix-contour) for each sector
58 // These arrays help in converting from real to pad co-ordinates and
61 // Segmentation is defined by rectangular modules approximating
62 // concentric circles as shown below
65 printf("\n Initialise Segmentation V05 \n");
68 // PCB module size in cm
69 const Float_t kDxPCB=40, kDyPCB=40;
70 // PCB distribution (7 rows with 1+3 segmentation regions)
71 const Int_t kpcb[7][4] = {{1, 2, 2, 2},
83 // 3 3 3 2 2 | 2 2 3 3 3
84 // 3 3 3 2 2 2 | 2 2 2 3 3 3
85 // 3 3 2 2 1 1 | 1 1 2 2 3 3
86 // 3 3 2 2 1 1 1 | 1 1 1 2 2 3 3
87 // 3 3 2 2 1 1 0 | 0 1 1 2 2 3 3
88 // ------------------------------
89 // 3 3 2 2 1 1 0 | 0 1 1 2 2 3 3
90 // 3 3 2 2 1 1 1 | 1 1 1 2 2 3 3
91 // 3 3 2 2 1 1 | 1 1 2 2 3 3
92 // 3 3 3 2 2 2 | 2 2 2 3 3 3
93 // 3 3 3 2 2 | 2 2 3 3 3
97 // number of pad rows per PCB
99 Int_t nPyPCB=Int_t(kDyPCB/fDpy);
101 // maximum number of pad rows
104 // Calculate padsize along x
105 (*fDpxD)[fNsec-1]=fDpx;
107 for (Int_t i=fNsec-2; i>=0; i--){
108 (*fDpxD)[i]=(*fDpxD)[fNsec-1]/(*fNDiv)[i];
112 // fill the arrays defining the pad segmentation boundaries
114 // loop over pcb module rows
116 for (Int_t irow=0; irow<7; irow++) {
118 // loop over pads along the anode wires
119 for (Int_t i=0; i<=nPyPCB; i++) {
120 // iy counts the padrow
122 // Loop over sectors (isec=0 is the dead space surounding the beam pipe)
123 for (Int_t isec=0; isec<4; isec++) {
125 fNpxS[0][iy]=kpcb[irow][0]*Int_t(kDxPCB/(*fDpxD)[0]);
126 fCx[0][iy]=kpcb[irow][0]*kDxPCB;
128 fNpxS[isec][iy]=fNpxS[isec-1][iy]
129 +kpcb[irow][isec]*Int_t(kDxPCB/(*fDpxD)[isec]);
131 fCx[isec][iy]=fCx[isec-1][iy]
132 +kpcb[irow][isec]*kDxPCB;
135 } // pad raws in module
138 AliMUON *pMUON = (AliMUON *) gAlice->GetModule("MUON");
139 fChamber=&(pMUON->Chamber(chamber));
143 void AliMUONSegmentationV05::GiveTestPoints(Int_t &n, Float_t *x, Float_t *y) const
145 // Returns test point on the pad plane.
146 // Used during determination of the segmoid correction of the COG-method
148 x[0]=(fCx[1][1]+fCx[0][1])/2/TMath::Sqrt(2.);