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.3 2000/06/29 12:34:09 morsch
19 AliMUONSegmentation class has been made independent of AliMUONChamber. This makes
20 it usable with any other geometry class. The link to the object to which it belongs is
21 established via an index. This assumes that there exists a global geometry manager
22 from which the pointer to the parent object can be obtained (in our case gAlice).
24 Revision 1.2 2000/06/15 07:58:48 morsch
25 Code from MUON-dev joined
27 Revision 1.1.2.1 2000/06/09 21:38:15 morsch
28 AliMUONSegmentationV04 code from AliMUONSegResV04.cxx
32 /////////////////////////////////////////////////////
33 // Segmentation and Response classes version 04 //
34 /////////////////////////////////////////////////////
37 #include "AliMUONSegmentationV04.h"
40 //___________________________________________
41 ClassImp(AliMUONSegmentationV04)
44 void AliMUONSegmentationV04::Init(Int_t chamber)
46 printf("\n Initialise segmentation v04 \n");
48 // Fill the arrays fCx (x-contour) and fNpxS (ix-contour) for each sector
49 // These arrays help in converting from real to pad co-ordinates and
52 // Segmentation is defined by rectangular modules approximating
53 // concentric circles as shown below
55 // PCB module size in cm
56 const Float_t kDxPCB=40, kDyPCB=40;
57 // PCB distribution (7 rows with 1+3 segmentation regions)
58 const Int_t kpcb[7][4] = {{1, 2, 2, 2},
70 // 3 3 3 2 2 | 2 2 3 3 3
71 // 3 3 3 2 2 2 | 2 2 2 3 3 3
72 // 3 3 2 2 1 1 | 1 1 2 2 3 3
73 // 3 3 2 2 1 1 1 | 1 1 1 2 2 3 3
74 // 3 3 2 2 1 1 0 | 0 1 1 2 2 3 3
75 // ------------------------------
76 // 3 3 2 2 1 1 0 | 0 1 1 2 2 3 3
77 // 3 3 2 2 1 1 1 | 1 1 1 2 2 3 3
78 // 3 3 2 2 1 1 | 1 1 2 2 3 3
79 // 3 3 3 2 2 2 | 2 2 2 3 3 3
80 // 3 3 3 2 2 | 2 2 3 3 3
84 // number of pad rows per PCB
86 Int_t nPyPCB=Int_t(kDyPCB/fDpy);
88 // maximum number of pad rows
91 // Calculate padsize along x
94 for (Int_t i=fNsec-2; i>=0; i--){
95 (*fDpxD)[i]=(*fDpxD)[fNsec-1]/(*fNDiv)[i];
96 printf("\n test ---dx %d %f \n",i,(*fDpxD)[i]);
100 // fill the arrays defining the pad segmentation boundaries
102 // loop over pcb module rows
104 for (Int_t irow=0; irow<7; irow++) {
106 // loop over pads along the anode wires
107 for (Int_t i=0; i<=nPyPCB; i++) {
108 // iy counts the padrow
110 // Loop over sectors (isec=0 is the dead space surounding the beam pipe)
111 for (Int_t isec=0; isec<4; isec++) {
113 fNpxS[0][iy]=kpcb[irow][0]*Int_t(kDxPCB/(*fDpxD)[0]);
114 fCx[0][iy]=kpcb[irow][0]*kDxPCB;
116 fNpxS[isec][iy]=fNpxS[isec-1][iy]
117 +kpcb[irow][isec]*Int_t(kDxPCB/(*fDpxD)[isec]);
119 fCx[isec][iy]=fCx[isec-1][iy]
120 +kpcb[irow][isec]*kDxPCB;
123 } // pad raws in module
127 void AliMUONSegmentationV04::GiveTestPoints(Int_t &n, Float_t *x, Float_t *y) const
129 // Returns test point on the pad plane.
130 // Used during determination of the segmoid correction of the COG-method
132 x[0]=(fCx[1][1]+fCx[0][1])/2/TMath::Sqrt(2.);
134 x[1]=(fCx[2][1]+fCx[1][1])/2/TMath::Sqrt(2.);
136 x[2]=(fCx[3][1]+fCx[2][1])/2/TMath::Sqrt(2.);