]>
Commit | Line | Data |
---|---|---|
0df3ca52 | 1 | #ifndef ALIMUONCLUSTERFINDERAZ_H |
2 | #define ALIMUONCLUSTERFINDERAZ_H | |
3 | /* Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. * | |
4 | * See cxx source for full Copyright notice */ | |
5 | ||
30178c30 | 6 | /* $Id$ */ |
7 | // Revision of includes 07/05/2004 | |
8 | ||
9 | #include "AliMUONClusterFinderVS.h" | |
10 | ||
0df3ca52 | 11 | class TH2F; |
12 | class TH2D; | |
13 | class TClonesArray; | |
0df3ca52 | 14 | class TMinuit; |
15 | class TMatrixD; | |
0df3ca52 | 16 | |
30178c30 | 17 | class AliSegmentation; |
18 | class AliMUONResponse; | |
19 | class AliMUONPixel; | |
0df3ca52 | 20 | |
30178c30 | 21 | class AliMUONClusterFinderAZ : public AliMUONClusterFinderVS |
22 | { | |
23 | public: | |
2b1e4f0e | 24 | AliMUONClusterFinderAZ(Bool_t draw = 0, Int_t iReco = 1);// Constructor |
0df3ca52 | 25 | virtual ~AliMUONClusterFinderAZ(); // Destructor |
26 | ||
9e993f2a | 27 | void FindRawClusters(); // the same interface as for old cluster finder |
28 | void EventLoop(Int_t nev, Int_t ch); // first event | |
30178c30 | 29 | Bool_t TestTrack(Int_t t) const; // test if track was selected |
9e993f2a | 30 | |
31 | protected: | |
74f7bbc5 | 32 | AliMUONClusterFinderAZ(const AliMUONClusterFinderAZ& rhs); |
33 | AliMUONClusterFinderAZ& operator=(const AliMUONClusterFinderAZ& rhs); | |
0df3ca52 | 34 | |
35 | private: | |
343146bf | 36 | // Some constants |
2b1e4f0e | 37 | static const Int_t fgkDim = 10000; // array size |
343146bf | 38 | static const Double_t fgkCouplMin; // threshold on coupling |
39 | ||
74f7bbc5 | 40 | static AliMUONClusterFinderAZ* fgClusterFinder; // the ClusterFinderAZ instance |
9e993f2a | 41 | |
42 | Int_t fnPads[2]; // ! number of pads in the cluster on 2 cathodes | |
2b1e4f0e | 43 | Float_t fXyq[7][fgkDim]; // ! pad information |
343146bf | 44 | Int_t fPadIJ[2][fgkDim]; // ! pad information |
2b1e4f0e | 45 | //AZ AliSegmentation *fSegmentation[2]; // ! old segmentation |
46 | AliMUONGeometrySegmentation *fSegmentation[2]; // ! new segmentation | |
9e993f2a | 47 | AliMUONResponse *fResponse;// ! response |
48 | Float_t fZpad; // ! z-coordinate of the hit | |
49 | Int_t fNpar; // ! number of fit parameters | |
50 | Double_t fQtot; // ! total cluster charge | |
2b1e4f0e | 51 | Int_t fReco; // ! =1 if run reco with writing of reconstructed clusters |
9e993f2a | 52 | |
53 | static TMinuit* fgMinuit; // ! Fitter | |
343146bf | 54 | Bool_t fUsed[2][fgkDim]; // ! flags for used pads |
9e993f2a | 55 | TH2F* fHist[4]; // ! histograms |
0df3ca52 | 56 | TClonesArray *fMuonDigits; // ! pointer to digits |
9e993f2a | 57 | Bool_t fDraw; // ! draw flag |
2b1e4f0e | 58 | Int_t fnMu; // ! number of muons passing thru the selected area |
9e993f2a | 59 | Double_t fxyMu[2][7]; // ! muon information |
2b1e4f0e | 60 | TObjArray* fPixArray; // ! collection of pixels |
61 | Int_t fnCoupled; // ! number of coupled clusters in precluster | |
62 | Int_t fDebug; // ! debug level | |
0df3ca52 | 63 | |
64 | // Functions | |
65 | ||
9e993f2a | 66 | void ModifyHistos(void); // modify histograms |
67 | void AddPad(Int_t cath, Int_t digit); // add a pad to the cluster | |
2b1e4f0e | 68 | //AZ Bool_t Overlap(Int_t cath, TObject *dig); // check if the pad from one cathode overlaps with a pad in the cluster on the other cathode |
69 | Bool_t Overlap(Int_t cath, AliMUONDigit *dig); // check if the pad from one cathode overlaps with a pad in the cluster on the other cathode | |
0df3ca52 | 70 | Bool_t Overlap(Float_t *xy1, Int_t iPad, Float_t *xy12, Int_t iSkip); // check if pads xy1 and iPad overlap and return overlap area |
71 | Bool_t CheckPrecluster(Int_t *nShown); // check precluster to simplify it (if possible) | |
9e993f2a | 72 | void BuildPixArray(); // build array of pixels |
2b1e4f0e | 73 | void AdjustPixel(Float_t width, Int_t ixy); // adjust size of small pixels |
74 | void AdjustPixel(Float_t wxmin, Float_t wymin); // adjust size of large pixels | |
75 | Bool_t MainLoop(Int_t iSimple); // repeat MLEM algorithm until pixels become sufficiently small | |
76 | void Mlem(Double_t *coef, Double_t *probi, Int_t nIter); // use MLEM for cluster finding | |
9e993f2a | 77 | void FindCOG(TH2D *mlem, Double_t *xyc); // find COG position around maximum bin |
78 | Int_t FindNearest(AliMUONPixel *pixPtr0); // find nearest neighbouring pixel to the given one | |
79 | void Split(TH2D *mlem, Double_t *coef); // steering function for pixels | |
80 | void AddBin(TH2D *mlem, Int_t ic, Int_t jc, Int_t mode, Bool_t* used, TObjArray *pix); // add a bin to the cluster | |
0df3ca52 | 81 | TObject* BinToPix(TH2D *mlem, Int_t jc, Int_t ic); // hist. bin-to-pixel |
9e993f2a | 82 | void AddCluster(Int_t ic, Int_t nclust, TMatrixD *aijcluclu, Bool_t *used, Int_t *clustNumb, Int_t &nCoupled); // add a cluster to the group of coupled clusters |
c1aed84f | 83 | Double_t MinGroupCoupl(Int_t nCoupled, Int_t *clustNumb, TMatrixD *aijcluclu, Int_t *minGroup); // find group of cluster with min. coupling to others |
9e993f2a | 84 | Int_t SelectPad(Int_t nCoupled, Int_t nForFit, Int_t *clustNumb, Int_t *clustFit, TMatrixD *aijcluclu); //select pads for fit |
85 | void Merge(Int_t nForFit, Int_t nCoupled, Int_t *clustNumb, Int_t *clustFit, TObjArray **clusters, TMatrixD *aijcluclu, TMatrixD *aijclupad); // merge clusters | |
86 | Int_t Fit(Int_t nfit, Int_t *clustFit, TObjArray **clusters, Double_t *parOk); // do the fitting | |
87 | void UpdatePads(Int_t nfit, Double_t *par); // subtract fitted charges from pads | |
2b1e4f0e | 88 | void AddRawCluster(Double_t x, Double_t y, Double_t qTot, Double_t fmin, Int_t nfit, Int_t *tracks, Double_t sigx, Double_t sigy, Double_t dist); // add new reconstructed cluster |
0df3ca52 | 89 | Int_t FindLocalMaxima(Int_t *localMax, Double_t *maxVal); // find local maxima |
9e993f2a | 90 | void FlagLocalMax(TH2D *hist, Int_t i, Int_t j, Int_t *isLocalMax); // flag local max |
91 | void FindCluster(Int_t *localMax, Int_t iMax); // find cluster around local max | |
2b1e4f0e | 92 | void AddVirtualPad(); // add virtual pads for some clusters (if necessary) |
93 | void PadsInXandY(Int_t &nInX, Int_t &nInY); // get number of pads in X and Y | |
94 | // This function is used for fitting | |
95 | void Fcn1(Int_t &npar, Double_t *gin, Double_t &f, Double_t *par, Int_t iflag); | |
96 | void Simple(); // process simple cluster | |
97 | ||
98 | void Errors(AliMUONRawCluster *clus); // correct coordinates and eval. errors | |
99 | void Errors(Int_t ny, Int_t nx, Int_t iby, Int_t ibx, Double_t fmin, | |
100 | Double_t wy, Double_t wx, Int_t iover, | |
101 | Double_t dyc, Double_t dxc, Double_t qtot, | |
102 | Double_t &yrec, Double_t &xrec, Double_t &erry, Double_t &errx); | |
103 | void DrawCluster(Int_t nev0, Int_t ch0); // draw precluster | |
104 | Int_t Next(Int_t &nev0, Int_t &ch0); // commands for drawing | |
f161a467 | 105 | |
2b1e4f0e | 106 | // Dummy methods for overloading warnings |
f161a467 | 107 | void FindCluster(int, int, int, AliMUONRawCluster&) {return;} |
108 | void FindLocalMaxima(AliMUONRawCluster*) {return;} | |
109 | void Split(AliMUONRawCluster*) {return;} | |
9a8c01b2 | 110 | void AddRawCluster(AliMUONRawCluster&) {return;} |
f161a467 | 111 | |
2b1e4f0e | 112 | ClassDef(AliMUONClusterFinderAZ,0) // cluster finder in MUON arm of ALICE |
74f7bbc5 | 113 | }; |
114 | ||
0df3ca52 | 115 | #endif |