]>
Commit | Line | Data |
---|---|---|
70c95f95 | 1 | #ifndef ALIITSVERTEXER3D_H |
2 | #define ALIITSVERTEXER3D_H | |
3 | ||
27167524 | 4 | #include<AliITSVertexer.h> |
70c95f95 | 5 | |
6 | /////////////////////////////////////////////////////////////////// | |
7 | // // | |
8 | // Class for primary vertex finding (3D reconstruction) // | |
9 | // // | |
10 | /////////////////////////////////////////////////////////////////// | |
11 | ||
6a0d56b8 | 12 | /* $Id$ */ |
13 | ||
f5f6da22 | 14 | #include <TClonesArray.h> |
6a0d56b8 | 15 | #include <AliESDVertex.h> |
7340864d | 16 | #include <TH3F.h> |
cd1c2af1 | 17 | #include <TBits.h> |
70c95f95 | 18 | |
19 | class AliITSVertexer3D : public AliITSVertexer { | |
20 | ||
21 | public: | |
22 | ||
23 | AliITSVertexer3D(); | |
70c95f95 | 24 | virtual ~AliITSVertexer3D(); |
308c2f7c | 25 | virtual AliESDVertex* FindVertexForCurrentEvent(TTree *itsClusterTree); |
6b4d9537 | 26 | void FindVertex3DIterative(); |
87104b06 | 27 | void FindVertex3DIterativeMM(); |
6b4d9537 | 28 | void FindVertex3D(TTree *itsClusterTree); |
6a0d56b8 | 29 | AliESDVertex GetVertex3D() const {return fVert3D;} |
70c95f95 | 30 | virtual void PrintStatus() const; |
6b4d9537 | 31 | static Bool_t DistBetweenVertices(AliESDVertex &a, AliESDVertex &b, Double_t test, Double_t &dist); |
242c8025 | 32 | void SetWideFiducialRegion(Double_t dz = 40.0, Double_t dr=2.5){ |
7203e11a | 33 | SetCoarseMaxRCut(dr); |
34 | SetZCutDiamond(dz); | |
35 | } | |
242c8025 | 36 | void SetNarrowFiducialRegion(Double_t dz = 0.5, Double_t dr=0.5){ |
7203e11a | 37 | SetMaxRCut(dr); |
38 | SetMaxZCut(dz); | |
39 | } | |
242c8025 | 40 | void SetDeltaPhiCuts(Double_t dphiloose=0.5, Double_t dphitight=0.025){ |
7203e11a | 41 | SetCoarseDiffPhiCut(dphiloose); |
42 | SetDiffPhiMax(dphitight); | |
43 | } | |
242c8025 | 44 | void SetCoarseDiffPhiCut(Double_t dphi = 0.5){fCoarseDiffPhiCut=dphi;} |
45 | void SetFineDiffPhiCut(Double_t dphi = 0.05){fFineDiffPhiCut=dphi;} | |
87104b06 | 46 | void SetCutOnPairs(Double_t cp = 0.15){fCutOnPairs = cp;} |
242c8025 | 47 | void SetCoarseMaxRCut(Double_t rad = 2.5){fCoarseMaxRCut=rad;} |
48 | void SetMaxRCut(Double_t rad = 0.5){fMaxRCut=rad;} | |
87104b06 | 49 | void SetMaxRCutAlgo2(Double_t rad = 0.2){fMaxRCut2=rad;} |
242c8025 | 50 | void SetZCutDiamond(Double_t zcut = 20.0){fZCutDiamond=zcut;} |
51 | void SetMaxZCut(Double_t dz = 0.5){fMaxZCut=dz;} | |
52 | void SetDCACut(Double_t dca=0.1){fDCAcut=dca;} | |
53 | void SetDiffPhiMax(Double_t pm = 0.025){fDiffPhiMax = pm;} | |
54 | void SetMeanPSelTracks(Double_t pGeV=0.875){fMeanPSelTrk = pGeV;} | |
55 | void SetMeanPtSelTracks(Double_t ptGeV=0.630){fMeanPtSelTrk = ptGeV;} | |
0496a544 | 56 | void SetMeanPPtSelTracks(Double_t fieldTesla); |
242c8025 | 57 | void SetMinDCAforPileup(Double_t mindist=0.1) {fDCAforPileup=mindist;} |
c238ba33 | 58 | void SetDeltaPhiforPileup(Double_t dphi=0.01) {fDiffPhiforPileup=dphi;} |
87104b06 | 59 | void SetPileupAlgo(UShort_t optalgo=1){fPileupAlgo=optalgo;} |
242c8025 | 60 | void SetBinSizeR(Double_t siz=0.1){fBinSizeR=siz;} |
61 | void SetBinSizeZ(Double_t siz=0.8){fBinSizeZ=siz;} | |
70c95f95 | 62 | |
63 | protected: | |
64 | AliITSVertexer3D(const AliITSVertexer3D& vtxr); | |
65 | AliITSVertexer3D& operator=(const AliITSVertexer3D& /* vtxr */); | |
308c2f7c | 66 | Int_t FindTracklets(TTree *itsClusterTree, Int_t optCuts); |
05d1294c | 67 | Int_t Prepare3DVertex(Int_t optCuts); |
27167524 | 68 | void ResetVert3D(); |
7340864d | 69 | void FindPeaks(TH3F* histo, Double_t *peak, Int_t &nOfTracklets, Int_t &nOfTimes); |
cd1c2af1 | 70 | void PileupFromZ(); |
71 | void MarkUsedClusters(); | |
72 | Int_t RemoveTracklets(); | |
73 | void FindOther3DVertices(TTree *itsClusterTree); | |
70c95f95 | 74 | |
cd1c2af1 | 75 | enum {kMaxCluPerMod=250}; |
6a0d56b8 | 76 | |
f5f6da22 | 77 | TClonesArray fLines; //! array of tracklets |
6a0d56b8 | 78 | AliESDVertex fVert3D; // 3D Vertex |
242c8025 | 79 | Double_t fCoarseDiffPhiCut; // loose cut on DeltaPhi for RecPoint matching |
80 | Double_t fFineDiffPhiCut; // tight value of DeltaPhi for RP matching (2nd method) | |
81 | Double_t fCutOnPairs; //cut on distance between pairs of tracklets | |
82 | Double_t fCoarseMaxRCut; // cut on tracklet DCA to Z axis | |
87104b06 | 83 | Double_t fMaxRCut; // cut on tracklet DCA to beam axis |
84 | Double_t fMaxRCut2; // cut on tracklet DCA to beam axis - algo2 | |
242c8025 | 85 | Double_t fZCutDiamond; // cut on +-Z of the diamond |
86 | Double_t fMaxZCut; // cut on Z distance from estimated vertex | |
87 | Double_t fDCAcut; // cut on tracklet to tracklet and tracklet to vertex DCA | |
88 | Double_t fDiffPhiMax; // Maximum delta phi allowed among corr. pixels | |
89 | Double_t fMeanPSelTrk; // GeV, mean P for tracks with dphi<0.01 rad | |
90 | Double_t fMeanPtSelTrk; // GeV, mean Pt for tracks with dphi<0.01 rad | |
cd1c2af1 | 91 | TBits fUsedCluster; // flag for used clusters in vertex calculation |
92 | TH1F *fZHisto; //! histogram with coarse z distribution | |
242c8025 | 93 | Double_t fDCAforPileup; // Minimum DCA to 1st vertex for pileup tracklets |
c238ba33 | 94 | Double_t fDiffPhiforPileup; // Cut on delta phi for pileup |
242c8025 | 95 | Double_t fBinSizeR; // Histo3D bin size along radius |
96 | Double_t fBinSizeZ; // Histo3D bin size along z | |
cd1c2af1 | 97 | UShort_t fPileupAlgo; // Algo for pileup identification |
98 | // 0->VertexerZ pileup algo | |
99 | // 1->Unused RecPoints algo | |
6a0d56b8 | 100 | |
87104b06 | 101 | ClassDef(AliITSVertexer3D,12); |
70c95f95 | 102 | |
103 | }; | |
104 | ||
105 | #endif |