Improving event printout
[u/mrichter/AliRoot.git] / STEER / AliVertexerTracks.h
CommitLineData
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
0aa2faf4 31class AliVEvent;
af885e0f 32class AliESDEvent;
8e104736 33class AliStrLine;
2d57349e 34
35class AliVertexerTracks : public TObject {
36
37 public:
38 AliVertexerTracks();
dc3719f3 39 AliVertexerTracks(Double_t fieldkG);
2d57349e 40 virtual ~AliVertexerTracks();
41
4448efe4 42 AliESDVertex* FindPrimaryVertex(AliVEvent *vEvent);
6d8df534 43 AliESDVertex* FindPrimaryVertex(TObjArray *trkArrayOrig,UShort_t *idOrig);
44 AliESDVertex* VertexForSelectedTracks(TObjArray *trkArray,UShort_t *id,
45 Bool_t optUseFitter=kTRUE,
97669588 46 Bool_t optPropagate=kTRUE,
47 Bool_t optUseDiamondConstraint=kFALSE);
6d8df534 48 AliESDVertex* VertexForSelectedESDTracks(TObjArray *trkArray,
49 Bool_t optUseFitter=kTRUE,
97669588 50 Bool_t optPropagate=kTRUE,
51 Bool_t optUseDiamondConstraint=kFALSE);
6d8df534 52 AliESDVertex* RemoveTracksFromVertex(AliESDVertex *inVtx,
53 TObjArray *trkArray,UShort_t *id,
6b908072 54 Float_t *diamondxy) const;
55 AliESDVertex* RemoveConstraintFromVertex(AliESDVertex *inVtx,
56 Float_t *diamondxyz,
57 Float_t *diamondcov) const;
a00021a7 58 void SetITSMode(Double_t dcacut=0.1,
59 Double_t dcacutIter0=0.1,
60 Double_t maxd0z0=0.5,
61 Int_t minCls=5,
62 Int_t mintrks=1,
63 Double_t nsigma=3.,
64 Double_t mindetfitter=100.,
65 Double_t maxtgl=1000.,
66 Double_t fidR=3.,
8c75f668 67 Double_t fidZ=30.,
68 Int_t finderAlgo=1,
69 Int_t finderAlgoIter0=4);
a00021a7 70 void SetTPCMode(Double_t dcacut=0.1,
71 Double_t dcacutIter0=1.0,
72 Double_t maxd0z0=5.0,
73 Int_t minCls=10,
74 Int_t mintrks=1,
75 Double_t nsigma=3.,
76 Double_t mindetfitter=0.1,
77 Double_t maxtgl=1.5,
78 Double_t fidR=3.,
8c75f668 79 Double_t fidZ=30.,
80 Int_t finderAlgo=1,
81 Int_t finderAlgoIter0=4);
a00021a7 82 void SetCuts(Double_t *cuts);
fee9ef0d 83 void SetConstraintOff() { fConstraint=kFALSE; return; }
84 void SetConstraintOn() { fConstraint=kTRUE; return; }
fee9ef0d 85 void SetDCAcut(Double_t maxdca) { fDCAcut=maxdca; return; }
f09c879d 86 void SetDCAcutIter0(Double_t maxdca) { fDCAcutIter0=maxdca; return; }
fee9ef0d 87 void SetFinderAlgorithm(Int_t opt=1) { fAlgo=opt; return; }
6d8df534 88 void SetITSrefitRequired() { fITSrefit=kTRUE; return; }
0aa2faf4 89 Bool_t GetITSrefitRequired() const { return fITSrefit; }
50ff0bcd 90 void SetITSrefitNotRequired() { fITSrefit=kFALSE; return; }
6b29d399 91 void SetFiducialRZ(Double_t r=3,Double_t z=30) { fFiducialR=r; fFiducialZ=z; return; }
fee9ef0d 92 void SetMaxd0z0(Double_t maxd0z0=0.5) { fMaxd0z0=maxd0z0; return; }
6b29d399 93 void SetMinClusters(Int_t n=5) { fMinClusters=n; return; }
0aa2faf4 94 Int_t GetMinClusters() const { return fMinClusters; }
6d8df534 95 void SetMinTracks(Int_t n=1) { fMinTracks=n; return; }
fee9ef0d 96 void SetNSigmad0(Double_t n=3) { fNSigma=n; return; }
97 Double_t GetNSigmad0() const { return fNSigma; }
f09c879d 98 void SetMinDetFitter(Double_t mindet=100.) { fMinDetFitter=mindet; return; }
99 void SetMaxTgl(Double_t maxtgl=1.) { fMaxTgl=maxtgl; return; }
fee9ef0d 100 void SetOnlyFitter() { if(!fConstraint) AliFatal("Set constraint first!");
101 fOnlyFitter=kTRUE; return; }
ec1be5d5 102 void SetSkipTracks(Int_t n,Int_t *skipped);
3b768a1d 103 void SetVtxStart(Double_t x=0,Double_t y=0,Double_t z=0)
07680cae 104 { fNominalPos[0]=x; fNominalPos[1]=y; fNominalPos[2]=z; return; }
146c29df 105 void SetVtxStartSigma(Double_t sx=3.,Double_t sy=3.,Double_t sz=15.)
50ff0bcd 106 { fNominalCov[0]=sx*sx; fNominalCov[2]=sy*sy; fNominalCov[5]=sz*sz;
107 fNominalCov[1]=0.; fNominalCov[3]=0.; fNominalCov[4]=0.; return; }
108 void SetVtxStart(AliESDVertex *vtx);
71d84967 109 static Double_t GetStrLinMinDist(Double_t *p0,Double_t *p1,Double_t *x0);
110 static Double_t GetDeterminant3X3(Double_t matr[][3]);
111 static void GetStrLinDerivMatrix(Double_t *p0,Double_t *p1,Double_t (*m)[3],Double_t *d);
112 static void GetStrLinDerivMatrix(Double_t *p0,Double_t *p1,Double_t *sigmasq,Double_t (*m)[3],Double_t *d);
146c29df 113 static AliESDVertex TrackletVertexFinder(TClonesArray *lines, Int_t optUseWeights=0);
8e104736 114 static AliESDVertex TrackletVertexFinder(AliStrLine **lines, const Int_t knacc, Int_t optUseWeights=0);
dc3719f3 115 void SetFieldkG(Double_t field=-999.) { fFieldkG=field; return; }
116 Double_t GetFieldkG() const {
117 if(fFieldkG<-99.) AliFatal("Field value not set");
118 return fFieldkG; }
3b768a1d 119 void SetNSigmaForUi00(Double_t n=1.5) { fnSigmaForUi00=n; return; }
120 Double_t GetNSigmaForUi00() const { return fnSigmaForUi00; }
07680cae 121
2d57349e 122 protected:
fee9ef0d 123 void HelixVertexFinder();
0c69be49 124 void OneTrackVertFinder();
6d8df534 125 Int_t PrepareTracks(TObjArray &trkArrayOrig,UShort_t *idOrig,
126 Int_t optImpParCut);
f09c879d 127 Bool_t PropagateTrackTo(AliExternalTrackParam *track,
128 Double_t xToGo);
6d8df534 129 Bool_t TrackToPoint(AliExternalTrackParam *t,
0bf2e2b4 130 TMatrixD &ri,TMatrixD &wWi,
131 Bool_t uUi3by3=kFALSE) const;
2d57349e 132 void VertexFinder(Int_t optUseWeights=0);
6d8df534 133 void VertexFitter();
fee9ef0d 134 void StrLinVertexFinderMinDist(Int_t optUseWeights=0);
6d8df534 135 void TooFewTracks();
eae1677e 136
146c29df 137 AliESDVertex fVert; // vertex after vertex finder
ec1be5d5 138 AliESDVertex *fCurrentVertex; // ESD vertex after fitter
f09c879d 139 UShort_t fMode; // 0 ITS+TPC; 1 TPC
dc3719f3 140 Double_t fFieldkG; // z component of field (kGauss)
07680cae 141 Double_t fNominalPos[3]; // initial knowledge on vertex position
50ff0bcd 142 Double_t fNominalCov[6]; // initial knowledge on vertex position
f09c879d 143 TObjArray fTrkArraySel; // array with tracks to be processed
144 UShort_t *fIdSel; // IDs of the tracks (AliESDtrack::GetID())
145 Int_t *fTrksToSkip; // track IDs to be skipped for find and fit
146 Int_t fNTrksToSkip; // number of tracks to be skipped
fee9ef0d 147 Bool_t fConstraint; // true when "mean vertex" was set in
148 // fNominal ... and must be used in the fit
149 Bool_t fOnlyFitter; // primary with one fitter shot only
150 // (use only with beam constraint)
2d57349e 151 Int_t fMinTracks; // minimum number of tracks
6b29d399 152 Int_t fMinClusters; // minimum number of ITS or TPC clusters per track
2d57349e 153 Double_t fDCAcut; // maximum DCA between 2 tracks used for vertex
f09c879d 154 Double_t fDCAcutIter0; // maximum DCA between 2 tracks used for vertex
07680cae 155 Double_t fNSigma; // number of sigmas for d0 cut in PrepareTracks()
43c9dae1 156 Double_t fMaxd0z0; // value for sqrt(d0d0+z0z0) cut
fee9ef0d 157 // in PrepareTracks(1) if fConstraint=kFALSE
f09c879d 158 Double_t fMinDetFitter; // minimum determinant to try to invertex matrix
159 Double_t fMaxTgl; // maximum tgl of tracks
50ff0bcd 160 Bool_t fITSrefit; // if kTRUE (default), use only kITSrefit tracks
161 // if kFALSE, use all tracks (also TPC only)
6b29d399 162 Double_t fFiducialR; // radius of fiducial cylinder for tracks
163 Double_t fFiducialZ; // length of fiducial cylinder for tracks
3b768a1d 164 Double_t fnSigmaForUi00; // n. sigmas from finder in TrackToPoint
f09c879d 165 Int_t fAlgo; // option for vertex finding algorythm
8c75f668 166 Int_t fAlgoIter0; // this is for iteration 0
2d57349e 167 // fAlgo=1 (default) finds minimum-distance point among all selected tracks
168 // approximated as straight lines
169 // and uses errors on track parameters as weights
170 // fAlgo=2 finds minimum-distance point among all the selected tracks
171 // approximated as straight lines
172 // fAlgo=3 finds the average point among DCA points of all pairs of tracks
173 // treated as helices
174 // fAlgo=4 finds the average point among DCA points of all pairs of tracks
175 // approximated as straight lines
176 // and uses errors on track parameters as weights
177 // fAlgo=5 finds the average point among DCA points of all pairs of tracks
178 // approximated as straight lines
179
3b768a1d 180
fe12e09c 181 private:
182 AliVertexerTracks(const AliVertexerTracks & source);
183 AliVertexerTracks & operator=(const AliVertexerTracks & source);
2d57349e 184
919e537f 185 ClassDef(AliVertexerTracks,12) // 3D Vertexing with tracks
2d57349e 186};
187
188#endif
43c9dae1 189