]> git.uio.no Git - u/mrichter/AliRoot.git/blame - STEER/AliCascadeVertexer.cxx
The vertex finder algorithm can be set from AliGPRRecoParam, and in case of HighFluxP...
[u/mrichter/AliRoot.git] / STEER / AliCascadeVertexer.cxx
CommitLineData
c7bafca9 1/**************************************************************************
2 * Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *
3 * *
4 * Author: The ALICE Off-line Project. *
5 * Contributors are mentioned in the code where appropriate. *
6 * *
7 * Permission to use, copy, modify and distribute this software and its *
8 * documentation strictly for non-commercial purposes is hereby granted *
9 * without fee, provided that the above copyright notice appears in all *
10 * copies and that both the copyright notice and this permission notice *
11 * appear in the supporting documentation. The authors make no claims *
12 * about the suitability of this software for any purpose. It is *
13 * provided "as is" without express or implied warranty. *
14 **************************************************************************/
15
16//-------------------------------------------------------------------------
17// Implementation of the cascade vertexer class
18// Reads V0s and tracks, writes out cascade vertices
19// Fills the ESD with the cascades
20// Origin: Christian Kuhn, IReS, Strasbourg, christian.kuhn@ires.in2p3.fr
21//-------------------------------------------------------------------------
c028b974 22
23//modified by R. Vernet 30/6/2006 : daughter label
24//modified by R. Vernet 3/7/2006 : causality
5e4ff34d 25//modified by I. Belikov 24/11/2006 : static setter for the default cuts
c028b974 26
27
c7bafca9 28#include <TObjArray.h>
29#include <TTree.h>
30
af885e0f 31#include "AliESDEvent.h"
c7bafca9 32#include "AliESDv0.h"
33#include "AliESDcascade.h"
34#include "AliCascadeVertexer.h"
faffd83e 35#include "AliESDtrack.h"
36#include "AliESDVertex.h"
c7bafca9 37
38ClassImp(AliCascadeVertexer)
39
5e4ff34d 40//A set of loose cuts
41Double_t
e82eee7e 42 AliCascadeVertexer::fgChi2max=33.; //maximal allowed chi2
5e4ff34d 43Double_t
e82eee7e 44 AliCascadeVertexer::fgDV0min=0.05; //min V0 impact parameter
5e4ff34d 45Double_t
e82eee7e 46 AliCascadeVertexer::fgMassWin=0.01; //"window" around the Lambda mass
5e4ff34d 47Double_t
e82eee7e 48 AliCascadeVertexer::fgDBachMin=0.035; //min bachelor impact parameter
5e4ff34d 49Double_t
e82eee7e 50 AliCascadeVertexer::fgDCAmax=0.10; //max DCA between the V0 and the track
5e4ff34d 51Double_t
85f0f56e 52 AliCascadeVertexer::fgCPAmin=0.9985; //min cosine of the cascade pointing angle
5e4ff34d 53Double_t
e82eee7e 54 AliCascadeVertexer::fgRmin=0.2; //min radius of the fiducial volume
5e4ff34d 55Double_t
e82eee7e 56 AliCascadeVertexer::fgRmax=100.; //max radius of the fiducial volume
5e4ff34d 57
58
af885e0f 59Int_t AliCascadeVertexer::V0sTracks2CascadeVertices(AliESDEvent *event) {
c7bafca9 60 //--------------------------------------------------------------------
61 // This function reconstructs cascade vertices
62 // Adapted to the ESD by I.Belikov (Jouri.Belikov@cern.ch)
63 //--------------------------------------------------------------------
81f174b6 64 const AliESDVertex *vtxSPD=event->GetVertex();
65 const AliESDVertex *vtxT3D=event->GetPrimaryVertex();
66
67 Double_t xPrimaryVertex=999, yPrimaryVertex=999, zPrimaryVertex=999;
68 if (vtxT3D->GetStatus()) {
69 xPrimaryVertex=vtxT3D->GetXv();
70 yPrimaryVertex=vtxT3D->GetYv();
71 zPrimaryVertex=vtxT3D->GetZv();
72 }
73 else {
74 xPrimaryVertex=vtxSPD->GetXv();
75 yPrimaryVertex=vtxSPD->GetYv();
76 zPrimaryVertex=vtxSPD->GetZv();
77 }
5e4ff34d 78
c7bafca9 79 Double_t b=event->GetMagneticField();
80 Int_t nV0=(Int_t)event->GetNumberOfV0s();
c028b974 81
82 //stores relevant V0s in an array
c7bafca9 83 TObjArray vtcs(nV0);
84 Int_t i;
85 for (i=0; i<nV0; i++) {
86 AliESDv0 *v=event->GetV0(i);
d6a49f20 87 if (v->GetOnFlyStatus()) continue;
81f174b6 88 if (v->GetD(xPrimaryVertex,yPrimaryVertex,zPrimaryVertex)<fDV0min) continue;
c7bafca9 89 vtcs.AddLast(v);
90 }
91 nV0=vtcs.GetEntriesFast();
92
c028b974 93 // stores relevant tracks in another array
c7bafca9 94 Int_t nentr=(Int_t)event->GetNumberOfTracks();
95 TArrayI trk(nentr); Int_t ntr=0;
96 for (i=0; i<nentr; i++) {
97 AliESDtrack *esdtr=event->GetTrack(i);
85f0f56e 98 ULong_t status=esdtr->GetStatus();
c7bafca9 99
100 if ((status&AliESDtrack::kITSrefit)==0)
85f0f56e 101 if ((status&AliESDtrack::kTPCrefit)==0) continue;
c7bafca9 102
81f174b6 103 if (TMath::Abs(esdtr->GetD(xPrimaryVertex,yPrimaryVertex,b))<fDBachMin) continue;
c7bafca9 104
105 trk[ntr++]=i;
106 }
107
108 Double_t massLambda=1.11568;
109 Int_t ncasc=0;
110
111 // Looking for the cascades...
c028b974 112
113 for (i=0; i<nV0; i++) { //loop on V0s
114
c7bafca9 115 AliESDv0 *v=(AliESDv0*)vtcs.UncheckedAt(i);
116 v->ChangeMassHypothesis(kLambda0); // the v0 must be Lambda
117 if (TMath::Abs(v->GetEffMass()-massLambda)>fMassWin) continue;
c028b974 118
119 for (Int_t j=0; j<ntr; j++) {//loop on tracks
c7bafca9 120 Int_t bidx=trk[j];
b75d63a7 121 //Bo: if (bidx==v->GetNindex()) continue; //bachelor and v0's negative tracks must be different
122 if (bidx==v->GetIndex(0)) continue; //Bo: consistency 0 for neg
c7bafca9 123 AliESDtrack *btrk=event->GetTrack(bidx);
c7bafca9 124 if (btrk->GetSign()>0) continue; // bachelor's charge
125
c028b974 126 AliESDv0 v0(*v), *pv0=&v0;
c7bafca9 127 AliExternalTrackParam bt(*btrk), *pbt=&bt;
128
129 Double_t dca=PropagateToDCA(pv0,pbt,b);
130 if (dca > fDCAmax) continue;
131
c028b974 132 AliESDcascade cascade(*pv0,*pbt,bidx);//constucts a cascade candidate
f776b387 133 //PH if (cascade.GetChi2Xi() > fChi2max) continue;
c7bafca9 134
85f0f56e 135 Double_t x,y,z; cascade.GetXYZcascade(x,y,z); // Bo: bug correction
c7bafca9 136 Double_t r2=x*x + y*y;
137 if (r2 > fRmax*fRmax) continue; // condition on fiducial zone
138 if (r2 < fRmin*fRmin) continue;
139
c028b974 140 Double_t pxV0,pyV0,pzV0;
141 pv0->GetPxPyPz(pxV0,pyV0,pzV0);
142 if (x*pxV0+y*pyV0+z*pzV0 < 0) continue; //causality
143
c7bafca9 144 Double_t x1,y1,z1; pv0->GetXYZ(x1,y1,z1);
145 if (r2 > (x1*x1+y1*y1)) continue;
c7bafca9 146
81f174b6 147 if (cascade.GetCascadeCosineOfPointingAngle(xPrimaryVertex,yPrimaryVertex,zPrimaryVertex) <fCPAmin) continue; //condition on the cascade pointing angle
c028b974 148
5c9c901e 149 cascade.SetDcaXiDaughters(dca);
c028b974 150 event->AddCascade(&cascade);
c7bafca9 151 ncasc++;
c028b974 152 } // end loop tracks
153 } // end loop V0s
c7bafca9 154
155 // Looking for the anti-cascades...
c028b974 156
157 for (i=0; i<nV0; i++) { //loop on V0s
c7bafca9 158 AliESDv0 *v=(AliESDv0*)vtcs.UncheckedAt(i);
159 v->ChangeMassHypothesis(kLambda0Bar); //the v0 must be anti-Lambda
160 if (TMath::Abs(v->GetEffMass()-massLambda)>fMassWin) continue;
c028b974 161
162 for (Int_t j=0; j<ntr; j++) {//loop on tracks
c7bafca9 163 Int_t bidx=trk[j];
b75d63a7 164 //Bo: if (bidx==v->GetPindex()) continue; //bachelor and v0's positive tracks must be different
165 if (bidx==v->GetIndex(1)) continue; //Bo: consistency 1 for pos
c7bafca9 166 AliESDtrack *btrk=event->GetTrack(bidx);
c7bafca9 167 if (btrk->GetSign()<0) continue; // bachelor's charge
168
169 AliESDv0 v0(*v), *pv0=&v0;
170 AliESDtrack bt(*btrk), *pbt=&bt;
171
172 Double_t dca=PropagateToDCA(pv0,pbt,b);
173 if (dca > fDCAmax) continue;
174
c028b974 175 AliESDcascade cascade(*pv0,*pbt,bidx); //constucts a cascade candidate
f776b387 176 //PH if (cascade.GetChi2Xi() > fChi2max) continue;
c7bafca9 177
85f0f56e 178 Double_t x,y,z; cascade.GetXYZcascade(x,y,z); // Bo: bug correction
c7bafca9 179 Double_t r2=x*x + y*y;
180 if (r2 > fRmax*fRmax) continue; // condition on fiducial zone
181 if (r2 < fRmin*fRmin) continue;
182
c028b974 183 Double_t pxV0,pyV0,pzV0;
184 pv0->GetPxPyPz(pxV0,pyV0,pzV0);
185 if (x*pxV0+y*pyV0+z*pzV0 < 0) continue; //causality
186
c7bafca9 187 Double_t x1,y1,z1; pv0->GetXYZ(x1,y1,z1);
188 if (r2 > (x1*x1+y1*y1)) continue;
c7bafca9 189
81f174b6 190 if (cascade.GetCascadeCosineOfPointingAngle(xPrimaryVertex,yPrimaryVertex,zPrimaryVertex) < fCPAmin) continue; //condition on the cascade pointing angle
5c9c901e 191
192 cascade.SetDcaXiDaughters(dca);
c028b974 193 event->AddCascade(&cascade);
c7bafca9 194 ncasc++;
195
c028b974 196 } // end loop tracks
197 } // end loop V0s
c7bafca9 198
199Info("V0sTracks2CascadeVertices","Number of reconstructed cascades: %d",ncasc);
200
201 return 0;
202}
203
204
df53c9d5 205Double_t det(Double_t a00, Double_t a01, Double_t a10, Double_t a11){
c7bafca9 206 // determinant 2x2
207 return a00*a11 - a01*a10;
208}
209
df53c9d5 210Double_t det (Double_t a00,Double_t a01,Double_t a02,
c7bafca9 211 Double_t a10,Double_t a11,Double_t a12,
212 Double_t a20,Double_t a21,Double_t a22) {
213 // determinant 3x3
214 return
215 a00*det(a11,a12,a21,a22)-a01*det(a10,a12,a20,a22)+a02*det(a10,a11,a20,a21);
216}
217
218
219
220
221Double_t AliCascadeVertexer::
222PropagateToDCA(AliESDv0 *v, AliExternalTrackParam *t, Double_t b) {
223 //--------------------------------------------------------------------
224 // This function returns the DCA between the V0 and the track
225 //--------------------------------------------------------------------
226 Double_t alpha=t->GetAlpha(), cs1=TMath::Cos(alpha), sn1=TMath::Sin(alpha);
227 Double_t r[3]; t->GetXYZ(r);
228 Double_t x1=r[0], y1=r[1], z1=r[2];
229 Double_t p[3]; t->GetPxPyPz(p);
230 Double_t px1=p[0], py1=p[1], pz1=p[2];
231
232 Double_t x2,y2,z2; // position and momentum of V0
233 Double_t px2,py2,pz2;
234
235 v->GetXYZ(x2,y2,z2);
236 v->GetPxPyPz(px2,py2,pz2);
237
238// calculation dca
239
240 Double_t dd= det(x2-x1,y2-y1,z2-z1,px1,py1,pz1,px2,py2,pz2);
241 Double_t ax= det(py1,pz1,py2,pz2);
242 Double_t ay=-det(px1,pz1,px2,pz2);
243 Double_t az= det(px1,py1,px2,py2);
244
245 Double_t dca=TMath::Abs(dd)/TMath::Sqrt(ax*ax + ay*ay + az*az);
246
247//points of the DCA
248 Double_t t1 = det(x2-x1,y2-y1,z2-z1,px2,py2,pz2,ax,ay,az)/
249 det(px1,py1,pz1,px2,py2,pz2,ax,ay,az);
250
251 x1 += px1*t1; y1 += py1*t1; //z1 += pz1*t1;
252
253
254 //propagate track to the points of DCA
255
256 x1=x1*cs1 + y1*sn1;
257 if (!t->PropagateTo(x1,b)) {
258 Error("PropagateToDCA","Propagation failed !");
259 return 1.e+33;
260 }
261
262 return dca;
263}
264
265
266
267
268
269
270
271
272
273
274