]> git.uio.no Git - u/mrichter/AliRoot.git/blame - ITS/AliITStrackerMI.cxx
git://git.uio.no / u / mrichter / AliRoot.git / blame
? search:
summary | shortlog | log | commit | commitdiff | tree
blob | blame (incremental) | history | HEAD
New methods to display tracking informations have been added
[u/mrichter/AliRoot.git] / ITS / AliITStrackerMI.cxx
CommitLineData
e43c066c 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 ITS tracker class
18// It reads AliITSclusterV2 clusters and creates AliITStrackV2 tracks
19// and fills with them the ESD
20// Origin: Iouri Belikov, CERN, Jouri.Belikov@cern.ch
f43e383b 21// Marian Ivanov, CERN, Marian.Ivanov@cern.ch
e43c066c 22// dEdx analysis by: Boris Batyunya, JINR, Boris.Batiounia@cern.ch
f43e383b 23//
e43c066c 24//-------------------------------------------------------------------------
f43e383b 25#include "AliITSrecoV2.h"
e43c066c 26#include <TTree.h>
e43c066c 27#include "AliITSgeom.h"
e43c066c 28#include "AliTPCtrack.h"
29#include "AliESD.h"
30#include "AliITSclusterV2.h"
e43c066c 31#include "AliITStrackerMI.h"
32#include "TMatrixD.h"
33#include "AliHelix.h"
f43e383b 34
35
e43c066c 36
37ClassImp(AliITStrackerMI)
38ClassImp(AliITSRecV0Info)
39
40
41
42AliITStrackerMI::AliITSlayer AliITStrackerMI::fgLayers[kMaxLayer]; // ITS layers
43
44AliITStrackerMI::AliITStrackerMI(const AliITSgeom *geom) : AliTracker() {
45 //--------------------------------------------------------------------
46 //This is the AliITStrackerMI constructor
47 //--------------------------------------------------------------------
48 AliITSgeom *g=(AliITSgeom*)geom;
49
50 Float_t x,y,z;
51 Int_t i;
52 for (i=1; i<kMaxLayer+1; i++) {
53 Int_t nlad=g->GetNladders(i);
54 Int_t ndet=g->GetNdetectors(i);
55
56 g->GetTrans(i,1,1,x,y,z);
57 Double_t r=TMath::Sqrt(x*x + y*y);
58 Double_t poff=TMath::ATan2(y,x);
59 Double_t zoff=z;
60
61 g->GetTrans(i,1,2,x,y,z);
62 r += TMath::Sqrt(x*x + y*y);
63 g->GetTrans(i,2,1,x,y,z);
64 r += TMath::Sqrt(x*x + y*y);
65 g->GetTrans(i,2,2,x,y,z);
66 r += TMath::Sqrt(x*x + y*y);
67 r*=0.25;
68
69 new (fgLayers+i-1) AliITSlayer(r,poff,zoff,nlad,ndet);
70
71 for (Int_t j=1; j<nlad+1; j++) {
72 for (Int_t k=1; k<ndet+1; k++) { //Fill this layer with detectors
73 Float_t x,y,zshift; g->GetTrans(i,j,k,x,y,zshift);
74 Double_t rot[9]; g->GetRotMatrix(i,j,k,rot);
75
76 Double_t phi=TMath::ATan2(rot[1],rot[0])+TMath::Pi();
77 phi+=TMath::Pi()/2;
78 if (i==1) phi+=TMath::Pi();
79 Double_t cp=TMath::Cos(phi), sp=TMath::Sin(phi);
80 Double_t r=x*cp+y*sp;
81
82 AliITSdetector &det=fgLayers[i-1].GetDetector((j-1)*ndet + k-1);
83 new(&det) AliITSdetector(r,phi);
84 }
85 }
86
87 }
88
89 fI=kMaxLayer;
90
91 fPass=0;
92 fConstraint[0]=1; fConstraint[1]=0;
93
94 Double_t xyz[]={kXV,kYV,kZV}, ers[]={kSigmaXV,kSigmaYV,kSigmaZV};
95 SetVertex(xyz,ers);
96
97 for (Int_t i=0; i<kMaxLayer; i++) fLayersNotToSkip[i]=kLayersNotToSkip[i];
98 fLastLayerToTrackTo=kLastLayerToTrackTo;
99
100}
101
102void AliITStrackerMI::SetLayersNotToSkip(Int_t *l) {
103 //--------------------------------------------------------------------
104 //This function set masks of the layers which must be not skipped
105 //--------------------------------------------------------------------
106 for (Int_t i=0; i<kMaxLayer; i++) fLayersNotToSkip[i]=l[i];
107}
108
109Int_t AliITStrackerMI::LoadClusters(TTree *cTree) {
110 //--------------------------------------------------------------------
111 //This function loads ITS clusters
112 //--------------------------------------------------------------------
113 TBranch *branch=cTree->GetBranch("Clusters");
114 if (!branch) {
115 Error("LoadClusters"," can't get the branch !\n");
116 return 1;
117 }
118
119 TClonesArray dummy("AliITSclusterV2",10000), *clusters=&dummy;
120 branch->SetAddress(&clusters);
121
122 Int_t j=0;
123 Int_t detector=0;
124 for (Int_t i=0; i<kMaxLayer; i++) {
125 Int_t ndet=fgLayers[i].GetNdetectors();
126 Int_t jmax = j + fgLayers[i].GetNladders()*ndet;
127 for (; j<jmax; j++) {
128 if (!cTree->GetEvent(j)) continue;
129 Int_t ncl=clusters->GetEntriesFast();
130 SignDeltas(clusters,GetZ());
131 while (ncl--) {
132 AliITSclusterV2 *c=(AliITSclusterV2*)clusters->UncheckedAt(ncl);
133 detector = c->GetDetectorIndex();
134 fgLayers[i].InsertCluster(new AliITSclusterV2(*c));
135 }
136 clusters->Delete();
137 //add dead zone virtual "cluster"
138 if (i<2){
139 for (Float_t ydead = 0; ydead < 1.31 ; ydead+=(i+1.)*0.018){
140 Int_t lab[4] = {0,0,0,detector};
141 Int_t info[3] = {0,0,0};
142 Float_t hit[5]={0,0,0.004/12.,0.001/12.,0};
143 if (i==0) hit[0] =ydead-0.4;
144 if (i==1) hit[0]=ydead-3.75;
145 hit[1] =-0.04;
146 if (TMath::Abs(fgLayers[i].GetDetector(detector).GetZmax()-hit[1])<2.)
147 fgLayers[i].InsertCluster(new AliITSclusterV2(lab, hit, info));
148 hit[1]=-7.05;
149 if (TMath::Abs(fgLayers[i].GetDetector(detector).GetZmax()-hit[1])<2.)
150 fgLayers[i].InsertCluster(new AliITSclusterV2(lab, hit, info));
151 hit[1]=-7.15;
152 if (TMath::Abs(fgLayers[i].GetDetector(detector).GetZmax()-hit[1])<2.)
153 fgLayers[i].InsertCluster(new AliITSclusterV2(lab, hit, info));
154 hit[1] =0.06;
155 if (TMath::Abs(fgLayers[i].GetDetector(detector).GetZmax()-hit[1])<2.)
156 fgLayers[i].InsertCluster(new AliITSclusterV2(lab, hit, info));
157 hit[1]=7.05;
158 if (TMath::Abs(fgLayers[i].GetDetector(detector).GetZmax()-hit[1])<2.)
159 fgLayers[i].InsertCluster(new AliITSclusterV2(lab, hit, info));
160 hit[1]=7.25;
161 if (TMath::Abs(fgLayers[i].GetDetector(detector).GetZmax()-hit[1])<2.)
162 fgLayers[i].InsertCluster(new AliITSclusterV2(lab, hit, info));
163 }
164 }
165
166 }
167 //
168 fgLayers[i].ResetRoad(); //road defined by the cluster density
169 fgLayers[i].SortClusters();
170 }
171
172 return 0;
173}
174
175void AliITStrackerMI::UnloadClusters() {
176 //--------------------------------------------------------------------
177 //This function unloads ITS clusters
178 //--------------------------------------------------------------------
179 for (Int_t i=0; i<kMaxLayer; i++) fgLayers[i].ResetClusters();
180}
181
182static Int_t CorrectForDeadZoneMaterial(AliITStrackV2 *t) {
183 //--------------------------------------------------------------------
184 // Correction for the material between the TPC and the ITS
185 // (should it belong to the TPC code ?)
186 //--------------------------------------------------------------------
187 Double_t riw=80., diw=0.0053, x0iw=30; // TPC inner wall ?
188 Double_t rcd=61., dcd=0.0053, x0cd=30; // TPC "central drum" ?
189 Double_t yr=12.8, dr=0.03; // rods ?
190 Double_t zm=0.2, dm=0.40; // membrane
191 //Double_t rr=52., dr=0.19, x0r=24., yyr=7.77; //rails
192 Double_t rs=50., ds=0.001; // something belonging to the ITS (screen ?)
193
194 if (t->GetX() > riw) {
195 if (!t->PropagateTo(riw,diw,x0iw)) return 1;
196 if (TMath::Abs(t->GetY())>yr) t->CorrectForMaterial(dr);
197 if (TMath::Abs(t->GetZ())<zm) t->CorrectForMaterial(dm);
198 if (!t->PropagateTo(rcd,dcd,x0cd)) return 1;
199 //Double_t x,y,z; t->GetGlobalXYZat(rr,x,y,z);
200 //if (TMath::Abs(y)<yyr) t->PropagateTo(rr,dr,x0r);
201 if (!t->PropagateTo(rs,ds)) return 1;
202 } else if (t->GetX() < rs) {
203 if (!t->PropagateTo(rs,-ds)) return 1;
204 //Double_t x,y,z; t->GetGlobalXYZat(rr,x,y,z);
205 //if (TMath::Abs(y)<yyr) t->PropagateTo(rr,-dr,x0r);
206 if (!t->PropagateTo(rcd,-dcd,x0cd)) return 1;
207 if (!t->PropagateTo(riw+0.001,-diw,x0iw)) return 1;
208 } else {
209 ::Error("CorrectForDeadZoneMaterial","track is already in the dead zone !");
210 return 1;
211 }
212
213 return 0;
214}
215
216Int_t AliITStrackerMI::Clusters2Tracks(AliESD *event) {
217 //--------------------------------------------------------------------
218 // This functions reconstructs ITS tracks
219 // The clusters must be already loaded !
220 //--------------------------------------------------------------------
221 TObjArray itsTracks(15000);
222
223 {/* Read ESD tracks */
224 Int_t nentr=event->GetNumberOfTracks();
225 Info("Clusters2Tracks", "Number of ESD tracks: %d\n", nentr);
226 while (nentr--) {
227 AliESDtrack *esd=event->GetTrack(nentr);
228
229 if ((esd->GetStatus()&AliESDtrack::kTPCin)==0) continue;
230 if (esd->GetStatus()&AliESDtrack::kTPCout) continue;
231 if (esd->GetStatus()&AliESDtrack::kITSin) continue;
232
233 AliITStrackV2 *t=0;
234 try {
235 t=new AliITStrackV2(*esd);
236 } catch (const Char_t *msg) {
237 Warning("Clusters2Tracks",msg);
238 delete t;
239 continue;
240 }
241 t->fD[0] = t->GetD(GetX(),GetY());
242 t->fD[1] = t->GetZat(GetX())-GetZ();
243 Double_t vdist = TMath::Sqrt(t->fD[0]*t->fD[0]+t->fD[1]*t->fD[1]);
244 if (t->GetMass()<0.13) t->SetMass(0.13957); // MI look to the esd - mass hypothesys !!!!!!!!!!!
245 // write expected q
246 t->fExpQ = TMath::Max(0.8*t->fESDtrack->GetTPCsignal(),30.);
247
248 if (TMath::Abs(t->fD[0])>10) {
249 delete t;
250 continue;
251 }
252
253 if (TMath::Abs(vdist)>20) {
254 delete t;
255 continue;
256 }
257 if (TMath::Abs(1/t->Get1Pt())<0.120) {
258 delete t;
259 continue;
260 }
261
262 if (CorrectForDeadZoneMaterial(t)!=0) {
263 Warning("Clusters2Tracks",
264 "failed to correct for the material in the dead zone !\n");
265 delete t;
266 continue;
267 }
268 t->fReconstructed = kFALSE;
269 itsTracks.AddLast(t);
270 }
271 } /* End Read ESD tracks */
272
273 itsTracks.Sort();
274 Int_t nentr=itsTracks.GetEntriesFast();
275 fTrackHypothesys.Expand(nentr);
276 MakeCoeficients(nentr);
277 Int_t ntrk=0;
278 for (fPass=0; fPass<2; fPass++) {
279 Int_t &constraint=fConstraint[fPass]; if (constraint<0) continue;
280 for (Int_t i=0; i<nentr; i++) {
4c53440c 281// cerr<<fPass<<" "<<i<<'\r';
e43c066c 282 fCurrentEsdTrack = i;
283 AliITStrackV2 *t=(AliITStrackV2*)itsTracks.UncheckedAt(i);
284 if (t==0) continue; //this track has been already tracked
285 if (t->fReconstructed&&(t->fNUsed<1.5)) continue; //this track was already "succesfully" reconstructed
286 if ( (TMath::Abs(t->GetD(GetX(),GetY())) >3.) && fConstraint[fPass]) continue;
287 if ( (TMath::Abs(t->GetZat(GetX())-GetZ())>3.) && fConstraint[fPass]) continue;
288
289 Int_t tpcLabel=t->GetLabel(); //save the TPC track label
290 fI = 6;
291 ResetTrackToFollow(*t);
292 ResetBestTrack();
293
294 FollowProlongationTree(t,i);
295
296
297 SortTrackHypothesys(fCurrentEsdTrack,20,0); //MI change
298 //
299 AliITStrackV2 * besttrack = GetBestHypothesys(fCurrentEsdTrack,t,15);
300 if (!besttrack) continue;
301 besttrack->SetLabel(tpcLabel);
302 // besttrack->CookdEdx();
303 CookdEdx(besttrack);
304 besttrack->fFakeRatio=1.;
305 CookLabel(besttrack,0.); //For comparison only
306 // besttrack->UpdateESDtrack(AliESDtrack::kITSin);
307 //
308
309 UpdateESDtrack(besttrack,AliESDtrack::kITSin);
310
311 if ( besttrack->GetNumberOfClusters()<5 && fConstraint[fPass]) {
312 continue;
313 }
314 if (besttrack->fChi2MIP[0]+besttrack->fNUsed>3.5) continue;
315 if ( (TMath::Abs(besttrack->fD[0]*besttrack->fD[0]+besttrack->fD[1]*besttrack->fD[1])>0.1) && fConstraint[fPass]) continue;
316 //delete itsTracks.RemoveAt(i);
317 t->fReconstructed = kTRUE;
318 ntrk++;
319 }
320 GetBestHypothesysMIP(itsTracks);
321 }
322
323 //GetBestHypothesysMIP(itsTracks);
324 //FindV0(event);
325
326 itsTracks.Delete();
327 //
328 Int_t entries = fTrackHypothesys.GetEntriesFast();
329 for (Int_t ientry=0;ientry<entries;ientry++){
330 TObjArray * array =(TObjArray*)fTrackHypothesys.UncheckedAt(ientry);
331 if (array) array->Delete();
332 delete fTrackHypothesys.RemoveAt(ientry);
333 }
334
335 fTrackHypothesys.Delete();
336 Info("Clusters2Tracks","Number of prolonged tracks: %d\n",ntrk);
337
338 return 0;
339}
340
341
342
343Int_t AliITStrackerMI::Clusters2Tracks(TTree *tpcTree, TTree *itsTree) {
344 //--------------------------------------------------------------------
345 // This functions reconstructs ITS tracks
346 // The clusters must be already loaded !
347 //--------------------------------------------------------------------
348 Int_t nentr=0; TObjArray itsTracks(15000);
349
350 Warning("Clusters2Tracks(TTree *, TTree *)",
351 "Will be removed soon ! Use Clusters2Tracks(AliESD *) instead.");
352
353 {/* Read TPC tracks */
354 AliTPCtrack *itrack=new AliTPCtrack;
355 TBranch *branch=tpcTree->GetBranch("tracks");
356 if (!branch) {
357 Error("Clusters2Tracks","Can't get the branch !");
358 return 1;
359 }
360 tpcTree->SetBranchAddress("tracks",&itrack);
361 nentr=(Int_t)tpcTree->GetEntries();
362
363 Info("Clusters2Tracks","Number of TPC tracks: %d\n",nentr);
364
365 for (Int_t i=0; i<nentr; i++) {
366 tpcTree->GetEvent(i);
367 AliITStrackV2 *t=0;
368 try {
369 t=new AliITStrackV2(*itrack);
370 } catch (const Char_t *msg) {
371 Warning("Clusters2Tracks",msg);
372 delete t;
373 continue;
374 }
375 if (TMath::Abs(t->GetD())>4) {
376 delete t;
377 continue;
378 }
379
380 if (CorrectForDeadZoneMaterial(t)!=0) {
381 Warning("Clusters2Tracks",
382 "failed to correct for the material in the dead zone !\n");
383 delete t;
384 continue;
385 }
386
387 itsTracks.AddLast(t);
388 }
389 delete itrack;
390 }
391 itsTracks.Sort();
392 nentr=itsTracks.GetEntriesFast();
393
394
395 AliITStrackV2 *otrack=&fBestTrack;
396 TBranch *branch=itsTree->GetBranch("tracks");
397 if (!branch) itsTree->Branch("tracks","AliITStrackV2",&otrack,32000,3);
398 else branch->SetAddress(&otrack);
399
400 for (fPass=0; fPass<2; fPass++) {
401 Int_t &constraint=fConstraint[fPass]; if (constraint<0) continue;
402 for (Int_t i=0; i<nentr; i++) {
403 AliITStrackV2 *t=(AliITStrackV2*)itsTracks.UncheckedAt(i);
404 if (t==0) continue; //this track has been already tracked
405 Int_t tpcLabel=t->GetLabel(); //save the TPC track label
406
407 ResetTrackToFollow(*t);
408 ResetBestTrack();
409 /*
410 for (FollowProlongation(); fI<kMaxLayer; fI++) {
411 while (TakeNextProlongation()) FollowProlongation();
412 }
413 */
414 FollowProlongationTree(t,i);
415 if (fBestTrack.GetNumberOfClusters() == 0) continue;
416
417 if (fConstraint[fPass]) {
418 ResetTrackToFollow(*t);
419 if (!RefitAt(3.7, &fTrackToFollow, &fBestTrack)) continue;
420 ResetBestTrack();
421 }
422
423 fBestTrack.SetLabel(tpcLabel);
424 //fBestTrack.CookdEdx();
425 CookdEdx(&fBestTrack);
426
427 CookLabel(&fBestTrack,0.); //For comparison only
428 itsTree->Fill();
429 //UseClusters(&fBestTrack);
430 delete itsTracks.RemoveAt(i);
431 }
432 }
433
434 nentr=(Int_t)itsTree->GetEntries();
435 Info("Clusters2Tracks","Number of prolonged tracks: %d\n",nentr);
436
437 itsTracks.Delete();
438
439 return 0;
440}
441
442Int_t AliITStrackerMI::PropagateBack(AliESD *event) {
443 //--------------------------------------------------------------------
444 // This functions propagates reconstructed ITS tracks back
445 // The clusters must be loaded !
446 //--------------------------------------------------------------------
447 Int_t nentr=event->GetNumberOfTracks();
448 Info("PropagateBack", "Number of ESD tracks: %d\n", nentr);
449
450 Int_t ntrk=0;
451 for (Int_t i=0; i<nentr; i++) {
452 AliESDtrack *esd=event->GetTrack(i);
453
454 if ((esd->GetStatus()&AliESDtrack::kITSin)==0) continue;
455 if (esd->GetStatus()&AliESDtrack::kITSout) continue;
456
457 AliITStrackV2 *t=0;
458 try {
459 t=new AliITStrackV2(*esd);
460 } catch (const Char_t *msg) {
461 Warning("PropagateBack",msg);
462 delete t;
463 continue;
464 }
465 t->fExpQ = TMath::Max(0.8*t->fESDtrack->GetTPCsignal(),30.);
466
467 ResetTrackToFollow(*t);
468
469 // propagete to vertex [SR, GSI 17.02.2003]
470 // Start Time measurement [SR, GSI 17.02.2003], corrected by I.Belikov
471 if (fTrackToFollow.PropagateTo(3.,0.0028,65.19)) {
472 if (fTrackToFollow.PropagateToVertex()) {
473 fTrackToFollow.StartTimeIntegral();
474 }
475 fTrackToFollow.PropagateTo(3.,-0.0028,65.19);
476 }
477
478 fTrackToFollow.ResetCovariance(); fTrackToFollow.ResetClusters();
479 if (RefitAt(49.,&fTrackToFollow,t)) {
480 if (CorrectForDeadZoneMaterial(&fTrackToFollow)!=0) {
481 Warning("PropagateBack",
482 "failed to correct for the material in the dead zone !\n");
483 delete t;
484 continue;
485 }
486 fTrackToFollow.SetLabel(t->GetLabel());
487 //fTrackToFollow.CookdEdx();
488 CookLabel(&fTrackToFollow,0.); //For comparison only
489 fTrackToFollow.UpdateESDtrack(AliESDtrack::kITSout);
490 //UseClusters(&fTrackToFollow);
491 ntrk++;
492 }
493 delete t;
494 }
495
496 Info("PropagateBack","Number of back propagated ITS tracks: %d\n",ntrk);
497
498 return 0;
499}
500
501Int_t AliITStrackerMI::RefitInward(AliESD *event) {
502 //--------------------------------------------------------------------
503 // This functions refits ITS tracks using the
504 // "inward propagated" TPC tracks
505 // The clusters must be loaded !
506 //--------------------------------------------------------------------
507 Int_t nentr=event->GetNumberOfTracks();
508 Info("RefitInward", "Number of ESD tracks: %d\n", nentr);
509
510 Int_t ntrk=0;
511 for (Int_t i=0; i<nentr; i++) {
512 AliESDtrack *esd=event->GetTrack(i);
513
514 if ((esd->GetStatus()&AliESDtrack::kITSout) == 0) continue;
515 if (esd->GetStatus()&AliESDtrack::kITSrefit) continue;
516 if (esd->GetStatus()&AliESDtrack::kTPCout)
517 if ((esd->GetStatus()&AliESDtrack::kTPCrefit)==0) continue;
518
519 AliITStrackV2 *t=0;
520 try {
521 t=new AliITStrackV2(*esd);
522 } catch (const Char_t *msg) {
523 Warning("RefitInward",msg);
524 delete t;
525 continue;
526 }
527 t->fExpQ = TMath::Max(0.8*t->fESDtrack->GetTPCsignal(),30.);
528 if (CorrectForDeadZoneMaterial(t)!=0) {
529 Warning("RefitInward",
530 "failed to correct for the material in the dead zone !\n");
531 delete t;
532 continue;
533 }
534
535 ResetTrackToFollow(*t);
536 fTrackToFollow.ResetClusters();
537
538 if ((esd->GetStatus()&AliESDtrack::kTPCin)==0)
539 fTrackToFollow.ResetCovariance();
540
541 //Refitting...
542 if (RefitAt(3.7, &fTrackToFollow, t)) {
543 fTrackToFollow.SetLabel(t->GetLabel());
544 // fTrackToFollow.CookdEdx();
545 CookdEdx(&fTrackToFollow);
546
547 CookLabel(&fTrackToFollow,0.0); //For comparison only
548
549 if (fTrackToFollow.PropagateTo(3.,0.0028,65.19)) {//The beam pipe
550 Double_t a=fTrackToFollow.GetAlpha();
551 Double_t cs=TMath::Cos(a),sn=TMath::Sin(a);
552 Double_t xv= GetX()*cs + GetY()*sn;
553 Double_t yv=-GetX()*sn + GetY()*cs;
554
555 Double_t c=fTrackToFollow.GetC(), snp=fTrackToFollow.GetSnp();
556 Double_t x=fTrackToFollow.GetX(), y=fTrackToFollow.GetY();
557 Double_t tgfv=-(c*(x-xv)-snp)/(c*(y-yv) + TMath::Sqrt(1.-snp*snp));
558 Double_t fv=TMath::ATan(tgfv);
559
560 cs=TMath::Cos(fv); sn=TMath::Sin(fv);
561 x = xv*cs + yv*sn;
562 yv=-xv*sn + yv*cs; xv=x;
563
564 if (fTrackToFollow.Propagate(fv+a,xv)) {
565 fTrackToFollow.UpdateESDtrack(AliESDtrack::kITSrefit);
566 //UseClusters(&fTrackToFollow);
567 {
568 AliITSclusterV2 c; c.SetY(yv); c.SetZ(GetZ());
569 c.SetSigmaY2(GetSigmaY()*GetSigmaY());
570 c.SetSigmaZ2(GetSigmaZ()*GetSigmaZ());
571 Double_t chi2=fTrackToFollow.GetPredictedChi2(&c);
572 //Double_t chi2=GetPredictedChi2MI(&fTrackToFollow,&c,fI);
573 if (chi2<kMaxChi2)
574 if (fTrackToFollow.Update(&c,-chi2,0))
575 //if (UpdateMI(&fTrackToFollow,&c,-chi2,0))
576 fTrackToFollow.SetConstrainedESDtrack(chi2);
577 }
578 ntrk++;
579 }
580 }
581 }
582 delete t;
583 }
584
585 Info("RefitInward","Number of refitted tracks: %d\n",ntrk);
586
587 return 0;
588}
589
590AliCluster *AliITStrackerMI::GetCluster(Int_t index) const {
591 //--------------------------------------------------------------------
592 // Return pointer to a given cluster
593 //--------------------------------------------------------------------
594 Int_t l=(index & 0xf0000000) >> 28;
595 Int_t c=(index & 0x0fffffff) >> 00;
596 return fgLayers[l].GetCluster(c);
597}
598
599
600void AliITStrackerMI::FollowProlongationTree(AliITStrackV2 * otrack, Int_t esdindex)
601{
602 //--------------------------------------------------------------------
603 // Follow prolongation tree
604 //--------------------------------------------------------------------
605
606 //setup tree of the prolongations
607 //
608 static AliITStrackV2 tracks[7][100];
609 AliITStrackV2 *currenttrack;
610 static AliITStrackV2 currenttrack1;
611 static AliITStrackV2 currenttrack2;
612 static AliITStrackV2 backuptrack;
613 Int_t ntracks[7];
614 Int_t nindexes[7][100];
615 Float_t normalizedchi2[100];
616 for (Int_t ilayer=0;ilayer<6;ilayer++) ntracks[ilayer]=0;
617 otrack->fNSkipped=0;
618 new (&(tracks[6][0])) AliITStrackV2(*otrack);
619 ntracks[6]=1;
620 nindexes[6][0]=0;
621 //
622 //
623 // follow prolongations
624 for (Int_t ilayer=5;ilayer>=0;ilayer--){
625 //
626 AliITSlayer &layer=fgLayers[ilayer];
627 Double_t r=layer.GetR();
628 ntracks[ilayer]=0;
629 //
630 //
631 Int_t nskipped=0;
632 Float_t nused =0;
633 for (Int_t itrack =0;itrack<ntracks[ilayer+1];itrack++){
634 //set current track
635 if (ntracks[ilayer]>=100) break;
636 if (tracks[ilayer+1][nindexes[ilayer+1][itrack]].fNSkipped>0) nskipped++;
637 if (tracks[ilayer+1][nindexes[ilayer+1][itrack]].fNUsed>2.) nused++;
638 if (ntracks[ilayer]>15+ilayer){
639 if (itrack>1&&tracks[ilayer+1][nindexes[ilayer+1][itrack]].fNSkipped>0 && nskipped>4+ilayer) continue;
640 if (itrack>1&&tracks[ilayer+1][nindexes[ilayer+1][itrack]].fNUsed>2. && nused>3) continue;
641 }
642
643 new(&currenttrack1) AliITStrackV2(tracks[ilayer+1][nindexes[ilayer+1][itrack]]);
644 if (ilayer==3 || ilayer==1) {
645 Double_t rs=0.5*(fgLayers[ilayer+1].GetR() + r);
646 Double_t d=0.0034, x0=38.6;
647 if (ilayer==1) {rs=9.; d=0.0097; x0=42;}
648 if (!currenttrack1.PropagateTo(rs,d,x0)) {
649 continue;
650 }
651 }
652 //
653 //find intersection with layer
654 Double_t x,y,z;
655 if (!currenttrack1.GetGlobalXYZat(r,x,y,z)) {
656 continue;
657 }
658 Double_t phi=TMath::ATan2(y,x);
659 Int_t idet=layer.FindDetectorIndex(phi,z);
660 if (idet<0) {
661 continue;
662 }
663 //propagate to the intersection
664 const AliITSdetector &det=layer.GetDetector(idet);
665 phi=det.GetPhi();
666 new(&currenttrack2) AliITStrackV2(currenttrack1);
667 if (!currenttrack1.Propagate(phi,det.GetR())) {
668 continue;
669 }
670 currenttrack2.Propagate(phi,det.GetR()); //
671 currenttrack1.SetDetectorIndex(idet);
672 currenttrack2.SetDetectorIndex(idet);
673
674 //
675 //
676 Double_t dz=7.5*TMath::Sqrt(currenttrack1.GetSigmaZ2() + 16.*kSigmaZ2[ilayer]);
677 Double_t dy=7.5*TMath::Sqrt(currenttrack1.GetSigmaY2() + 16.*kSigmaY2[ilayer]);
678 //
679 Bool_t isBoundary=kFALSE;
680 if (currenttrack1.GetY()-dy< det.GetYmin()+0.2) isBoundary = kTRUE;
681 if (currenttrack1.GetY()+dy> det.GetYmax()-0.2) isBoundary = kTRUE;
682 if (currenttrack1.GetZ()-dz< det.GetZmin()+0.2) isBoundary = kTRUE;
683 if (currenttrack1.GetZ()+dz> det.GetZmax()-0.2) isBoundary = kTRUE;
684
685 if (isBoundary){ // track at boundary between detectors
686 Float_t maxtgl = TMath::Abs(currenttrack1.GetTgl());
687 if (maxtgl>1) maxtgl=1;
688 dz = TMath::Sqrt(dz*dz+0.25*maxtgl*maxtgl);
689 //
690 Float_t maxsnp = TMath::Abs(currenttrack1.GetSnp());
691 if (maxsnp>0.95) continue;
692 //if (maxsnp>0.5) maxsnp=0.5;
693 dy=TMath::Sqrt(dy*dy+0.25*maxsnp*maxsnp);
694 }
695
696 Double_t zmin=currenttrack1.GetZ() - dz;
697 Double_t zmax=currenttrack1.GetZ() + dz;
698 Double_t ymin=currenttrack1.GetY() + r*phi - dy;
699 Double_t ymax=currenttrack1.GetY() + r*phi + dy;
700 layer.SelectClusters(zmin,zmax,ymin,ymax);
701 //
702 // loop over all possible prolongations
703 //
704 Double_t msz=1./((currenttrack1.GetSigmaZ2() + 16.*kSigmaZ2[ilayer]));
705 Double_t msy=1./((currenttrack1.GetSigmaY2() + 16.*kSigmaY2[ilayer]));
706 if (fConstraint[fPass]){
707 msy/=60; msz/=60.;
708 }
709 else{
710 msy/=50; msz/=50.;
711 }
712 //
713 const AliITSclusterV2 *c=0; Int_t ci=-1;
714 Double_t chi2=12345.;
715 Int_t deadzone=0;
716 currenttrack = &currenttrack1;
717 while ((c=layer.GetNextCluster(ci))!=0) {
718 if (ntracks[ilayer]>95) break; //space for skipped clusters
719 Bool_t change =kFALSE;
720 if (c->GetQ()==0 && (deadzone==1)) continue;
721 Int_t idet=c->GetDetectorIndex();
722 if (currenttrack->GetDetectorIndex()!=idet) {
723 const AliITSdetector &det=layer.GetDetector(idet);
724 Double_t y,z;
725 if (!currenttrack2.GetProlongationFast(det.GetPhi(),det.GetR(),y,z)) continue;
726 Float_t pz = (z - c->GetZ()) , py=(y - c->GetY());
727 if (pz*pz*msz+py*py*msy>1.) continue;
728 //
729 new (&backuptrack) AliITStrackV2(currenttrack2);
730 change = kTRUE;
731 currenttrack =&currenttrack2;
732 if (!currenttrack->Propagate(det.GetPhi(),det.GetR())) {
733 new (currenttrack) AliITStrackV2(backuptrack);
734 change = kFALSE;
735 continue;
736 }
737 currenttrack->SetDetectorIndex(idet);
738 }
739 else{
740 Float_t pz = (currenttrack->GetZ() - c->GetZ()) , py=(currenttrack->GetY() - c->GetY());
741 if (pz*pz*msz+py*py*msy>1.) continue;
742 }
743
744 chi2=GetPredictedChi2MI(currenttrack,c,ilayer);
745 if (chi2<kMaxChi2s[ilayer]){
746 if (c->GetQ()==0) deadzone=1; // take dead zone only once
747 if (ntracks[ilayer]>=100) continue;
748 AliITStrackV2 * updatetrack = new (&tracks[ilayer][ntracks[ilayer]]) AliITStrackV2(*currenttrack);
749 updatetrack->fClIndex[ilayer]=0;
750 if (change){
751 new (&currenttrack2) AliITStrackV2(backuptrack);
752 }
753 if (c->GetQ()!=0){
754 if (!UpdateMI(updatetrack,c,chi2,(ilayer<<28)+ci)) continue;
755 updatetrack->SetSampledEdx(c->GetQ(),updatetrack->GetNumberOfClusters()-1); //b.b.
756 }
757 else {
758 updatetrack->fNDeadZone++;
759 updatetrack->fDeadZoneProbability=GetDeadZoneProbability(updatetrack->GetZ(),TMath::Sqrt(updatetrack->GetSigmaZ2()));
760 }
761 if (c->IsUsed()){
762 updatetrack->fNUsed++;
763 }
764 Double_t x0;
765 Double_t d=layer.GetThickness(updatetrack->GetY(),updatetrack->GetZ(),x0);
766 updatetrack->CorrectForMaterial(d,x0);
767 if (fConstraint[fPass]) {
768 updatetrack->fConstrain = fConstraint[fPass];
769 fI = ilayer;
770 Double_t d=GetEffectiveThickness(0,0); //Think of this !!!!
771 Double_t xyz[]={GetX(),GetY(),GetZ()};
772 Double_t ptfactor = 1;
773 Double_t ers[]={GetSigmaX()*ptfactor,GetSigmaY()*ptfactor,GetSigmaZ()};
774 Bool_t isPrim = kTRUE;
775 if (ilayer<4){
776 updatetrack->fD[0] = updatetrack->GetD(GetX(),GetY());
777 updatetrack->fD[1] = updatetrack->GetZat(GetX())-GetZ();
778 if ( TMath::Abs(updatetrack->fD[0]/(1.+ilayer))>0.4 || TMath::Abs(updatetrack->fD[1]/(1.+ilayer))>0.4) isPrim=kFALSE;
779 }
780 if (isPrim) updatetrack->Improve(d,xyz,ers);
781 } //apply vertex constrain
782 ntracks[ilayer]++;
783 } // create new hypothesy
784 } // loop over possible cluster prolongation
785 // if (fConstraint[fPass]&&itrack<2&&currenttrack1.fNSkipped==0 && deadzone==0){
786 if (itrack<2&&currenttrack1.fNSkipped==0 && deadzone==0&&ntracks[ilayer]<100){
787 AliITStrackV2* vtrack = new (&tracks[ilayer][ntracks[ilayer]]) AliITStrackV2(currenttrack1);
788 vtrack->fClIndex[ilayer]=0;
789 fI = ilayer;
790 Double_t d=GetEffectiveThickness(0,0); //Think of this !!!!
791 Double_t xyz[]={GetX(),GetY(),GetZ()};
792 Double_t ers[]={GetSigmaX(),GetSigmaY(),GetSigmaZ()};
793 vtrack->Improve(d,xyz,ers);
794 vtrack->fNSkipped++;
795 ntracks[ilayer]++;
796 }
797
798 } //loop over track candidates
799 //
800 //
801 Int_t accepted=0;
802
803 Int_t golds=0;
804 for (Int_t itrack=0;itrack<ntracks[ilayer];itrack++){
805 normalizedchi2[itrack] = NormalizedChi2(&tracks[ilayer][itrack],ilayer);
806 if ( normalizedchi2[itrack]<3+0.5*ilayer) golds++;
807 if (ilayer>4) accepted++;
808 else{
809 if ( fConstraint[fPass] && normalizedchi2[itrack]<kMaxNormChi2C[ilayer]+1) accepted++;
810 if (!fConstraint[fPass] && normalizedchi2[itrack]<kMaxNormChi2NonC[ilayer]+1) accepted++;
811 }
812 }
813 TMath::Sort(ntracks[ilayer],normalizedchi2,nindexes[ilayer],kFALSE);
814 ntracks[ilayer] = TMath::Min(accepted,7+2*ilayer);
815 if (ntracks[ilayer]<golds+2+ilayer) ntracks[ilayer]=TMath::Min(golds+2+ilayer,accepted);
816 if (ntracks[ilayer]>90) ntracks[ilayer]=90;
817 } //loop over layers
818 //printf("%d\t%d\t%d\t%d\t%d\t%d\n",ntracks[0],ntracks[1],ntracks[2],ntracks[3],ntracks[4],ntracks[5]);
819
820 for (Int_t i=0;i<TMath::Min(20,ntracks[0]);i++) {
821 AliITStrackV2 & track= tracks[0][nindexes[0][i]];
822 if (!fConstraint[fPass]&&track.fNormChi2[0]>7.)continue;
823 AddTrackHypothesys(new AliITStrackV2(track), esdindex);
824 }
825 for (Int_t i=0;i<TMath::Min(4,ntracks[1]);i++) {
826 AliITStrackV2 & track= tracks[1][nindexes[1][i]];
827 if (track.GetNumberOfClusters()<4) continue;
828 if (!fConstraint[fPass]&&track.fNormChi2[1]>7.)continue;
829 if (fConstraint[fPass]) track.fNSkipped+=1;
830 if (!fConstraint[fPass]) {
831 track.fD[0] = track.GetD(GetX(),GetY());
4c53440c 832 track.fNSkipped+=4./(4.+8.*TMath::Abs(track.fD[0]));
e43c066c 833 if (track.fN+track.fNDeadZone+track.fNSkipped>6) {
834 track.fNSkipped = 6-track.fN+track.fNDeadZone;
835 }
836 }
837 AddTrackHypothesys(new AliITStrackV2(track), esdindex);
838 }
839 //}
840
841 if (!fConstraint[fPass]){
842 for (Int_t i=0;i<TMath::Min(3,ntracks[2]);i++) {
843 AliITStrackV2 & track= tracks[2][nindexes[2][i]];
844 if (track.GetNumberOfClusters()<4) continue;
845 if (!fConstraint[fPass]&&track.fNormChi2[2]>7.)continue;
846 if (fConstraint[fPass]) track.fNSkipped+=2;
847 if (!fConstraint[fPass]){
848 track.fD[0] = track.GetD(GetX(),GetY());
4c53440c 849 track.fNSkipped+= 7./(7.+8.*TMath::Abs(track.fD[0]));
e43c066c 850 if (track.fN+track.fNDeadZone+track.fNSkipped>6) {
851 track.fNSkipped = 6-track.fN+track.fNDeadZone;
852 }
853 }
854 AddTrackHypothesys(new AliITStrackV2(track), esdindex);
855 }
856 }
857}
858
859
860AliITStrackerMI::AliITSlayer & AliITStrackerMI::GetLayer(Int_t layer) const
861{
862 //--------------------------------------------------------------------
863 //
864 //
865 return fgLayers[layer];
866}
867AliITStrackerMI::AliITSlayer::AliITSlayer() {
868 //--------------------------------------------------------------------
869 //default AliITSlayer constructor
870 //--------------------------------------------------------------------
871 fN=0;
872 fDetectors=0;
873 fSkip = 0;
874 fCurrentSlice=-1;
875 for (Int_t i=0; i<kMaxClusterPerLayer;i++) {
876 fClusterWeight[i]=0;
877 fClusterTracks[0][i]=-1;
878 fClusterTracks[1][i]=-1;
879 fClusterTracks[2][i]=-1;
880 fClusterTracks[3][i]=-1;
881 }
882}
883
884AliITStrackerMI::AliITSlayer::
885AliITSlayer(Double_t r,Double_t p,Double_t z,Int_t nl,Int_t nd) {
886 //--------------------------------------------------------------------
887 //main AliITSlayer constructor
888 //--------------------------------------------------------------------
889 fR=r; fPhiOffset=p; fZOffset=z;
890 fNladders=nl; fNdetectors=nd;
891 fDetectors=new AliITSdetector[fNladders*fNdetectors];
892
893 fN=0;
894 fI=0;
895 fSkip = 0;
896 fRoad=2*fR*TMath::Sqrt(3.14/1.);//assuming that there's only one cluster
897}
898
899AliITStrackerMI::AliITSlayer::~AliITSlayer() {
900 //--------------------------------------------------------------------
901 // AliITSlayer destructor
902 //--------------------------------------------------------------------
903 delete[] fDetectors;
904 for (Int_t i=0; i<fN; i++) delete fClusters[i];
905 for (Int_t i=0; i<kMaxClusterPerLayer;i++) {
906 fClusterWeight[i]=0;
907 fClusterTracks[0][i]=-1;
908 fClusterTracks[1][i]=-1;
909 fClusterTracks[2][i]=-1;
910 fClusterTracks[3][i]=-1;
911 }
912}
913
914void AliITStrackerMI::AliITSlayer::ResetClusters() {
915 //--------------------------------------------------------------------
916 // This function removes loaded clusters
917 //--------------------------------------------------------------------
918 for (Int_t i=0; i<fN; i++) delete fClusters[i];
919 for (Int_t i=0; i<kMaxClusterPerLayer;i++){
920 fClusterWeight[i]=0;
921 fClusterTracks[0][i]=-1;
922 fClusterTracks[1][i]=-1;
923 fClusterTracks[2][i]=-1;
924 fClusterTracks[3][i]=-1;
925 }
926
927 fN=0;
928 fI=0;
929}
930
931void AliITStrackerMI::AliITSlayer::ResetWeights() {
932 //--------------------------------------------------------------------
933 // This function reset weights of the clusters
934 //--------------------------------------------------------------------
935 for (Int_t i=0; i<kMaxClusterPerLayer;i++) {
936 fClusterWeight[i]=0;
937 fClusterTracks[0][i]=-1;
938 fClusterTracks[1][i]=-1;
939 fClusterTracks[2][i]=-1;
940 fClusterTracks[3][i]=-1;
941 }
942 for (Int_t i=0; i<fN;i++) {
943 AliITSclusterV2 * cl = (AliITSclusterV2*)GetCluster(i);
944 if (cl&&cl->IsUsed()) cl->Use();
945 }
946
947}
948
949void AliITStrackerMI::AliITSlayer::ResetRoad() {
950 //--------------------------------------------------------------------
951 // This function calculates the road defined by the cluster density
952 //--------------------------------------------------------------------
953 Int_t n=0;
954 for (Int_t i=0; i<fN; i++) {
955 if (TMath::Abs(fClusters[i]->GetZ())<fR) n++;
956 }
957 //if (n>1) fRoad=2*fR*TMath::Sqrt(3.14/n);
958 if (n>1) fRoad=2*fR*TMath::Sqrt(3.14/n);
959}
960
961Int_t AliITStrackerMI::AliITSlayer::InsertCluster(AliITSclusterV2 *c) {
962 //--------------------------------------------------------------------
963 //This function adds a cluster to this layer
964 //--------------------------------------------------------------------
965 if (fN==kMaxClusterPerLayer) {
966 ::Error("InsertCluster","Too many clusters !\n");
967 return 1;
968 }
969 fCurrentSlice=-1;
970 if (fN==0) {fClusters[fN++]=c; return 0;}
971 Int_t i=FindClusterIndex(c->GetZ());
972 memmove(fClusters+i+1 ,fClusters+i,(fN-i)*sizeof(AliITSclusterV2*));
973 memmove(fY+i+1 ,fY+i,(fN-i)*sizeof(Float_t));
974 memmove(fZ+i+1 ,fZ+i,(fN-i)*sizeof(Float_t));
975 fClusters[i]=c; fN++;
976 //
977 AliITSdetector &det=GetDetector(c->GetDetectorIndex());
978 Double_t y=fR*det.GetPhi() + c->GetY();
979 if (y>2.*fR*TMath::Pi()) y -= 2.*fR*TMath::Pi();
980 fY[i] = y;
981 fZ[i] = c->GetZ();
982 if (c->GetY()<det.GetYmin()) det.SetYmin(c->GetY());
983 if (c->GetY()>det.GetYmax()) det.SetYmax(c->GetY());
984 if (c->GetZ()<det.GetZmin()) det.SetZmin(c->GetZ());
985 if (c->GetZ()>det.GetZmax()) det.SetZmax(c->GetZ());
986
987 return 0;
988}
989
990void AliITStrackerMI::AliITSlayer::SortClusters()
991{
992 //
993 //sort clusters
994 //
995 fYB[0]=10000000;
996 fYB[1]=-10000000;
997 for (Int_t i=0;i<fN;i++){
998 if (fY[i]<fYB[0]) fYB[0]=fY[i];
999 if (fY[i]>fYB[1]) fYB[1]=fY[i];
1000 fClusterIndex[i] = i;
1001 }
1002 //
1003 // fill slices
1004 fDy5 = (fYB[1]-fYB[0])/5.;
1005 fDy10 = (fYB[1]-fYB[0])/10.;
1006 fDy20 = (fYB[1]-fYB[0])/20.;
1007 for (Int_t i=0;i<6;i++) fN5[i] =0;
1008 for (Int_t i=0;i<11;i++) fN10[i]=0;
1009 for (Int_t i=0;i<21;i++) fN20[i]=0;
1010 //
1011 for (Int_t i=0;i<6;i++) {fBy5[i][0] = fYB[0]+(i-0.75)*fDy5; fBy5[i][1] = fYB[0]+(i+0.75)*fDy5;}
1012 for (Int_t i=0;i<11;i++) {fBy10[i][0] = fYB[0]+(i-0.75)*fDy10; fBy10[i][1] = fYB[0]+(i+0.75)*fDy10;}
1013 for (Int_t i=0;i<21;i++) {fBy20[i][0] = fYB[0]+(i-0.75)*fDy20; fBy20[i][1] = fYB[0]+(i+0.75)*fDy20;}
1014 //
1015 //
1016 for (Int_t i=0;i<fN;i++) for (Int_t irot=-1;irot<=1;irot++){
1017 Float_t curY = fY[i]+irot*2.*TMath::Pi()*fR;
1018 if (curY<fYB[0]-fDy5) continue;
1019 if (curY>fYB[1]+fDy5) continue;
1020 //
1021 // slice 10
db3f8691 1022 if (TMath::Abs(fYB[1]-fYB[0])<=0) continue;
e43c066c 1023 Float_t fslice = TMath::Nint(10.*(curY-fYB[0])/(fYB[1]-fYB[0]));
1024 Float_t ymiddle = fYB[0]+fslice*fDy10;
1025 for (Int_t di =-1;di<=1;di++){
1026 if (TMath::Abs(curY-(ymiddle+(float)di*fDy10))<0.75*fDy10){
1027 //
1028 Int_t slice = int(fslice+21.0001)-21+di;
1029 if (slice<0) continue;
1030 if (slice>10) continue;
1031 fClusters10[slice][fN10[slice]] = fClusters[i];
1032 fY10[slice][fN10[slice]] = curY;
1033 fZ10[slice][fN10[slice]] = fZ[i];
1034 fClusterIndex10[slice][fN10[slice]]=i;
1035 fN10[slice]++;
1036 }
1037 }
1038 //
1039 // slice 5
1040 fslice = TMath::Nint(5.*(curY-fYB[0])/(fYB[1]-fYB[0]));
1041 ymiddle = fYB[0]+fslice*fDy5;
1042 for (Int_t di =-1;di<=1;di++){
1043 if (TMath::Abs(curY-(ymiddle+(float)di*fDy5))<0.75*fDy5){
1044 //
1045 Int_t slice = int(fslice+21.0001)-21+di;
1046 if (slice<0) continue;
1047 if (slice>5) continue;
1048 fClusters5[slice][fN5[slice]] = fClusters[i];
1049 fY5[slice][fN5[slice]] = curY;
1050 fZ5[slice][fN5[slice]] = fZ[i];
1051 fClusterIndex5[slice][fN5[slice]]=i;
1052 fN5[slice]++;
1053 }
1054 }
1055 //
1056 // slice 20
1057 fslice = TMath::Nint(20.*(curY-fYB[0])/(fYB[1]-fYB[0]));
1058 ymiddle = fYB[0]+fslice*fDy20;
1059 for (Int_t di =-1;di<=1;di++){
1060 if (TMath::Abs(curY-(ymiddle+(float)di*fDy20))<0.75*fDy20){
1061 //
1062 Int_t slice = int(fslice+21.0001)-21+di;
1063 if (slice<0) continue;
1064 if (slice>20) continue;
1065 fClusters20[slice][fN20[slice]] = fClusters[i];
1066 fY20[slice][fN20[slice]] = curY;
1067 fZ20[slice][fN20[slice]] = fZ[i];
1068 fClusterIndex20[slice][fN20[slice]]=i;
1069 fN20[slice]++;
1070 }
1071 }
1072 }
1073}
1074
1075
1076
1077
1078Int_t AliITStrackerMI::AliITSlayer::FindClusterIndex(Float_t z) const {
1079 //--------------------------------------------------------------------
1080 // This function returns the index of the nearest cluster
1081 //--------------------------------------------------------------------
1082 Int_t ncl=0;
1083 const Float_t *zcl;
1084 if (fCurrentSlice<0) {
1085 ncl = fN;
1086 zcl = fZ;
1087 }
1088 else{
1089 ncl = fNcs;
1090 zcl = fZcs;;
1091 }
1092
1093 if (ncl==0) return 0;
1094 Int_t b=0, e=ncl-1, m=(b+e)/2;
1095 for (; b<e; m=(b+e)/2) {
1096 // if (z > fClusters[m]->GetZ()) b=m+1;
1097 if (z > zcl[m]) b=m+1;
1098 else e=m;
1099 }
1100 return m;
1101}
1102/*
1103void AliITStrackerMI::AliITSlayer::
1104SelectClusters(Double_t zmin,Double_t zmax,Double_t ymin, Double_t ymax) {
1105 //--------------------------------------------------------------------
1106 // This function sets the "window"
1107 //--------------------------------------------------------------------
1108 fI=FindClusterIndex(zmin); fZmax=zmax;
1109 fImax = TMath::Min(FindClusterIndex(zmax)+1,fN);
1110 Double_t circle=2*TMath::Pi()*fR;
1111 if (ymax>circle) { ymax-=circle; ymin-=circle; }
1112 fYmin=ymin; fYmax=ymax;
1113 fSkip = 0;
1114}
1115*/
1116
1117
1118void AliITStrackerMI::AliITSlayer::
1119SelectClusters(Double_t zmin,Double_t zmax,Double_t ymin, Double_t ymax) {
1120 //--------------------------------------------------------------------
1121 // This function sets the "window"
1122 //--------------------------------------------------------------------
1123
1124 Double_t circle=2*TMath::Pi()*fR;
1125 fYmin = ymin; fYmax =ymax;
1126 Float_t ymiddle = (fYmin+fYmax)*0.5;
1127 if (ymiddle<fYB[0]) {fYmin+=circle; fYmax+=circle;ymiddle+=circle;}
1128 else{
1129 if (ymiddle>fYB[1]) {fYmin-=circle; fYmax-=circle;ymiddle-=circle;}
1130 }
1131 //
1132 fCurrentSlice =-1;
1133 // defualt take all
1134 fClustersCs = fClusters;
1135 fClusterIndexCs = fClusterIndex;
1136 fYcs = fY;
1137 fZcs = fZ;
1138 fNcs = fN;
1139 //
1140 //is in 20 slice?
1141 if (fCurrentSlice<0&&TMath::Abs(fYmax-fYmin)<1.49*fDy20){
1142 Int_t slice = int(0.5+(ymiddle-fYB[0])/fDy20);
1143 if (slice<0) slice=0;
1144 if (slice>20) slice=20;
1145 Bool_t isOK = (fYmin>fBy20[slice][0]&&fYmax<fBy20[slice][1]);
1146 if (isOK) {
1147 fCurrentSlice=slice;
1148 fClustersCs = fClusters20[fCurrentSlice];
1149 fClusterIndexCs = fClusterIndex20[fCurrentSlice];
1150 fYcs = fY20[fCurrentSlice];
1151 fZcs = fZ20[fCurrentSlice];
1152 fNcs = fN20[fCurrentSlice];
1153 }
1154 }
1155 //
1156 //is in 10 slice?
1157 if (fCurrentSlice<0&&TMath::Abs(fYmax-fYmin)<1.49*fDy10){
1158 Int_t slice = int(0.5+(ymiddle-fYB[0])/fDy10);
1159 if (slice<0) slice=0;
1160 if (slice>10) slice=10;
1161 Bool_t isOK = (fYmin>fBy10[slice][0]&&fYmax<fBy10[slice][1]);
1162 if (isOK) {
1163 fCurrentSlice=slice;
1164 fClustersCs = fClusters10[fCurrentSlice];
1165 fClusterIndexCs = fClusterIndex10[fCurrentSlice];
1166 fYcs = fY10[fCurrentSlice];
1167 fZcs = fZ10[fCurrentSlice];
1168 fNcs = fN10[fCurrentSlice];
1169 }
1170 }
1171 //
1172 //is in 5 slice?
1173 if (fCurrentSlice<0&&TMath::Abs(fYmax-fYmin)<1.49*fDy5){
1174 Int_t slice = int(0.5+(ymiddle-fYB[0])/fDy5);
1175 if (slice<0) slice=0;
1176 if (slice>5) slice=5;
1177 Bool_t isOK = (fYmin>fBy5[slice][0]&&fYmax<fBy5[slice][1]);
1178 if ( isOK){
1179 fCurrentSlice=slice;
1180 fClustersCs = fClusters5[fCurrentSlice];
1181 fClusterIndexCs = fClusterIndex5[fCurrentSlice];
1182 fYcs = fY5[fCurrentSlice];
1183 fZcs = fZ5[fCurrentSlice];
1184 fNcs = fN5[fCurrentSlice];
1185 }
1186 }
1187 //
1188 fI=FindClusterIndex(zmin); fZmax=zmax;
1189 fImax = TMath::Min(FindClusterIndex(zmax)+1,fNcs);
1190 fSkip = 0;
1191 fAccepted =0;
1192}
1193
1194/*
1195const AliITSclusterV2 *AliITStrackerMI::AliITSlayer::GetNextCluster(Int_t &ci){
1196 //--------------------------------------------------------------------
1197 // This function returns clusters within the "window"
1198 //--------------------------------------------------------------------
1199 const AliITSclusterV2 *cluster=0;
1200 for (Int_t i=fI; i<fN; i++) {
1201 const AliITSclusterV2 *c=fClusters[i];
1202 if (c->GetZ() > fZmax) break;
1203 // if (c->IsUsed()) continue;
1204 const AliITSdetector &det=GetDetector(c->GetDetectorIndex());
1205 Double_t y=fR*det.GetPhi() + c->GetY();
1206
1207 if (y>2.*fR*TMath::Pi()) y -= 2*fR*TMath::Pi();
1208 if (y>1.*fR*TMath::Pi() && fYmax<y) y -= 2*fR*TMath::Pi();
1209
1210 if (y<fYmin) continue;
1211 if (y>fYmax) continue;
1212 cluster=c; ci=i;
1213 fI=i+1;
1214 break;
1215 }
1216 return cluster;
1217}
1218*/
1219
1220const AliITSclusterV2 *AliITStrackerMI::AliITSlayer::GetNextCluster(Int_t &ci){
1221 //--------------------------------------------------------------------
1222 // This function returns clusters within the "window"
1223 //--------------------------------------------------------------------
1224
1225 if (fCurrentSlice<0){
1226 Double_t rpi2 = 2.*fR*TMath::Pi();
1227 for (Int_t i=fI; i<fImax; i++) {
1228 Double_t y = fY[i];
1229 if (fYmax<y) y -= rpi2;
1230 if (y<fYmin) continue;
1231 if (y>fYmax) continue;
1232 if (fClusters[i]->GetQ()==0&&fSkip==2) continue;
1233 ci=i;
1234 fI=i+1;
1235 return fClusters[i];
1236 }
1237 }
1238 else{
1239 for (Int_t i=fI; i<fImax; i++) {
1240 if (fYcs[i]<fYmin) continue;
1241 if (fYcs[i]>fYmax) continue;
1242 if (fClustersCs[i]->GetQ()==0&&fSkip==2) continue;
1243 ci=fClusterIndexCs[i];
1244 fI=i+1;
1245 return fClustersCs[i];
1246 }
1247 }
1248 return 0;
1249}
1250
1251
1252
1253Int_t AliITStrackerMI::AliITSlayer::
1254FindDetectorIndex(Double_t phi, Double_t z) const {
1255 //--------------------------------------------------------------------
1256 //This function finds the detector crossed by the track
1257 //--------------------------------------------------------------------
1258 Double_t dphi=-(phi-fPhiOffset);
1259 if (dphi < 0) dphi += 2*TMath::Pi();
1260 else if (dphi >= 2*TMath::Pi()) dphi -= 2*TMath::Pi();
1261 Int_t np=Int_t(dphi*fNladders*0.5/TMath::Pi()+0.5);
1262 if (np>=fNladders) np-=fNladders;
1263 if (np<0) np+=fNladders;
1264
1265 Double_t dz=fZOffset-z;
1266 Int_t nz=Int_t(dz*(fNdetectors-1)*0.5/fZOffset+0.5);
1267 if (nz>=fNdetectors) return -1;
1268 if (nz<0) return -1;
1269
1270 return np*fNdetectors + nz;
1271}
1272
1273Double_t AliITStrackerMI::AliITSlayer::GetThickness(Double_t y,Double_t z,Double_t &x0)
1274const {
1275 //--------------------------------------------------------------------
1276 //This function returns the layer thickness at this point (units X0)
1277 //--------------------------------------------------------------------
1278 Double_t d=0.0085;
1279 x0=21.82;
1280 if (43<fR&&fR<45) { //SSD2
1281 Double_t dd=0.0034;
1282 d=dd;
1283 if (TMath::Abs(y-0.00)>3.40) d+=dd;
1284 if (TMath::Abs(y-1.90)<0.45) {d+=(0.013-0.0034);}
1285 if (TMath::Abs(y+1.90)<0.45) {d+=(0.013-0.0034);}
1286 for (Int_t i=0; i<12; i++) {
1287 if (TMath::Abs(z-3.9*(i+0.5))<0.15) {
1288 if (TMath::Abs(y-0.00)>3.40) d+=dd;
1289 d+=0.0034;
1290 break;
1291 }
1292 if (TMath::Abs(z+3.9*(i+0.5))<0.15) {
1293 if (TMath::Abs(y-0.00)>3.40) d+=dd;
1294 d+=0.0034;
1295 break;
1296 }
1297 if (TMath::Abs(z-3.4-3.9*i)<0.50) {d+=(0.016-0.0034); break;}
1298 if (TMath::Abs(z+0.5+3.9*i)<0.50) {d+=(0.016-0.0034); break;}
1299 }
1300 } else
1301 if (37<fR&&fR<41) { //SSD1
1302 Double_t dd=0.0034;
1303 d=dd;
1304 if (TMath::Abs(y-0.00)>3.40) d+=dd;
1305 if (TMath::Abs(y-1.90)<0.45) {d+=(0.013-0.0034);}
1306 if (TMath::Abs(y+1.90)<0.45) {d+=(0.013-0.0034);}
1307 for (Int_t i=0; i<11; i++) {
1308 if (TMath::Abs(z-3.9*i)<0.15) {
1309 if (TMath::Abs(y-0.00)>3.40) d+=dd;
1310 d+=dd;
1311 break;
1312 }
1313 if (TMath::Abs(z+3.9*i)<0.15) {
1314 if (TMath::Abs(y-0.00)>3.40) d+=dd;
1315 d+=dd;
1316 break;
1317 }
1318 if (TMath::Abs(z-1.85-3.9*i)<0.50) {d+=(0.016-0.0034); break;}
1319 if (TMath::Abs(z+2.05+3.9*i)<0.50) {d+=(0.016-0.0034); break;}
1320 }
1321 } else
1322 if (13<fR&&fR<26) { //SDD
1323 Double_t dd=0.0033;
1324 d=dd;
1325 if (TMath::Abs(y-0.00)>3.30) d+=dd;
1326
1327 if (TMath::Abs(y-1.80)<0.55) {
1328 d+=0.016;
1329 for (Int_t j=0; j<20; j++) {
1330 if (TMath::Abs(z+0.7+1.47*j)<0.12) {d+=0.08; x0=9.; break;}
1331 if (TMath::Abs(z-0.7-1.47*j)<0.12) {d+=0.08; x0=9.; break;}
1332 }
1333 }
1334 if (TMath::Abs(y+1.80)<0.55) {
1335 d+=0.016;
1336 for (Int_t j=0; j<20; j++) {
1337 if (TMath::Abs(z-0.7-1.47*j)<0.12) {d+=0.08; x0=9.; break;}
1338 if (TMath::Abs(z+0.7+1.47*j)<0.12) {d+=0.08; x0=9.; break;}
1339 }
1340 }
1341
1342 for (Int_t i=0; i<4; i++) {
1343 if (TMath::Abs(z-7.3*i)<0.60) {
1344 d+=dd;
1345 if (TMath::Abs(y-0.00)>3.30) d+=dd;
1346 break;
1347 }
1348 if (TMath::Abs(z+7.3*i)<0.60) {
1349 d+=dd;
1350 if (TMath::Abs(y-0.00)>3.30) d+=dd;
1351 break;
1352 }
1353 }
1354 } else
1355 if (6<fR&&fR<8) { //SPD2
1356 Double_t dd=0.0063; x0=21.5;
1357 d=dd;
1358 if (TMath::Abs(y-3.08)>0.5) d+=dd;
1359 //if (TMath::Abs(y-3.08)>0.45) d+=dd;
1360 if (TMath::Abs(y-3.03)<0.10) {d+=0.014;}
1361 } else
1362 if (3<fR&&fR<5) { //SPD1
1363 Double_t dd=0.0063; x0=21.5;
1364 d=dd;
1365 if (TMath::Abs(y+0.21)>0.6) d+=dd;
1366 //if (TMath::Abs(y+0.21)>0.45) d+=dd;
1367 if (TMath::Abs(y+0.10)<0.10) {d+=0.014;}
1368 }
1369
1370 return d;
1371}
1372
1373Double_t AliITStrackerMI::GetEffectiveThickness(Double_t y,Double_t z) const
1374{
1375 //--------------------------------------------------------------------
1376 //Returns the thickness between the current layer and the vertex (units X0)
1377 //--------------------------------------------------------------------
1378 Double_t d=0.0028*3*3; //beam pipe
1379 Double_t x0=0;
1380
1381 Double_t xn=fgLayers[fI].GetR();
1382 for (Int_t i=0; i<fI; i++) {
1383 Double_t xi=fgLayers[i].GetR();
1384 d+=fgLayers[i].GetThickness(y,z,x0)*xi*xi;
1385 }
1386
1387 if (fI>1) {
1388 Double_t xi=9.;
1389 d+=0.0097*xi*xi;
1390 }
1391
1392 if (fI>3) {
1393 Double_t xi=0.5*(fgLayers[3].GetR()+fgLayers[4].GetR());
1394 d+=0.0034*xi*xi;
1395 }
1396
1397 return d/(xn*xn);
1398}
1399
1400Int_t AliITStrackerMI::AliITSlayer::InRoad() const {
1401 //--------------------------------------------------------------------
1402 // This function returns number of clusters within the "window"
1403 //--------------------------------------------------------------------
1404 Int_t ncl=0;
1405 for (Int_t i=fI; i<fN; i++) {
1406 const AliITSclusterV2 *c=fClusters[i];
1407 if (c->GetZ() > fZmax) break;
1408 if (c->IsUsed()) continue;
1409 const AliITSdetector &det=GetDetector(c->GetDetectorIndex());
1410 Double_t y=fR*det.GetPhi() + c->GetY();
1411
1412 if (y>2.*fR*TMath::Pi()) y -= 2*fR*TMath::Pi();
1413 if (y>1.*fR*TMath::Pi() && fYmax<y) y -= 2*fR*TMath::Pi();
1414
1415 if (y<fYmin) continue;
1416 if (y>fYmax) continue;
1417 ncl++;
1418 }
1419 return ncl;
1420}
1421
1422Bool_t
1423AliITStrackerMI::RefitAt(Double_t xx,AliITStrackV2 *t,const AliITStrackV2 *c) {
1424 //--------------------------------------------------------------------
1425 // This function refits the track "t" at the position "x" using
1426 // the clusters from "c"
1427 //--------------------------------------------------------------------
1428 Int_t index[kMaxLayer];
1429 Int_t k;
1430 for (k=0; k<kMaxLayer; k++) index[k]=-1;
1431 Int_t nc=c->GetNumberOfClusters();
1432 for (k=0; k<nc; k++) {
1433 Int_t idx=c->GetClusterIndex(k),nl=(idx&0xf0000000)>>28;
1434 index[nl]=idx;
1435 }
1436
1437 Int_t from, to, step;
1438 if (xx > t->GetX()) {
1439 from=0; to=kMaxLayer;
1440 step=+1;
1441 } else {
1442 from=kMaxLayer-1; to=-1;
1443 step=-1;
1444 }
1445
1446 for (Int_t i=from; i != to; i += step) {
1447 AliITSlayer &layer=fgLayers[i];
1448 Double_t r=layer.GetR();
1449
1450 {
1451 Double_t hI=i-0.5*step;
1452 if (TMath::Abs(hI-1.5)<0.01 || TMath::Abs(hI-3.5)<0.01) {
1453 Double_t rs=0.5*(fgLayers[i-step].GetR() + r);
1454 Double_t d=0.0034, x0=38.6;
1455 if (TMath::Abs(hI-1.5)<0.01) {rs=9.; d=0.0097; x0=42;}
1456 if (!t->PropagateTo(rs,-step*d,x0)) {
1457 return kFALSE;
1458 }
1459 }
1460 }
1461
1462 // remember old position [SR, GSI 18.02.2003]
1463 Double_t oldX=0., oldY=0., oldZ=0.;
1464 if (t->IsStartedTimeIntegral() && step==1) {
1465 t->GetGlobalXYZat(t->GetX(),oldX,oldY,oldZ);
1466 }
1467 //
1468
1469 Double_t x,y,z;
1470 if (!t->GetGlobalXYZat(r,x,y,z)) {
1471 return kFALSE;
1472 }
1473 Double_t phi=TMath::ATan2(y,x);
1474 Int_t idet=layer.FindDetectorIndex(phi,z);
1475 if (idet<0) {
1476 return kFALSE;
1477 }
1478 const AliITSdetector &det=layer.GetDetector(idet);
1479 phi=det.GetPhi();
1480 if (!t->Propagate(phi,det.GetR())) {
1481 return kFALSE;
1482 }
1483 t->SetDetectorIndex(idet);
1484
1485 const AliITSclusterV2 *cl=0;
1486 Double_t maxchi2=1000.*kMaxChi2;
1487
1488 Int_t idx=index[i];
1489 if (idx>0) {
1490 const AliITSclusterV2 *c=(AliITSclusterV2 *)GetCluster(idx);
1491 if (idet != c->GetDetectorIndex()) {
1492 idet=c->GetDetectorIndex();
1493 const AliITSdetector &det=layer.GetDetector(idet);
1494 if (!t->Propagate(det.GetPhi(),det.GetR())) {
1495 return kFALSE;
1496 }
1497 t->SetDetectorIndex(idet);
1498 }
1499 //Double_t chi2=t->GetPredictedChi2(c);
1500 Int_t layer = (idx & 0xf0000000) >> 28;;
1501 Double_t chi2=GetPredictedChi2MI(t,c,layer);
1502 if (chi2<maxchi2) {
1503 cl=c;
1504 maxchi2=chi2;
1505 } else {
1506 return kFALSE;
1507 }
1508 }
1509 /*
1510 if (cl==0)
1511 if (t->GetNumberOfClusters()>2) {
1512 Double_t dz=4*TMath::Sqrt(t->GetSigmaZ2()+kSigmaZ2[i]);
1513 Double_t dy=4*TMath::Sqrt(t->GetSigmaY2()+kSigmaY2[i]);
1514 Double_t zmin=t->GetZ() - dz;
1515 Double_t zmax=t->GetZ() + dz;
1516 Double_t ymin=t->GetY() + phi*r - dy;
1517 Double_t ymax=t->GetY() + phi*r + dy;
1518 layer.SelectClusters(zmin,zmax,ymin,ymax);
1519
1520 const AliITSclusterV2 *c=0; Int_t ci=-1;
1521 while ((c=layer.GetNextCluster(ci))!=0) {
1522 if (idet != c->GetDetectorIndex()) continue;
1523 Double_t chi2=t->GetPredictedChi2(c);
1524 if (chi2<maxchi2) { cl=c; maxchi2=chi2; idx=ci; }
1525 }
1526 }
1527 */
1528 if (cl) {
1529 //if (!t->Update(cl,maxchi2,idx)) {
1530 if (!UpdateMI(t,cl,maxchi2,idx)) {
1531 return kFALSE;
1532 }
1533 t->SetSampledEdx(cl->GetQ(),t->GetNumberOfClusters()-1);
1534 }
1535
1536 {
1537 Double_t x0;
1538 Double_t d=layer.GetThickness(t->GetY(),t->GetZ(),x0);
1539 t->CorrectForMaterial(-step*d,x0);
1540 }
1541
1542 // track time update [SR, GSI 17.02.2003]
1543 if (t->IsStartedTimeIntegral() && step==1) {
1544 Double_t newX, newY, newZ;
1545 t->GetGlobalXYZat(t->GetX(),newX,newY,newZ);
1546 Double_t dL2 = (oldX-newX)*(oldX-newX) + (oldY-newY)*(oldY-newY) +
1547 (oldZ-newZ)*(oldZ-newZ);
1548 t->AddTimeStep(TMath::Sqrt(dL2));
1549 }
1550 //
1551
1552 }
1553
1554 if (!t->PropagateTo(xx,0.,0.)) return kFALSE;
1555 return kTRUE;
1556}
1557
1558
1559Double_t AliITStrackerMI::GetNormalizedChi2(AliITStrackV2 * track, Int_t mode)
1560{
1561 //
1562 // calculate normalized chi2
1563 // return NormalizedChi2(track,0);
1564 Float_t chi2 = 0;
1565 Float_t sum=0;
1566 Float_t *erry = GetErrY(fCurrentEsdTrack), *errz = GetErrZ(fCurrentEsdTrack);
1567 // track->fdEdxMismatch=0;
1568 Float_t dedxmismatch =0;
1569 Float_t *ny = GetNy(fCurrentEsdTrack), *nz = GetNz(fCurrentEsdTrack);
1570 if (mode<100){
1571 for (Int_t i = 0;i<6;i++){
1572 if (track->fClIndex[i]>0){
1573 Float_t cerry, cerrz;
1574 if (ny[i]>0) {cerry = erry[i]; cerrz=errz[i];}
1575 else
1576 { cerry= track->fSigmaY[i]; cerrz = track->fSigmaZ[i];}
1577 cerry*=cerry;
1578 cerrz*=cerrz;
1579 Float_t cchi2 = (track->fDy[i]*track->fDy[i]/cerry)+(track->fDz[i]*track->fDz[i]/cerrz);
1580 if (i>1){
1581 Float_t ratio = track->fNormQ[i]/track->fExpQ;
1582 if (ratio<0.5) {
1583 cchi2+=(0.5-ratio)*10.;
1584 //track->fdEdxMismatch+=(0.5-ratio)*10.;
1585 dedxmismatch+=(0.5-ratio)*10.;
1586 }
1587 }
1588 if (i<2 ||i>3){
1589 AliITSclusterV2 * cl = (AliITSclusterV2*)GetCluster( track->fClIndex[i]);
1590 Double_t delta = cl->GetNy()+cl->GetNz()-ny[i]-nz[i];
1591 if (delta>1) chi2 +=0.5*TMath::Min(delta/2,2.);
1592 if (i<2) chi2+=2*cl->GetDeltaProbability();
1593 }
1594 chi2+=cchi2;
1595 sum++;
1596 }
1597 }
1598 if (TMath::Abs(track->fdEdxMismatch-dedxmismatch)>0.0001){
1599 track->fdEdxMismatch = dedxmismatch;
1600 }
1601 }
1602 else{
1603 for (Int_t i = 0;i<4;i++){
1604 if (track->fClIndex[i]>0){
1605 Float_t cerry, cerrz;
1606 if (ny[i]>0) {cerry = erry[i]; cerrz=errz[i];}
1607 else { cerry= track->fSigmaY[i]; cerrz = track->fSigmaZ[i];}
1608 cerry*=cerry;
1609 cerrz*=cerrz;
1610 chi2+= (track->fDy[i]*track->fDy[i]/cerry);
1611 chi2+= (track->fDz[i]*track->fDz[i]/cerrz);
1612 sum++;
1613 }
1614 }
1615 for (Int_t i = 4;i<6;i++){
1616 if (track->fClIndex[i]>0){
1617 Float_t cerry, cerrz;
1618 if (ny[i]>0) {cerry = erry[i]; cerrz=errz[i];}
1619 else { cerry= track->fSigmaY[i]; cerrz = track->fSigmaZ[i];}
1620 cerry*=cerry;
1621 cerrz*=cerrz;
1622 Float_t cerryb, cerrzb;
1623 if (ny[i+6]>0) {cerryb = erry[i+6]; cerrzb=errz[i+6];}
1624 else { cerryb= track->fSigmaY[i+6]; cerrzb = track->fSigmaZ[i+6];}
1625 cerryb*=cerryb;
1626 cerrzb*=cerrzb;
1627 chi2+= TMath::Min((track->fDy[i+6]*track->fDy[i+6]/cerryb),track->fDy[i]*track->fDy[i]/cerry);
1628 chi2+= TMath::Min((track->fDz[i+6]*track->fDz[i+6]/cerrzb),track->fDz[i]*track->fDz[i]/cerrz);
1629 sum++;
1630 }
1631 }
1632 }
1633 if (track->fESDtrack->GetTPCsignal()>85){
1634 Float_t ratio = track->fdEdx/track->fESDtrack->GetTPCsignal();
1635 if (ratio<0.5) {
1636 chi2+=(0.5-ratio)*5.;
1637 }
1638 if (ratio>2){
1639 chi2+=(ratio-2.0)*3;
1640 }
1641 }
1642 //
1643 Double_t match = TMath::Sqrt(track->fChi22);
1644 if (track->fConstrain) match/=track->GetNumberOfClusters();
1645 if (!track->fConstrain) match/=track->GetNumberOfClusters()-2.;
1646 if (match<0) match=0;
1647 Float_t deadzonefactor = (track->fNDeadZone>0) ? 3*(1.1-track->fDeadZoneProbability):0.;
1648 Double_t normchi2 = 2*track->fNSkipped+match+deadzonefactor+(1+(2*track->fNSkipped+deadzonefactor)/track->GetNumberOfClusters())*
1649 (chi2)/TMath::Max(double(sum-track->fNSkipped),
1650 1./(1.+track->fNSkipped));
1651
1652 return normchi2;
1653}
1654
1655
1656Double_t AliITStrackerMI::GetMatchingChi2(AliITStrackV2 * track1, AliITStrackV2 * track2)
1657{
1658 //
1659 // return matching chi2 between two tracks
1660 AliITStrackV2 track3(*track2);
1661 track3.Propagate(track1->GetAlpha(),track1->GetX());
1662 TMatrixD vec(5,1);
1663 vec(0,0)=track1->fP0-track3.fP0;
1664 vec(1,0)=track1->fP1-track3.fP1;
1665 vec(2,0)=track1->fP2-track3.fP2;
1666 vec(3,0)=track1->fP3-track3.fP3;
1667 vec(4,0)=track1->fP4-track3.fP4;
1668 //
1669 TMatrixD cov(5,5);
1670 cov(0,0) = track1->fC00+track3.fC00;
1671 cov(1,1) = track1->fC11+track3.fC11;
1672 cov(2,2) = track1->fC22+track3.fC22;
1673 cov(3,3) = track1->fC33+track3.fC33;
1674 cov(4,4) = track1->fC44+track3.fC44;
1675
1676 cov(0,1)=cov(1,0) = track1->fC10+track3.fC10;
1677 cov(0,2)=cov(2,0) = track1->fC20+track3.fC20;
1678 cov(0,3)=cov(3,0) = track1->fC30+track3.fC30;
1679 cov(0,4)=cov(4,0) = track1->fC40+track3.fC40;
1680 //
1681 cov(1,2)=cov(2,1) = track1->fC21+track3.fC21;
1682 cov(1,3)=cov(3,1) = track1->fC31+track3.fC31;
1683 cov(1,4)=cov(4,1) = track1->fC41+track3.fC41;
1684 //
1685 cov(2,3)=cov(3,2) = track1->fC32+track3.fC32;
1686 cov(2,4)=cov(4,2) = track1->fC42+track3.fC42;
1687 //
1688 cov(3,4)=cov(4,3) = track1->fC43+track3.fC43;
1689
1690 cov.Invert();
1691 TMatrixD vec2(cov,TMatrixD::kMult,vec);
1692 TMatrixD chi2(vec2,TMatrixD::kTransposeMult,vec);
1693 return chi2(0,0);
1694}
1695
1696Double_t AliITStrackerMI::GetDeadZoneProbability(Double_t zpos, Double_t zerr)
1697{
1698 //
1699 // return probability that given point - characterized by z position and error is in dead zone
1700 //
1701 Double_t probability =0;
1702 Double_t absz = TMath::Abs(zpos);
1703 Double_t nearestz = (absz<2)? 0.:7.1;
1704 if (TMath::Abs(absz-nearestz)>0.25+3*zerr) return 0;
1705 Double_t zmin=0, zmax=0;
1706 if (zpos<-6.){
1707 zmin = -7.25; zmax = -6.95;
1708 }
1709 if (zpos>6){
1710 zmin = 7.0; zmax =7.3;
1711 }
1712 if (absz<2){
1713 zmin = -0.75; zmax = 1.5;
1714 }
1715 probability = (TMath::Erf((zpos-zmin)/zerr) - TMath::Erf((zpos-zmax)/zerr))*0.5;
1716 return probability;
1717}
1718
1719
1720Double_t AliITStrackerMI::GetTruncatedChi2(AliITStrackV2 * track, Float_t fac)
1721{
1722 //
1723 // calculate normalized chi2
1724 Float_t chi2[6];
1725 Float_t *erry = GetErrY(fCurrentEsdTrack), *errz = GetErrZ(fCurrentEsdTrack);
1726 Float_t ncl = 0;
1727 for (Int_t i = 0;i<6;i++){
1728 if (TMath::Abs(track->fDy[i])>0){
1729 chi2[i]= (track->fDy[i]/erry[i])*(track->fDy[i]/erry[i]);
1730 chi2[i]+= (track->fDz[i]/errz[i])*(track->fDz[i]/errz[i]);
1731 ncl++;
1732 }
1733 else{chi2[i]=10000;}
1734 }
1735 Int_t index[6];
1736 TMath::Sort(6,chi2,index,kFALSE);
1737 Float_t max = float(ncl)*fac-1.;
1738 Float_t sumchi=0, sumweight=0;
1739 for (Int_t i=0;i<max+1;i++){
1740 Float_t weight = (i<max)?1.:(max+1.-i);
1741 sumchi+=weight*chi2[index[i]];
1742 sumweight+=weight;
1743 }
1744 Double_t normchi2 = sumchi/sumweight;
1745 return normchi2;
1746}
1747
1748
1749Double_t AliITStrackerMI::GetInterpolatedChi2(AliITStrackV2 * forwardtrack, AliITStrackV2 * backtrack)
1750{
1751 //
1752 // calculate normalized chi2
1753 // if (forwardtrack->fNUsed>0.3*float(forwardtrack->GetNumberOfClusters())) return 10000;
1754 Int_t npoints = 0;
1755 Double_t res =0;
1756 for (Int_t i=0;i<6;i++){
1757 if ( (backtrack->fSigmaY[i]<0.000000001) || (forwardtrack->fSigmaY[i]<0.000000001)) continue;
1758 Double_t sy1 = forwardtrack->fSigmaY[i];
1759 Double_t sz1 = forwardtrack->fSigmaZ[i];
1760 Double_t sy2 = backtrack->fSigmaY[i];
1761 Double_t sz2 = backtrack->fSigmaZ[i];
1762 if (i<2){ sy2=1000.;sz2=1000;}
1763 //
1764 Double_t dy0 = (forwardtrack->fDy[i]/(sy1*sy1) +backtrack->fDy[i]/(sy2*sy2))/(1./(sy1*sy1)+1./(sy2*sy2));
1765 Double_t dz0 = (forwardtrack->fDz[i]/(sz1*sz1) +backtrack->fDz[i]/(sz2*sz2))/(1./(sz1*sz1)+1./(sz2*sz2));
1766 //
1767 Double_t nz0 = dz0*TMath::Sqrt((1./(sz1*sz1)+1./(sz2*sz2)));
1768 Double_t ny0 = dy0*TMath::Sqrt((1./(sy1*sy1)+1./(sy2*sy2)));
1769 //
1770 res+= nz0*nz0+ny0*ny0;
1771 npoints++;
1772 }
1773 if (npoints>1) return
1774 TMath::Max(TMath::Abs(0.3*forwardtrack->Get1Pt())-0.5,0.)+
1775 //2*forwardtrack->fNUsed+
1776 res/TMath::Max(double(npoints-forwardtrack->fNSkipped),
1777 1./(1.+forwardtrack->fNSkipped));
1778 return 1000;
1779}
1780
1781
1782
1783
1784
1785Float_t *AliITStrackerMI::GetWeight(Int_t index) {
1786 //--------------------------------------------------------------------
1787 // Return pointer to a given cluster
1788 //--------------------------------------------------------------------
1789 Int_t l=(index & 0xf0000000) >> 28;
1790 Int_t c=(index & 0x0fffffff) >> 00;
1791 return fgLayers[l].GetWeight(c);
1792}
1793
1794void AliITStrackerMI::RegisterClusterTracks(AliITStrackV2* track,Int_t id)
1795{
1796 //---------------------------------------------
1797 // register track to the list
1798 for (Int_t icluster=0;icluster<track->GetNumberOfClusters();icluster++){
1799 Int_t index = track->GetClusterIndex(icluster);
1800 Int_t l=(index & 0xf0000000) >> 28;
1801 Int_t c=(index & 0x0fffffff) >> 00;
1802 if (c>fgLayers[l].fN) continue;
1803 for (Int_t itrack=0;itrack<4;itrack++){
1804 if (fgLayers[l].fClusterTracks[itrack][c]<0){
1805 fgLayers[l].fClusterTracks[itrack][c]=id;
1806 break;
1807 }
1808 }
1809 }
1810}
1811void AliITStrackerMI::UnRegisterClusterTracks(AliITStrackV2* track, Int_t id)
1812{
1813 //---------------------------------------------
1814 // unregister track from the list
1815 for (Int_t icluster=0;icluster<track->GetNumberOfClusters();icluster++){
1816 Int_t index = track->GetClusterIndex(icluster);
1817 Int_t l=(index & 0xf0000000) >> 28;
1818 Int_t c=(index & 0x0fffffff) >> 00;
1819 if (c>fgLayers[l].fN) continue;
1820 for (Int_t itrack=0;itrack<4;itrack++){
1821 if (fgLayers[l].fClusterTracks[itrack][c]==id){
1822 fgLayers[l].fClusterTracks[itrack][c]=-1;
1823 }
1824 }
1825 }
1826}
1827Float_t AliITStrackerMI::GetNumberOfSharedClusters(AliITStrackV2* track,Int_t id, Int_t list[6], AliITSclusterV2 *clist[6])
1828{
1829 //-------------------------------------------------------------
1830 //get number of shared clusters
1831 //-------------------------------------------------------------
1832 Float_t shared=0;
1833 for (Int_t i=0;i<6;i++) { list[i]=-1, clist[i]=0;}
1834 // mean number of clusters
1835 Float_t *ny = GetNy(id), *nz = GetNz(id);
1836
1837
1838 for (Int_t icluster=0;icluster<track->GetNumberOfClusters();icluster++){
1839 Int_t index = track->GetClusterIndex(icluster);
1840 Int_t l=(index & 0xf0000000) >> 28;
1841 Int_t c=(index & 0x0fffffff) >> 00;
1842 if (c>fgLayers[l].fN) continue;
1843 if (ny[l]==0){
1844 printf("problem\n");
1845 }
1846 AliITSclusterV2 *cl = (AliITSclusterV2*)GetCluster(index);
1847 Float_t weight=1;
1848 //
1849 Float_t deltan = 0;
1850 if (l>3&&cl->GetNy()+cl->GetNz()>6) continue;
1851 if (l>2&&track->fNormQ[l]/track->fExpQ>3.5) continue;
1852 if (l<2 || l>3){
1853 deltan = (cl->GetNy()+cl->GetNz()-ny[l]-nz[l]);
1854 }
1855 else{
1856 deltan = (cl->GetNz()-nz[l]);
1857 }
1858 if (deltan>2.0) continue; // extended - highly probable shared cluster
1859 weight = 2./TMath::Max(3.+deltan,2.);
1860 //
1861 for (Int_t itrack=0;itrack<4;itrack++){
1862 if (fgLayers[l].fClusterTracks[itrack][c]>=0 && fgLayers[l].fClusterTracks[itrack][c]!=id){
1863 list[l]=index;
1864 clist[l] = (AliITSclusterV2*)GetCluster(index);
1865 shared+=weight;
1866 break;
1867 }
1868 }
1869 }
1870 track->fNUsed=shared;
1871 return shared;
1872}
1873
1874Int_t AliITStrackerMI::GetOverlapTrack(AliITStrackV2 *track, Int_t trackID, Int_t &shared, Int_t clusterlist[6],Int_t overlist[6])
1875{
1876 //
1877 // find first shared track
1878 //
1879 // mean number of clusters
1880 Float_t *ny = GetNy(trackID), *nz = GetNz(trackID);
1881 //
1882 for (Int_t i=0;i<6;i++) overlist[i]=-1;
1883 Int_t sharedtrack=100000;
1884 Int_t tracks[24],trackindex=0;
1885 for (Int_t i=0;i<24;i++) {tracks[i]=-1;}
1886 //
1887 for (Int_t icluster=0;icluster<6;icluster++){
1888 if (clusterlist[icluster]<0) continue;
1889 Int_t index = clusterlist[icluster];
1890 Int_t l=(index & 0xf0000000) >> 28;
1891 Int_t c=(index & 0x0fffffff) >> 00;
1892 if (ny[l]==0){
1893 printf("problem\n");
1894 }
1895 if (c>fgLayers[l].fN) continue;
1896 //if (l>3) continue;
1897 AliITSclusterV2 *cl = (AliITSclusterV2*)GetCluster(index);
1898 //
1899 Float_t deltan = 0;
1900 if (l>3&&cl->GetNy()+cl->GetNz()>6) continue;
1901 if (l>2&&track->fNormQ[l]/track->fExpQ>3.5) continue;
1902 if (l<2 || l>3){
1903 deltan = (cl->GetNy()+cl->GetNz()-ny[l]-nz[l]);
1904 }
1905 else{
1906 deltan = (cl->GetNz()-nz[l]);
1907 }
1908 if (deltan>2.0) continue; // extended - highly probable shared cluster
1909 //
1910 for (Int_t itrack=3;itrack>=0;itrack--){
1911 if (fgLayers[l].fClusterTracks[itrack][c]<0) continue;
1912 if (fgLayers[l].fClusterTracks[itrack][c]!=trackID){
1913 tracks[trackindex] = fgLayers[l].fClusterTracks[itrack][c];
1914 trackindex++;
1915 }
1916 }
1917 }
1918 if (trackindex==0) return -1;
1919 if (trackindex==1){
1920 sharedtrack = tracks[0];
1921 }else{
1922 if (trackindex==2) sharedtrack =TMath::Min(tracks[0],tracks[1]);
1923 else{
1924 //
1925 Int_t track[24], cluster[24];
1926 for (Int_t i=0;i<trackindex;i++){ track[i]=-1; cluster[i]=0;}
1927 Int_t index =0;
1928 //
1929 for (Int_t i=0;i<trackindex;i++){
1930 if (tracks[i]<0) continue;
1931 track[index] = tracks[i];
1932 cluster[index]++;
1933 for (Int_t j=i+1;j<trackindex;j++){
1934 if (tracks[j]<0) continue;
1935 if (tracks[j]==tracks[i]){
1936 cluster[index]++;
1937 tracks[j]=-1;
1938 }
1939 }
1940 index++;
1941 }
1942 Int_t max=0;
1943 for (Int_t i=0;i<index;i++){
1944 if (cluster[index]>max) {
1945 sharedtrack=track[index];
1946 max=cluster[index];
1947 }
1948 }
1949 }
1950 }
1951
1952 if (sharedtrack>=100000) return -1;
1953 //
1954 // make list of overlaps
1955 shared =0;
1956 for (Int_t icluster=0;icluster<6;icluster++){
1957 if (clusterlist[icluster]<0) continue;
1958 Int_t index = clusterlist[icluster];
1959 Int_t l=(index & 0xf0000000) >> 28;
1960 Int_t c=(index & 0x0fffffff) >> 00;
1961 if (c>fgLayers[l].fN) continue;
1962 AliITSclusterV2 *cl = (AliITSclusterV2*)GetCluster(index);
1963 if (l==0 || l==1){
1964 if (cl->GetNy()>2) continue;
1965 if (cl->GetNz()>2) continue;
1966 }
1967 if (l==4 || l==5){
1968 if (cl->GetNy()>3) continue;
1969 if (cl->GetNz()>3) continue;
1970 }
1971 //
1972 for (Int_t itrack=3;itrack>=0;itrack--){
1973 if (fgLayers[l].fClusterTracks[itrack][c]<0) continue;
1974 if (fgLayers[l].fClusterTracks[itrack][c]==sharedtrack){
1975 overlist[l]=index;
1976 shared++;
1977 }
1978 }
1979 }
1980 return sharedtrack;
1981}
1982
1983
1984AliITStrackV2 * AliITStrackerMI::GetBest2Tracks(Int_t trackID1, Int_t trackID2, Float_t th0, Float_t th1){
1985 //
1986 // try to find track hypothesys without conflicts
1987 // with minimal chi2;
1988 TClonesArray *arr1 = (TClonesArray*)fTrackHypothesys.At(trackID1);
1989 Int_t entries1 = arr1->GetEntriesFast();
1990 TClonesArray *arr2 = (TClonesArray*)fTrackHypothesys.At(trackID2);
1991 if (!arr2) return (AliITStrackV2*) arr1->UncheckedAt(0);
1992 Int_t entries2 = arr2->GetEntriesFast();
1993 if (entries2<=0) return (AliITStrackV2*) arr1->UncheckedAt(0);
1994 //
1995 AliITStrackV2 * track10=(AliITStrackV2*) arr1->UncheckedAt(0);
1996 AliITStrackV2 * track20=(AliITStrackV2*) arr2->UncheckedAt(0);
1997 if (TMath::Abs(1./track10->Get1Pt())>0.5+TMath::Abs(1/track20->Get1Pt())) return track10;
1998
1999 for (Int_t itrack=0;itrack<entries1;itrack++){
2000 AliITStrackV2 * track=(AliITStrackV2*) arr1->UncheckedAt(itrack);
2001 UnRegisterClusterTracks(track,trackID1);
2002 }
2003 //
2004 for (Int_t itrack=0;itrack<entries2;itrack++){
2005 AliITStrackV2 * track=(AliITStrackV2*) arr2->UncheckedAt(itrack);
2006 UnRegisterClusterTracks(track,trackID2);
2007 }
2008 Int_t index1=0;
2009 Int_t index2=0;
2010 Float_t maxconflicts=6;
2011 Double_t maxchi2 =1000.;
2012 //
2013 // get weight of hypothesys - using best hypothesy
2014 Double_t w1,w2;
2015
2016 Int_t list1[6],list2[6];
2017 AliITSclusterV2 *clist1[6], *clist2[6] ;
2018 RegisterClusterTracks(track10,trackID1);
2019 RegisterClusterTracks(track20,trackID2);
2020 Float_t conflict1 = GetNumberOfSharedClusters(track10,trackID1,list1,clist1);
2021 Float_t conflict2 = GetNumberOfSharedClusters(track20,trackID2,list2,clist2);
2022 UnRegisterClusterTracks(track10,trackID1);
2023 UnRegisterClusterTracks(track20,trackID2);
2024 //
2025 // normalized chi2
2026 Float_t chi21 =0,chi22=0,ncl1=0,ncl2=0;
2027 Float_t nerry[6],nerrz[6];
2028 Float_t *erry1=GetErrY(trackID1),*errz1 = GetErrZ(trackID1);
2029 Float_t *erry2=GetErrY(trackID2),*errz2 = GetErrZ(trackID2);
2030 for (Int_t i=0;i<6;i++){
2031 if ( (erry1[i]>0) && (erry2[i]>0)) {
2032 nerry[i] = TMath::Min(erry1[i],erry2[i]);
2033 nerrz[i] = TMath::Min(errz1[i],errz2[i]);
2034 }else{
2035 nerry[i] = TMath::Max(erry1[i],erry2[i]);
2036 nerrz[i] = TMath::Max(errz1[i],errz2[i]);
2037 }
2038 if (TMath::Abs(track10->fDy[i])>0.000000000000001){
2039 chi21 += track10->fDy[i]*track10->fDy[i]/(nerry[i]*nerry[i]);
2040 chi21 += track10->fDz[i]*track10->fDz[i]/(nerrz[i]*nerrz[i]);
2041 ncl1++;
2042 }
2043 if (TMath::Abs(track20->fDy[i])>0.000000000000001){
2044 chi22 += track20->fDy[i]*track20->fDy[i]/(nerry[i]*nerry[i]);
2045 chi22 += track20->fDz[i]*track20->fDz[i]/(nerrz[i]*nerrz[i]);
2046 ncl2++;
2047 }
2048 }
2049 chi21/=ncl1;
2050 chi22/=ncl2;
2051 //
2052 //
2053 Float_t d1 = TMath::Sqrt(track10->fD[0]*track10->fD[0]+track10->fD[1]*track10->fD[1])+0.1;
2054 Float_t d2 = TMath::Sqrt(track20->fD[0]*track20->fD[0]+track20->fD[1]*track20->fD[1])+0.1;
2055 Float_t s1 = TMath::Sqrt(track10->GetSigmaY2()*track10->GetSigmaZ2());
2056 Float_t s2 = TMath::Sqrt(track20->GetSigmaY2()*track20->GetSigmaZ2());
2057 //
2058 w1 = (d2/(d1+d2)+ 2*s2/(s1+s2)+
2059 +s2/(s1+s2)*0.5*(chi22+2.)/(chi21+chi22+4.)
2060 +1.*TMath::Abs(1./track10->Get1Pt())/(TMath::Abs(1./track10->Get1Pt())+TMath::Abs(1./track20->Get1Pt()))
2061 );
2062 w2 = (d1/(d1+d2)+ 2*s1/(s1+s2)+
2063 s1/(s1+s2)*0.5*(chi21+2.)/(chi21+chi22+4.)
2064 +1.*TMath::Abs(1./track20->Get1Pt())/(TMath::Abs(1./track10->Get1Pt())+TMath::Abs(1./track20->Get1Pt()))
2065 );
2066
2067 Double_t sumw = w1+w2;
2068 w1/=sumw;
2069 w2/=sumw;
2070 if (w1<w2*0.5) {
2071 w1 = (d2+0.5)/(d1+d2+1.);
2072 w2 = (d1+0.5)/(d1+d2+1.);
2073 }
2074 // Float_t maxmax = w1*track10->fChi2MIP[0]+w2*track20->fChi2MIP[0]+w1*conflict1+w2*conflict2+1.;
2075 //Float_t maxconflicts0 = w1*conflict1+w2*conflict2;
2076 //
2077 // get pair of "best" hypothesys
2078 //
2079 Float_t * ny1 = GetNy(trackID1), * nz1 = GetNz(trackID1);
2080 Float_t * ny2 = GetNy(trackID2), * nz2 = GetNz(trackID2);
2081
2082 for (Int_t itrack1=0;itrack1<entries1;itrack1++){
2083 AliITStrackV2 * track1=(AliITStrackV2*) arr1->UncheckedAt(itrack1);
2084 //if (track1->fFakeRatio>0) continue;
2085 RegisterClusterTracks(track1,trackID1);
2086 for (Int_t itrack2=0;itrack2<entries2;itrack2++){
2087 AliITStrackV2 * track2=(AliITStrackV2*) arr2->UncheckedAt(itrack2);
2088
2089 // Float_t current = w1*track1->fChi2MIP[0]+w2*track2->fChi2MIP[0];
2090 //if (track2->fFakeRatio>0) continue;
2091 Float_t nskipped=0;
2092 RegisterClusterTracks(track2,trackID2);
2093 Int_t list1[6],list2[6];
2094 AliITSclusterV2 *clist1[6], *clist2[6] ;
2095 Float_t cconflict1 = GetNumberOfSharedClusters(track1,trackID1,list1,clist1);
2096 Float_t cconflict2 = GetNumberOfSharedClusters(track2,trackID2,list2,clist2);
2097 UnRegisterClusterTracks(track2,trackID2);
2098 //
2099 if (track1->fConstrain) nskipped+=w1*track1->fNSkipped;
2100 if (track2->fConstrain) nskipped+=w2*track2->fNSkipped;
2101 if (nskipped>0.5) continue;
2102 //
2103 //if ( w1*conflict1+w2*conflict2>maxconflicts0) continue;
2104 if (conflict1+1<cconflict1) continue;
2105 if (conflict2+1<cconflict2) continue;
2106 Float_t conflict=0;
2107 Float_t sumchi2=0;
2108 Float_t sum=0;
2109 for (Int_t i=0;i<6;i++){
2110 //
2111 Float_t c1 =0.; // conflict coeficients
2112 Float_t c2 =0.;
2113 if (clist1[i]&&clist2[i]){
2114 Float_t deltan = 0;
2115 if (i<2 || i>3){
2116 deltan = (clist1[i]->GetNy()+clist1[i]->GetNz()-TMath::Max(ny1[i],ny2[i])-TMath::Max(nz1[i],nz2[i]));
2117 }
2118 else{
2119 deltan = (clist1[i]->GetNz()-TMath::Max(nz1[i],nz2[i]));
2120 }
2121 c1 = 2./TMath::Max(3.+deltan,2.);
2122 c2 = 2./TMath::Max(3.+deltan,2.);
2123 }
2124 else{
2125 if (clist1[i]){
2126 Float_t deltan = 0;
2127 if (i<2 || i>3){
2128 deltan = (clist1[i]->GetNy()+clist1[i]->GetNz()-ny1[i]-nz1[i]);
2129 }
2130 else{
2131 deltan = (clist1[i]->GetNz()-nz1[i]);
2132 }
2133 c1 = 2./TMath::Max(3.+deltan,2.);
2134 c2 = 0;
2135 }
2136
2137 if (clist2[i]){
2138 Float_t deltan = 0;
2139 if (i<2 || i>3){
2140 deltan = (clist2[i]->GetNy()+clist2[i]->GetNz()-ny2[i]-nz2[i]);
2141 }
2142 else{
2143 deltan = (clist2[i]->GetNz()-nz2[i]);
2144 }
2145 c2 = 2./TMath::Max(3.+deltan,2.);
2146 c1 = 0;
2147 }
2148 }
2149 //
2150 Double_t chi21=0,chi22=0;
2151 if (TMath::Abs(track1->fDy[i])>0.) {
2152 chi21 = (track1->fDy[i]/track1->fSigmaY[i])*(track1->fDy[i]/track1->fSigmaY[i])+
2153 (track1->fDz[i]/track1->fSigmaZ[i])*(track1->fDz[i]/track1->fSigmaZ[i]);
2154 //chi21 = (track1->fDy[i]*track1->fDy[i])/(nerry[i]*nerry[i])+
2155 // (track1->fDz[i]*track1->fDz[i])/(nerrz[i]*nerrz[i]);
2156 }else{
2157 if (TMath::Abs(track1->fSigmaY[i]>0.)) c1=1;
2158 }
2159 //
2160 if (TMath::Abs(track2->fDy[i])>0.) {
2161 chi22 = (track2->fDy[i]/track2->fSigmaY[i])*(track2->fDy[i]/track2->fSigmaY[i])+
2162 (track2->fDz[i]/track2->fSigmaZ[i])*(track2->fDz[i]/track2->fSigmaZ[i]);
2163 //chi22 = (track2->fDy[i]*track2->fDy[i])/(nerry[i]*nerry[i])+
2164 // (track2->fDz[i]*track2->fDz[i])/(nerrz[i]*nerrz[i]);
2165 }
2166 else{
2167 if (TMath::Abs(track2->fSigmaY[i]>0.)) c2=1;
2168 }
2169 sumchi2+=w1*(1.+c1)*(1+c1)*(chi21+c1)+w2*(1.+c2)*(1+c2)*(chi22+c2);
2170 if (chi21>0) sum+=w1;
2171 if (chi22>0) sum+=w2;
2172 conflict+=(c1+c2);
2173 }
2174 Double_t norm = sum-w1*track1->fNSkipped-w2*track2->fNSkipped;
2175 if (norm<0) norm =1/(w1*track1->fNSkipped+w2*track2->fNSkipped);
2176 Double_t normchi2 = 2*conflict+sumchi2/sum;
2177 if ( normchi2 <maxchi2 ){
2178 index1 = itrack1;
2179 index2 = itrack2;
2180 maxconflicts = conflict;
2181 maxchi2 = normchi2;
2182 }
2183 }
2184 UnRegisterClusterTracks(track1,trackID1);
2185 }
2186 //
2187 // if (maxconflicts<4 && maxchi2<th0){
2188 if (maxchi2<th0*2.){
2189 Float_t orig = track10->fFakeRatio*track10->GetNumberOfClusters();
2190 AliITStrackV2* track1=(AliITStrackV2*) arr1->UncheckedAt(index1);
2191 track1->fChi2MIP[5] = maxconflicts;
2192 track1->fChi2MIP[6] = maxchi2;
2193 track1->fChi2MIP[7] = 0.01+orig-(track1->fFakeRatio*track1->GetNumberOfClusters());
2194 // track1->UpdateESDtrack(AliESDtrack::kITSin);
2195 track1->fChi2MIP[8] = index1;
2196 fBestTrackIndex[trackID1] =index1;
2197 UpdateESDtrack(track1, AliESDtrack::kITSin);
2198 }
2199 else if (track10->fChi2MIP[0]<th1){
2200 track10->fChi2MIP[5] = maxconflicts;
2201 track10->fChi2MIP[6] = maxchi2;
2202 // track10->UpdateESDtrack(AliESDtrack::kITSin);
2203 UpdateESDtrack(track10,AliESDtrack::kITSin);
2204 }
2205
2206 for (Int_t itrack=0;itrack<entries1;itrack++){
2207 AliITStrackV2 * track=(AliITStrackV2*) arr1->UncheckedAt(itrack);
2208 UnRegisterClusterTracks(track,trackID1);
2209 }
2210 //
2211 for (Int_t itrack=0;itrack<entries2;itrack++){
2212 AliITStrackV2 * track=(AliITStrackV2*) arr2->UncheckedAt(itrack);
2213 UnRegisterClusterTracks(track,trackID2);
2214 }
2215
2216 if (track10->fConstrain&&track10->fChi2MIP[0]<kMaxChi2PerCluster[0]&&track10->fChi2MIP[1]<kMaxChi2PerCluster[1]
2217 &&track10->fChi2MIP[2]<kMaxChi2PerCluster[2]&&track10->fChi2MIP[3]<kMaxChi2PerCluster[3]){
2218 // if (track10->fChi2MIP[0]<kMaxChi2PerCluster[0]&&track10->fChi2MIP[1]<kMaxChi2PerCluster[1]
2219 // &&track10->fChi2MIP[2]<kMaxChi2PerCluster[2]&&track10->fChi2MIP[3]<kMaxChi2PerCluster[3]){
2220 RegisterClusterTracks(track10,trackID1);
2221 }
2222 if (track20->fConstrain&&track20->fChi2MIP[0]<kMaxChi2PerCluster[0]&&track20->fChi2MIP[1]<kMaxChi2PerCluster[1]
2223 &&track20->fChi2MIP[2]<kMaxChi2PerCluster[2]&&track20->fChi2MIP[3]<kMaxChi2PerCluster[3]){
2224 //if (track20->fChi2MIP[0]<kMaxChi2PerCluster[0]&&track20->fChi2MIP[1]<kMaxChi2PerCluster[1]
2225 // &&track20->fChi2MIP[2]<kMaxChi2PerCluster[2]&&track20->fChi2MIP[3]<kMaxChi2PerCluster[3]){
2226 RegisterClusterTracks(track20,trackID2);
2227 }
2228 return track10;
2229
2230}
2231
2232void AliITStrackerMI::UseClusters(const AliKalmanTrack *t, Int_t from) const {
2233 //--------------------------------------------------------------------
2234 // This function marks clusters assigned to the track
2235 //--------------------------------------------------------------------
2236 AliTracker::UseClusters(t,from);
2237
2238 AliITSclusterV2 *c=(AliITSclusterV2 *)GetCluster(t->GetClusterIndex(0));
2239 //if (c->GetQ()>2) c->Use();
2240 if (c->GetSigmaZ2()>0.1) c->Use();
2241 c=(AliITSclusterV2 *)GetCluster(t->GetClusterIndex(1));
2242 //if (c->GetQ()>2) c->Use();
2243 if (c->GetSigmaZ2()>0.1) c->Use();
2244
2245}
2246
2247
2248void AliITStrackerMI::AddTrackHypothesys(AliITStrackV2 * track, Int_t esdindex)
2249{
2250 //------------------------------------------------------------------
2251 // add track to the list of hypothesys
2252 //------------------------------------------------------------------
2253
2254 if (esdindex>=fTrackHypothesys.GetEntriesFast()) fTrackHypothesys.Expand(esdindex*2+10);
2255 //
2256 TObjArray * array = (TObjArray*) fTrackHypothesys.At(esdindex);
2257 if (!array) {
2258 array = new TObjArray(10);
2259 fTrackHypothesys.AddAt(array,esdindex);
2260 }
2261 array->AddLast(track);
2262}
2263
2264void AliITStrackerMI::SortTrackHypothesys(Int_t esdindex, Int_t maxcut, Int_t mode)
2265{
2266 //-------------------------------------------------------------------
2267 // compress array of track hypothesys
2268 // keep only maxsize best hypothesys
2269 //-------------------------------------------------------------------
2270 if (esdindex>fTrackHypothesys.GetEntriesFast()) return;
2271 if (! (fTrackHypothesys.At(esdindex)) ) return;
2272 TObjArray * array = (TObjArray*) fTrackHypothesys.At(esdindex);
2273 Int_t entries = array->GetEntriesFast();
2274 //
2275 //- find preliminary besttrack as a reference
2276 Float_t minchi2=10000;
2277 Int_t maxn=0;
2278 AliITStrackV2 * besttrack=0;
2279 for (Int_t itrack=0;itrack<array->GetEntriesFast();itrack++){
2280 AliITStrackV2 * track = (AliITStrackV2*)array->At(itrack);
2281 if (!track) continue;
2282 Float_t chi2 = NormalizedChi2(track,0);
2283 //
2284 Int_t tpcLabel=track->fESDtrack->GetTPCLabel();
2285 track->SetLabel(tpcLabel);
2286 CookdEdx(track);
2287 track->fFakeRatio=1.;
2288 CookLabel(track,0.); //For comparison only
2289 //
2290 //if (chi2<kMaxChi2PerCluster[0]&&track->fFakeRatio==0){
2291 if (chi2<kMaxChi2PerCluster[0]){
2292 if (track->GetNumberOfClusters()<maxn) continue;
2293 maxn = track->GetNumberOfClusters();
2294 if (chi2<minchi2){
2295 minchi2=chi2;
2296 besttrack=track;
2297 }
2298 }
2299 else{
2300 delete array->RemoveAt(itrack);
2301 }
2302 }
2303 if (!besttrack) return;
2304 //
2305 //
2306 //take errors of best track as a reference
2307 Float_t *erry = GetErrY(esdindex), *errz = GetErrZ(esdindex);
2308 Float_t *ny = GetNy(esdindex), *nz = GetNz(esdindex);
2309 for (Int_t i=0;i<6;i++) {
2310 if (besttrack->fClIndex[i]>0){
2311 erry[i] = besttrack->fSigmaY[i]; erry[i+6] = besttrack->fSigmaY[i+6];
2312 errz[i] = besttrack->fSigmaZ[i]; errz[i+6] = besttrack->fSigmaZ[i+6];
2313 ny[i] = besttrack->fNy[i];
2314 nz[i] = besttrack->fNz[i];
2315 }
2316 }
2317 //
2318 // calculate normalized chi2
2319 //
2320 Float_t * chi2 = new Float_t[entries];
2321 Int_t * index = new Int_t[entries];
2322 for (Int_t i=0;i<entries;i++) chi2[i] =10000;
2323 for (Int_t itrack=0;itrack<entries;itrack++){
2324 AliITStrackV2 * track = (AliITStrackV2*)array->At(itrack);
2325 if (track){
2326 track->fChi2MIP[0] = GetNormalizedChi2(track, mode);
2327 if (track->fChi2MIP[0]<kMaxChi2PerCluster[0])
2328 chi2[itrack] = track->fChi2MIP[0];
2329 else
2330 delete array->RemoveAt(itrack);
2331 }
2332 }
2333 //
2334 TMath::Sort(entries,chi2,index,kFALSE);
2335 besttrack = (AliITStrackV2*)array->At(index[0]);
2336 if (besttrack&&besttrack->fChi2MIP[0]<kMaxChi2PerCluster[0]){
2337 for (Int_t i=0;i<6;i++){
2338 if (besttrack->fClIndex[i]>0){
2339 erry[i] = besttrack->fSigmaY[i]; erry[i+6] = besttrack->fSigmaY[i+6];
2340 errz[i] = besttrack->fSigmaZ[i]; erry[i+6] = besttrack->fSigmaY[i+6];
2341 ny[i] = besttrack->fNy[i];
2342 nz[i] = besttrack->fNz[i];
2343 }
2344 }
2345 }
2346 //
2347 // calculate one more time with updated normalized errors
2348 for (Int_t i=0;i<entries;i++) chi2[i] =10000;
2349 for (Int_t itrack=0;itrack<entries;itrack++){
2350 AliITStrackV2 * track = (AliITStrackV2*)array->At(itrack);
2351 if (track){
2352 track->fChi2MIP[0] = GetNormalizedChi2(track,mode);
2353 if (track->fChi2MIP[0]<kMaxChi2PerCluster[0])
2354 chi2[itrack] = track->fChi2MIP[0]-0*(track->GetNumberOfClusters()+track->fNDeadZone);
2355 else
2356 delete array->RemoveAt(itrack);
2357 }
2358 }
2359 entries = array->GetEntriesFast();
2360 //
2361 if (entries>0){
2362 TObjArray * newarray = new TObjArray();
2363 TMath::Sort(entries,chi2,index,kFALSE);
2364 besttrack = (AliITStrackV2*)array->At(index[0]);
2365 if (besttrack){
2366 //
2367 for (Int_t i=0;i<6;i++){
2368 if (besttrack->fNz[i]>0&&besttrack->fNy[i]>0){
2369 erry[i] = besttrack->fSigmaY[i]; erry[i+6] = besttrack->fSigmaY[i+6];
2370 errz[i] = besttrack->fSigmaZ[i]; errz[i+6] = besttrack->fSigmaZ[i+6];
2371 ny[i] = besttrack->fNy[i];
2372 nz[i] = besttrack->fNz[i];
2373 }
2374 }
2375 besttrack->fChi2MIP[0] = GetNormalizedChi2(besttrack,mode);
2376 Float_t minchi2 = TMath::Min(besttrack->fChi2MIP[0]+5.+besttrack->fNUsed, double(kMaxChi2PerCluster[0]));
2377 Float_t minn = besttrack->GetNumberOfClusters()-3;
2378 Int_t accepted=0;
2379 for (Int_t i=0;i<entries;i++){
2380 AliITStrackV2 * track = (AliITStrackV2*)array->At(index[i]);
2381 if (!track) continue;
2382 if (accepted>maxcut) break;
2383 track->fChi2MIP[0] = GetNormalizedChi2(track,mode);
2384 if (track->GetNumberOfClusters()<6 && (track->fChi2MIP[0]+track->fNUsed>minchi2)){
2385 delete array->RemoveAt(index[i]);
2386 continue;
2387 }
2388 if (track->fChi2MIP[0]+track->fNUsed<minchi2 && track->GetNumberOfClusters()>=minn){
2389 accepted++;
2390 //
2391 newarray->AddLast(array->RemoveAt(index[i]));
2392 for (Int_t i=0;i<6;i++){
2393 if (nz[i]==0){
2394 erry[i] = track->fSigmaY[i]; erry[i+6] = track->fSigmaY[i+6];
2395 errz[i] = track->fSigmaZ[i]; errz[i] = track->fSigmaZ[i+6];
2396 ny[i] = track->fNy[i];
2397 nz[i] = track->fNz[i];
2398 }
2399 }
2400 }
2401 else{
2402 delete array->RemoveAt(index[i]);
2403 }
2404 }
2405 array->Delete();
2406 delete fTrackHypothesys.RemoveAt(esdindex);
2407 fTrackHypothesys.AddAt(newarray,esdindex);
2408 }
2409 else{
2410 array->Delete();
2411 delete fTrackHypothesys.RemoveAt(esdindex);
2412 }
2413 }
2414 delete [] chi2;
2415 delete [] index;
2416}
2417
2418
2419
2420AliITStrackV2 * AliITStrackerMI::GetBestHypothesys(Int_t esdindex, AliITStrackV2 * original, Int_t checkmax)
2421{
2422 //-------------------------------------------------------------
2423 // try to find best hypothesy
2424 // currently - minimal chi2 of track+backpropagated track+matching to the tpc track
2425 //-------------------------------------------------------------
2426 if (fTrackHypothesys.GetEntriesFast()<=esdindex) return 0;
2427 TObjArray * array = (TObjArray*) fTrackHypothesys.At(esdindex);
2428 if (!array) return 0;
2429 Int_t entries = array->GetEntriesFast();
2430 if (!entries) return 0;
2431 Float_t minchi2 = 100000;
2432 AliITStrackV2 * besttrack=0;
2433 //
2434 AliITStrackV2 * backtrack = new AliITStrackV2(*original);
2435 AliITStrackV2 * forwardtrack = new AliITStrackV2(*original);
2436 //
2437 for (Int_t i=0;i<entries;i++){
2438 AliITStrackV2 * track = (AliITStrackV2*)array->At(i);
2439 if (!track) continue;
2440 track->fChi2MIP[1] = 1000000;
2441 track->fChi2MIP[2] = 1000000;
2442 track->fChi2MIP[3] = 1000000;
2443 //
2444 // backtrack
2445 backtrack = new(backtrack) AliITStrackV2(*track);
2446 backtrack->ResetCovariance();
2447 backtrack->ResetCovariance();
2448 backtrack->ResetClusters();
2449 Double_t x = original->GetX();
2450 if (!RefitAt(x,backtrack,track)) continue;
2451 track->fChi2MIP[1] = NormalizedChi2(backtrack,0);
2452 //for (Int_t i=2;i<6;i++){track->fDy[i]+=backtrack->fDy[i]; track->fDz[i]+=backtrack->fDz[i];}
2453 if (track->fChi2MIP[1]>kMaxChi2PerCluster[1]*6.) continue;
2454 track->fChi22 = GetMatchingChi2(backtrack,original);
2455
2456 if ((track->fConstrain) && track->fChi22>90.) continue;
2457 if ((!track->fConstrain) && track->fChi22>30.) continue;
2458 if ( track->fChi22/track->GetNumberOfClusters()>11.) continue;
2459
2460
2461 if (!(track->fConstrain)&&track->fChi2MIP[1]>kMaxChi2PerCluster[1]) continue;
2462 Bool_t isOK=kTRUE;
2463 /*
2464 for (Int_t i=0;i<6;i++){
2465 if (track->fClIndex[i]>0){
2466 Double_t dy1 = (track->fDy[i]/track->fSigmaY[i]);
2467 Double_t dz1 = (track->fDz[i]/track->fSigmaZ[i]);
2468 Double_t dy2 = (backtrack->fDy[i]/backtrack->fSigmaY[i]);
2469 Double_t dz2 = (backtrack->fDz[i]/backtrack->fSigmaZ[i]);
2470 if (TMath::Min(dy1*dy1+dz1*dz1,dy2*dy2+dz2*dz2)> kMaxChi2sR[i]) isOK =kFALSE;
2471 track->fDy[i+6] = backtrack->fDy[i];
2472 track->fDz[i+6] = backtrack->fDz[i];
2473 track->fSigmaY[i+6] = backtrack->fSigmaY[i];
2474 track->fSigmaZ[i+6] = backtrack->fSigmaZ[i];
2475 }
2476 else{
2477 if (i==5){
2478 if (track->fClIndex[i-1]>0){
2479 Double_t dy2 = (backtrack->fDy[i-1]/backtrack->fSigmaY[i-1]);
2480 Double_t dz2 = (backtrack->fDz[i-1]/backtrack->fSigmaZ[i-1]);
2481 if (dy2*dy2+dz2*dz2> kMaxChi2sR[i]) isOK =kFALSE;
2482 }
2483 else isOK = kFALSE;
2484 }
2485 }
2486 }
2487 */
2488 if(!isOK) continue;
2489 //
2490 //forward track - without constraint
2491 forwardtrack = new(forwardtrack) AliITStrackV2(*original);
2492 forwardtrack->ResetClusters();
2493 x = track->GetX();
2494 if (!RefitAt(x,forwardtrack,track)) continue;
2495 track->fChi2MIP[2] = NormalizedChi2(forwardtrack,0);
2496 if (track->fChi2MIP[2]>kMaxChi2PerCluster[2]*6.0) continue;
2497 if (!(track->fConstrain)&&track->fChi2MIP[2]>kMaxChi2PerCluster[2]) continue;
2498
2499 track->fD[0] = forwardtrack->GetD(GetX(),GetY());
2500 track->fD[1] = forwardtrack->GetZat(GetX())-GetZ();
2501 forwardtrack->fD[0] = track->fD[0];
2502 forwardtrack->fD[1] = track->fD[1];
2503 {
2504 Int_t list[6];
2505 AliITSclusterV2* clist[6];
2506 track->fChi2MIP[4] = GetNumberOfSharedClusters(track,esdindex,list,clist);
2507 if ( (!track->fConstrain) && track->fChi2MIP[4]>1.0) continue;
2508 }
2509
2510 track->fChi2MIP[3] = GetInterpolatedChi2(forwardtrack,backtrack);
2511 if ( (track->fChi2MIP[3]>6.*kMaxChi2PerCluster[3])) continue;
2512 if ( (!track->fConstrain) && (track->fChi2MIP[3]>2*kMaxChi2PerCluster[3])) {
2513 track->fChi2MIP[3]=1000;
2514 continue;
2515 }
2516 Double_t chi2 = track->fChi2MIP[0]+track->fNUsed;
2517 //
2518 for (Int_t ichi=0;ichi<5;ichi++){
2519 forwardtrack->fChi2MIP[ichi] = track->fChi2MIP[ichi];
2520 }
2521 if (chi2 < minchi2){
99c2ee26 2522 //besttrack = new AliITStrackV2(*forwardtrack);
2523 besttrack = track;
e43c066c 2524 besttrack->SetLabel(track->GetLabel());
2525 besttrack->fFakeRatio = track->fFakeRatio;
2526 minchi2 = chi2;
2527 original->fD[0] = forwardtrack->GetD(GetX(),GetY());
2528 original->fD[1] = forwardtrack->GetZat(GetX())-GetZ();
2529 }
2530 }
2531 delete backtrack;
2532 delete forwardtrack;
2533 Int_t accepted=0;
2534 for (Int_t i=0;i<entries;i++){
2535 AliITStrackV2 * track = (AliITStrackV2*)array->At(i);
2536 if (!track) continue;
2537 if (accepted>checkmax || track->fChi2MIP[3]>kMaxChi2PerCluster[3]*6. ||
2538 (track->GetNumberOfClusters()<besttrack->GetNumberOfClusters()-1.)||
2539 track->fChi2MIP[0]>besttrack->fChi2MIP[0]+2.*besttrack->fNUsed+3.){
2540 delete array->RemoveAt(i);
2541 continue;
2542 }
2543 else{
2544 accepted++;
2545 }
2546 }
2547 //
2548 array->Compress();
2549 SortTrackHypothesys(esdindex,checkmax,1);
2550 array = (TObjArray*) fTrackHypothesys.At(esdindex);
2551 besttrack = (AliITStrackV2*)array->At(0);
2552 if (!besttrack) return 0;
2553 besttrack->fChi2MIP[8]=0;
2554 fBestTrackIndex[esdindex]=0;
2555 entries = array->GetEntriesFast();
2556 AliITStrackV2 *longtrack =0;
2557 minchi2 =1000;
2558 Float_t minn=besttrack->GetNumberOfClusters()+besttrack->fNDeadZone;
2559 for (Int_t itrack=entries-1;itrack>0;itrack--){
2560 AliITStrackV2 * track = (AliITStrackV2*)array->At(itrack);
2561 if (!track->fConstrain) continue;
2562 if (track->GetNumberOfClusters()+track->fNDeadZone<minn) continue;
2563 if (track->fChi2MIP[0]-besttrack->fChi2MIP[0]>0.0) continue;
2564 if (track->fChi2MIP[0]>4.) continue;
2565 minn = track->GetNumberOfClusters()+track->fNDeadZone;
2566 longtrack =track;
2567 }
2568 //if (longtrack) besttrack=longtrack;
2569
2570 Int_t list[6];
2571 AliITSclusterV2 * clist[6];
2572 Float_t shared = GetNumberOfSharedClusters(besttrack,esdindex,list,clist);
2573 if (besttrack->fConstrain&&besttrack->fChi2MIP[0]<kMaxChi2PerCluster[0]&&besttrack->fChi2MIP[1]<kMaxChi2PerCluster[1]
2574 &&besttrack->fChi2MIP[2]<kMaxChi2PerCluster[2]&&besttrack->fChi2MIP[3]<kMaxChi2PerCluster[3]){
2575 //if (besttrack->fChi2MIP[0]<kMaxChi2PerCluster[0]&&besttrack->fChi2MIP[1]<kMaxChi2PerCluster[1]
2576 // &&besttrack->fChi2MIP[2]<kMaxChi2PerCluster[2]&&besttrack->fChi2MIP[3]<kMaxChi2PerCluster[3]){
2577 RegisterClusterTracks(besttrack,esdindex);
2578 }
2579 //
2580 //
2581 if (shared>0.0){
2582 Int_t nshared;
2583 Int_t overlist[6];
2584 Int_t sharedtrack = GetOverlapTrack(besttrack, esdindex, nshared, list, overlist);
2585 if (sharedtrack>=0){
2586 //
2587 besttrack = GetBest2Tracks(esdindex,sharedtrack,10,5.5);
2588 if (besttrack){
2589 shared = GetNumberOfSharedClusters(besttrack,esdindex,list,clist);
2590 }
2591 else return 0;
2592 }
2593 }
2594
2595 if (shared>2.5) return 0;
2596 if (shared>1.0) return besttrack;
2597 //
2598 // don't sign clusters if not gold track
2599 Double_t deltad = besttrack->GetD(GetX(),GetY());
2600 Double_t deltaz = besttrack->GetZat(GetX()) - GetZ();
2601 Double_t deltaprim = TMath::Sqrt(deltad*deltad+deltaz*deltaz);
2602 if (deltaprim>0.1 && (fConstraint[fPass])) return besttrack;
2603 if (TMath::Abs(deltad)>0.1) return besttrack;
2604 if (TMath::Abs(deltaz)>0.1) return besttrack;
2605 if (besttrack->fChi2MIP[0]>4.) return besttrack;
2606 if (besttrack->fChi2MIP[1]>4.) return besttrack;
2607 if (besttrack->fChi2MIP[2]>4.) return besttrack;
2608 if (besttrack->fChi2MIP[3]>4.) return besttrack;
2609 if (fConstraint[fPass]){
2610 //
2611 // sign clusters
2612 //
2613 Float_t *ny = GetNy(esdindex), *nz = GetNz(esdindex);
2614 for (Int_t i=0;i<6;i++){
2615 Int_t index = besttrack->fClIndex[i];
2616 if (index<=0) continue;
2617 Int_t ilayer = (index & 0xf0000000) >> 28;
2618 if (besttrack->fSigmaY[ilayer]<0.00000000001) continue;
2619 AliITSclusterV2 *c = (AliITSclusterV2*)GetCluster(index);
2620 if (!c) continue;
2621 if (ilayer>3&&c->GetNy()+c->GetNz()>6) continue;
2622 if ( (c->GetNy()+c->GetNz() )> ny[i]+nz[i]+0.7) continue; //shared track
2623 if ( c->GetNz()> nz[i]+0.7) continue; //shared track
2624 if ( ilayer>2&& besttrack->fNormQ[ilayer]/besttrack->fExpQ>1.5) continue;
2625 //if ( c->GetNy()> ny[i]+0.7) continue; //shared track
2626
2627 Bool_t cansign = kTRUE;
2628 for (Int_t itrack=0;itrack<entries; itrack++){
2629 AliITStrackV2 * track = (AliITStrackV2*)array->At(i);
2630 if (!track) continue;
2631 if (track->fChi2MIP[0]>besttrack->fChi2MIP[0]+2.*shared+1.) break;
2632 if ( (track->fClIndex[ilayer]>0) && (track->fClIndex[ilayer]!=besttrack->fClIndex[ilayer])){
2633 cansign = kFALSE;
2634 break;
2635 }
2636 }
2637 if (cansign){
2638 if (TMath::Abs(besttrack->fDy[ilayer]/besttrack->fSigmaY[ilayer])>3.) continue;
2639 if (TMath::Abs(besttrack->fDz[ilayer]/besttrack->fSigmaZ[ilayer])>3.) continue;
2640 if (!c->IsUsed()) c->Use();
2641 }
2642 }
2643 }
2644 return besttrack;
2645}
2646
2647
2648
2649void AliITStrackerMI::GetBestHypothesysMIP(TObjArray &itsTracks)
2650{
2651 //
2652 // get "best" hypothesys
2653 //for (Int_t ilayer=0;ilayer<6;ilayer++) fgLayers[ilayer].ResetWeights();
2654
2655
2656 Int_t nentries = itsTracks.GetEntriesFast();
2657 for (Int_t i=0;i<nentries;i++){
2658 AliITStrackV2* track = (AliITStrackV2*)itsTracks.At(i);
2659 if (!track) continue;
2660 TObjArray * array = (TObjArray*) fTrackHypothesys.At(i);
2661 if (!array) continue;
2662 if (array->GetEntriesFast()<=0) continue;
2663 //
2664 AliITStrackV2* longtrack=0;
2665 Float_t minn=0;
2666 Float_t maxchi2=1000;
2667 for (Int_t j=0;j<array->GetEntriesFast();j++){
2668 AliITStrackV2* track = (AliITStrackV2*)array->At(j);
2669 if (!track) continue;
2670 if (track->GetNumberOfClusters()+track->fNDeadZone<minn) continue;
2671 if (track->GetNumberOfClusters()+track->fNDeadZone>minn) maxchi2 = track->fChi2MIP[0];
2672 if (track->fChi2MIP[0]>maxchi2) continue;
2673 minn= track->GetNumberOfClusters()+track->fNDeadZone;
2674 maxchi2 = track->fChi2MIP[0];
2675 longtrack=track;
2676 break;
2677 }
2678 AliITStrackV2 * besttrack = (AliITStrackV2*)array->At(0);
2679 if (!longtrack) {longtrack = besttrack;}
2680 else besttrack= longtrack;
2681 if (besttrack){
2682 Int_t list[6];
2683 AliITSclusterV2 * clist[6];
2684 Float_t shared = GetNumberOfSharedClusters(longtrack,i,list,clist);
2685 //
2686 track->fNUsed = shared;
2687 track->fNSkipped = besttrack->fNSkipped;
2688 track->fChi2MIP[0] = besttrack->fChi2MIP[0];
2689 if (shared>0){
2690 Int_t nshared;
2691 Int_t overlist[6];
2692 //
2693 Int_t sharedtrack = GetOverlapTrack(longtrack, i, nshared, list, overlist);
2694 //if (sharedtrack==-1) sharedtrack=0;
2695 if (sharedtrack>=0){
2696 besttrack = GetBest2Tracks(i,sharedtrack,10,5.5);
2697 }
2698 }
2699 if (besttrack&&fConstraint[fPass])
2700 UpdateESDtrack(besttrack,AliESDtrack::kITSin);
2701 //if (besttrack&&besttrack->fConstrain)
2702 // UpdateESDtrack(besttrack,AliESDtrack::kITSin);
2703 if (besttrack->fChi2MIP[0]+besttrack->fNUsed>1.5){
2704 if ( (TMath::Abs(besttrack->fD[0])>0.1) && fConstraint[fPass]) {
2705 track->fReconstructed= kFALSE;
2706 }
2707 if ( (TMath::Abs(besttrack->fD[1])>0.1) && fConstraint[fPass]){
2708 track->fReconstructed= kFALSE;
2709 }
2710 }
2711
2712 }
2713 }
2714}
2715
2716
2717void AliITStrackerMI::CookLabel(AliITStrackV2 *track,Float_t wrong) const {
2718 //--------------------------------------------------------------------
2719 //This function "cooks" a track label. If label<0, this track is fake.
2720 //--------------------------------------------------------------------
2721 Int_t tpcLabel=-1;
2722
2723 if ( track->fESDtrack) tpcLabel = TMath::Abs(track->fESDtrack->GetTPCLabel());
2724
2725 track->fChi2MIP[9]=0;
2726 Int_t nwrong=0;
2727 for (Int_t i=0;i<track->GetNumberOfClusters();i++){
2728 Int_t cindex = track->GetClusterIndex(i);
2729 Int_t l=(cindex & 0xf0000000) >> 28;
2730 AliITSclusterV2 *cl = (AliITSclusterV2*)GetCluster(cindex);
2731 Int_t isWrong=1;
2732 for (Int_t ind=0;ind<3;ind++){
2733 if (tpcLabel>0)
2734 if (cl->GetLabel(ind)==tpcLabel) isWrong=0;
2735 }
2736 track->fChi2MIP[9]+=isWrong*(2<<l);
2737 nwrong+=isWrong;
2738 }
2739 track->fFakeRatio = double(nwrong)/double(track->GetNumberOfClusters());
2740 if (tpcLabel>0){
2741 if (track->fFakeRatio>wrong) track->fLab = -tpcLabel;
2742 else
2743 track->fLab = tpcLabel;
2744 }
2745
2746}
2747
2748
2749
2750void AliITStrackerMI::CookdEdx(AliITStrackV2* track)
2751{
2752 //
2753 //
2754 // Int_t list[6];
2755 //AliITSclusterV2 * clist[6];
2756 // Int_t shared = GetNumberOfSharedClusters(track,index,list,clist);
2757 Float_t dedx[4];
2758 Int_t accepted=0;
2759 track->fChi2MIP[9]=0;
2760 for (Int_t i=0;i<track->GetNumberOfClusters();i++){
2761 Int_t cindex = track->GetClusterIndex(i);
2762 Int_t l=(cindex & 0xf0000000) >> 28;
2763 AliITSclusterV2 *cl = (AliITSclusterV2*)GetCluster(cindex);
2764 Int_t lab = TMath::Abs(track->fESDtrack->GetTPCLabel());
2765 Int_t isWrong=1;
2766 for (Int_t ind=0;ind<3;ind++){
2767 if (cl->GetLabel(ind)==lab) isWrong=0;
2768 }
2769 track->fChi2MIP[9]+=isWrong*(2<<l);
2770 if (l<2) continue;
2771 //if (l>3 && (cl->GetNy()>4) || (cl->GetNz()>4)) continue; //shared track
2772 //if (l>3&& !(cl->GetType()==1||cl->GetType()==10)) continue;
2773 //if (l<4&& !(cl->GetType()==1)) continue;
2774 dedx[accepted]= track->fdEdxSample[i];
2775 //dedx[accepted]= track->fNormQ[l];
2776 accepted++;
2777 }
2778 if (accepted<1) {
2779 track->SetdEdx(0);
2780 return;
2781 }
2782 Int_t indexes[4];
2783 TMath::Sort(accepted,dedx,indexes,kFALSE);
2784 Double_t low=0.;
2785 Double_t up=0.51;
2786 Double_t nl=low*accepted, nu =up*accepted;
2787 Float_t sumamp = 0;
2788 Float_t sumweight =0;
2789 for (Int_t i=0; i<accepted; i++) {
2790 Float_t weight =1;
2791 if (i<nl+0.1) weight = TMath::Max(1.-(nl-i),0.);
2792 if (i>nu-1) weight = TMath::Max(nu-i,0.);
2793 sumamp+= dedx[indexes[i]]*weight;
2794 sumweight+=weight;
2795 }
2796 track->SetdEdx(sumamp/sumweight);
2797}
2798
2799
2800void AliITStrackerMI::MakeCoeficients(Int_t ntracks){
2801 //
2802 //
2803 fCoeficients = new Float_t[ntracks*48];
2804 for (Int_t i=0;i<ntracks*48;i++) fCoeficients[i]=-1.;
2805}
2806
2807
2808Double_t AliITStrackerMI::GetPredictedChi2MI(AliITStrackV2* track, const AliITSclusterV2 *cluster,Int_t layer)
2809{
2810 //
2811 //
2812 //
2813 Float_t erry,errz;
2814 Float_t theta = track->GetTgl();
2815 Float_t phi = track->GetSnp();
2816 phi = TMath::Sqrt(phi*phi/(1.-phi*phi));
2817 GetError(layer,cluster,theta,phi,track->fExpQ,erry,errz);
2818 Double_t chi2 = track->GetPredictedChi2MI(cluster->GetY(),cluster->GetZ(),erry,errz);
2819 Float_t ny,nz;
2820 GetNTeor(layer,cluster, theta,phi,ny,nz);
2821 Double_t delta = cluster->GetNy()+cluster->GetNz()-nz-ny;
2822 if (delta>1){
2823 chi2+=0.5*TMath::Min(delta/2,2.);
2824 chi2+=2.*cluster->GetDeltaProbability();
2825 }
2826 //
2827 track->fNy[layer] =ny;
2828 track->fNz[layer] =nz;
2829 track->fSigmaY[layer] = erry;
2830 track->fSigmaZ[layer] = errz;
2831 //track->fNormQ[layer] = cluster->GetQ()/TMath::Sqrt(1+theta*theta+phi*phi);
2832 track->fNormQ[layer] = cluster->GetQ()/TMath::Sqrt((1.+ track->fP3*track->fP3)/(1.- track->fP2*track->fP2));
2833 return chi2;
2834
2835}
2836
f43e383b 2837Int_t AliITStrackerMI::UpdateMI(AliITStrackV2* track, const AliITSclusterV2* cl,Double_t chi2,Int_t index) const
e43c066c 2838{
2839 //
2840 //
2841 //
2842 Int_t layer = (index & 0xf0000000) >> 28;
2843 track->fClIndex[layer] = index;
2844 if ( (layer>1) &&track->fNormQ[layer]/track->fExpQ<0.5 ) {
2845 chi2+= (0.5-track->fNormQ[layer]/track->fExpQ)*10.;
2846 track->fdEdxMismatch+=(0.5-track->fNormQ[layer]/track->fExpQ)*10.;
2847 }
2848 return track->UpdateMI(cl->GetY(),cl->GetZ(),track->fSigmaY[layer],track->fSigmaZ[layer],chi2,index);
2849}
2850
2851void AliITStrackerMI::GetNTeor(Int_t layer, const AliITSclusterV2* /*cl*/, Float_t theta, Float_t phi, Float_t &ny, Float_t &nz)
2852{
2853 //
2854 //get "mean shape"
2855 //
2856 if (layer==0){
2857 ny = 1.+TMath::Abs(phi)*3.2;
2858 nz = 1.+TMath::Abs(theta)*0.34;
2859 return;
2860 }
2861 if (layer==1){
2862 ny = 1.+TMath::Abs(phi)*3.2;
2863 nz = 1.+TMath::Abs(theta)*0.28;
2864 return;
2865 }
2866
2867 if (layer>3){
2868 ny = 2.02+TMath::Abs(phi)*1.95;
2869 nz = 2.02+TMath::Abs(phi)*2.35;
2870 return;
2871 }
4c53440c 2872 ny = 6.6-2.7*TMath::Abs(phi);
e43c066c 2873 nz = 2.8-3.11*TMath::Abs(phi)+0.45*TMath::Abs(theta);
2874}
2875
2876
2877
2878Int_t AliITStrackerMI::GetError(Int_t layer, const AliITSclusterV2*cl, Float_t theta, Float_t phi,Float_t expQ, Float_t &erry, Float_t &errz)
2879{
2880 //calculate cluster position error
2881 //
2882 Float_t nz,ny;
2883 GetNTeor(layer, cl,theta,phi,ny,nz);
2884 erry = TMath::Sqrt(cl->GetSigmaY2());
2885 errz = TMath::Sqrt(cl->GetSigmaZ2());
2886 //
2887 // PIXELS
2888 if (layer<2){
2889
2890 if (TMath::Abs(ny-cl->GetNy())>0.6) {
2891 if (ny<cl->GetNy()){
2892 erry*=0.4+TMath::Abs(ny-cl->GetNy());
2893 errz*=0.4+TMath::Abs(ny-cl->GetNy());
2894 }else{
2895 erry*=0.7+0.5*TMath::Abs(ny-cl->GetNy());
2896 errz*=0.7+0.5*TMath::Abs(ny-cl->GetNy());
2897 }
2898 }
2899 if (TMath::Abs(nz-cl->GetNz())>1.) {
2900 erry*=TMath::Abs(nz-cl->GetNz());
2901 errz*=TMath::Abs(nz-cl->GetNz());
2902 }
2903 erry*=0.85;
2904 errz*=0.85;
2905 erry= TMath::Min(erry,float(0.005));
2906 errz= TMath::Min(errz,float(0.03));
2907 return 10;
2908 }
2909
2910//STRIPS
2911 if (layer>3){
2912 if (cl->GetNy()==100||cl->GetNz()==100){
2913 erry = 0.004;
2914 errz = 0.2;
2915 return 100;
2916 }
2917 if (cl->GetNy()+cl->GetNz()>12){
2918 erry = 0.06;
2919 errz = 0.57;
2920 return 100;
2921 }
2922 Float_t normq = cl->GetQ()/(TMath::Sqrt(1+theta*theta+phi*phi));
2923 Float_t chargematch = TMath::Max(double(normq/expQ),2.);
2924 //
2925 if (cl->GetType()==1 || cl->GetType()==10 ){
2926 if (chargematch<1.0 || (cl->GetNy()+cl->GetNz()<nz+ny+0.5)){
2927 errz = 0.043;
2928 erry = 0.00094;
2929 return 101;
2930 }
2931 if (cl->GetNy()+cl->GetNz()<nz+ny+1.2){
2932 errz = 0.06;
2933 erry =0.0013;
2934 return 102;
2935 }
2936 erry = 0.0027;
2937 errz = TMath::Min(0.028*(chargematch+cl->GetNy()+cl->GetNz()-nz+ny),0.15);
2938 return 103;
2939 }
2940 if (cl->GetType()==2 || cl->GetType()==11 ){
2941 erry = TMath::Min(0.0010*(1+chargematch+cl->GetNy()+cl->GetNz()-nz+ny),0.05);
2942 errz = TMath::Min(0.025*(1+chargematch+cl->GetNy()+cl->GetNz()-nz+ny),0.5);
2943 return 104;
2944 }
2945
2946 if (cl->GetType()>100 ){
2947 if ((chargematch+cl->GetNy()+cl->GetNz()-nz-ny<1.5)){
2948 errz = 0.05;
2949 erry = 0.00096;
2950 return 105;
2951 }
2952 if (cl->GetNy()+cl->GetNz()-nz-ny<1){
2953 errz = 0.10;
2954 erry = 0.0025;
2955 return 106;
2956 }
2957
2958 errz = TMath::Min(0.05*(chargematch+cl->GetNy()+cl->GetNz()-nz-ny),0.4);
2959 erry = TMath::Min(0.003*(chargematch+cl->GetNy()+cl->GetNz()-nz-ny),0.05);
2960 return 107;
2961 }
2962 Float_t diff = cl->GetNy()+cl->GetNz()-ny-nz;
2963 if (diff<1) diff=1;
2964 if (diff>4) diff=4;
2965
2966 if (cl->GetType()==5||cl->GetType()==6||cl->GetType()==7||cl->GetType()==8){
2967 errz = 0.14*diff;
2968 erry = 0.003*diff;
2969 return 108;
2970 }
2971 erry = 0.04*diff;
2972 errz = 0.06*diff;
2973 return 109;
2974 }
2975 //DRIFTS
2976 Float_t normq = cl->GetQ()/(TMath::Sqrt(1+theta*theta+phi*phi));
2977 Float_t chargematch = normq/expQ;
2978 Float_t factorz=1;
2979 Int_t cnz = cl->GetNz()%10;
2980 //charge match
2981 if (cl->GetType()==1){
2982 if (chargematch<1.25){
2983 erry = 0.0028*(1.+6./cl->GetQ()); // gold clusters
2984 }
2985 else{
2986 erry = 0.003*chargematch;
2987 if (cl->GetNz()==3) erry*=1.5;
2988 }
2989 if (chargematch<1.0){
2990 errz = 0.0011*(1.+6./cl->GetQ());
2991 }
2992 else{
2993 errz = 0.002*(1+2*(chargematch-1.));
2994 }
2995 if (cnz>nz+0.6) {
2996 erry*=(cnz-nz+0.5);
2997 errz*=1.4*(cnz-nz+0.5);
2998 }
2999 }
3000 if (cl->GetType()>1){
3001 if (chargematch<1){
3002 erry = 0.00385*(1.+6./cl->GetQ()); // gold clusters
3003 errz = 0.0016*(1.+6./cl->GetQ());
3004 }
3005 else{
3006 errz = 0.0014*(1+3*(chargematch-1.));
3007 erry = 0.003*(1+3*(chargematch-1.));
3008 }
3009 if (cnz>nz+0.6) {
3010 erry*=(cnz-nz+0.5);
3011 errz*=1.4*(cnz-nz+0.5);
3012 }
3013 }
3014
3015 if (TMath::Abs(cl->GetY())>2.5){
3016 factorz*=1+2*(TMath::Abs(cl->GetY())-2.5);
3017 }
3018 if (TMath::Abs(cl->GetY())<1){
3019 factorz*=1.+0.5*TMath::Abs(TMath::Abs(cl->GetY())-1.);
3020 }
3021 factorz= TMath::Min(factorz,float(4.));
3022 errz*=factorz;
3023
3024 erry= TMath::Min(erry,float(0.05));
3025 errz= TMath::Min(errz,float(0.05));
3026 return 200;
3027}
3028
3029
3030
3031void AliITStrackerMI::SignDeltas( TObjArray *ClusterArray, Float_t vz)
3032{
3033 //
3034 //
3035 Int_t entries = ClusterArray->GetEntriesFast();
3036 if (entries<4) return;
3037 AliITSclusterV2* cluster = (AliITSclusterV2*)ClusterArray->At(0);
3038 Int_t layer = cluster->GetLayer();
3039 if (layer>1) return;
3040 Int_t index[10000];
3041 Int_t ncandidates=0;
3042 Float_t r = (layer>0)? 7:4;
3043 //
3044 for (Int_t i=0;i<entries;i++){
3045 AliITSclusterV2* cl0 = (AliITSclusterV2*)ClusterArray->At(i);
3046 Float_t nz = 1+TMath::Abs((cl0->GetZ()-vz)/r);
3047 if (cl0->GetNy()+cl0->GetNz()<=5+2*layer+nz) continue;
3048 index[ncandidates] = i; //candidate to belong to delta electron track
3049 ncandidates++;
3050 if (cl0->GetNy()+cl0->GetNz()>9+2*layer+nz) {
3051 cl0->SetDeltaProbability(1);
3052 }
3053 }
3054 //
3055 //
3056 //
3057 for (Int_t i=0;i<ncandidates;i++){
3058 AliITSclusterV2* cl0 = (AliITSclusterV2*)ClusterArray->At(index[i]);
3059 if (cl0->GetDeltaProbability()>0.8) continue;
3060 //
3061 Int_t ncl = 0;
3062 Float_t y[100],z[100],sumy,sumz,sumy2, sumyz, sumw;
3063 sumy=sumz=sumy2=sumyz=sumw=0.0;
3064 for (Int_t j=0;j<ncandidates;j++){
3065 if (i==j) continue;
3066 AliITSclusterV2* cl1 = (AliITSclusterV2*)ClusterArray->At(index[j]);
3067 //
3068 Float_t dz = cl0->GetZ()-cl1->GetZ();
3069 Float_t dy = cl0->GetY()-cl1->GetY();
3070 if (TMath::Sqrt(dz*dz+dy*dy)<0.2){
3071 Float_t weight = cl1->GetNy()+cl1->GetNz()-2;
3072 y[ncl] = cl1->GetY();
3073 z[ncl] = cl1->GetZ();
3074 sumy+= y[ncl]*weight;
3075 sumz+= z[ncl]*weight;
3076 sumy2+=y[ncl]*y[ncl]*weight;
3077 sumyz+=y[ncl]*z[ncl]*weight;
3078 sumw+=weight;
3079 ncl++;
3080 }
3081 }
3082 if (ncl<4) continue;
3083 Float_t det = sumw*sumy2 - sumy*sumy;
3084 Float_t delta=1000;
3085 if (TMath::Abs(det)>0.01){
3086 Float_t z0 = (sumy2*sumz - sumy*sumyz)/det;
3087 Float_t k = (sumyz*sumw - sumy*sumz)/det;
3088 delta = TMath::Abs(cl0->GetZ()-(z0+k*cl0->GetY()));
3089 }
3090 else{
3091 Float_t z0 = sumyz/sumy;
3092 delta = TMath::Abs(cl0->GetZ()-z0);
3093 }
3094 if ( delta<0.05) {
3095 cl0->SetDeltaProbability(1-20.*delta);
3096 }
3097 }
3098}
3099
3100
f43e383b 3101void AliITStrackerMI::UpdateESDtrack(AliITStrackV2* track, ULong_t flags) const
e43c066c 3102{
3103 //
3104 //
3105 track->UpdateESDtrack(flags);
99c2ee26 3106 AliITStrackV2 * oldtrack = (AliITStrackV2*)(track->fESDtrack->GetITStrack());
3107 if (oldtrack) delete oldtrack;
e43c066c 3108 track->fESDtrack->SetITStrack(new AliITStrackV2(*track));
3109}
3110
3111
3112
3113
3114void AliITStrackerMI::FindV0(AliESD */*event*/)
3115{
3116 //
3117 // fast V0 finder
3118 //
3119 AliHelix helixes[30000];
3120 TObjArray trackarray(30000);
3121 Float_t dist[30000];
3122 AliITSRecV0Info vertex;
3123 //
3124 Int_t entries = fTrackHypothesys.GetEntriesFast();
3125 for (Int_t i=0;i<entries;i++){
3126 TObjArray * array = (TObjArray*)fTrackHypothesys.At(i);
3127 if (!array) continue;
3128 AliITStrackV2 * track = (AliITStrackV2*)array->At(fBestTrackIndex[i]);
3129 if (track){
3130 dist[i] = TMath::Sqrt(track->fD[0]*track->fD[0]+track->fD[1]*track->fD[1]);
3131 trackarray.AddAt(track,i);
3132 new (&helixes[i]) AliHelix(*track);
3133 }
3134 }
3135 for (Int_t itrack0=0;itrack0<entries;itrack0++){
3136 AliITStrackV2 * track0 = (AliITStrackV2*)trackarray.At(itrack0);
3137 if (!track0) continue;
3138 if (dist[itrack0]<0.2) continue;
3139 for (Int_t itrack1=itrack0+1;itrack1<entries;itrack1++){
3140 AliITStrackV2 * track1 = (AliITStrackV2*)trackarray.At(itrack1);
3141 if (!track1) continue;
3142 if (dist[itrack1]<0.2) continue;
3143 if (track1->fP4*track0->fP4>0) continue; //the same sign
3144 AliHelix *h1 = &helixes[itrack0];
3145 AliHelix *h2 = &helixes[itrack1];
3146
3147 Double_t distance = TestV0(h1,h2,&vertex);
3148 if (distance>0.4) continue;
3149 if (vertex.fRr<0.3) continue;
3150 if (vertex.fRr>27) continue;
3151 Float_t v[3]={GetX(),GetY(),GetZ()};
3152 vertex.Update(v,track0->fMass, track1->fMass);
3153
3154 if ((TMath::Abs(vertex.fInvMass-0.4976)<0.05 || TMath::Abs(vertex.fInvMass-0.0)<0.1|| TMath::Abs(vertex.fInvMass-1.1)<0.1)) {
3155 if (vertex.fPointAngle<0.85) continue;
3156 }
3157 else{
3158 if (vertex.fPointAngle<0.98) continue;
3159 }
3160 if (TMath::Abs(TMath::Abs(track0->fLab)-TMath::Abs(track1->fLab))<2){
3161 Float_t mindist = FindBestPair(itrack0,itrack1,&vertex);
3162 if (mindist>1) FindBestPair(itrack0,itrack1,&vertex);
3163 }
3164 }
3165 }
3166}
3167
3168Double_t AliITStrackerMI::FindBestPair(Int_t esdtrack0, Int_t esdtrack1,AliITSRecV0Info *vertex)
3169{
3170 //
3171 // try to find best pair from the tree of track hyp.
3172 //
3173 TObjArray * array0 = (TObjArray*)fTrackHypothesys.At(esdtrack0);
3174 Int_t entries0 = array0->GetEntriesFast();
3175 TObjArray * array1 = (TObjArray*)fTrackHypothesys.At(esdtrack1);
3176 Int_t entries1 = array1->GetEntriesFast();
3177 //
3178 //
3179 AliITSRecV0Info v0;
3180 AliITSRecV0Info vbest;
3181 Double_t criticalradius = vertex->fRr;
3182 Double_t mindist =1000;
3183 Int_t bestpair[2];
3184 //
3185 for (Int_t itrack0=0;itrack0<entries0;itrack0++){
3186 AliITStrackV2 * track0 = (AliITStrackV2*)array0->At(itrack0);
3187 if (!track0) continue;
3188 if (track0->fX<criticalradius-1) continue;
3189 if (track0->fX>criticalradius+5) continue;
3190 for (Int_t itrack1=0;itrack1<entries1;itrack1++){
3191 AliITStrackV2 * track1 = (AliITStrackV2*)array1->At(itrack1);
3192 if (!track1) continue;
3193 if (track1->fX<criticalradius-1) continue;
3194 if (track1->fX>criticalradius+5) continue;
3195
3196 AliHelix h0(*track0);
3197 AliHelix h1(*track1);
3198 Double_t distance = TestV0(&h0,&h1,&v0);
3199 if (v0.fRr>30) continue;
3200 if (v0.fRr<0.2) continue;
3201 Float_t v[3]={GetX(),GetY(),GetZ()};
3202 v0.Update(v,track0->fMass, track1->fMass);
3203 if (distance<mindist){
3204 mindist = distance;
3205 bestpair[0]=itrack0;
3206 bestpair[1]=itrack1;
3207 vbest = v0;
3208 }
3209 }
3210 }
3211 if (mindist<0.2){
3212 vbest.Dump();
3213 vertex->Dump();
3214 }
3215 return mindist;
3216}
3217
3218
3219void AliITSRecV0Info::Update(Float_t vertex[3], Float_t mass1, Float_t mass2)
3220{
f43e383b 3221 //
3222 //Update V0 information
3223 //
e43c066c 3224 Float_t v[3] = {fXr[0]-vertex[0],fXr[1]-vertex[1],fXr[2]-vertex[2]};
3225 Float_t p[3] = {fPdr[0]+fPm[0], fPdr[1]+fPm[1],fPdr[2]+fPm[2]};
3226
3227 Float_t vnorm2 = v[0]*v[0]+v[1]*v[1];
3228 Float_t vnorm3 = TMath::Sqrt(v[2]*v[2]+vnorm2);
3229 vnorm2 = TMath::Sqrt(vnorm2);
3230 Float_t pnorm2 = p[0]*p[0]+p[1]*p[1];
3231 Float_t pnorm3 = TMath::Sqrt(p[2]*p[2]+pnorm2);
3232 pnorm2 = TMath::Sqrt(pnorm2);
3233
3234 fPointAngleFi = (v[0]*p[0]+v[1]*p[1])/(vnorm2*pnorm2);
3235 fPointAngleTh = (v[2]*p[2]+vnorm2*pnorm2)/(vnorm3*pnorm3);
3236 fPointAngle = (v[0]*p[0]+v[1]*p[1]+v[2]*p[2])/(vnorm3*pnorm3);
3237
3238 Float_t e1 = TMath::Sqrt(mass1*mass1+
3239 fPdr[0]*fPdr[0]+
3240 fPdr[1]*fPdr[1]+
3241 fPdr[2]*fPdr[2]);
3242 Float_t e2 = TMath::Sqrt(mass2*mass2+
3243 fPm[0]*fPm[0]+
3244 fPm[1]*fPm[1]+
3245 fPm[2]*fPm[2]);
3246
3247 fInvMass =
3248 (fPm[0]+fPdr[0])*(fPm[0]+fPdr[0])+
3249 (fPm[1]+fPdr[1])*(fPm[1]+fPdr[1])+
3250 (fPm[2]+fPdr[2])*(fPm[2]+fPdr[2]);
3251
3252 fInvMass = TMath::Sqrt((e1+e2)*(e1+e2)-fInvMass);
3253
3254
3255}
3256
3257
3258
3259Double_t AliITStrackerMI::TestV0(AliHelix *helix1, AliHelix *helix2, AliITSRecV0Info *vertex)
3260{
3261 //
3262 // test the helixes for the distnce calculate vertex characteristic
3263 //
3264 Float_t distance1,distance2;
3265 AliHelix & dhelix1 = *helix1;
3266 Double_t pp[3],xx[3];
3267 dhelix1.GetMomentum(0,pp,0);
3268 dhelix1.Evaluate(0,xx);
3269 AliHelix &mhelix = *helix2;
3270 //
3271 //find intersection linear
3272 //
3273 Double_t phase[2][2],radius[2];
3274 Int_t points = dhelix1.GetRPHIintersections(mhelix, phase, radius);
3275 Double_t delta1=10000,delta2=10000;
3276
3277 if (points>0){
3278 dhelix1.LinearDCA(mhelix,phase[0][0],phase[0][1],radius[0],delta1);
3279 dhelix1.LinearDCA(mhelix,phase[0][0],phase[0][1],radius[0],delta1);
3280 dhelix1.LinearDCA(mhelix,phase[0][0],phase[0][1],radius[0],delta1);
3281 }
3282 if (points==2){
3283 dhelix1.LinearDCA(mhelix,phase[1][0],phase[1][1],radius[1],delta2);
3284 dhelix1.LinearDCA(mhelix,phase[1][0],phase[1][1],radius[1],delta2);
3285 dhelix1.LinearDCA(mhelix,phase[1][0],phase[1][1],radius[1],delta2);
3286 }
3287 distance1 = TMath::Min(delta1,delta2);
3288 vertex->fDist1 = TMath::Sqrt(distance1);
3289 //
3290 //find intersection parabolic
3291 //
3292 points = dhelix1.GetRPHIintersections(mhelix, phase, radius);
3293 delta1=10000,delta2=10000;
3294
3295 if (points>0){
3296 dhelix1.ParabolicDCA(mhelix,phase[0][0],phase[0][1],radius[0],delta1);
3297 }
3298 if (points==2){
3299 dhelix1.ParabolicDCA(mhelix,phase[1][0],phase[1][1],radius[1],delta2);
3300 }
3301
3302 distance2 = TMath::Min(delta1,delta2);
3303 vertex->fDist2 = TMath::Sqrt(distance2);
3304 if (distance2<100){
3305 if (delta1<delta2){
3306 //get V0 info
3307 dhelix1.Evaluate(phase[0][0],vertex->fXr);
3308 dhelix1.GetMomentum(phase[0][0],vertex->fPdr);
3309 mhelix.GetMomentum(phase[0][1],vertex->fPm);
3310 dhelix1.GetAngle(phase[0][0],mhelix,phase[0][1],vertex->fAngle);
3311 vertex->fRr = TMath::Sqrt(radius[0]);
3312 }
3313 else{
3314 dhelix1.Evaluate(phase[1][0],vertex->fXr);
3315 dhelix1.GetMomentum(phase[1][0],vertex->fPdr);
3316 mhelix.GetMomentum(phase[1][1],vertex->fPm);
3317 dhelix1.GetAngle(phase[1][0],mhelix,phase[1][1],vertex->fAngle);
3318 vertex->fRr = TMath::Sqrt(radius[1]);
3319 }
3320 }
3321 //
3322 //
3323 return vertex->fDist2;
3324}
3325