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 */
7 // Revision of includes 07/05/2004
10 /// \class AliMUONClusterFinderAZ
11 /// \brief Cluster finder in MUON arm of ALICE
13 #include "AliMUONClusterFinderVS.h"
21 class AliSegmentation;
22 class AliMUONResponse;
25 class AliMUONClusterFinderAZ : public AliMUONClusterFinderVS
28 AliMUONClusterFinderAZ(Bool_t draw = 0, Int_t iReco = 1);// Constructor
29 virtual ~AliMUONClusterFinderAZ(); // Destructor
31 void FindRawClusters(); // the same interface as for old cluster finder
32 void EventLoop(Int_t nev, Int_t ch); // first event
33 Bool_t TestTrack(Int_t t) const; // test if track was selected
36 AliMUONClusterFinderAZ(const AliMUONClusterFinderAZ& rhs);
37 AliMUONClusterFinderAZ& operator=(const AliMUONClusterFinderAZ& rhs);
41 static const Int_t fgkDim = 10000; // array size
42 static const Double_t fgkCouplMin; // threshold on coupling
44 static AliMUONClusterFinderAZ* fgClusterFinder; // the ClusterFinderAZ instance
46 Int_t fnPads[2]; // ! number of pads in the cluster on 2 cathodes
47 Float_t fXyq[7][fgkDim]; // ! pad information
48 Int_t fPadIJ[2][fgkDim]; // ! pad information
49 //AZ AliSegmentation *fSegmentation[2]; // ! old segmentation
50 AliMUONGeometrySegmentation *fSegmentation[2]; // ! new segmentation
51 AliMUONResponse *fResponse;// ! response
52 Float_t fZpad; // ! z-coordinate of the hit
53 Int_t fNpar; // ! number of fit parameters
54 Double_t fQtot; // ! total cluster charge
55 Int_t fReco; // ! =1 if run reco with writing of reconstructed clusters
57 static TMinuit* fgMinuit; // ! Fitter
58 Bool_t fUsed[2][fgkDim]; // ! flags for used pads
59 TH2F* fHist[4]; // ! histograms
60 TClonesArray *fMuonDigits; // ! pointer to digits
61 Bool_t fDraw; // ! draw flag
62 Int_t fnMu; // ! number of muons passing thru the selected area
63 Double_t fxyMu[2][7]; // ! muon information
64 TObjArray* fPixArray; // ! collection of pixels
65 Int_t fnCoupled; // ! number of coupled clusters in precluster
66 Int_t fDebug; // ! debug level
70 void ModifyHistos(void); // modify histograms
71 void AddPad(Int_t cath, Int_t digit); // add a pad to the cluster
72 //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
73 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
74 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
75 Bool_t CheckPrecluster(Int_t *nShown); // check precluster to simplify it (if possible)
76 void BuildPixArray(); // build array of pixels
77 void AdjustPixel(Float_t width, Int_t ixy); // adjust size of small pixels
78 void AdjustPixel(Float_t wxmin, Float_t wymin); // adjust size of large pixels
79 Bool_t MainLoop(Int_t iSimple); // repeat MLEM algorithm until pixels become sufficiently small
80 void Mlem(Double_t *coef, Double_t *probi, Int_t nIter); // use MLEM for cluster finding
81 void FindCOG(TH2D *mlem, Double_t *xyc); // find COG position around maximum bin
82 Int_t FindNearest(AliMUONPixel *pixPtr0); // find nearest neighbouring pixel to the given one
83 void Split(TH2D *mlem, Double_t *coef); // steering function for pixels
84 void AddBin(TH2D *mlem, Int_t ic, Int_t jc, Int_t mode, Bool_t* used, TObjArray *pix); // add a bin to the cluster
85 TObject* BinToPix(TH2D *mlem, Int_t jc, Int_t ic); // hist. bin-to-pixel
86 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
87 Double_t MinGroupCoupl(Int_t nCoupled, Int_t *clustNumb, TMatrixD *aijcluclu, Int_t *minGroup); // find group of cluster with min. coupling to others
88 Int_t SelectPad(Int_t nCoupled, Int_t nForFit, Int_t *clustNumb, Int_t *clustFit, TMatrixD *aijcluclu); //select pads for fit
89 void Merge(Int_t nForFit, Int_t nCoupled, Int_t *clustNumb, Int_t *clustFit, TObjArray **clusters, TMatrixD *aijcluclu, TMatrixD *aijclupad); // merge clusters
90 Int_t Fit(Int_t nfit, Int_t *clustFit, TObjArray **clusters, Double_t *parOk); // do the fitting
91 void UpdatePads(Int_t nfit, Double_t *par); // subtract fitted charges from pads
92 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
93 Int_t FindLocalMaxima(Int_t *localMax, Double_t *maxVal); // find local maxima
94 void FlagLocalMax(TH2D *hist, Int_t i, Int_t j, Int_t *isLocalMax); // flag local max
95 void FindCluster(Int_t *localMax, Int_t iMax); // find cluster around local max
96 void AddVirtualPad(); // add virtual pads for some clusters (if necessary)
97 void PadsInXandY(Int_t &nInX, Int_t &nInY); // get number of pads in X and Y
98 // This function is used for fitting
99 void Fcn1(Int_t &npar, Double_t *gin, Double_t &f, Double_t *par, Int_t iflag);
100 void Simple(); // process simple cluster
102 void Errors(AliMUONRawCluster *clus); // correct coordinates and eval. errors
103 void Errors(Int_t ny, Int_t nx, Int_t iby, Int_t ibx, Double_t fmin,
104 Double_t wy, Double_t wx, Int_t iover,
105 Double_t dyc, Double_t dxc, Double_t qtot,
106 Double_t &yrec, Double_t &xrec, Double_t &erry, Double_t &errx);
107 void DrawCluster(Int_t nev0, Int_t ch0); // draw precluster
108 Int_t Next(Int_t &nev0, Int_t &ch0); // commands for drawing
110 // Dummy methods for overloading warnings
111 void FindCluster(int, int, int, AliMUONRawCluster&) {return;}
112 void FindLocalMaxima(AliMUONRawCluster*) {return;}
113 void Split(AliMUONRawCluster*) {return;}
114 void AddRawCluster(AliMUONRawCluster&) {return;}
116 ClassDef(AliMUONClusterFinderAZ,0) // cluster finder in MUON arm of ALICE