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 */
7 //-------------------------------------------------------
8 // Class for vertex determination with tracks
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 //-------------------------------------------------------
17 /*****************************************************************************
19 * This class determines the vertex of a set of tracks. *
20 * Different algorithms are implemented, see data member fAlgo. *
22 *****************************************************************************/
24 #include <TObjArray.h>
28 #include "AliESDVertex.h"
31 class AliExternalTrackParam;
36 class AliVertexerTracks : public TObject {
39 enum {kTOFBCShift=200,
40 kStrLinVertexFinderMinDist1=1,
41 kStrLinVertexFinderMinDist0=2,
46 enum {kBitUsed = BIT(16),kBitAccounted = BIT(17)};
48 AliVertexerTracks(Double_t fieldkG);
49 virtual ~AliVertexerTracks();
51 AliESDVertex* FindPrimaryVertex(const AliVEvent *vEvent);
52 AliESDVertex* FindPrimaryVertex(const TObjArray *trkArrayOrig,UShort_t *idOrig);
53 AliESDVertex* VertexForSelectedTracks(const TObjArray *trkArray,UShort_t *id,
54 Bool_t optUseFitter=kTRUE,
55 Bool_t optPropagate=kTRUE,
56 Bool_t optUseDiamondConstraint=kFALSE);
57 AliESDVertex* VertexForSelectedESDTracks(TObjArray *trkArray,
58 Bool_t optUseFitter=kTRUE,
59 Bool_t optPropagate=kTRUE,
60 Bool_t optUseDiamondConstraint=kFALSE);
61 AliESDVertex* RemoveTracksFromVertex(AliESDVertex *inVtx,
62 const TObjArray *trkArray,UShort_t *id,
63 const Float_t *diamondxy) const;
64 AliESDVertex* RemoveConstraintFromVertex(AliESDVertex *inVtx,
66 Float_t *diamondcov) const;
67 void SetITSMode(Double_t dcacut=0.1,
68 Double_t dcacutIter0=0.1,
73 Double_t mindetfitter=100.,
74 Double_t maxtgl=1000.,
78 Int_t finderAlgoIter0=4);
79 void SetTPCMode(Double_t dcacut=0.1,
80 Double_t dcacutIter0=1.0,
85 Double_t mindetfitter=0.1,
90 Int_t finderAlgoIter0=4);
91 void SetCuts(Double_t *cuts, int ncuts);
92 void SetConstraintOff() { fConstraint=kFALSE; SetVtxStart(); SetVtxStartSigma(); return; }
93 void SetConstraintOn() { fConstraint=kTRUE; return; }
94 void SetDCAcut(Double_t maxdca) { fDCAcut=maxdca; return; }
95 void SetDCAcutIter0(Double_t maxdca) { fDCAcutIter0=maxdca; return; }
96 void SetFinderAlgorithm(Int_t opt=1) { fAlgo=opt; return; }
97 void SetITSrefitRequired() { fITSrefit=kTRUE; return; }
98 void SetITSpureSA() { fITSpureSA=kTRUE; return; }
99 Bool_t GetITSrefitRequired() const { return fITSrefit; }
100 void SetITSrefitNotRequired() { fITSrefit=kFALSE; return; }
101 void SetFiducialRZ(Double_t r=3,Double_t z=30) { fFiducialR=r; fFiducialZ=z; return; }
102 void SetMaxd0z0(Double_t maxd0z0=0.5) { fMaxd0z0=maxd0z0; return; }
103 void SetMinClusters(Int_t n=5) { fMinClusters=n; return; }
104 Int_t GetMinClusters() const { return fMinClusters; }
105 void SetMinTracks(Int_t n=1) { fMinTracks=n; return; }
106 void SetNSigmad0(Double_t n=3) { fNSigma=n; return; }
107 Double_t GetNSigmad0() const { return fNSigma; }
108 void SetMinDetFitter(Double_t mindet=100.) { fMinDetFitter=mindet; return; }
109 void SetMaxTgl(Double_t maxtgl=1.) { fMaxTgl=maxtgl; return; }
110 void SetOnlyFitter() { if(!fConstraint) AliFatal("Set constraint first!");
111 fOnlyFitter=kTRUE; return; }
112 void SetSkipTracks(Int_t n,const Int_t *skipped);
113 void SetVtxStart(Double_t x=0,Double_t y=0,Double_t z=0)
114 { fNominalPos[0]=x; fNominalPos[1]=y; fNominalPos[2]=z; return; }
115 void SetVtxStartSigma(Double_t sx=3.,Double_t sy=3.,Double_t sz=15.)
116 { fNominalCov[0]=sx*sx; fNominalCov[2]=sy*sy; fNominalCov[5]=sz*sz;
117 fNominalCov[1]=0.; fNominalCov[3]=0.; fNominalCov[4]=0.; return; }
118 void SetVtxStart(AliESDVertex *vtx);
119 void SetSelectOnTOFBunchCrossing(Bool_t select=kFALSE,Bool_t keepAlsoUnflagged=kTRUE) {fSelectOnTOFBunchCrossing=select; fKeepAlsoUnflaggedTOFBunchCrossing=keepAlsoUnflagged; return;}
121 static Double_t GetStrLinMinDist(const Double_t *p0,const Double_t *p1,const Double_t *x0);
122 static Double_t GetDeterminant3X3(Double_t matr[][3]);
123 static void GetStrLinDerivMatrix(const Double_t *p0,const Double_t *p1,Double_t (*m)[3],Double_t *d);
124 static void GetStrLinDerivMatrix(const Double_t *p0,const Double_t *p1,const Double_t *sigmasq,Double_t (*m)[3],Double_t *d);
125 static AliESDVertex TrackletVertexFinder(const TClonesArray *lines, Int_t optUseWeights=0);
126 static AliESDVertex TrackletVertexFinder(AliStrLine **lines, const Int_t knacc, Int_t optUseWeights=0);
127 void SetFieldkG(Double_t field=-999.) { fFieldkG=field; return; }
128 Double_t GetFieldkG() const {
129 if(fFieldkG<-99.) AliFatal("Field value not set");
131 void SetNSigmaForUi00(Double_t n=1.5) { fnSigmaForUi00=n; return; }
132 Double_t GetNSigmaForUi00() const { return fnSigmaForUi00; }
134 void SetMVTukey2(double t=6) {fMVTukey2 = t;}
135 void SetMVSig2Ini(double t=1e3) {fMVSig2Ini = t;}
136 void SetMVMaxSigma2(double t=3.) {fMVMaxSigma2 = t;}
137 void SetMVMinSig2Red(double t=0.005) {fMVMinSig2Red = t;}
138 void SetMVMinDst(double t=10e-4) {fMVMinDst = t;}
139 void SetMVScanStep(double t=2.) {fMVScanStep = t;}
140 void SetMVFinalWBinary(Bool_t v=kTRUE) {fMVFinalWBinary = v;}
141 void SetMVMaxWghNtr(double w=10.) {fMVMaxWghNtr = w;}
143 void FindVerticesMV();
144 Bool_t FindNextVertexMV();
146 AliESDVertex* GetCurrentVertex() const {return (AliESDVertex*)fCurrentVertex;}
147 TObjArray* GetVerticesArray() const {return (TObjArray*)fMVVertices;} // RS to be removed
148 void AnalyzePileUp(AliESDEvent* esdEv);
149 void SetBCSpacing(Int_t ns=50) {fBCSpacing = ns;}
152 void HelixVertexFinder();
153 void OneTrackVertFinder();
154 Int_t PrepareTracks(const TObjArray &trkArrayOrig,const UShort_t *idOrig,
156 Bool_t PropagateTrackTo(AliExternalTrackParam *track,
158 Bool_t TrackToPoint(AliExternalTrackParam *t,
159 TMatrixD &ri,TMatrixD &wWi,
160 Bool_t uUi3by3=kFALSE) const;
161 void VertexFinder(Int_t optUseWeights=0);
162 void VertexFitter(Bool_t vfit=kTRUE, Bool_t chiCalc=kTRUE,Int_t useWeights=0);
163 void StrLinVertexFinderMinDist(Int_t optUseWeights=0);
166 AliESDVertex fVert; // vertex after vertex finder
167 AliESDVertex *fCurrentVertex; // ESD vertex after fitter
168 UShort_t fMode; // 0 ITS+TPC; 1 TPC
169 Double_t fFieldkG; // z component of field (kGauss)
170 Double_t fNominalPos[3]; // initial knowledge on vertex position
171 Double_t fNominalCov[6]; // initial knowledge on vertex position
172 TObjArray fTrkArraySel; // array with tracks to be processed
173 UShort_t *fIdSel; // IDs of the tracks (AliESDtrack::GetID())
174 Int_t *fTrksToSkip; // track IDs to be skipped for find and fit
175 Int_t fNTrksToSkip; // number of tracks to be skipped
176 Bool_t fConstraint; // true when "mean vertex" was set in
177 // fNominal ... and must be used in the fit
178 Bool_t fOnlyFitter; // primary with one fitter shot only
179 // (use only with beam constraint)
180 Int_t fMinTracks; // minimum number of tracks
181 Int_t fMinClusters; // minimum number of ITS or TPC clusters per track
182 Double_t fDCAcut; // maximum DCA between 2 tracks used for vertex
183 Double_t fDCAcutIter0; // maximum DCA between 2 tracks used for vertex
184 Double_t fNSigma; // number of sigmas for d0 cut in PrepareTracks()
185 Double_t fMaxd0z0; // value for sqrt(d0d0+z0z0) cut
186 // in PrepareTracks(1) if fConstraint=kFALSE
187 Double_t fMinDetFitter; // minimum determinant to try to invertex matrix
188 Double_t fMaxTgl; // maximum tgl of tracks
189 Bool_t fITSrefit; // if kTRUE (default), use only kITSrefit tracks
190 // if kFALSE, use all tracks (also TPC only)
191 Bool_t fITSpureSA; // if kFALSE (default) skip ITSpureSA tracks
192 // if kTRUE use only those
193 Double_t fFiducialR; // radius of fiducial cylinder for tracks
194 Double_t fFiducialZ; // length of fiducial cylinder for tracks
195 Double_t fnSigmaForUi00; // n. sigmas from finder in TrackToPoint
196 Int_t fAlgo; // option for vertex finding algorythm
197 Int_t fAlgoIter0; // this is for iteration 0
198 // fAlgo=1 (default) finds minimum-distance point among all selected tracks
199 // approximated as straight lines
200 // and uses errors on track parameters as weights
201 // fAlgo=2 finds minimum-distance point among all the selected tracks
202 // approximated as straight lines
203 // fAlgo=3 finds the average point among DCA points of all pairs of tracks
204 // treated as helices
205 // fAlgo=4 finds the average point among DCA points of all pairs of tracks
206 // approximated as straight lines
207 // and uses errors on track parameters as weights
208 // fAlgo=5 finds the average point among DCA points of all pairs of tracks
209 // approximated as straight lines
211 Bool_t fSelectOnTOFBunchCrossing; // tracks from bunch crossing 0
212 Bool_t fKeepAlsoUnflaggedTOFBunchCrossing; // also tracks w/o bunch crossing number (-1)
213 // parameters for multivertexer
214 Double_t fMVWSum; // sum of weights for multivertexer
215 Double_t fMVWE2; // sum of weighted chi2's for multivertexer
216 Double_t fMVTukey2; // Tukey constant for multivertexer
217 Double_t fMVSigma2; // chi2 current scaling param for multivertexer
218 Double_t fMVSig2Ini; // initial value for fMVSigma2
219 Double_t fMVMaxSigma2; // max acceptable value for final fMVSigma2
220 Double_t fMVMinSig2Red; // min reduction of fMVSigma2 to exit the loop
221 Double_t fMVMinDst; // min distance between vertices at two iterations to exit
222 Double_t fMVScanStep; // step of vertices scan
223 Double_t fMVMaxWghNtr; // min W-distance*Ncontr_min for close vertices
224 Bool_t fMVFinalWBinary; // for the final fit use binary weights
225 Int_t fBCSpacing; // BC Spacing in ns (will define the rounding of BCid)
226 TObjArray* fMVVertices; // array of found vertices
229 AliVertexerTracks(const AliVertexerTracks & source);
230 AliVertexerTracks & operator=(const AliVertexerTracks & source);
232 ClassDef(AliVertexerTracks,15) // 3D Vertexing with tracks