]>
Commit | Line | Data |
---|---|---|
2d57349e | 1 | #ifndef ALIVERTEXERTRACKS_H |
2 | #define ALIVERTEXERTRACKS_H | |
3 | /* Copyright(c) 1998-2003, ALICE Experiment at CERN, All rights reserved. * | |
4 | * See cxx source for full Copyright notice */ | |
5 | ||
6 | ||
7 | //------------------------------------------------------- | |
6d8df534 | 8 | // Class for vertex determination with tracks |
2d57349e | 9 | // |
10 | // Origin: AliITSVertexerTracks | |
11 | // A.Dainese, Padova, andrea.dainese@pd.infn.it | |
12 | // M.Masera, Torino, massimo.masera@to.infn.it | |
13 | // Moved to STEER and adapted to ESD tracks: | |
14 | // F.Prino, Torino, prino@to.infn.it | |
15 | //------------------------------------------------------- | |
16 | ||
17 | /***************************************************************************** | |
18 | * * | |
6d8df534 | 19 | * This class determines the vertex of a set of tracks. * |
2d57349e | 20 | * Different algorithms are implemented, see data member fAlgo. * |
21 | * * | |
22 | *****************************************************************************/ | |
23 | ||
2d57349e | 24 | #include <TObjArray.h> |
fee9ef0d | 25 | #include <TMatrixD.h> |
2d57349e | 26 | |
6d8df534 | 27 | #include "AliESDVertex.h" |
28 | #include "AliExternalTrackParam.h" | |
29 | #include "AliLog.h" | |
30 | ||
af885e0f | 31 | class AliESDEvent; |
2d57349e | 32 | |
33 | class AliVertexerTracks : public TObject { | |
34 | ||
35 | public: | |
36 | AliVertexerTracks(); | |
dc3719f3 | 37 | AliVertexerTracks(Double_t fieldkG); |
2d57349e | 38 | virtual ~AliVertexerTracks(); |
39 | ||
af885e0f | 40 | AliESDVertex* FindPrimaryVertex(const AliESDEvent *esdEvent); |
6d8df534 | 41 | AliESDVertex* FindPrimaryVertex(TObjArray *trkArrayOrig,UShort_t *idOrig); |
42 | AliESDVertex* VertexForSelectedTracks(TObjArray *trkArray,UShort_t *id, | |
43 | Bool_t optUseFitter=kTRUE, | |
44 | Bool_t optPropagate=kTRUE); | |
45 | AliESDVertex* VertexForSelectedESDTracks(TObjArray *trkArray, | |
46 | Bool_t optUseFitter=kTRUE, | |
47 | Bool_t optPropagate=kTRUE); | |
48 | AliESDVertex* RemoveTracksFromVertex(AliESDVertex *inVtx, | |
49 | TObjArray *trkArray,UShort_t *id, | |
50 | Float_t *diamondxy); | |
fee9ef0d | 51 | void SetConstraintOff() { fConstraint=kFALSE; return; } |
52 | void SetConstraintOn() { fConstraint=kTRUE; return; } | |
53 | void SetDebug(Int_t optdebug=0) { fDebug=optdebug; return; } | |
54 | void SetDCAcut(Double_t maxdca) { fDCAcut=maxdca; return; } | |
55 | void SetFinderAlgorithm(Int_t opt=1) { fAlgo=opt; return; } | |
6d8df534 | 56 | void SetITSrefitRequired() { fITSrefit=kTRUE; return; } |
50ff0bcd | 57 | void SetITSrefitNotRequired() { fITSrefit=kFALSE; return; } |
fee9ef0d | 58 | void SetMaxd0z0(Double_t maxd0z0=0.5) { fMaxd0z0=maxd0z0; return; } |
6d8df534 | 59 | void SetMinITSClusters(Int_t n=5) { fMinITSClusters=n; return; } |
60 | void SetMinTracks(Int_t n=1) { fMinTracks=n; return; } | |
fee9ef0d | 61 | void SetNSigmad0(Double_t n=3) { fNSigma=n; return; } |
62 | Double_t GetNSigmad0() const { return fNSigma; } | |
63 | void SetOnlyFitter() { if(!fConstraint) AliFatal("Set constraint first!"); | |
64 | fOnlyFitter=kTRUE; return; } | |
ec1be5d5 | 65 | void SetSkipTracks(Int_t n,Int_t *skipped); |
3b768a1d | 66 | void SetVtxStart(Double_t x=0,Double_t y=0,Double_t z=0) |
07680cae | 67 | { fNominalPos[0]=x; fNominalPos[1]=y; fNominalPos[2]=z; return; } |
146c29df | 68 | void SetVtxStartSigma(Double_t sx=3.,Double_t sy=3.,Double_t sz=15.) |
50ff0bcd | 69 | { fNominalCov[0]=sx*sx; fNominalCov[2]=sy*sy; fNominalCov[5]=sz*sz; |
70 | fNominalCov[1]=0.; fNominalCov[3]=0.; fNominalCov[4]=0.; return; } | |
71 | void SetVtxStart(AliESDVertex *vtx); | |
71d84967 | 72 | static Double_t GetStrLinMinDist(Double_t *p0,Double_t *p1,Double_t *x0); |
73 | static Double_t GetDeterminant3X3(Double_t matr[][3]); | |
74 | static void GetStrLinDerivMatrix(Double_t *p0,Double_t *p1,Double_t (*m)[3],Double_t *d); | |
75 | static void GetStrLinDerivMatrix(Double_t *p0,Double_t *p1,Double_t *sigmasq,Double_t (*m)[3],Double_t *d); | |
146c29df | 76 | static AliESDVertex TrackletVertexFinder(TClonesArray *lines, Int_t optUseWeights=0); |
dc3719f3 | 77 | void SetFieldkG(Double_t field=-999.) { fFieldkG=field; return; } |
78 | Double_t GetFieldkG() const { | |
79 | if(fFieldkG<-99.) AliFatal("Field value not set"); | |
80 | return fFieldkG; } | |
3b768a1d | 81 | void SetNSigmaForUi00(Double_t n=1.5) { fnSigmaForUi00=n; return; } |
82 | Double_t GetNSigmaForUi00() const { return fnSigmaForUi00; } | |
07680cae | 83 | |
2d57349e | 84 | protected: |
fee9ef0d | 85 | void HelixVertexFinder(); |
0c69be49 | 86 | void OneTrackVertFinder(); |
6d8df534 | 87 | Int_t PrepareTracks(TObjArray &trkArrayOrig,UShort_t *idOrig, |
88 | Int_t optImpParCut); | |
89 | Bool_t TrackToPoint(AliExternalTrackParam *t, | |
0bf2e2b4 | 90 | TMatrixD &ri,TMatrixD &wWi, |
91 | Bool_t uUi3by3=kFALSE) const; | |
2d57349e | 92 | void VertexFinder(Int_t optUseWeights=0); |
6d8df534 | 93 | void VertexFitter(); |
fee9ef0d | 94 | void StrLinVertexFinderMinDist(Int_t optUseWeights=0); |
6d8df534 | 95 | void TooFewTracks(); |
eae1677e | 96 | |
146c29df | 97 | AliESDVertex fVert; // vertex after vertex finder |
ec1be5d5 | 98 | AliESDVertex *fCurrentVertex; // ESD vertex after fitter |
dc3719f3 | 99 | Double_t fFieldkG; // z component of field (kGauss) |
07680cae | 100 | Double_t fNominalPos[3]; // initial knowledge on vertex position |
50ff0bcd | 101 | Double_t fNominalCov[6]; // initial knowledge on vertex position |
fee9ef0d | 102 | Bool_t fConstraint; // true when "mean vertex" was set in |
103 | // fNominal ... and must be used in the fit | |
104 | Bool_t fOnlyFitter; // primary with one fitter shot only | |
105 | // (use only with beam constraint) | |
2d57349e | 106 | Int_t fMinTracks; // minimum number of tracks |
07680cae | 107 | Int_t fMinITSClusters; // minimum number of ITS clusters per track |
6d8df534 | 108 | TObjArray fTrkArraySel; // array with tracks to be processed |
109 | UShort_t *fIdSel; // IDs of the tracks (AliESDtrack::GetID()) | |
110 | Int_t *fTrksToSkip; // track IDs to be skipped for find and fit | |
ec1be5d5 | 111 | Int_t fNTrksToSkip; // number of tracks to be skipped |
2d57349e | 112 | Double_t fDCAcut; // maximum DCA between 2 tracks used for vertex |
113 | Int_t fAlgo; // option for vertex finding algorythm | |
07680cae | 114 | Double_t fNSigma; // number of sigmas for d0 cut in PrepareTracks() |
43c9dae1 | 115 | Double_t fMaxd0z0; // value for sqrt(d0d0+z0z0) cut |
fee9ef0d | 116 | // in PrepareTracks(1) if fConstraint=kFALSE |
50ff0bcd | 117 | Bool_t fITSrefit; // if kTRUE (default), use only kITSrefit tracks |
118 | // if kFALSE, use all tracks (also TPC only) | |
3b768a1d | 119 | Double_t fnSigmaForUi00; // n. sigmas from finder in TrackToPoint |
50ff0bcd | 120 | Int_t fDebug; //! debug flag - verbose printing if >0 |
2d57349e | 121 | // fAlgo=1 (default) finds minimum-distance point among all selected tracks |
122 | // approximated as straight lines | |
123 | // and uses errors on track parameters as weights | |
124 | // fAlgo=2 finds minimum-distance point among all the selected tracks | |
125 | // approximated as straight lines | |
126 | // fAlgo=3 finds the average point among DCA points of all pairs of tracks | |
127 | // treated as helices | |
128 | // fAlgo=4 finds the average point among DCA points of all pairs of tracks | |
129 | // approximated as straight lines | |
130 | // and uses errors on track parameters as weights | |
131 | // fAlgo=5 finds the average point among DCA points of all pairs of tracks | |
132 | // approximated as straight lines | |
133 | ||
3b768a1d | 134 | |
fe12e09c | 135 | private: |
136 | AliVertexerTracks(const AliVertexerTracks & source); | |
137 | AliVertexerTracks & operator=(const AliVertexerTracks & source); | |
2d57349e | 138 | |
6d8df534 | 139 | ClassDef(AliVertexerTracks,10) // 3D Vertexing with tracks |
2d57349e | 140 | }; |
141 | ||
142 | #endif | |
43c9dae1 | 143 |