1 #ifndef ALIPMDCLUSTERING_H
2 #define ALIPMDCLUSTERING_H
3 /* Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *
4 * See cxx source for full Copyright notice */
5 //-----------------------------------------------------//
7 // Header File : PMDClustering.h, Version 00 //
9 // Date : September 26 2002 //
11 // clustering code for alice pmd //
13 //-----------------------------------------------------//
14 /* --------------------------------------------------------------------
15 Code developed by S. C. Phatak, Institute of Physics,
16 Bhubaneswar 751 005 ( phatak@iopb.res.in ) Given the energy deposited
17 ( or ADC value ) in each cell of supermodule ( pmd or cpv ), the code
18 builds up superclusters and breaks them into clusters. The input is
19 in array d[ndimx][ndimy] and cluster information is in array
20 clusters[5][5000]. integer clno gives total number of clusters in the
22 d, clno and clusters are the only global ( public ) variables. Others
23 are local ( private ) to the code.
24 At the moment, the data is read for whole detector ( all supermodules
25 and pmd as well as cpv. This will have to be modify later )
26 LAST UPDATE : October 23, 2002
27 -----------------------------------------------------------------------*/
33 class AliPMDClustering
38 virtual ~AliPMDClustering();
40 void DoClust(Double_t celladc[][96], TObjArray *pmdcont);
43 Int_t CrClust(Double_t ave, Double_t cutoff, Int_t nmx1);
44 void RefClust(Int_t incr);
45 void GaussFit(Int_t ncell, Int_t nclust, Double_t &x,
46 Double_t &y, Double_t &z, Double_t &xc,
47 Double_t &yc, Double_t &zc, Double_t &rc);
48 Double_t Distance(Double_t x1, Double_t y1,
49 Double_t x2, Double_t y2);
50 Double_t Ranmar() const;
51 void SetEdepCut(Float_t decut);
52 void SetDebug(Int_t idebug);
56 static const Double_t fgkSqroot3by2; // fgkSqroot3by2 = sqrt(3.)/2.
63 Proposed changes inNMX, kNDIMX and kNDIMY by S. C. Phatak to account
64 for rectangular ( vs rhomboid ) geometry.
65 To keep the clustering functional, we define a rhomboid which
66 superscribes the rectangle. So we need to pad up dummy cells in x
67 direction. The number of these cells is 96/2-1=47 in each row ( value
68 of x ). For first two rows, all dummy cells are to the left. For
69 every two rows add one cell to right and subtract one from left.
70 So previous (i,j) values go over to ( i',j) i'=i+(96-j)/2-1
71 Note we use C++ convention so i and j run from 0 to 47 or 95.
82 kNMX : # of cells in a supermodule
83 kNDIMX : maximum number of cells along x direction (origin at one corner)
84 kNDIMY : maximum number of cells along axis at 60 degrees with x axis
87 Double_t fEdepCell[kNDIMX][kNDIMY]; //energy(ADC) in each cell of the supermodule
88 Double_t fClusters[5][5000]; // Cluster informations
89 Int_t fClno; // number of clusters in a supermodule
92 clusters[0][i] --- x position of the cluster center
93 clusters[1][i] --- y position of the cluster center
94 clusters[2][i] --- total energy in the cluster
95 clusters[3][i] --- number of cells forming the cluster
96 ( possibly fractional )
97 clusters[4][i] --- cluster radius
100 Int_t fIord[2][kNMX]; // ordered list of i and j according to decreasing energy dep.
101 Int_t fInfocl[2][kNDIMX][kNDIMY]; // cellwise information on the cluster to which the cell
102 Int_t fInfcl[3][kNMX]; // cluster information [0][i] -- cluster number
103 Double_t fCoord[2][kNDIMX][kNDIMY];
106 fIord --- ordered list of i and j according to decreasing energy dep.
107 fInfocl --- cellwise information on the cluster to which the cell
108 belongs and whether it has largest energy dep. or not
109 ( now redundant - probably )
110 fInfcl --- cluster information [0][i] -- cluster number
111 [1][i] -- i of the cell
112 [2][i] -- j of the cell
113 coord --- x and y coordinates of center of each cell
116 Int_t fDebug; // Switch for debug (1:Print, 0:Noprint)
117 Float_t fCutoff; // Energy(ADC) cutoff per cell before clustering
119 ClassDef(AliPMDClustering,3) // Does clustering for PMD