]> git.uio.no Git - u/mrichter/AliRoot.git/blame - TPC/AliTPCtrackerMI.cxx
git://git.uio.no / u / mrichter / AliRoot.git / blame
? search:
summary | shortlog | log | commit | commitdiff | tree
blob | blame (incremental) | history | HEAD
Updated version (B.Nandi)
[u/mrichter/AliRoot.git] / TPC / AliTPCtrackerMI.cxx
CommitLineData
1c53abe2 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
1c53abe2 16
17//-------------------------------------------------------
18// Implementation of the TPC tracker
19//
20// Origin: Marian Ivanov Marian.Ivanov@cern.ch
21//
47966a6d 22// AliTPC parallel tracker -
23// How to use? -
24// run AliTPCFindClusters.C macro - clusters neccessary for tracker are founded
25// run AliTPCFindTracksMI.C macro - to find tracks
26// tracks are written to AliTPCtracks.root file
27// for comparison also seeds are written to the same file - to special branch
1c53abe2 28//-------------------------------------------------------
47966a6d 29
30
31/* $Id$ */
32
cc5e9db0 33#include "Riostream.h"
6d171107 34#include <TClonesArray.h>
35#include <TFile.h>
36#include <TObjArray.h>
37#include <TTree.h>
1c53abe2 38
47966a6d 39#include "AliComplexCluster.h"
91162307 40#include "AliESD.h"
9996a03b 41#include "AliESDkink.h"
91162307 42#include "AliHelix.h"
91162307 43#include "AliRunLoader.h"
6d171107 44#include "AliTPCClustersRow.h"
45#include "AliTPCParam.h"
9996a03b 46#include "AliTPCReconstructor.h"
6d171107 47#include "AliTPCclusterMI.h"
48#include "AliTPCpolyTrack.h"
81e97e0d 49#include "AliTPCreco.h"
50#include "AliTPCseed.h"
b67e07dc 51#include "AliTPCtrackerMI.h"
6d171107 52#include "TStopwatch.h"
81e97e0d 53#include "AliTPCReconstructor.h"
54#include "AliESDkink.h"
55#include "AliPID.h"
eea478d3 56#include "TTreeStream.h"
5d837844 57#include "AliAlignObj.h"
58#include "AliTrackPointArray.h"
59
6d171107 60//
c9427e08 61
91162307 62ClassImp(AliTPCtrackerMI)
c9427e08 63
64
b67e07dc 65class AliTPCFastMath {
91162307 66public:
b67e07dc 67 AliTPCFastMath();
91162307 68 static Double_t FastAsin(Double_t x);
69 private:
b67e07dc 70 static Double_t fgFastAsin[20000]; //lookup table for fast asin computation
91162307 71};
c9427e08 72
b67e07dc 73Double_t AliTPCFastMath::fgFastAsin[20000];
2274b54b 74AliTPCFastMath gAliTPCFastMath; // needed to fill the LUT
c9427e08 75
b67e07dc 76AliTPCFastMath::AliTPCFastMath(){
77 //
78 // initialized lookup table;
91162307 79 for (Int_t i=0;i<10000;i++){
80 fgFastAsin[2*i] = TMath::ASin(i/10000.);
81 fgFastAsin[2*i+1] = (TMath::ASin((i+1)/10000.)-fgFastAsin[2*i]);
82 }
c9427e08 83}
84
b67e07dc 85Double_t AliTPCFastMath::FastAsin(Double_t x){
86 //
87 // return asin using lookup table
91162307 88 if (x>0){
89 Int_t index = int(x*10000);
90 return fgFastAsin[2*index]+(x*10000.-index)*fgFastAsin[2*index+1];
91 }
92 x*=-1;
93 Int_t index = int(x*10000);
94 return -(fgFastAsin[2*index]+(x*10000.-index)*fgFastAsin[2*index+1]);
1c53abe2 95}
96
97
98
99
91162307 100Int_t AliTPCtrackerMI::UpdateTrack(AliTPCseed * track, Int_t accept){
b67e07dc 101 //
102 //update track information using current cluster - track->fCurrentCluster
103
1c53abe2 104
91162307 105 AliTPCclusterMI* c =track->fCurrentCluster;
106 if (accept>0) track->fCurrentClusterIndex1 |=0x8000; //sign not accepted clusters
c9427e08 107
91162307 108 UInt_t i = track->fCurrentClusterIndex1;
1c53abe2 109
110 Int_t sec=(i&0xff000000)>>24;
91162307 111 //Int_t row = (i&0x00ff0000)>>16;
1c53abe2 112 track->fRow=(i&0x00ff0000)>>16;
113 track->fSector = sec;
114 // Int_t index = i&0xFFFF;
115 if (sec>=fParam->GetNInnerSector()) track->fRow += fParam->GetNRowLow();
d26d9159 116 track->SetClusterIndex2(track->fRow, i);
91162307 117 //track->fFirstPoint = row;
118 //if ( track->fLastPoint<row) track->fLastPoint =row;
119 // if (track->fRow<0 || track->fRow>160) {
120 // printf("problem\n");
121 //}
122 if (track->fFirstPoint>track->fRow)
123 track->fFirstPoint = track->fRow;
124 if (track->fLastPoint<track->fRow)
125 track->fLastPoint = track->fRow;
126
127
128 track->fClusterPointer[track->fRow] = c;
1c53abe2 129 //
130
1c53abe2 131 Float_t angle2 = track->GetSnp()*track->GetSnp();
132 angle2 = TMath::Sqrt(angle2/(1-angle2));
133 //
134 //SET NEW Track Point
135 //
91162307 136 // if (debug)
137 {
138 AliTPCTrackerPoint &point =*(track->GetTrackPoint(track->fRow));
1c53abe2 139 //
91162307 140 point.SetSigmaY(c->GetSigmaY2()/track->fCurrentSigmaY2);
141 point.SetSigmaZ(c->GetSigmaZ2()/track->fCurrentSigmaZ2);
142 point.SetErrY(sqrt(track->fErrorY2));
143 point.SetErrZ(sqrt(track->fErrorZ2));
1c53abe2 144 //
91162307 145 point.SetX(track->GetX());
146 point.SetY(track->GetY());
147 point.SetZ(track->GetZ());
148 point.SetAngleY(angle2);
149 point.SetAngleZ(track->GetTgl());
150 if (point.fIsShared){
151 track->fErrorY2 *= 4;
152 track->fErrorZ2 *= 4;
153 }
154 }
155
156 Double_t chi2 = track->GetPredictedChi2(track->fCurrentCluster);
157 //
158 track->fErrorY2 *= 1.3;
159 track->fErrorY2 += 0.01;
160 track->fErrorZ2 *= 1.3;
161 track->fErrorZ2 += 0.005;
162 //}
163 if (accept>0) return 0;
164 if (track->GetNumberOfClusters()%20==0){
165 // if (track->fHelixIn){
166 // TClonesArray & larr = *(track->fHelixIn);
167 // Int_t ihelix = larr.GetEntriesFast();
168 // new(larr[ihelix]) AliHelix(*track) ;
169 //}
1c53abe2 170 }
91162307 171 track->fNoCluster =0;
172 return track->Update(c,chi2,i);
173}
174
175
176
177Int_t AliTPCtrackerMI::AcceptCluster(AliTPCseed * seed, AliTPCclusterMI * cluster, Float_t factor,
178 Float_t cory, Float_t corz)
179{
1c53abe2 180 //
91162307 181 // decide according desired precision to accept given
182 // cluster for tracking
183 Double_t sy2=ErrY2(seed,cluster)*cory;
184 Double_t sz2=ErrZ2(seed,cluster)*corz;
185 //sy2=ErrY2(seed,cluster)*cory;
186 //sz2=ErrZ2(seed,cluster)*cory;
1c53abe2 187
91162307 188 Double_t sdistancey2 = sy2+seed->GetSigmaY2();
189 Double_t sdistancez2 = sz2+seed->GetSigmaZ2();
190
191 Double_t rdistancey2 = (seed->fCurrentCluster->GetY()-seed->GetY())*
192 (seed->fCurrentCluster->GetY()-seed->GetY())/sdistancey2;
193 Double_t rdistancez2 = (seed->fCurrentCluster->GetZ()-seed->GetZ())*
194 (seed->fCurrentCluster->GetZ()-seed->GetZ())/sdistancez2;
195
196 Double_t rdistance2 = rdistancey2+rdistancez2;
197 //Int_t accept =0;
1c53abe2 198
91162307 199 if (rdistance2>16) return 3;
200
201
202 if ((rdistancey2>9.*factor || rdistancez2>9.*factor) && cluster->GetType()==0)
203 return 2; //suspisiouce - will be changed
204
205 if ((rdistancey2>6.25*factor || rdistancez2>6.25*factor) && cluster->GetType()>0)
206 // strict cut on overlaped cluster
207 return 2; //suspisiouce - will be changed
208
209 if ( (rdistancey2>1.*factor || rdistancez2>6.25*factor )
210 && cluster->GetType()<0){
211 seed->fNFoundable--;
212 return 2;
1c53abe2 213 }
91162307 214 return 0;
215}
216
217
1c53abe2 218
1c53abe2 219
1c53abe2 220//_____________________________________________________________________________
f8aae377 221AliTPCtrackerMI::AliTPCtrackerMI(const AliTPCParam *par):
1c53abe2 222AliTracker(), fkNIS(par->GetNInnerSector()/2), fkNOS(par->GetNOuterSector()/2)
223{
224 //---------------------------------------------------------------------
225 // The main TPC tracker constructor
226 //---------------------------------------------------------------------
227 fInnerSec=new AliTPCSector[fkNIS];
228 fOuterSec=new AliTPCSector[fkNOS];
91162307 229
1c53abe2 230 Int_t i;
231 for (i=0; i<fkNIS; i++) fInnerSec[i].Setup(par,0);
232 for (i=0; i<fkNOS; i++) fOuterSec[i].Setup(par,1);
233
234 fN=0; fSectors=0;
235
1c53abe2 236 fSeeds=0;
237 fNtracks = 0;
91162307 238 fParam = par;
239 Int_t nrowlow = par->GetNRowLow();
240 Int_t nrowup = par->GetNRowUp();
241
242
243 for (Int_t i=0;i<nrowlow;i++){
244 fXRow[i] = par->GetPadRowRadiiLow(i);
245 fPadLength[i]= par->GetPadPitchLength(0,i);
246 fYMax[i] = fXRow[i]*TMath::Tan(0.5*par->GetInnerAngle());
247 }
248
249
250 for (Int_t i=0;i<nrowup;i++){
251 fXRow[i+nrowlow] = par->GetPadRowRadiiUp(i);
252 fPadLength[i+nrowlow] = par->GetPadPitchLength(60,i);
253 fYMax[i+nrowlow] = fXRow[i+nrowlow]*TMath::Tan(0.5*par->GetOuterAngle());
254 }
255 fSeeds=0;
256 //
257 fInput = 0;
258 fOutput = 0;
259 fSeedTree = 0;
260 fTreeDebug =0;
261 fNewIO =0;
262 fDebug =0;
263 fEvent =0;
81e97e0d 264 fDebugStreamer = new TTreeSRedirector("TPCdebug.root");
1c53abe2 265}
2fc0c115 266//________________________________________________________________________
58251ea0 267AliTPCtrackerMI::AliTPCtrackerMI(const AliTPCtrackerMI &t):
268 AliTracker(t),
269 fkNIS(t.fkNIS),
270 fkNOS(t.fkNOS)
271{
2fc0c115 272 //------------------------------------
273 // dummy copy constructor
274 //------------------------------------------------------------------
275}
276AliTPCtrackerMI & AliTPCtrackerMI::operator=(const AliTPCtrackerMI& /*r*/){
277 //------------------------------
278 // dummy
279 //--------------------------------------------------------------
280 return *this;
281}
1c53abe2 282//_____________________________________________________________________________
283AliTPCtrackerMI::~AliTPCtrackerMI() {
284 //------------------------------------------------------------------
285 // TPC tracker destructor
286 //------------------------------------------------------------------
287 delete[] fInnerSec;
288 delete[] fOuterSec;
289 if (fSeeds) {
290 fSeeds->Delete();
291 delete fSeeds;
292 }
81e97e0d 293 if (fDebugStreamer) delete fDebugStreamer;
1c53abe2 294}
295
91162307 296void AliTPCtrackerMI::SetIO()
297{
1c53abe2 298 //
91162307 299 fNewIO = kTRUE;
e191bb57 300 fInput = AliRunLoader::GetTreeR("TPC", kFALSE,AliConfig::GetDefaultEventFolderName());
d26d9159 301
e191bb57 302 fOutput = AliRunLoader::GetTreeT("TPC", kTRUE,AliConfig::GetDefaultEventFolderName());
d26d9159 303 if (fOutput){
304 AliTPCtrack *iotrack= new AliTPCtrack;
305 fOutput->Branch("tracks","AliTPCtrack",&iotrack,32000,100);
306 delete iotrack;
307 }
91162307 308}
1c53abe2 309
d26d9159 310
91162307 311void AliTPCtrackerMI::SetIO(TTree * input, TTree * output, AliESD * event)
312{
1c53abe2 313
91162307 314 // set input
315 fNewIO = kFALSE;
316 fInput = 0;
317 fOutput = 0;
318 fSeedTree = 0;
319 fTreeDebug =0;
320 fInput = input;
321 if (input==0){
322 return;
323 }
324 //set output
325 fOutput = output;
326 if (output){
327 AliTPCtrack *iotrack= new AliTPCtrack;
328 // iotrack->fHelixIn = new TClonesArray("AliHelix");
329 //iotrack->fHelixOut = new TClonesArray("AliHelix");
330 fOutput->Branch("tracks","AliTPCtrack",&iotrack,32000,100);
331 delete iotrack;
332 }
333 if (output && (fDebug&2)){
334 //write the full seed information if specified in debug mode
335 //
336 fSeedTree = new TTree("Seeds","Seeds");
337 AliTPCseed * vseed = new AliTPCseed;
338 //
339 TClonesArray * arrtr = new TClonesArray("AliTPCTrackPoint",160);
340 arrtr->ExpandCreateFast(160);
341 TClonesArray * arre = new TClonesArray("AliTPCExactPoint",160);
342 //
343 vseed->fPoints = arrtr;
344 vseed->fEPoints = arre;
345 // vseed->fClusterPoints = arrcl;
346 fSeedTree->Branch("seeds","AliTPCseed",&vseed,32000,99);
347 delete arrtr;
348 delete arre;
349 fTreeDebug = new TTree("trackDebug","trackDebug");
350 TClonesArray * arrd = new TClonesArray("AliTPCTrackPoint2",0);
351 fTreeDebug->Branch("debug",&arrd,32000,99);
1c53abe2 352 }
1c53abe2 353
1c53abe2 354
91162307 355 //set ESD event
356 fEvent = event;
357}
1c53abe2 358
d26d9159 359void AliTPCtrackerMI::FillESD(TObjArray* arr)
91162307 360{
47966a6d 361 //
362 //
363 //fill esds using updated tracks
91162307 364 if (fEvent){
365 // write tracks to the event
366 // store index of the track
d26d9159 367 Int_t nseed=arr->GetEntriesFast();
51ad6848 368 //FindKinks(arr,fEvent);
91162307 369 for (Int_t i=0; i<nseed; i++) {
d26d9159 370 AliTPCseed *pt=(AliTPCseed*)arr->UncheckedAt(i);
91162307 371 if (!pt) continue;
51ad6848 372 pt->UpdatePoints();
eea478d3 373 // pt->PropagateTo(fParam->GetInnerRadiusLow());
374 if (pt->GetKinkIndex(0)<=0){ //don't propagate daughter tracks
375 pt->PropagateTo(fParam->GetInnerRadiusLow());
376 }
51ad6848 377
378 if (( pt->GetPoints()[2]- pt->GetPoints()[0])>5 && pt->GetPoints()[3]>0.8){
379 AliESDtrack iotrack;
380 iotrack.UpdateTrackParams(pt,AliESDtrack::kTPCin);
381 iotrack.SetTPCPoints(pt->GetPoints());
382 iotrack.SetKinkIndexes(pt->GetKinkIndexes());
81e97e0d 383 iotrack.SetV0Indexes(pt->GetV0Indexes());
384 // iotrack.SetTPCpid(pt->fTPCr);
51ad6848 385 //iotrack.SetTPCindex(i);
386 fEvent->AddTrack(&iotrack);
387 continue;
388 }
389
4d158c36 390 if ( (pt->GetNumberOfClusters()>70)&& (Float_t(pt->GetNumberOfClusters())/Float_t(pt->fNFoundable))>0.55) {
d26d9159 391 AliESDtrack iotrack;
51ad6848 392 iotrack.UpdateTrackParams(pt,AliESDtrack::kTPCin);
393 iotrack.SetTPCPoints(pt->GetPoints());
d26d9159 394 //iotrack.SetTPCindex(i);
51ad6848 395 iotrack.SetKinkIndexes(pt->GetKinkIndexes());
81e97e0d 396 iotrack.SetV0Indexes(pt->GetV0Indexes());
397 // iotrack.SetTPCpid(pt->fTPCr);
d26d9159 398 fEvent->AddTrack(&iotrack);
a42a6bae 399 continue;
400 }
51ad6848 401 //
402 // short tracks - maybe decays
403
a42a6bae 404 if ( (pt->GetNumberOfClusters()>30) && (Float_t(pt->GetNumberOfClusters())/Float_t(pt->fNFoundable))>0.70) {
405 Int_t found,foundable,shared;
406 pt->GetClusterStatistic(0,60,found, foundable,shared,kFALSE);
407 if ( (found>20) && (pt->fNShared/float(pt->GetNumberOfClusters())<0.2)){
408 AliESDtrack iotrack;
409 iotrack.UpdateTrackParams(pt,AliESDtrack::kTPCin);
410 //iotrack.SetTPCindex(i);
51ad6848 411 iotrack.SetTPCPoints(pt->GetPoints());
412 iotrack.SetKinkIndexes(pt->GetKinkIndexes());
81e97e0d 413 iotrack.SetV0Indexes(pt->GetV0Indexes());
414 //iotrack.SetTPCpid(pt->fTPCr);
a42a6bae 415 fEvent->AddTrack(&iotrack);
416 continue;
417 }
418 }
419
420 if ( (pt->GetNumberOfClusters()>20) && (Float_t(pt->GetNumberOfClusters())/Float_t(pt->fNFoundable))>0.8) {
421 Int_t found,foundable,shared;
422 pt->GetClusterStatistic(0,60,found, foundable,shared,kFALSE);
423 if (found<20) continue;
424 if (pt->fNShared/float(pt->GetNumberOfClusters())>0.2) continue;
425 //
426 AliESDtrack iotrack;
427 iotrack.UpdateTrackParams(pt,AliESDtrack::kTPCin);
51ad6848 428 iotrack.SetTPCPoints(pt->GetPoints());
429 iotrack.SetKinkIndexes(pt->GetKinkIndexes());
81e97e0d 430 iotrack.SetV0Indexes(pt->GetV0Indexes());
431 //iotrack.SetTPCpid(pt->fTPCr);
51ad6848 432 //iotrack.SetTPCindex(i);
433 fEvent->AddTrack(&iotrack);
434 continue;
435 }
436 // short tracks - secondaties
437 //
438 if ( (pt->GetNumberOfClusters()>30) ) {
439 Int_t found,foundable,shared;
440 pt->GetClusterStatistic(128,158,found, foundable,shared,kFALSE);
441 if ( (found>20) && (pt->fNShared/float(pt->GetNumberOfClusters())<0.2) &&float(found)/float(foundable)>0.8){
442 AliESDtrack iotrack;
443 iotrack.UpdateTrackParams(pt,AliESDtrack::kTPCin);
444 iotrack.SetTPCPoints(pt->GetPoints());
445 iotrack.SetKinkIndexes(pt->GetKinkIndexes());
81e97e0d 446 iotrack.SetV0Indexes(pt->GetV0Indexes());
447 //iotrack.SetTPCpid(pt->fTPCr);
51ad6848 448 //iotrack.SetTPCindex(i);
449 fEvent->AddTrack(&iotrack);
450 continue;
451 }
452 }
453
454 if ( (pt->GetNumberOfClusters()>15)) {
455 Int_t found,foundable,shared;
456 pt->GetClusterStatistic(138,158,found, foundable,shared,kFALSE);
457 if (found<15) continue;
458 if (pt->fNShared/float(pt->GetNumberOfClusters())>0.2) continue;
459 if (float(found)/float(foundable)<0.8) continue;
460 //
461 AliESDtrack iotrack;
462 iotrack.UpdateTrackParams(pt,AliESDtrack::kTPCin);
463 iotrack.SetTPCPoints(pt->GetPoints());
464 iotrack.SetKinkIndexes(pt->GetKinkIndexes());
81e97e0d 465 iotrack.SetV0Indexes(pt->GetV0Indexes());
466 // iotrack.SetTPCpid(pt->fTPCr);
a42a6bae 467 //iotrack.SetTPCindex(i);
468 fEvent->AddTrack(&iotrack);
469 continue;
470 }
91162307 471 }
1c53abe2 472 }
51ad6848 473 printf("Number of filled ESDs-\t%d\n",fEvent->GetNumberOfTracks());
d26d9159 474}
475
47966a6d 476void AliTPCtrackerMI::WriteTracks(TTree * tree)
477{
d26d9159 478 //
47966a6d 479 // write tracks from seed array to selected tree
d26d9159 480 //
481 fOutput = tree;
482 if (fOutput){
483 AliTPCtrack *iotrack= new AliTPCtrack;
484 fOutput->Branch("tracks","AliTPCtrack",&iotrack,32000,100);
485 }
486 WriteTracks();
487}
488
489void AliTPCtrackerMI::WriteTracks()
490{
491 //
492 // write tracks to the given output tree -
493 // output specified with SetIO routine
494 if (!fSeeds) return;
495 if (!fOutput){
496 SetIO();
497 }
1c53abe2 498
91162307 499 if (fOutput){
500 AliTPCtrack *iotrack= 0;
501 Int_t nseed=fSeeds->GetEntriesFast();
982aff31 502 //for (Int_t i=0; i<nseed; i++) {
503 // iotrack= (AliTPCtrack*)fSeeds->UncheckedAt(i);
504 // if (iotrack) break;
505 //}
91162307 506 //TBranch * br = fOutput->Branch("tracks","AliTPCtrack",&iotrack,32000,100);
507 TBranch * br = fOutput->GetBranch("tracks");
508 br->SetAddress(&iotrack);
509 //
510 for (Int_t i=0; i<nseed; i++) {
511 AliTPCseed *pt=(AliTPCseed*)fSeeds->UncheckedAt(i);
512 if (!pt) continue;
982aff31 513 AliTPCtrack * track = new AliTPCtrack(*pt);
514 iotrack = track;
91162307 515 pt->fLab2 =i;
516 // br->SetAddress(&iotrack);
517 fOutput->Fill();
982aff31 518 delete track;
91162307 519 iotrack =0;
520 }
982aff31 521 //fOutput->GetDirectory()->cd();
522 //fOutput->Write();
91162307 523 }
d26d9159 524 // delete iotrack;
525 //
91162307 526 if (fSeedTree){
527 //write the full seed information if specified in debug mode
528
529 AliTPCseed * vseed = new AliTPCseed;
530 //
531 TClonesArray * arrtr = new TClonesArray("AliTPCTrackPoint",160);
532 arrtr->ExpandCreateFast(160);
533 //TClonesArray * arrcl = new TClonesArray("AliTPCclusterMI",160);
534 //arrcl->ExpandCreateFast(160);
535 TClonesArray * arre = new TClonesArray("AliTPCExactPoint",160);
536 //
537 vseed->fPoints = arrtr;
538 vseed->fEPoints = arre;
539 // vseed->fClusterPoints = arrcl;
540 //TBranch * brseed = seedtree->Branch("seeds","AliTPCseed",&vseed,32000,99);
541 TBranch * brseed = fSeedTree->GetBranch("seeds");
542
543 Int_t nseed=fSeeds->GetEntriesFast();
544
545 for (Int_t i=0; i<nseed; i++) {
546 AliTPCseed *pt=(AliTPCseed*)fSeeds->UncheckedAt(i);
547 if (!pt) continue;
548 pt->fPoints = arrtr;
549 // pt->fClusterPoints = arrcl;
550 pt->fEPoints = arre;
551 pt->RebuildSeed();
552 vseed = pt;
553 brseed->SetAddress(&vseed);
554 fSeedTree->Fill();
555 pt->fPoints = 0;
556 pt->fEPoints = 0;
557 // pt->fClusterPoints = 0;
558 }
559 fSeedTree->Write();
560 if (fTreeDebug) fTreeDebug->Write();
561 }
1c53abe2 562
91162307 563}
1c53abe2 564
1c53abe2 565
1c53abe2 566
567
91162307 568Double_t AliTPCtrackerMI::ErrY2(AliTPCseed* seed, AliTPCclusterMI * cl){
569 //
570 //
571 //seed->SetErrorY2(0.1);
572 //return 0.1;
573 //calculate look-up table at the beginning
574 static Bool_t ginit = kFALSE;
575 static Float_t gnoise1,gnoise2,gnoise3;
576 static Float_t ggg1[10000];
577 static Float_t ggg2[10000];
578 static Float_t ggg3[10000];
579 static Float_t glandau1[10000];
580 static Float_t glandau2[10000];
581 static Float_t glandau3[10000];
582 //
583 static Float_t gcor01[500];
584 static Float_t gcor02[500];
585 static Float_t gcorp[500];
586 //
1c53abe2 587
91162307 588 //
589 if (ginit==kFALSE){
590 for (Int_t i=1;i<500;i++){
591 Float_t rsigma = float(i)/100.;
592 gcor02[i] = TMath::Max(0.78 +TMath::Exp(7.4*(rsigma-1.2)),0.6);
593 gcor01[i] = TMath::Max(0.72 +TMath::Exp(3.36*(rsigma-1.2)),0.6);
594 gcorp[i] = TMath::Max(TMath::Power((rsigma+0.5),1.5),1.2);
595 }
1c53abe2 596
91162307 597 //
598 for (Int_t i=3;i<10000;i++){
599 //
600 //
601 // inner sector
602 Float_t amp = float(i);
603 Float_t padlength =0.75;
604 gnoise1 = 0.0004/padlength;
605 Float_t nel = 0.268*amp;
606 Float_t nprim = 0.155*amp;
607 ggg1[i] = fParam->GetDiffT()*fParam->GetDiffT()*(2+0.001*nel/(padlength*padlength))/nel;
608 glandau1[i] = (2.+0.12*nprim)*0.5* (2.+nprim*nprim*0.001/(padlength*padlength))/nprim;
609 if (glandau1[i]>1) glandau1[i]=1;
610 glandau1[i]*=padlength*padlength/12.;
611 //
612 // outer short
613 padlength =1.;
614 gnoise2 = 0.0004/padlength;
615 nel = 0.3*amp;
616 nprim = 0.133*amp;
617 ggg2[i] = fParam->GetDiffT()*fParam->GetDiffT()*(2+0.0008*nel/(padlength*padlength))/nel;
618 glandau2[i] = (2.+0.12*nprim)*0.5*(2.+nprim*nprim*0.001/(padlength*padlength))/nprim;
619 if (glandau2[i]>1) glandau2[i]=1;
620 glandau2[i]*=padlength*padlength/12.;
621 //
622 //
623 // outer long
624 padlength =1.5;
625 gnoise3 = 0.0004/padlength;
626 nel = 0.3*amp;
627 nprim = 0.133*amp;
628 ggg3[i] = fParam->GetDiffT()*fParam->GetDiffT()*(2+0.0008*nel/(padlength*padlength))/nel;
629 glandau3[i] = (2.+0.12*nprim)*0.5*(2.+nprim*nprim*0.001/(padlength*padlength))/nprim;
630 if (glandau3[i]>1) glandau3[i]=1;
631 glandau3[i]*=padlength*padlength/12.;
632 //
633 }
634 ginit = kTRUE;
635 }
1c53abe2 636 //
637 //
91162307 638 //
639 Int_t amp = int(TMath::Abs(cl->GetQ()));
640 if (amp>9999) {
641 seed->SetErrorY2(1.);
642 return 1.;
643 }
1c53abe2 644 Float_t snoise2;
c9427e08 645 Float_t z = TMath::Abs(fParam->GetZLength()-TMath::Abs(seed->GetZ()));
91162307 646 Int_t ctype = cl->GetType();
647 Float_t padlength= GetPadPitchLength(seed->fRow);
648 Float_t angle2 = seed->GetSnp()*seed->GetSnp();
649 angle2 = angle2/(1-angle2);
650 //
651 //cluster "quality"
652 Int_t rsigmay = int(100.*cl->GetSigmaY2()/(seed->fCurrentSigmaY2));
653 Float_t res;
1c53abe2 654 //
1c53abe2 655 if (fSectors==fInnerSec){
91162307 656 snoise2 = gnoise1;
657 res = ggg1[amp]*z+glandau1[amp]*angle2;
658 if (ctype==0) res *= gcor01[rsigmay];
659 if ((ctype>0)){
660 res+=0.002;
661 res*= gcorp[rsigmay];
662 }
1c53abe2 663 }
664 else {
91162307 665 if (padlength<1.1){
666 snoise2 = gnoise2;
667 res = ggg2[amp]*z+glandau2[amp]*angle2;
668 if (ctype==0) res *= gcor02[rsigmay];
669 if ((ctype>0)){
670 res+=0.002;
671 res*= gcorp[rsigmay];
672 }
673 }
674 else{
675 snoise2 = gnoise3;
676 res = ggg3[amp]*z+glandau3[amp]*angle2;
677 if (ctype==0) res *= gcor02[rsigmay];
678 if ((ctype>0)){
679 res+=0.002;
680 res*= gcorp[rsigmay];
681 }
682 }
683 }
1c53abe2 684
91162307 685 if (ctype<0){
686 res+=0.005;
687 res*=2.4; // overestimate error 2 times
688 }
689 res+= snoise2;
690
1c53abe2 691 if (res<2*snoise2)
91162307 692 res = 2*snoise2;
693
694 seed->SetErrorY2(res);
1c53abe2 695 return res;
1c53abe2 696
697
91162307 698}
c9427e08 699
700
701
91162307 702Double_t AliTPCtrackerMI::ErrZ2(AliTPCseed* seed, AliTPCclusterMI * cl){
703 //
704 //
705 //seed->SetErrorY2(0.1);
706 //return 0.1;
707 //calculate look-up table at the beginning
708 static Bool_t ginit = kFALSE;
709 static Float_t gnoise1,gnoise2,gnoise3;
710 static Float_t ggg1[10000];
711 static Float_t ggg2[10000];
712 static Float_t ggg3[10000];
713 static Float_t glandau1[10000];
714 static Float_t glandau2[10000];
715 static Float_t glandau3[10000];
716 //
717 static Float_t gcor01[1000];
718 static Float_t gcor02[1000];
719 static Float_t gcorp[1000];
1627d1c4 720 //
1627d1c4 721
91162307 722 //
723 if (ginit==kFALSE){
724 for (Int_t i=1;i<1000;i++){
725 Float_t rsigma = float(i)/100.;
726 gcor02[i] = TMath::Max(0.81 +TMath::Exp(6.8*(rsigma-1.2)),0.6);
727 gcor01[i] = TMath::Max(0.72 +TMath::Exp(2.04*(rsigma-1.2)),0.6);
728 gcorp[i] = TMath::Max(TMath::Power((rsigma+0.5),1.5),1.2);
729 }
1c53abe2 730
91162307 731 //
732 for (Int_t i=3;i<10000;i++){
733 //
734 //
735 // inner sector
736 Float_t amp = float(i);
737 Float_t padlength =0.75;
738 gnoise1 = 0.0004/padlength;
739 Float_t nel = 0.268*amp;
740 Float_t nprim = 0.155*amp;
741 ggg1[i] = fParam->GetDiffT()*fParam->GetDiffT()*(2+0.001*nel/(padlength*padlength))/nel;
742 glandau1[i] = (2.+0.12*nprim)*0.5* (2.+nprim*nprim*0.001/(padlength*padlength))/nprim;
743 if (glandau1[i]>1) glandau1[i]=1;
744 glandau1[i]*=padlength*padlength/12.;
745 //
746 // outer short
747 padlength =1.;
748 gnoise2 = 0.0004/padlength;
749 nel = 0.3*amp;
750 nprim = 0.133*amp;
751 ggg2[i] = fParam->GetDiffT()*fParam->GetDiffT()*(2+0.0008*nel/(padlength*padlength))/nel;
752 glandau2[i] = (2.+0.12*nprim)*0.5*(2.+nprim*nprim*0.001/(padlength*padlength))/nprim;
753 if (glandau2[i]>1) glandau2[i]=1;
754 glandau2[i]*=padlength*padlength/12.;
755 //
756 //
757 // outer long
758 padlength =1.5;
759 gnoise3 = 0.0004/padlength;
760 nel = 0.3*amp;
761 nprim = 0.133*amp;
762 ggg3[i] = fParam->GetDiffT()*fParam->GetDiffT()*(2+0.0008*nel/(padlength*padlength))/nel;
763 glandau3[i] = (2.+0.12*nprim)*0.5*(2.+nprim*nprim*0.001/(padlength*padlength))/nprim;
764 if (glandau3[i]>1) glandau3[i]=1;
765 glandau3[i]*=padlength*padlength/12.;
766 //
767 }
768 ginit = kTRUE;
769 }
770 //
771 //
772 //
773 Int_t amp = int(TMath::Abs(cl->GetQ()));
774 if (amp>9999) {
775 seed->SetErrorY2(1.);
776 return 1.;
777 }
778 Float_t snoise2;
779 Float_t z = TMath::Abs(fParam->GetZLength()-TMath::Abs(seed->GetZ()));
780 Int_t ctype = cl->GetType();
781 Float_t padlength= GetPadPitchLength(seed->fRow);
782 //
783 Float_t angle2 = seed->GetSnp()*seed->GetSnp();
784 // if (angle2<0.6) angle2 = 0.6;
785 angle2 = seed->GetTgl()*seed->GetTgl()*(1+angle2/(1-angle2));
786 //
787 //cluster "quality"
788 Int_t rsigmaz = int(100.*cl->GetSigmaZ2()/(seed->fCurrentSigmaZ2));
789 Float_t res;
790 //
791 if (fSectors==fInnerSec){
792 snoise2 = gnoise1;
793 res = ggg1[amp]*z+glandau1[amp]*angle2;
794 if (ctype==0) res *= gcor01[rsigmaz];
795 if ((ctype>0)){
796 res+=0.002;
797 res*= gcorp[rsigmaz];
798 }
799 }
800 else {
801 if (padlength<1.1){
802 snoise2 = gnoise2;
803 res = ggg2[amp]*z+glandau2[amp]*angle2;
804 if (ctype==0) res *= gcor02[rsigmaz];
805 if ((ctype>0)){
806 res+=0.002;
807 res*= gcorp[rsigmaz];
808 }
809 }
810 else{
811 snoise2 = gnoise3;
812 res = ggg3[amp]*z+glandau3[amp]*angle2;
813 if (ctype==0) res *= gcor02[rsigmaz];
814 if ((ctype>0)){
815 res+=0.002;
816 res*= gcorp[rsigmaz];
817 }
818 }
819 }
820
821 if (ctype<0){
822 res+=0.002;
823 res*=1.3;
824 }
825 if ((ctype<0) &&amp<70){
826 res+=0.002;
827 res*=1.3;
828 }
829 res += snoise2;
830 if (res<2*snoise2)
831 res = 2*snoise2;
832 if (res>3) res =3;
833 seed->SetErrorZ2(res);
834 return res;
835}
836
837
838
839/*
840Double_t AliTPCtrackerMI::ErrZ2(AliTPCseed* seed, AliTPCclusterMI * cl){
841 //
842 //
843 //seed->SetErrorZ2(0.1);
844 //return 0.1;
845
846 Float_t snoise2;
847 Float_t z = TMath::Abs(fParam->GetZLength()-TMath::Abs(seed->GetZ()));
848 //
849 Float_t rsigmaz = cl->GetSigmaZ2()/(seed->fCurrentSigmaZ2);
850 Int_t ctype = cl->GetType();
851 Float_t amp = TMath::Abs(cl->GetQ());
852
853 Float_t nel;
854 Float_t nprim;
855 //
856 Float_t landau=2 ; //landau fluctuation part
857 Float_t gg=2; // gg fluctuation part
858 Float_t padlength= GetPadPitchLength(seed->GetX());
859
860 if (fSectors==fInnerSec){
861 snoise2 = 0.0004/padlength;
862 nel = 0.268*amp;
863 nprim = 0.155*amp;
864 gg = (2+0.001*nel/(padlength*padlength))/nel;
865 landau = (2.+0.12*nprim)*0.5*(2.+nprim*nprim*0.001/(padlength*padlength))/nprim;
866 if (landau>1) landau=1;
867 }
868 else {
869 snoise2 = 0.0004/padlength;
870 nel = 0.3*amp;
871 nprim = 0.133*amp;
872 gg = (2+0.0008*nel/(padlength*padlength))/nel;
873 landau = (2.+0.12*nprim)*0.5*(2.+nprim*nprim*0.001/(padlength*padlength))/nprim;
874 if (landau>1) landau=1;
875 }
876 Float_t sdiff = gg*fParam->GetDiffT()*fParam->GetDiffT()*z;
877
878 //
879 Float_t angle2 = seed->GetSnp()*seed->GetSnp();
880 angle2 = TMath::Sqrt((1-angle2));
881 if (angle2<0.6) angle2 = 0.6;
882 //angle2 = 1;
883
884 Float_t angle = seed->GetTgl()/angle2;
885 Float_t angular = landau*angle*angle*padlength*padlength/12.;
886 Float_t res = sdiff + angular;
887
888
889 if ((ctype==0) && (fSectors ==fOuterSec))
890 res *= 0.81 +TMath::Exp(6.8*(rsigmaz-1.2));
891
892 if ((ctype==0) && (fSectors ==fInnerSec))
893 res *= 0.72 +TMath::Exp(2.04*(rsigmaz-1.2));
894
895 if ((ctype>0)){
896 res+=0.005;
897 res*= TMath::Power(rsigmaz+0.5,1.5); //0.31+0.147*ctype;
898 }
899 if (ctype<0){
900 res+=0.002;
901 res*=1.3;
902 }
903 if ((ctype<0) &&amp<70){
904 res+=0.002;
905 res*=1.3;
906 }
907 res += snoise2;
908 if (res<2*snoise2)
909 res = 2*snoise2;
910
911 seed->SetErrorZ2(res);
912 return res;
913}
914*/
915
916
917
1c53abe2 918
c9427e08 919void AliTPCtrackerMI::RotateToLocal(AliTPCseed *seed)
920{
921 //rotate to track "local coordinata
922 Float_t x = seed->GetX();
923 Float_t y = seed->GetY();
924 Float_t ymax = x*TMath::Tan(0.5*fSectors->GetAlpha());
91162307 925
c9427e08 926 if (y > ymax) {
927 seed->fRelativeSector= (seed->fRelativeSector+1) % fN;
928 if (!seed->Rotate(fSectors->GetAlpha()))
929 return;
930 } else if (y <-ymax) {
931 seed->fRelativeSector= (seed->fRelativeSector-1+fN) % fN;
932 if (!seed->Rotate(-fSectors->GetAlpha()))
933 return;
934 }
1c53abe2 935
c9427e08 936}
1c53abe2 937
938
939
1c53abe2 940//_____________________________________________________________________________
b67e07dc 941Double_t AliTPCtrackerMI::F1old(Double_t x1,Double_t y1,
1c53abe2 942 Double_t x2,Double_t y2,
943 Double_t x3,Double_t y3)
944{
945 //-----------------------------------------------------------------
946 // Initial approximation of the track curvature
947 //-----------------------------------------------------------------
948 Double_t d=(x2-x1)*(y3-y2)-(x3-x2)*(y2-y1);
949 Double_t a=0.5*((y3-y2)*(y2*y2-y1*y1+x2*x2-x1*x1)-
950 (y2-y1)*(y3*y3-y2*y2+x3*x3-x2*x2));
951 Double_t b=0.5*((x2-x1)*(y3*y3-y2*y2+x3*x3-x2*x2)-
952 (x3-x2)*(y2*y2-y1*y1+x2*x2-x1*x1));
953
954 Double_t xr=TMath::Abs(d/(d*x1-a)), yr=d/(d*y1-b);
91162307 955 if ( xr*xr+yr*yr<=0.00000000000001) return 100;
1c53abe2 956 return -xr*yr/sqrt(xr*xr+yr*yr);
957}
958
959
91162307 960
1c53abe2 961//_____________________________________________________________________________
b67e07dc 962Double_t AliTPCtrackerMI::F1(Double_t x1,Double_t y1,
91162307 963 Double_t x2,Double_t y2,
964 Double_t x3,Double_t y3)
965{
966 //-----------------------------------------------------------------
967 // Initial approximation of the track curvature
968 //-----------------------------------------------------------------
969 x3 -=x1;
970 x2 -=x1;
971 y3 -=y1;
972 y2 -=y1;
973 //
974 Double_t det = x3*y2-x2*y3;
975 if (det==0) {
976 return 100;
977 }
978 //
979 Double_t u = 0.5* (x2*(x2-x3)+y2*(y2-y3))/det;
980 Double_t x0 = x3*0.5-y3*u;
981 Double_t y0 = y3*0.5+x3*u;
982 Double_t c2 = 1/TMath::Sqrt(x0*x0+y0*y0);
983 if (det<0) c2*=-1;
984 return c2;
985}
986
987
b67e07dc 988Double_t AliTPCtrackerMI::F2(Double_t x1,Double_t y1,
1c53abe2 989 Double_t x2,Double_t y2,
990 Double_t x3,Double_t y3)
91162307 991{
992 //-----------------------------------------------------------------
993 // Initial approximation of the track curvature
994 //-----------------------------------------------------------------
995 x3 -=x1;
996 x2 -=x1;
997 y3 -=y1;
998 y2 -=y1;
999 //
1000 Double_t det = x3*y2-x2*y3;
1001 if (det==0) {
1002 return 100;
1003 }
1004 //
1005 Double_t u = 0.5* (x2*(x2-x3)+y2*(y2-y3))/det;
1006 Double_t x0 = x3*0.5-y3*u;
1007 Double_t y0 = y3*0.5+x3*u;
1008 Double_t c2 = 1/TMath::Sqrt(x0*x0+y0*y0);
1009 if (det<0) c2*=-1;
1010 x0+=x1;
1011 x0*=c2;
1012 return x0;
1013}
1014
1015
1016
1017//_____________________________________________________________________________
b67e07dc 1018Double_t AliTPCtrackerMI::F2old(Double_t x1,Double_t y1,
91162307 1019 Double_t x2,Double_t y2,
1020 Double_t x3,Double_t y3)
1c53abe2 1021{
1022 //-----------------------------------------------------------------
1023 // Initial approximation of the track curvature times center of curvature
1024 //-----------------------------------------------------------------
1025 Double_t d=(x2-x1)*(y3-y2)-(x3-x2)*(y2-y1);
1026 Double_t a=0.5*((y3-y2)*(y2*y2-y1*y1+x2*x2-x1*x1)-
1027 (y2-y1)*(y3*y3-y2*y2+x3*x3-x2*x2));
1028 Double_t b=0.5*((x2-x1)*(y3*y3-y2*y2+x3*x3-x2*x2)-
1029 (x3-x2)*(y2*y2-y1*y1+x2*x2-x1*x1));
1030
1031 Double_t xr=TMath::Abs(d/(d*x1-a)), yr=d/(d*y1-b);
1032
1033 return -a/(d*y1-b)*xr/sqrt(xr*xr+yr*yr);
1034}
1035
1036//_____________________________________________________________________________
b67e07dc 1037Double_t AliTPCtrackerMI::F3(Double_t x1,Double_t y1,
1c53abe2 1038 Double_t x2,Double_t y2,
1039 Double_t z1,Double_t z2)
1040{
1041 //-----------------------------------------------------------------
1042 // Initial approximation of the tangent of the track dip angle
1043 //-----------------------------------------------------------------
1044 return (z1 - z2)/sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));
1045}
1046
1047
b67e07dc 1048Double_t AliTPCtrackerMI::F3n(Double_t x1,Double_t y1,
91162307 1049 Double_t x2,Double_t y2,
1050 Double_t z1,Double_t z2, Double_t c)
1c53abe2 1051{
91162307 1052 //-----------------------------------------------------------------
1053 // Initial approximation of the tangent of the track dip angle
1054 //-----------------------------------------------------------------
1055
1056 // Double_t angle1;
1057
1058 //angle1 = (z1-z2)*c/(TMath::ASin(c*x1-ni)-TMath::ASin(c*x2-ni));
1c53abe2 1059 //
91162307 1060 Double_t d = TMath::Sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));
1061 if (TMath::Abs(d*c*0.5)>1) return 0;
1062 // Double_t angle2 = TMath::ASin(d*c*0.5);
b67e07dc 1063 // Double_t angle2 = AliTPCFastMath::FastAsin(d*c*0.5);
1064 Double_t angle2 = (d*c*0.5>0.1)? TMath::ASin(d*c*0.5): AliTPCFastMath::FastAsin(d*c*0.5);
91162307 1065
1066 angle2 = (z1-z2)*c/(angle2*2.);
1067 return angle2;
1068}
1069
1070Bool_t AliTPCtrackerMI::GetProlongation(Double_t x1, Double_t x2, Double_t x[5], Double_t &y, Double_t &z)
1071{//-----------------------------------------------------------------
1072 // This function find proloncation of a track to a reference plane x=x2.
1073 //-----------------------------------------------------------------
1074
1075 Double_t dx=x2-x1;
1076
1077 if (TMath::Abs(x[4]*x1 - x[2]) >= 0.999) {
1078 return kFALSE;
1c53abe2 1079 }
f8aae377 1080
91162307 1081 Double_t c1=x[4]*x1 - x[2], r1=sqrt(1.- c1*c1);
1082 Double_t c2=x[4]*x2 - x[2], r2=sqrt(1.- c2*c2);
1083 y = x[0];
1084 z = x[1];
1085
1086 Double_t dy = dx*(c1+c2)/(r1+r2);
1087 Double_t dz = 0;
1088 //
1089 Double_t delta = x[4]*dx*(c1+c2)/(c1*r2 + c2*r1);
1090
1091 if (TMath::Abs(delta)>0.01){
1092 dz = x[3]*TMath::ASin(delta)/x[4];
1093 }else{
b67e07dc 1094 dz = x[3]*AliTPCFastMath::FastAsin(delta)/x[4];
91162307 1095 }
1096
b67e07dc 1097 //dz = x[3]*AliTPCFastMath::FastAsin(delta)/x[4];
f8aae377 1098
91162307 1099 y+=dy;
1100 z+=dz;
1101
1102 return kTRUE;
1c53abe2 1103}
1104
d26d9159 1105Int_t AliTPCtrackerMI::LoadClusters (TTree *tree)
1106{
1107 //
1108 //
1109 fInput = tree;
1110 return LoadClusters();
1111}
91162307 1112
1113Int_t AliTPCtrackerMI::LoadClusters()
1c53abe2 1114{
1115 //
1116 // load clusters to the memory
91162307 1117 AliTPCClustersRow *clrow= new AliTPCClustersRow;
1118 clrow->SetClass("AliTPCclusterMI");
1119 clrow->SetArray(0);
1120 clrow->GetArray()->ExpandCreateFast(10000);
1121 //
1122 // TTree * tree = fClustersArray.GetTree();
1123
1124 TTree * tree = fInput;
1125 TBranch * br = tree->GetBranch("Segment");
1126 br->SetAddress(&clrow);
1127 //
1128 Int_t j=Int_t(tree->GetEntries());
1c53abe2 1129 for (Int_t i=0; i<j; i++) {
91162307 1130 br->GetEntry(i);
1131 //
1132 Int_t sec,row;
1133 fParam->AdjustSectorRow(clrow->GetID(),sec,row);
1134 //
1135 AliTPCRow * tpcrow=0;
1136 Int_t left=0;
1137 if (sec<fkNIS*2){
1138 tpcrow = &(fInnerSec[sec%fkNIS][row]);
1139 left = sec/fkNIS;
1140 }
1141 else{
1142 tpcrow = &(fOuterSec[(sec-fkNIS*2)%fkNOS][row]);
1143 left = (sec-fkNIS*2)/fkNOS;
1144 }
1145 if (left ==0){
1146 tpcrow->fN1 = clrow->GetArray()->GetEntriesFast();
1147 tpcrow->fClusters1 = new AliTPCclusterMI[tpcrow->fN1];
1148 for (Int_t i=0;i<tpcrow->fN1;i++)
1149 tpcrow->fClusters1[i] = *(AliTPCclusterMI*)(clrow->GetArray()->At(i));
1150 }
1151 if (left ==1){
1152 tpcrow->fN2 = clrow->GetArray()->GetEntriesFast();
1153 tpcrow->fClusters2 = new AliTPCclusterMI[tpcrow->fN2];
1154 for (Int_t i=0;i<tpcrow->fN2;i++)
1155 tpcrow->fClusters2[i] = *(AliTPCclusterMI*)(clrow->GetArray()->At(i));
1156 }
1c53abe2 1157 }
91162307 1158 //
1159 delete clrow;
1160 LoadOuterSectors();
1161 LoadInnerSectors();
1162 return 0;
1c53abe2 1163}
1164
1165
91162307 1166void AliTPCtrackerMI::UnloadClusters()
1167{
1168 //
1169 // unload clusters from the memory
1170 //
1171 Int_t nrows = fOuterSec->GetNRows();
1172 for (Int_t sec = 0;sec<fkNOS;sec++)
1173 for (Int_t row = 0;row<nrows;row++){
1174 AliTPCRow* tpcrow = &(fOuterSec[sec%fkNOS][row]);
982aff31 1175 // if (tpcrow){
1176 // if (tpcrow->fClusters1) delete []tpcrow->fClusters1;
1177 // if (tpcrow->fClusters2) delete []tpcrow->fClusters2;
1178 //}
1179 tpcrow->ResetClusters();
1c53abe2 1180 }
91162307 1181 //
1182 nrows = fInnerSec->GetNRows();
1183 for (Int_t sec = 0;sec<fkNIS;sec++)
1184 for (Int_t row = 0;row<nrows;row++){
1185 AliTPCRow* tpcrow = &(fInnerSec[sec%fkNIS][row]);
982aff31 1186 //if (tpcrow){
1187 // if (tpcrow->fClusters1) delete []tpcrow->fClusters1;
1188 //if (tpcrow->fClusters2) delete []tpcrow->fClusters2;
1189 //}
1190 tpcrow->ResetClusters();
91162307 1191 }
1192
1193 return ;
1c53abe2 1194}
1195
1196
1197//_____________________________________________________________________________
91162307 1198Int_t AliTPCtrackerMI::LoadOuterSectors() {
1c53abe2 1199 //-----------------------------------------------------------------
91162307 1200 // This function fills outer TPC sectors with clusters.
1c53abe2 1201 //-----------------------------------------------------------------
91162307 1202 Int_t nrows = fOuterSec->GetNRows();
1203 UInt_t index=0;
1204 for (Int_t sec = 0;sec<fkNOS;sec++)
1205 for (Int_t row = 0;row<nrows;row++){
1206 AliTPCRow* tpcrow = &(fOuterSec[sec%fkNOS][row]);
1207 Int_t sec2 = sec+2*fkNIS;
1208 //left
1209 Int_t ncl = tpcrow->fN1;
1210 while (ncl--) {
1211 AliTPCclusterMI *c= &(tpcrow->fClusters1[ncl]);
1212 index=(((sec2<<8)+row)<<16)+ncl;
1213 tpcrow->InsertCluster(c,index);
1214 }
1215 //right
1216 ncl = tpcrow->fN2;
1217 while (ncl--) {
1218 AliTPCclusterMI *c= &(tpcrow->fClusters2[ncl]);
1219 index=((((sec2+fkNOS)<<8)+row)<<16)+ncl;
1220 tpcrow->InsertCluster(c,index);
1221 }
1222 //
1223 // write indexes for fast acces
1224 //
1225 for (Int_t i=0;i<510;i++)
1226 tpcrow->fFastCluster[i]=-1;
1227 for (Int_t i=0;i<tpcrow->GetN();i++){
1228 Int_t zi = Int_t((*tpcrow)[i]->GetZ()+255.);
1229 tpcrow->fFastCluster[zi]=i; // write index
1230 }
1231 Int_t last = 0;
1232 for (Int_t i=0;i<510;i++){
1233 if (tpcrow->fFastCluster[i]<0)
1234 tpcrow->fFastCluster[i] = last;
1235 else
1236 last = tpcrow->fFastCluster[i];
1237 }
1238 }
1239 fN=fkNOS;
1240 fSectors=fOuterSec;
1241 return 0;
1242}
1243
1244
1245//_____________________________________________________________________________
1246Int_t AliTPCtrackerMI::LoadInnerSectors() {
1247 //-----------------------------------------------------------------
1248 // This function fills inner TPC sectors with clusters.
1249 //-----------------------------------------------------------------
1250 Int_t nrows = fInnerSec->GetNRows();
1251 UInt_t index=0;
1252 for (Int_t sec = 0;sec<fkNIS;sec++)
1253 for (Int_t row = 0;row<nrows;row++){
1254 AliTPCRow* tpcrow = &(fInnerSec[sec%fkNIS][row]);
1255 //
1256 //left
1257 Int_t ncl = tpcrow->fN1;
1258 while (ncl--) {
1259 AliTPCclusterMI *c= &(tpcrow->fClusters1[ncl]);
1260 index=(((sec<<8)+row)<<16)+ncl;
1261 tpcrow->InsertCluster(c,index);
1262 }
1263 //right
1264 ncl = tpcrow->fN2;
1265 while (ncl--) {
1266 AliTPCclusterMI *c= &(tpcrow->fClusters2[ncl]);
1267 index=((((sec+fkNIS)<<8)+row)<<16)+ncl;
1268 tpcrow->InsertCluster(c,index);
1269 }
1270 //
1271 // write indexes for fast acces
1272 //
1273 for (Int_t i=0;i<510;i++)
1274 tpcrow->fFastCluster[i]=-1;
1275 for (Int_t i=0;i<tpcrow->GetN();i++){
1276 Int_t zi = Int_t((*tpcrow)[i]->GetZ()+255.);
1277 tpcrow->fFastCluster[zi]=i; // write index
1278 }
1279 Int_t last = 0;
1280 for (Int_t i=0;i<510;i++){
1281 if (tpcrow->fFastCluster[i]<0)
1282 tpcrow->fFastCluster[i] = last;
1283 else
1284 last = tpcrow->fFastCluster[i];
1285 }
1c53abe2 1286
91162307 1287 }
1288
1c53abe2 1289 fN=fkNIS;
1290 fSectors=fInnerSec;
91162307 1291 return 0;
1292}
1293
1294
1295
1296//_________________________________________________________________________
1297AliTPCclusterMI *AliTPCtrackerMI::GetClusterMI(Int_t index) const {
1298 //--------------------------------------------------------------------
1299 // Return pointer to a given cluster
1300 //--------------------------------------------------------------------
1301 Int_t sec=(index&0xff000000)>>24;
1302 Int_t row=(index&0x00ff0000)>>16;
d26d9159 1303 Int_t ncl=(index&0x00007fff)>>00;
91162307 1304
1305 const AliTPCRow * tpcrow=0;
1306 AliTPCclusterMI * clrow =0;
3da363a1 1307
91162307 1308 if (sec<fkNIS*2){
1309 tpcrow = &(fInnerSec[sec%fkNIS][row]);
3da363a1 1310 if (tpcrow==0) return 0;
1311
1312 if (sec<fkNIS) {
1313 if (tpcrow->fN1<=ncl) return 0;
91162307 1314 clrow = tpcrow->fClusters1;
3da363a1 1315 }
1316 else {
1317 if (tpcrow->fN2<=ncl) return 0;
91162307 1318 clrow = tpcrow->fClusters2;
3da363a1 1319 }
91162307 1320 }
3da363a1 1321 else {
91162307 1322 tpcrow = &(fOuterSec[(sec-fkNIS*2)%fkNOS][row]);
3da363a1 1323 if (tpcrow==0) return 0;
1324
1325 if (sec-2*fkNIS<fkNOS) {
1326 if (tpcrow->fN1<=ncl) return 0;
91162307 1327 clrow = tpcrow->fClusters1;
3da363a1 1328 }
1329 else {
1330 if (tpcrow->fN2<=ncl) return 0;
91162307 1331 clrow = tpcrow->fClusters2;
3da363a1 1332 }
91162307 1333 }
3da363a1 1334
91162307 1335 return &(clrow[ncl]);
1336
1c53abe2 1337}
1338
91162307 1339
1340
1c53abe2 1341Int_t AliTPCtrackerMI::FollowToNext(AliTPCseed& t, Int_t nr) {
1342 //-----------------------------------------------------------------
1343 // This function tries to find a track prolongation to next pad row
1344 //-----------------------------------------------------------------
1c53abe2 1345 //
91162307 1346 Double_t x= GetXrow(nr), ymax=GetMaxY(nr);
4d158c36 1347 AliTPCclusterMI *cl=0;
1348 Int_t tpcindex= t.GetClusterIndex2(nr);
1349 //
1350 // update current shape info every 5 pad-row
1351 // if ( (nr%5==0) || t.GetNumberOfClusters()<2 || (t.fCurrentSigmaY2<0.0001) ){
1352 GetShape(&t,nr);
1353 //}
1354 //
1355 if (fIteration>0 && tpcindex>=-1){ //if we have already clusters
1356 //
1357 if (tpcindex==-1) return 0; //track in dead zone
1358 if (tpcindex>0){ //
1359 cl = t.fClusterPointer[nr];
e0656451 1360 if ( (cl==0) ) cl = GetClusterMI(tpcindex);
4d158c36 1361 t.fCurrentClusterIndex1 = tpcindex;
1362 }
1363 if (cl){
1364 Int_t relativesector = ((tpcindex&0xff000000)>>24)%18; // if previously accepted cluster in different sector
1365 Float_t angle = relativesector*fSectors->GetAlpha()+fSectors->GetAlphaShift();
1366 //
1367 if (angle<-TMath::Pi()) angle += 2*TMath::Pi();
1368 if (angle>=TMath::Pi()) angle -= 2*TMath::Pi();
1369
1370 if (TMath::Abs(angle-t.GetAlpha())>0.001){
1371 Double_t rotation = angle-t.GetAlpha();
1372 t.fRelativeSector= relativesector;
1373 t.Rotate(rotation);
1374 }
1375 t.PropagateTo(x);
1376 //
1377 t.fCurrentCluster = cl;
1378 t.fRow = nr;
1379 Int_t accept = AcceptCluster(&t,t.fCurrentCluster,1.);
1380 if ((tpcindex&0x8000)==0) accept =0;
1381 if (accept<3) {
1382 //if founded cluster is acceptible
1383 if (cl->IsUsed(11)) { // id cluster is shared inrease uncertainty
1384 t.fErrorY2 += 0.03;
1385 t.fErrorZ2 += 0.03;
1386 t.fErrorY2 *= 3;
1387 t.fErrorZ2 *= 3;
1388 }
1389 t.fNFoundable++;
1390 UpdateTrack(&t,accept);
1391 return 1;
1392 }
1393 }
1627d1c4 1394 }
b406fdb0 1395 if (fIteration>1) {t.fNFoundable++; return 0;} // not look for new cluster during refitting
91162307 1396 //
4d158c36 1397 UInt_t index=0;
1398 if (TMath::Abs(t.GetSnp())>0.95 || TMath::Abs(x*t.GetC()-t.GetEta())>0.95) return 0;
1399 Double_t y=t.GetYat(x);
91162307 1400 if (TMath::Abs(y)>ymax){
1401 if (y > ymax) {
1402 t.fRelativeSector= (t.fRelativeSector+1) % fN;
1403 if (!t.Rotate(fSectors->GetAlpha()))
1404 return 0;
1405 } else if (y <-ymax) {
1406 t.fRelativeSector= (t.fRelativeSector-1+fN) % fN;
1407 if (!t.Rotate(-fSectors->GetAlpha()))
1408 return 0;
1409 }
4d158c36 1410 //return 1;
91162307 1411 }
1412 //
4d158c36 1413 if (!t.PropagateTo(x)) {
1414 if (fIteration==0) t.fRemoval = 10;
1415 return 0;
91162307 1416 }
4d158c36 1417 y=t.GetY();
1418 Double_t z=t.GetZ();
1419 //
91162307 1420 const AliTPCRow &krow=GetRow(t.fRelativeSector,nr);
1421 if ( (t.GetSigmaY2()<0) || t.GetSigmaZ2()<0) return 0;
1422 Double_t roady =1.;
1423 Double_t roadz = 1.;
1424 //
1c53abe2 1425 if (TMath::Abs(TMath::Abs(y)-ymax)<krow.fDeadZone){
1426 t.fInDead = kTRUE;
91162307 1427 t.SetClusterIndex2(nr,-1);
1c53abe2 1428 return 0;
1429 }
1430 else
1431 {
ab4179bf 1432 if (TMath::Abs(z)<(AliTPCReconstructor::GetCtgRange()*x+10) && TMath::Abs(z)<fParam->GetZLength() ) t.fNFoundable++;
1627d1c4 1433 else
1434 return 0;
1c53abe2 1435 }
1436 //calculate
91162307 1437 if (krow) {
1438 // cl = krow.FindNearest2(y+10.,z,roady,roadz,index);
1439 cl = krow.FindNearest2(y,z,roady,roadz,index);
1440 if (cl) t.fCurrentClusterIndex1 = krow.GetIndex(index);
1441 }
91162307 1442 if (cl) {
1443 t.fCurrentCluster = cl;
1444 t.fRow = nr;
4d158c36 1445 if (fIteration==2&&cl->IsUsed(10)) return 0;
91162307 1446 Int_t accept = AcceptCluster(&t,t.fCurrentCluster,1.);
4d158c36 1447 if (fIteration==2&&cl->IsUsed(11)) {
1448 t.fErrorY2 += 0.03;
1449 t.fErrorZ2 += 0.03;
1450 t.fErrorY2 *= 3;
1451 t.fErrorZ2 *= 3;
1452 }
d26d9159 1453 /*
91162307 1454 if (t.fCurrentCluster->IsUsed(10)){
1455 //
1456 //
c9427e08 1457
91162307 1458 t.fNShared++;
1459 if (t.fNShared>0.7*t.GetNumberOfClusters()) {
1460 t.fRemoval =10;
1461 return 0;
1462 }
1463 }
d26d9159 1464 */
91162307 1465 if (accept<3) UpdateTrack(&t,accept);
c9427e08 1466
91162307 1467 } else {
982aff31 1468 if ( fIteration==0 && t.fNFoundable*0.5 > t.GetNumberOfClusters()) t.fRemoval=10;
91162307 1469
1470 }
1471 return 1;
1472}
c9427e08 1473
91162307 1474Int_t AliTPCtrackerMI::FollowToNextFast(AliTPCseed& t, Int_t nr) {
1475 //-----------------------------------------------------------------
1476 // This function tries to find a track prolongation to next pad row
1477 //-----------------------------------------------------------------
1478 //
1479 Double_t x= GetXrow(nr), ymax=GetMaxY(nr);
1480 Double_t y,z;
1481 if (!t.GetProlongation(x,y,z)) {
1482 t.fRemoval = 10;
1483 return 0;
1484 }
1485 //
1486 //
1487 if (TMath::Abs(y)>ymax){
91162307 1488
1c53abe2 1489 if (y > ymax) {
1490 t.fRelativeSector= (t.fRelativeSector+1) % fN;
1491 if (!t.Rotate(fSectors->GetAlpha()))
1492 return 0;
1493 } else if (y <-ymax) {
1494 t.fRelativeSector= (t.fRelativeSector-1+fN) % fN;
1495 if (!t.Rotate(-fSectors->GetAlpha()))
1496 return 0;
91162307 1497 }
1498 if (!t.PropagateTo(x)) {
1499 return 0;
1500 }
1501 t.GetProlongation(x,y,z);
1502 }
1503 //
1504 // update current shape info every 3 pad-row
1505 if ( (nr%6==0) || t.GetNumberOfClusters()<2 || (t.fCurrentSigmaY2<0.0001) ){
1506 // t.fCurrentSigmaY = GetSigmaY(&t);
1507 //t.fCurrentSigmaZ = GetSigmaZ(&t);
1508 GetShape(&t,nr);
1509 }
1510 //
1511 AliTPCclusterMI *cl=0;
1512 UInt_t index=0;
1513
1514
1515 //Int_t nr2 = nr;
1516 const AliTPCRow &krow=GetRow(t.fRelativeSector,nr);
1517 if ( (t.GetSigmaY2()<0) || t.GetSigmaZ2()<0) return 0;
1518 Double_t roady =1.;
1519 Double_t roadz = 1.;
1520 //
1521 Int_t row = nr;
1522 if (TMath::Abs(TMath::Abs(y)-ymax)<krow.fDeadZone){
1523 t.fInDead = kTRUE;
1524 t.SetClusterIndex2(row,-1);
1525 return 0;
1526 }
1527 else
1528 {
d7a11555 1529 if (TMath::Abs(z)>(AliTPCReconstructor::GetCtgRange()*x+10)) t.SetClusterIndex2(row,-1);
1c53abe2 1530 }
91162307 1531 //calculate
1532
1533 if ((cl==0)&&(krow)) {
1534 // cl = krow.FindNearest2(y+10,z,roady,roadz,index);
1535 cl = krow.FindNearest2(y,z,roady,roadz,index);
1536
1537 if (cl) t.fCurrentClusterIndex1 = krow.GetIndex(index);
1538 }
1539
1540 if (cl) {
1541 t.fCurrentCluster = cl;
1542 // Int_t accept = AcceptCluster(&t,t.fCurrentCluster,1.);
1543 //if (accept<3){
1544 t.SetClusterIndex2(row,index);
1545 t.fClusterPointer[row] = cl;
1546 //}
1c53abe2 1547 }
1548 return 1;
1549}
1550
1551
91162307 1552
5d837844 1553//_________________________________________________________________________
1554Bool_t AliTPCtrackerMI::GetTrackPoint(Int_t index, AliTrackPoint &p ) const
1555{
1556 // Get track space point by index
1557 // return false in case the cluster doesn't exist
1558 AliTPCclusterMI *cl = GetClusterMI(index);
1559 if (!cl) return kFALSE;
1560 Int_t sector = (index&0xff000000)>>24;
1561 Int_t row = (index&0x00ff0000)>>16;
1562 Float_t xyz[3];
1563 xyz[0] = fParam->GetPadRowRadii(sector,row);
1564 xyz[1] = cl->GetY();
1565 xyz[2] = cl->GetZ();
1566 Float_t sin,cos;
1567 fParam->AdjustCosSin(sector,cos,sin);
1568 Float_t x = cos*xyz[0]-sin*xyz[1];
1569 Float_t y = cos*xyz[1]+sin*xyz[0];
1570 Float_t cov[6];
1571 Float_t sigmaY2 = 0.027*cl->GetSigmaY2();
1572 if (sector < fParam->GetNInnerSector()) sigmaY2 *= 2.07;
1573 Float_t sigmaZ2 = 0.066*cl->GetSigmaZ2();
1574 if (sector < fParam->GetNInnerSector()) sigmaZ2 *= 1.77;
1575 cov[0] = sin*sin*sigmaY2;
1576 cov[1] = -sin*cos*sigmaY2;
1577 cov[2] = 0.;
1578 cov[3] = cos*cos*sigmaY2;
1579 cov[4] = 0.;
1580 cov[5] = sigmaZ2;
1581 p.SetXYZ(x,y,xyz[2],cov);
1582 AliAlignObj::ELayerID iLayer;
1583 Int_t idet;
1584 if (sector < fParam->GetNInnerSector()) {
1585 iLayer = AliAlignObj::kTPC1;
1586 idet = sector;
1587 }
1588 else {
1589 iLayer = AliAlignObj::kTPC2;
1590 idet = sector - fParam->GetNInnerSector();
1591 }
1592 UShort_t volid = AliAlignObj::LayerToVolUID(iLayer,idet);
1593 p.SetVolumeID(volid);
1594 return kTRUE;
1595}
1596
1597
1598
91162307 1599Int_t AliTPCtrackerMI::UpdateClusters(AliTPCseed& t, Int_t nr) {
1c53abe2 1600 //-----------------------------------------------------------------
1601 // This function tries to find a track prolongation to next pad row
1602 //-----------------------------------------------------------------
1603 t.fCurrentCluster = 0;
1604 t.fCurrentClusterIndex1 = 0;
1c53abe2 1605
1606 Double_t xt=t.GetX();
91162307 1607 Int_t row = GetRowNumber(xt)-1;
1608 Double_t ymax= GetMaxY(nr);
1609
1c53abe2 1610 if (row < nr) return 1; // don't prolongate if not information until now -
91162307 1611 if (TMath::Abs(t.GetSnp())>0.9 && t.GetNumberOfClusters()>40. && fIteration!=2) {
1612 t.fRemoval =10;
1613 return 0; // not prolongate strongly inclined tracks
1614 }
1615 if (TMath::Abs(t.GetSnp())>0.95) {
1616 t.fRemoval =10;
1617 return 0; // not prolongate strongly inclined tracks
1618 }
1619
1620 Double_t x= GetXrow(nr);
1621 Double_t y,z;
1622 //t.PropagateTo(x+0.02);
1623 //t.PropagateTo(x+0.01);
1627d1c4 1624 if (!t.PropagateTo(x)){
1627d1c4 1625 return 0;
1626 }
1c53abe2 1627 //
91162307 1628 y=t.GetY();
1629 z=t.GetZ();
1c53abe2 1630
91162307 1631 if (TMath::Abs(y)>ymax){
1632 if (y > ymax) {
1633 t.fRelativeSector= (t.fRelativeSector+1) % fN;
1634 if (!t.Rotate(fSectors->GetAlpha()))
1635 return 0;
1636 } else if (y <-ymax) {
1637 t.fRelativeSector= (t.fRelativeSector-1+fN) % fN;
1638 if (!t.Rotate(-fSectors->GetAlpha()))
1639 return 0;
1640 }
982aff31 1641 // if (!t.PropagateTo(x)){
1642 // return 0;
1643 //}
1644 return 1;
1645 //y = t.GetY();
1c53abe2 1646 }
91162307 1647 //
1c53abe2 1648
91162307 1649 AliTPCRow &krow=GetRow(t.fRelativeSector,nr);
1c53abe2 1650
1651 if (TMath::Abs(TMath::Abs(y)-ymax)<krow.fDeadZone){
1652 t.fInDead = kTRUE;
91162307 1653 t.SetClusterIndex2(nr,-1);
1c53abe2 1654 return 0;
1655 }
1656 else
1657 {
d7a11555 1658 if (TMath::Abs(t.GetZ())<(AliTPCReconstructor::GetCtgRange()*t.GetX()+10)) t.fNFoundable++;
1627d1c4 1659 else
1660 return 0;
1c53abe2 1661 }
1c53abe2 1662
91162307 1663 // update current
1664 if ( (nr%6==0) || t.GetNumberOfClusters()<2){
1665 // t.fCurrentSigmaY = GetSigmaY(&t);
1666 //t.fCurrentSigmaZ = GetSigmaZ(&t);
1667 GetShape(&t,nr);
1668 }
1c53abe2 1669
91162307 1670 AliTPCclusterMI *cl=0;
d184f295 1671 Int_t index=0;
91162307 1672 //
1673 Double_t roady = 1.;
1674 Double_t roadz = 1.;
1675 //
d26d9159 1676
1677 if (!cl){
1678 index = t.GetClusterIndex2(nr);
1679 if ( (index>0) && (index&0x8000)==0){
1680 cl = t.fClusterPointer[nr];
1681 if ( (cl==0) && (index>0)) cl = GetClusterMI(index);
1682 t.fCurrentClusterIndex1 = index;
1683 if (cl) {
1684 t.fCurrentCluster = cl;
1685 return 1;
1686 }
1687 }
1688 }
1689
3d172d79 1690 // if (index<0) return 0;
1691 UInt_t uindex = TMath::Abs(index);
d184f295 1692
91162307 1693 if (krow) {
d184f295 1694 //cl = krow.FindNearest2(y+10,z,roady,roadz,uindex);
1695 cl = krow.FindNearest2(y,z,roady,roadz,uindex);
91162307 1696 }
d26d9159 1697
d184f295 1698 if (cl) t.fCurrentClusterIndex1 = krow.GetIndex(uindex);
d26d9159 1699 t.fCurrentCluster = cl;
1700
91162307 1701 return 1;
1702}
1c53abe2 1703
1c53abe2 1704
91162307 1705Int_t AliTPCtrackerMI::FollowToNextCluster(AliTPCseed & t, Int_t nr) {
1706 //-----------------------------------------------------------------
1707 // This function tries to find a track prolongation to next pad row
1708 //-----------------------------------------------------------------
1c53abe2 1709
91162307 1710 //update error according neighborhoud
1c53abe2 1711
91162307 1712 if (t.fCurrentCluster) {
1713 t.fRow = nr;
8c51a605 1714 Int_t accept = AcceptCluster(&t,t.fCurrentCluster,1.);
91162307 1715
1716 if (t.fCurrentCluster->IsUsed(10)){
1717 //
1718 //
1719 // t.fErrorZ2*=2;
1720 // t.fErrorY2*=2;
1721 t.fNShared++;
1722 if (t.fNShared>0.7*t.GetNumberOfClusters()) {
1723 t.fRemoval =10;
1724 return 0;
1725 }
b364ca79 1726 }
d26d9159 1727 if (fIteration>0) accept = 0;
b364ca79 1728 if (accept<3) UpdateTrack(&t,accept);
1729
1c53abe2 1730 } else {
91162307 1731 if (fIteration==0){
1732 if ( ( (t.GetSigmaY2()+t.GetSigmaZ2())>0.16)&& t.GetNumberOfClusters()>18) t.fRemoval=10;
1733 if ( t.GetChi2()/t.GetNumberOfClusters()>6 &&t.GetNumberOfClusters()>18) t.fRemoval=10;
1734
1735 if (( (t.fNFoundable*0.5 > t.GetNumberOfClusters()) || t.fNoCluster>15)) t.fRemoval=10;
1c53abe2 1736 }
1737 }
1738 return 1;
1739}
1740
1741
1742
91162307 1743//_____________________________________________________________________________
1744Int_t AliTPCtrackerMI::FollowProlongation(AliTPCseed& t, Int_t rf, Int_t step) {
1c53abe2 1745 //-----------------------------------------------------------------
91162307 1746 // This function tries to find a track prolongation.
1c53abe2 1747 //-----------------------------------------------------------------
1748 Double_t xt=t.GetX();
1749 //
91162307 1750 Double_t alpha=t.GetAlpha() - fSectors->GetAlphaShift();
1c53abe2 1751 if (alpha > 2.*TMath::Pi()) alpha -= 2.*TMath::Pi();
1752 if (alpha < 0. ) alpha += 2.*TMath::Pi();
91162307 1753 //
1754 t.fRelativeSector = Int_t(alpha/fSectors->GetAlpha()+0.0001)%fN;
1c53abe2 1755
91162307 1756 Int_t first = GetRowNumber(xt)-1;
51ad6848 1757 for (Int_t nr= first; nr>=rf; nr-=step) {
1758 // update kink info
1759 if (t.GetKinkIndexes()[0]>0){
1760 for (Int_t i=0;i<3;i++){
1761 Int_t index = t.GetKinkIndexes()[i];
1762 if (index==0) break;
1763 if (index<0) continue;
1764 //
1765 AliESDkink * kink = fEvent->GetKink(index-1);
1766 if (!kink){
1767 printf("PROBLEM\n");
1768 }
1769 else{
eea478d3 1770 Int_t kinkrow = kink->GetTPCRow0()+2+Int_t(0.5/(0.05+kink->GetAngle(2)));
51ad6848 1771 if (kinkrow==nr){
1772 AliExternalTrackParam paramd(t);
1773 kink->SetDaughter(paramd);
eea478d3 1774 kink->SetStatus(2,5);
51ad6848 1775 kink->Update();
51ad6848 1776 }
1777 }
1778 }
1779 }
1780
1781 if (nr==80) t.UpdateReference();
982aff31 1782 if (nr<fInnerSec->GetNRows())
1783 fSectors = fInnerSec;
1784 else
1785 fSectors = fOuterSec;
91162307 1786 if (FollowToNext(t,nr)==0)
4d158c36 1787 if (!t.IsActive())
1788 return 0;
91162307 1789
1790 }
1791 return 1;
1792}
1793
1c53abe2 1794
1795//_____________________________________________________________________________
91162307 1796Int_t AliTPCtrackerMI::FollowProlongationFast(AliTPCseed& t, Int_t rf, Int_t step) {
1c53abe2 1797 //-----------------------------------------------------------------
1798 // This function tries to find a track prolongation.
1799 //-----------------------------------------------------------------
1800 Double_t xt=t.GetX();
1801 //
1802 Double_t alpha=t.GetAlpha() - fSectors->GetAlphaShift();
1803 if (alpha > 2.*TMath::Pi()) alpha -= 2.*TMath::Pi();
1804 if (alpha < 0. ) alpha += 2.*TMath::Pi();
91162307 1805 t.fRelativeSector = Int_t(alpha/fSectors->GetAlpha()+0.0001)%fN;
1806
1807 for (Int_t nr=GetRowNumber(xt)-1; nr>=rf; nr-=step) {
1808
1809 if (FollowToNextFast(t,nr)==0)
1810 if (!t.IsActive()) return 0;
1c53abe2 1811
1c53abe2 1812 }
1813 return 1;
1814}
1815
1816
91162307 1817
1818
1819
1c53abe2 1820Int_t AliTPCtrackerMI::FollowBackProlongation(AliTPCseed& t, Int_t rf) {
1821 //-----------------------------------------------------------------
1822 // This function tries to find a track prolongation.
1823 //-----------------------------------------------------------------
1c53abe2 1824 //
eea478d3 1825 Double_t xt=t.GetX();
1c53abe2 1826 Double_t alpha=t.GetAlpha() - fSectors->GetAlphaShift();
1827 if (alpha > 2.*TMath::Pi()) alpha -= 2.*TMath::Pi();
1828 if (alpha < 0. ) alpha += 2.*TMath::Pi();
91162307 1829 t.fRelativeSector = Int_t(alpha/fSectors->GetAlpha()+0.0001)%fN;
1c53abe2 1830
4d158c36 1831 Int_t first = t.fFirstPoint;
eea478d3 1832 if (first<GetRowNumber(xt)+1) first = GetRowNumber(xt)+1;
91162307 1833 //
1834 if (first<0) first=0;
4d158c36 1835 for (Int_t nr=first; nr<=rf; nr++) {
2bd61959 1836 if ( (TMath::Abs(t.GetSnp())>0.95)) break;
51ad6848 1837 if (t.GetKinkIndexes()[0]<0){
1838 for (Int_t i=0;i<3;i++){
1839 Int_t index = t.GetKinkIndexes()[i];
1840 if (index==0) break;
1841 if (index>0) continue;
1842 index = TMath::Abs(index);
1843 AliESDkink * kink = fEvent->GetKink(index-1);
1844 if (!kink){
1845 printf("PROBLEM\n");
1846 }
1847 else{
eea478d3 1848 Int_t kinkrow = kink->GetTPCRow0()-2-Int_t(0.5/(0.05+kink->GetAngle(2)));
51ad6848 1849 if (kinkrow==nr){
1850 AliExternalTrackParam paramm(t);
1851 kink->SetMother(paramm);
eea478d3 1852 kink->SetStatus(2,1);
51ad6848 1853 kink->Update();
51ad6848 1854 }
1855 }
eea478d3 1856 }
51ad6848 1857 }
eea478d3 1858 //
d26d9159 1859 if (nr<fInnerSec->GetNRows())
1860 fSectors = fInnerSec;
1861 else
1862 fSectors = fOuterSec;
1863 FollowToNext(t,nr);
1c53abe2 1864 }
1865 return 1;
1866}
1867
1868
1869
1870
1871
1872Float_t AliTPCtrackerMI::OverlapFactor(AliTPCseed * s1, AliTPCseed * s2, Int_t &sum1, Int_t & sum2)
1873{
1874 //
1875 //
1876 sum1=0;
1877 sum2=0;
1878 Int_t sum=0;
1c53abe2 1879 //
1880 Float_t dz2 =(s1->GetZ() - s2->GetZ());
c9427e08 1881 dz2*=dz2;
91162307 1882
c9427e08 1883 Float_t dy2 =TMath::Abs((s1->GetY() - s2->GetY()));
1c53abe2 1884 dy2*=dy2;
1885 Float_t distance = TMath::Sqrt(dz2+dy2);
c9427e08 1886 if (distance>4.) return 0; // if there are far away - not overlap - to reduce combinatorics
1c53abe2 1887
91162307 1888 // Int_t offset =0;
c9427e08 1889 Int_t firstpoint = TMath::Min(s1->fFirstPoint,s2->fFirstPoint);
1890 Int_t lastpoint = TMath::Max(s1->fLastPoint,s2->fLastPoint);
c9427e08 1891 if (lastpoint>160)
1892 lastpoint =160;
1893 if (firstpoint<0)
1894 firstpoint = 0;
91162307 1895 if (firstpoint>lastpoint) {
1896 firstpoint =lastpoint;
1897 // lastpoint =160;
c9427e08 1898 }
1899
1900
91162307 1901 for (Int_t i=firstpoint-1;i<lastpoint+1;i++){
1902 if (s1->GetClusterIndex2(i)>0) sum1++;
1903 if (s2->GetClusterIndex2(i)>0) sum2++;
1904 if (s1->GetClusterIndex2(i)==s2->GetClusterIndex2(i) && s1->GetClusterIndex2(i)>0) {
1c53abe2 1905 sum++;
1906 }
1907 }
91162307 1908 if (sum<5) return 0;
1909
1627d1c4 1910 Float_t summin = TMath::Min(sum1+1,sum2+1);
1911 Float_t ratio = (sum+1)/Float_t(summin);
1c53abe2 1912 return ratio;
1913}
1914
1915void AliTPCtrackerMI::SignShared(AliTPCseed * s1, AliTPCseed * s2)
1916{
1917 //
1918 //
91162307 1919 if (TMath::Abs(s1->GetC()-s2->GetC())>0.004) return;
1920 if (TMath::Abs(s1->GetTgl()-s2->GetTgl())>0.6) return;
1921
1c53abe2 1922 Float_t dz2 =(s1->GetZ() - s2->GetZ());
1923 dz2*=dz2;
1924 Float_t dy2 =(s1->GetY() - s2->GetY());
1925 dy2*=dy2;
91162307 1926 Float_t distance = dz2+dy2;
1927 if (distance>325.) return ; // if there are far away - not overlap - to reduce combinatorics
1928
1c53abe2 1929 //
91162307 1930 Int_t sumshared=0;
1931 //
1932 Int_t firstpoint = TMath::Max(s1->fFirstPoint,s2->fFirstPoint);
1933 Int_t lastpoint = TMath::Min(s1->fLastPoint,s2->fLastPoint);
1934 //
1935 if (firstpoint>=lastpoint-5) return;;
1c53abe2 1936
91162307 1937 for (Int_t i=firstpoint;i<lastpoint;i++){
1938 // if ( (s1->GetClusterIndex2(i)&0xFFFF8FFF)==(s2->GetClusterIndex2(i)&0xFFFF8FFF) && s1->GetClusterIndex2(i)>0) {
1939 if ( (s1->GetClusterIndex2(i))==(s2->GetClusterIndex2(i)) && s1->GetClusterIndex2(i)>0) {
1940 sumshared++;
1941 }
1942 }
1943 if (sumshared>4){
1944 // sign clusters
1945 //
1946 for (Int_t i=firstpoint;i<lastpoint;i++){
1947 // if ( (s1->GetClusterIndex2(i)&0xFFFF8FFF)==(s2->GetClusterIndex2(i)&0xFFFF8FFF) && s1->GetClusterIndex2(i)>0) {
1948 if ( (s1->GetClusterIndex2(i))==(s2->GetClusterIndex2(i)) && s1->GetClusterIndex2(i)>0) {
1949 AliTPCTrackerPoint *p1 = s1->GetTrackPoint(i);
1950 AliTPCTrackerPoint *p2 = s2->GetTrackPoint(i);;
1951 if (s1->IsActive()&&s2->IsActive()){
1952 p1->fIsShared = kTRUE;
1953 p2->fIsShared = kTRUE;
1954 }
1955 }
1956 }
1957 }
1958 //
1959 if (sumshared>10){
1960 for (Int_t i=0;i<4;i++){
1961 if (s1->fOverlapLabels[3*i]==0){
1962 s1->fOverlapLabels[3*i] = s2->GetLabel();
1963 s1->fOverlapLabels[3*i+1] = sumshared;
1964 s1->fOverlapLabels[3*i+2] = s2->GetUniqueID();
1965 break;
1966 }
1967 }
1968 for (Int_t i=0;i<4;i++){
1969 if (s2->fOverlapLabels[3*i]==0){
1970 s2->fOverlapLabels[3*i] = s1->GetLabel();
1971 s2->fOverlapLabels[3*i+1] = sumshared;
1972 s2->fOverlapLabels[3*i+2] = s1->GetUniqueID();
1973 break;
1974 }
1975 }
1976 }
1c53abe2 1977
91162307 1978}
1c53abe2 1979
91162307 1980void AliTPCtrackerMI::SignShared(TObjArray * arr)
1981{
1c53abe2 1982 //
91162307 1983 //sort trackss according sectors
1984 //
c9427e08 1985 for (Int_t i=0; i<arr->GetEntriesFast(); i++) {
1986 AliTPCseed *pt=(AliTPCseed*)arr->UncheckedAt(i);
91162307 1987 if (!pt) continue;
1988 //if (pt) RotateToLocal(pt);
1989 pt->fSort = 0;
c9427e08 1990 }
91162307 1991 arr->UnSort();
1c53abe2 1992 arr->Sort(); // sorting according z
1993 arr->Expand(arr->GetEntries());
91162307 1994 //
1995 //
1c53abe2 1996 Int_t nseed=arr->GetEntriesFast();
1c53abe2 1997 for (Int_t i=0; i<nseed; i++) {
1998 AliTPCseed *pt=(AliTPCseed*)arr->UncheckedAt(i);
91162307 1999 if (!pt) continue;
2000 for (Int_t j=0;j<=12;j++){
2001 pt->fOverlapLabels[j] =0;
1c53abe2 2002 }
91162307 2003 }
2004 for (Int_t i=0; i<nseed; i++) {
2005 AliTPCseed *pt=(AliTPCseed*)arr->UncheckedAt(i);
2006 if (!pt) continue;
2007 if (pt->fRemoval>10) continue;
1c53abe2 2008 for (Int_t j=i+1; j<nseed; j++){
2009 AliTPCseed *pt2=(AliTPCseed*)arr->UncheckedAt(j);
91162307 2010 // if (pt2){
2011 if (pt2->fRemoval<=10) {
2012 if ( TMath::Abs(pt->fRelativeSector-pt2->fRelativeSector)>0) break;
2013 SignShared(pt,pt2);
c9427e08 2014 }
91162307 2015 }
2016 }
2017}
2018
2019void AliTPCtrackerMI::RemoveDouble(TObjArray * arr, Float_t factor1, Float_t factor2, Int_t removalindex)
2020{
2021 //
2022 //sort trackss according sectors
2023 //
2024 if (fDebug&1) {
6bdc18d6 2025 Info("RemoveDouble","Number of tracks before double removal- %d\n",arr->GetEntries());
91162307 2026 }
2027 //
2028 for (Int_t i=0; i<arr->GetEntriesFast(); i++) {
2029 AliTPCseed *pt=(AliTPCseed*)arr->UncheckedAt(i);
2030 if (!pt) continue;
2031 pt->fSort = 0;
2032 }
2033 arr->UnSort();
2034 arr->Sort(); // sorting according z
2035 arr->Expand(arr->GetEntries());
2036 //
2037 //reset overlap labels
2038 //
2039 Int_t nseed=arr->GetEntriesFast();
2040 for (Int_t i=0; i<nseed; i++) {
2041 AliTPCseed *pt=(AliTPCseed*)arr->UncheckedAt(i);
2042 if (!pt) continue;
2043 pt->SetUniqueID(i);
2044 for (Int_t j=0;j<=12;j++){
2045 pt->fOverlapLabels[j] =0;
1c53abe2 2046 }
2047 }
91162307 2048 //
2049 //sign shared tracks
1c53abe2 2050 for (Int_t i=0; i<nseed; i++) {
2051 AliTPCseed *pt=(AliTPCseed*)arr->UncheckedAt(i);
91162307 2052 if (!pt) continue;
2053 if (pt->fRemoval>10) continue;
2054 Float_t deltac = pt->GetC()*0.1;
2055 for (Int_t j=i+1; j<nseed; j++){
2056 AliTPCseed *pt2=(AliTPCseed*)arr->UncheckedAt(j);
2057 // if (pt2){
2058 if (pt2->fRemoval<=10) {
2059 if ( TMath::Abs(pt->fRelativeSector-pt2->fRelativeSector)>0) break;
2060 if (TMath::Abs(pt->GetC() -pt2->GetC())>deltac) continue;
2061 if (TMath::Abs(pt->GetTgl()-pt2->GetTgl())>0.05) continue;
2062 //
2063 SignShared(pt,pt2);
2064 }
1c53abe2 2065 }
1c53abe2 2066 }
91162307 2067 //
2068 // remove highly shared tracks
2069 for (Int_t i=0; i<nseed; i++) {
2070 AliTPCseed *pt=(AliTPCseed*)arr->UncheckedAt(i);
2071 if (!pt) continue;
2072 if (pt->fRemoval>10) continue;
2073 //
2074 Int_t sumshared =0;
2075 for (Int_t j=0;j<4;j++){
2076 sumshared = pt->fOverlapLabels[j*3+1];
2077 }
2078 Float_t factor = factor1;
2079 if (pt->fRemoval>0) factor = factor2;
2080 if (sumshared/pt->GetNumberOfClusters()>factor){
2081 for (Int_t j=0;j<4;j++){
2082 if (pt->fOverlapLabels[3*j]==0) continue;
2083 if (pt->fOverlapLabels[3*j+1]<5) continue;
2084 if (pt->fRemoval==removalindex) continue;
2085 AliTPCseed * pt2 = (AliTPCseed*)arr->UncheckedAt(pt->fOverlapLabels[3*j+2]);
2086 if (!pt2) continue;
2087 if (pt2->GetSigma2C()<pt->GetSigma2C()){
2088 // pt->fRemoval = removalindex;
2089 delete arr->RemoveAt(i);
2090 break;
1c53abe2 2091 }
91162307 2092 }
1c53abe2 2093 }
91162307 2094 }
2095 arr->Compress();
2096 if (fDebug&1) {
6bdc18d6 2097 Info("RemoveDouble","Number of tracks after double removal- %d\n",arr->GetEntries());
91162307 2098 }
2099}
2100
2101
2102
1c53abe2 2103
2104
91162307 2105
47966a6d 2106void AliTPCtrackerMI::SortTracks(TObjArray * arr, Int_t mode) const
91162307 2107{
2108 //
2109 //sort tracks in array according mode criteria
2110 Int_t nseed = arr->GetEntriesFast();
2111 for (Int_t i=0; i<nseed; i++) {
2112 AliTPCseed *pt=(AliTPCseed*)arr->UncheckedAt(i);
2113 if (!pt) {
2114 continue;
2115 }
2116 pt->fSort = mode;
2117 }
2118 arr->UnSort();
2119 arr->Sort();
1c53abe2 2120}
c9427e08 2121
91162307 2122void AliTPCtrackerMI::RemoveUsed(TObjArray * arr, Float_t factor1, Float_t factor2, Int_t removalindex)
c9427e08 2123{
2124
2125 //Loop over all tracks and remove "overlaps"
2126 //
2127 //
2128 Int_t nseed = arr->GetEntriesFast();
2129 Int_t good =0;
91162307 2130
c9427e08 2131 for (Int_t i=0; i<nseed; i++) {
2132 AliTPCseed *pt=(AliTPCseed*)arr->UncheckedAt(i);
2133 if (!pt) {
91162307 2134 delete arr->RemoveAt(i);
c9427e08 2135 }
91162307 2136 else{
2137 pt->fSort =1;
2138 pt->fBSigned = kFALSE;
c9427e08 2139 }
91162307 2140 }
2141 arr->Compress();
2142 nseed = arr->GetEntriesFast();
2143 arr->UnSort();
2144 arr->Sort();
2145 //
2146 //unsign used
2147 UnsignClusters();
2148 //
2149 for (Int_t i=0; i<nseed; i++) {
2150 AliTPCseed *pt=(AliTPCseed*)arr->UncheckedAt(i);
2151 if (!pt) {
2152 continue;
2153 }
2154 Int_t found,foundable,shared;
2155 if (pt->IsActive())
2156 pt->GetClusterStatistic(0,160,found, foundable,shared,kFALSE);
2157 else
2158 pt->GetClusterStatistic(0,160,found, foundable,shared,kTRUE);
2159 //
2160 Double_t factor = factor2;
2161 if (pt->fBConstrain) factor = factor1;
2162
2163 if ((Float_t(shared)/Float_t(found))>factor){
c9427e08 2164 pt->Desactivate(removalindex);
91162307 2165 continue;
2166 }
2167
2168 good++;
2169 for (Int_t i=0; i<160; i++) {
2170 Int_t index=pt->GetClusterIndex2(i);
2171 if (index<0 || index&0x8000 ) continue;
2172 AliTPCclusterMI *c= pt->fClusterPointer[i];
2173 if (!c) continue;
2174 // if (!c->IsUsed(10)) c->Use(10);
2175 //if (pt->IsActive())
2176 c->Use(10);
2177 //else
2178 // c->Use(5);
c9427e08 2179 }
91162307 2180
c9427e08 2181 }
2182 fNtracks = good;
6bdc18d6 2183 if (fDebug>0){
2184 Info("RemoveUsed","\n*****\nNumber of good tracks after shared removal\t%d\n",fNtracks);
2185 }
c9427e08 2186}
2187
51ad6848 2188
2189void AliTPCtrackerMI::RemoveUsed2(TObjArray * arr, Float_t factor1, Float_t factor2, Int_t minimal)
2190{
2191
2192 //Loop over all tracks and remove "overlaps"
2193 //
2194 //
2195 UnsignClusters();
2196 //
2197 Int_t nseed = arr->GetEntriesFast();
2198 Float_t * quality = new Float_t[nseed];
2199 Int_t * indexes = new Int_t[nseed];
2200 Int_t good =0;
2201 //
2202 //
2203 for (Int_t i=0; i<nseed; i++) {
2204 AliTPCseed *pt=(AliTPCseed*)arr->UncheckedAt(i);
2205 if (!pt){
2206 quality[i]=-1;
2207 continue;
2208 }
2209 pt->UpdatePoints(); //select first last max dens points
2210 Float_t * points = pt->GetPoints();
2211 if (points[3]<0.8) quality[i] =-1;
2212 //
2213 quality[i] = (points[2]-points[0])+pt->GetNumberOfClusters();
2214 }
2215 TMath::Sort(nseed,quality,indexes);
2216 //
2217 //
2218 for (Int_t itrack=0; itrack<nseed; itrack++) {
2219 Int_t trackindex = indexes[itrack];
2220 AliTPCseed *pt=(AliTPCseed*)arr->UncheckedAt(trackindex);
2221 if (quality[trackindex]<0){
2222 if (pt) {
2223 delete arr->RemoveAt(trackindex);
2224 }
2225 else{
2226 arr->RemoveAt(trackindex);
2227 }
2228 continue;
2229 }
2230 //
2231 Int_t first = Int_t(pt->GetPoints()[0]);
2232 Int_t last = Int_t(pt->GetPoints()[2]);
2233 Double_t factor = (pt->fBConstrain) ? factor1: factor2;
2234 //
2235 Int_t found,foundable,shared;
2236 pt->GetClusterStatistic(first,last, found, foundable,shared,kFALSE);
eea478d3 2237 Float_t sharedfactor = Float_t(shared+1)/Float_t(found+1);
b406fdb0 2238 Bool_t itsgold =kFALSE;
2239 if (pt->fEsd){
2240 UInt_t dummy[12];
2241 if (pt->fEsd->GetITSclusters(dummy)>4) itsgold= kTRUE;
51ad6848 2242 }
b406fdb0 2243 if (!itsgold){
2244 //
2245 if (Float_t(shared+1)/Float_t(found+1)>factor){
2246 if (pt->GetKinkIndexes()[0]!=0) continue; //don't remove tracks - part of the kinks
2247 delete arr->RemoveAt(trackindex);
2248 continue;
2249 }
2250 if (pt->GetNumberOfClusters()<50&&(found-0.5*shared)<minimal){ //remove short tracks
2251 if (pt->GetKinkIndexes()[0]!=0) continue; //don't remove tracks - part of the kinks
2252 delete arr->RemoveAt(trackindex);
2253 continue;
2254 }
51ad6848 2255 }
2256
2257 good++;
2258 if (sharedfactor>0.4) continue;
b406fdb0 2259 if (pt->GetKinkIndexes()[0]>0) continue;
51ad6848 2260 for (Int_t i=first; i<last; i++) {
2261 Int_t index=pt->GetClusterIndex2(i);
2262 // if (index<0 || index&0x8000 ) continue;
2263 if (index<0 || index&0x8000 ) continue;
2264 AliTPCclusterMI *c= pt->fClusterPointer[i];
2265 if (!c) continue;
2266 c->Use(10);
2267 }
2268 }
2269 fNtracks = good;
2270 if (fDebug>0){
2271 Info("RemoveUsed","\n*****\nNumber of good tracks after shared removal\t%d\n",fNtracks);
2272 }
2273 delete []quality;
2274 delete []indexes;
2275}
2276
91162307 2277void AliTPCtrackerMI::UnsignClusters()
1c53abe2 2278{
91162307 2279 //
2280 // loop over all clusters and unsign them
2281 //
2282
2283 for (Int_t sec=0;sec<fkNIS;sec++){
2284 for (Int_t row=0;row<fInnerSec->GetNRows();row++){
2285 AliTPCclusterMI *cl = fInnerSec[sec][row].fClusters1;
2286 for (Int_t icl =0;icl< fInnerSec[sec][row].fN1;icl++)
2287 // if (cl[icl].IsUsed(10))
2288 cl[icl].Use(-1);
2289 cl = fInnerSec[sec][row].fClusters2;
2290 for (Int_t icl =0;icl< fInnerSec[sec][row].fN2;icl++)
2291 //if (cl[icl].IsUsed(10))
2292 cl[icl].Use(-1);
2293 }
2294 }
2295
2296 for (Int_t sec=0;sec<fkNOS;sec++){
2297 for (Int_t row=0;row<fOuterSec->GetNRows();row++){
2298 AliTPCclusterMI *cl = fOuterSec[sec][row].fClusters1;
2299 for (Int_t icl =0;icl< fOuterSec[sec][row].fN1;icl++)
2300 //if (cl[icl].IsUsed(10))
2301 cl[icl].Use(-1);
2302 cl = fOuterSec[sec][row].fClusters2;
2303 for (Int_t icl =0;icl< fOuterSec[sec][row].fN2;icl++)
2304 //if (cl[icl].IsUsed(10))
2305 cl[icl].Use(-1);
2306 }
2307 }
2308
1c53abe2 2309}
2310
91162307 2311
2312
732b9e78 2313void AliTPCtrackerMI::SignClusters(TObjArray * arr, Float_t fnumber, Float_t fdensity)
1c53abe2 2314{
2315 //
91162307 2316 //sign clusters to be "used"
2317 //
2318 // snumber and sdensity sign number of sigmas - bellow mean value to be accepted
2319 // loop over "primaries"
2320
2321 Float_t sumdens=0;
2322 Float_t sumdens2=0;
2323 Float_t sumn =0;
2324 Float_t sumn2 =0;
2325 Float_t sumchi =0;
2326 Float_t sumchi2 =0;
2327
2328 Float_t sum =0;
2329
1c53abe2 2330 TStopwatch timer;
91162307 2331 timer.Start();
1c53abe2 2332
91162307 2333 Int_t nseed = arr->GetEntriesFast();
2334 for (Int_t i=0; i<nseed; i++) {
2335 AliTPCseed *pt=(AliTPCseed*)arr->UncheckedAt(i);
2336 if (!pt) {
2337 continue;
2338 }
2339 if (!(pt->IsActive())) continue;
2340 Float_t dens = pt->GetNumberOfClusters()/Float_t(pt->fNFoundable);
2341 if ( (dens>0.7) && (pt->GetNumberOfClusters()>70)){
2342 sumdens += dens;
2343 sumdens2+= dens*dens;
2344 sumn += pt->GetNumberOfClusters();
2345 sumn2 += pt->GetNumberOfClusters()*pt->GetNumberOfClusters();
2346 Float_t chi2 = pt->GetChi2()/pt->GetNumberOfClusters();
2347 if (chi2>5) chi2=5;
2348 sumchi +=chi2;
2349 sumchi2 +=chi2*chi2;
2350 sum++;
2351 }
1627d1c4 2352 }
91162307 2353
2354 Float_t mdensity = 0.9;
2355 Float_t meann = 130;
2356 Float_t meanchi = 1;
2357 Float_t sdensity = 0.1;
2358 Float_t smeann = 10;
2359 Float_t smeanchi =0.4;
1627d1c4 2360
91162307 2361
2362 if (sum>20){
2363 mdensity = sumdens/sum;
2364 meann = sumn/sum;
2365 meanchi = sumchi/sum;
2366 //
2367 sdensity = sumdens2/sum-mdensity*mdensity;
2368 sdensity = TMath::Sqrt(sdensity);
2369 //
2370 smeann = sumn2/sum-meann*meann;
2371 smeann = TMath::Sqrt(smeann);
2372 //
2373 smeanchi = sumchi2/sum - meanchi*meanchi;
2374 smeanchi = TMath::Sqrt(smeanchi);
2375 }
2376
2377
2378 //REMOVE SHORT DELTAS or tracks going out of sensitive volume of TPC
2379 //
2380 for (Int_t i=0; i<nseed; i++) {
2381 AliTPCseed *pt=(AliTPCseed*)arr->UncheckedAt(i);
2382 if (!pt) {
2383 continue;
1c53abe2 2384 }
91162307 2385 if (pt->fBSigned) continue;
2386 if (pt->fBConstrain) continue;
2387 //if (!(pt->IsActive())) continue;
2388 /*
2389 Int_t found,foundable,shared;
2390 pt->GetClusterStatistic(0,160,found, foundable,shared);
2391 if (shared/float(found)>0.3) {
2392 if (shared/float(found)>0.9 ){
2393 //delete arr->RemoveAt(i);
2394 }
2395 continue;
c9427e08 2396 }
91162307 2397 */
2398 Bool_t isok =kFALSE;
2399 if ( (pt->fNShared/pt->GetNumberOfClusters()<0.5) &&pt->GetNumberOfClusters()>60)
2400 isok = kTRUE;
2401 if ((TMath::Abs(1/pt->GetC())<100.) && (pt->fNShared/pt->GetNumberOfClusters()<0.7))
2402 isok =kTRUE;
2403 if (TMath::Abs(pt->GetZ()/pt->GetX())>1.1)
2404 isok =kTRUE;
2405 if ( (TMath::Abs(pt->GetSnp()>0.7) && pt->GetD(0,0)>60.))
2406 isok =kTRUE;
2407
2408 if (isok)
2409 for (Int_t i=0; i<160; i++) {
2410 Int_t index=pt->GetClusterIndex2(i);
2411 if (index<0) continue;
2412 AliTPCclusterMI *c= pt->fClusterPointer[i];
2413 if (!c) continue;
2414 //if (!(c->IsUsed(10))) c->Use();
2415 c->Use(10);
2416 }
2417 }
2418
c9427e08 2419
1c53abe2 2420 //
91162307 2421 Double_t maxchi = meanchi+2.*smeanchi;
2422
2423 for (Int_t i=0; i<nseed; i++) {
2424 AliTPCseed *pt=(AliTPCseed*)arr->UncheckedAt(i);
2425 if (!pt) {
1c53abe2 2426 continue;
91162307 2427 }
2428 //if (!(pt->IsActive())) continue;
2429 if (pt->fBSigned) continue;
2430 Double_t chi = pt->GetChi2()/pt->GetNumberOfClusters();
2431 if (chi>maxchi) continue;
2432
2433 Float_t bfactor=1;
2434 Float_t dens = pt->GetNumberOfClusters()/Float_t(pt->fNFoundable);
2435
2436 //sign only tracks with enoug big density at the beginning
2437
2438 if ((pt->GetDensityFirst(40)<0.75) && pt->GetNumberOfClusters()<meann) continue;
2439
2440
3e5d0aa2 2441 Double_t mindens = TMath::Max(double(mdensity-sdensity*fdensity*bfactor),0.65);
91162307 2442 Double_t minn = TMath::Max(Int_t(meann-fnumber*smeann*bfactor),50);
2443
2444 // if (pt->fBConstrain) mindens = TMath::Max(mdensity-sdensity*fdensity*bfactor,0.65);
2445 if ( (pt->fRemoval==10) && (pt->GetSnp()>0.8)&&(dens>mindens))
2446 minn=0;
2447
2448 if ((dens>mindens && pt->GetNumberOfClusters()>minn) && chi<maxchi ){
2449 //Int_t noc=pt->GetNumberOfClusters();
2450 pt->fBSigned = kTRUE;
2451 for (Int_t i=0; i<160; i++) {
2452
2453 Int_t index=pt->GetClusterIndex2(i);
2454 if (index<0) continue;
2455 AliTPCclusterMI *c= pt->fClusterPointer[i];
2456 if (!c) continue;
2457 // if (!(c->IsUsed(10))) c->Use();
2458 c->Use(10);
2459 }
1c53abe2 2460 }
91162307 2461 }
2462 // gLastCheck = nseed;
2463 // arr->Compress();
2464 if (fDebug>0){
2465 timer.Print();
2466 }
1c53abe2 2467}
2468
2469
47966a6d 2470void AliTPCtrackerMI::StopNotActive(TObjArray * arr, Int_t row0, Float_t th0, Float_t th1, Float_t th2) const
91162307 2471{
2472 // stop not active tracks
2473 // take th1 as threshold for number of founded to number of foundable on last 10 active rows
2474 // take th2 as threshold for number of founded to number of foundable on last 20 active rows
2475 Int_t nseed = arr->GetEntriesFast();
2476 //
2477 for (Int_t i=0; i<nseed; i++) {
2478 AliTPCseed *pt=(AliTPCseed*)arr->UncheckedAt(i);
2479 if (!pt) {
2480 continue;
2481 }
2482 if (!(pt->IsActive())) continue;
2483 StopNotActive(pt,row0,th0, th1,th2);
2484 }
2485}
1c53abe2 2486
1c53abe2 2487
1c53abe2 2488
91162307 2489void AliTPCtrackerMI::StopNotActive(AliTPCseed * seed, Int_t row0, Float_t th0, Float_t th1,
47966a6d 2490 Float_t th2) const
91162307 2491{
2492 // stop not active tracks
2493 // take th1 as threshold for number of founded to number of foundable on last 10 active rows
2494 // take th2 as threshold for number of founded to number of foundable on last 20 active rows
2495 Int_t sumgood1 = 0;
2496 Int_t sumgood2 = 0;
2497 Int_t foundable = 0;
2498 Int_t maxindex = seed->fLastPoint; //last foundable row
2499 if (seed->fNFoundable*th0 > seed->GetNumberOfClusters()) {
2500 seed->Desactivate(10) ;
2501 return;
2502 }
1c53abe2 2503
3e5d0aa2 2504 for (Int_t i=row0; i<maxindex; i++){
91162307 2505 Int_t index = seed->GetClusterIndex2(i);
2506 if (index!=-1) foundable++;
2507 //if (!c) continue;
2508 if (foundable<=30) sumgood1++;
2509 if (foundable<=50) {
2510 sumgood2++;
2511 }
2512 else{
2513 break;
2514 }
2515 }
2516 if (foundable>=30.){
2517 if (sumgood1<(th1*30.)) seed->Desactivate(10);
2518 }
2519 if (foundable>=50)
2520 if (sumgood2<(th2*50.)) seed->Desactivate(10);
2521}
1c53abe2 2522
1c53abe2 2523
d26d9159 2524Int_t AliTPCtrackerMI::RefitInward(AliESD *event)
2525{
2526 //
2527 // back propagation of ESD tracks
2528 //
2529 //return 0;
2530 fEvent = event;
2531 ReadSeeds(event,2);
2532 fIteration=2;
982aff31 2533 //PrepareForProlongation(fSeeds,1);
2534 PropagateForward2(fSeeds);
af32720d 2535
4d158c36 2536 Int_t ntracks=0;
d26d9159 2537 Int_t nseed = fSeeds->GetEntriesFast();
2538 for (Int_t i=0;i<nseed;i++){
2539 AliTPCseed * seed = (AliTPCseed*) fSeeds->UncheckedAt(i);
4d158c36 2540 if (!seed) continue;
eea478d3 2541 if (seed->GetKinkIndex(0)>0) UpdateKinkQualityD(seed); // update quality informations for kinks
2542
d26d9159 2543 seed->PropagateTo(fParam->GetInnerRadiusLow());
51ad6848 2544 seed->UpdatePoints();
d26d9159 2545 AliESDtrack *esd=event->GetTrack(i);
2546 seed->CookdEdx(0.02,0.6);
2547 CookLabel(seed,0.1); //For comparison only
af32720d 2548 //
2549 if (0 && seed!=0&&esd!=0) {
2550 TTreeSRedirector &cstream = *fDebugStreamer;
2551 cstream<<"Crefit"<<
2552 "Esd.="<<esd<<
2553 "Track.="<<seed<<
2554 "\n";
2555 }
51ad6848 2556 if (seed->GetNumberOfClusters()>15){
4d158c36 2557 esd->UpdateTrackParams(seed,AliESDtrack::kTPCrefit);
51ad6848 2558 esd->SetTPCPoints(seed->GetPoints());
b406fdb0 2559 esd->SetTPCPointsF(seed->fNFoundable);
2560 Int_t ndedx = seed->fNCDEDX[0]+seed->fNCDEDX[1]+seed->fNCDEDX[2]+seed->fNCDEDX[3];
2561 Float_t sdedx = (seed->fSDEDX[0]+seed->fSDEDX[1]+seed->fSDEDX[2]+seed->fSDEDX[3])*0.25;
2562 Float_t dedx = seed->GetdEdx();
2563 esd->SetTPCsignal(dedx, sdedx, ndedx);
4d158c36 2564 ntracks++;
d26d9159 2565 }
2566 else{
2567 //printf("problem\n");
2568 }
2569 }
51ad6848 2570 //FindKinks(fSeeds,event);
4d158c36 2571 Info("RefitInward","Number of refitted tracks %d",ntracks);
d26d9159 2572 fEvent =0;
2573 //WriteTracks();
2574 return 0;
2575}
2576
1c53abe2 2577
91162307 2578Int_t AliTPCtrackerMI::PropagateBack(AliESD *event)
2579{
2580 //
2581 // back propagation of ESD tracks
2582 //
1c53abe2 2583
91162307 2584 fEvent = event;
d26d9159 2585 fIteration = 1;
5d837844 2586 ReadSeeds(event,1);
b406fdb0 2587 PropagateBack(fSeeds);
2588 RemoveUsed2(fSeeds,0.4,0.4,20);
2589 //
91162307 2590 Int_t nseed = fSeeds->GetEntriesFast();
4d158c36 2591 Int_t ntracks=0;
91162307 2592 for (Int_t i=0;i<nseed;i++){
2593 AliTPCseed * seed = (AliTPCseed*) fSeeds->UncheckedAt(i);
d9e62e7e 2594 if (!seed) continue;
51ad6848 2595 if (seed->GetKinkIndex(0)<0) UpdateKinkQualityM(seed); // update quality informations for kinks
2596 seed->UpdatePoints();
91162307 2597 AliESDtrack *esd=event->GetTrack(i);
d26d9159 2598 seed->CookdEdx(0.02,0.6);
91162307 2599 CookLabel(seed,0.1); //For comparison only
51ad6848 2600 if (seed->GetNumberOfClusters()>15){
4d158c36 2601 esd->UpdateTrackParams(seed,AliESDtrack::kTPCout);
51ad6848 2602 esd->SetTPCPoints(seed->GetPoints());
167c41ab 2603 esd->SetTPCPointsF(seed->fNFoundable);
2604 Int_t ndedx = seed->fNCDEDX[0]+seed->fNCDEDX[1]+seed->fNCDEDX[2]+seed->fNCDEDX[3];
2605 Float_t sdedx = (seed->fSDEDX[0]+seed->fSDEDX[1]+seed->fSDEDX[2]+seed->fSDEDX[3])*0.25;
2606 Float_t dedx = seed->GetdEdx();
2607 esd->SetTPCsignal(dedx, sdedx, ndedx);
4d158c36 2608 ntracks++;
2609 }
91162307 2610 }
51ad6848 2611 //FindKinks(fSeeds,event);
4d158c36 2612 Info("PropagateBack","Number of back propagated tracks %d",ntracks);
91162307 2613 fEvent =0;
d26d9159 2614 //WriteTracks();
91162307 2615 return 0;
2616}
2617
2618
2619void AliTPCtrackerMI::DeleteSeeds()
2620{
b67e07dc 2621 //
2622 //delete Seeds
91162307 2623 Int_t nseed = fSeeds->GetEntriesFast();
2624 for (Int_t i=0;i<nseed;i++){
2625 AliTPCseed * seed = (AliTPCseed*)fSeeds->At(i);
2626 if (seed) delete fSeeds->RemoveAt(i);
2627 }
2628 delete fSeeds;
2629 fSeeds =0;
2630}
2631
d26d9159 2632void AliTPCtrackerMI::ReadSeeds(AliESD *event, Int_t direction)
91162307 2633{
2634 //
2635 //read seeds from the event
2636
2637 Int_t nentr=event->GetNumberOfTracks();
6bdc18d6 2638 if (fDebug>0){
2639 Info("ReadSeeds", "Number of ESD tracks: %d\n", nentr);
2640 }
91162307 2641 if (fSeeds)
2642 DeleteSeeds();
2643 if (!fSeeds){
4d158c36 2644 fSeeds = new TObjArray(nentr);
91162307 2645 }
4d158c36 2646 UnsignClusters();
2647 // Int_t ntrk=0;
91162307 2648 for (Int_t i=0; i<nentr; i++) {
2649 AliESDtrack *esd=event->GetTrack(i);
51ad6848 2650 ULong_t status=esd->GetStatus();
2651 if (!(status&AliESDtrack::kTPCin)) continue;
b67e07dc 2652 AliTPCtrack t(*esd);
5d837844 2653 t.SetNumberOfClusters(0);
eea478d3 2654 // AliTPCseed *seed = new AliTPCseed(t,t.GetAlpha());
2655 AliTPCseed *seed = new AliTPCseed(t/*,t.GetAlpha()*/);
2656 for (Int_t ikink=0;ikink<3;ikink++) {
2657 Int_t index = esd->GetKinkIndex(ikink);
2658 seed->GetKinkIndexes()[ikink] = index;
2659 if (index==0) continue;
2660 index = TMath::Abs(index);
2661 AliESDkink * kink = fEvent->GetKink(index-1);
2662 if (kink&&esd->GetKinkIndex(ikink)<0){
2663 if ((status & AliESDtrack::kTRDrefit) != 0) kink->SetStatus(1,2);
2664 if ((status & AliESDtrack::kITSout) != 0) kink->SetStatus(1,0);
2665 }
2666 if (kink&&esd->GetKinkIndex(ikink)>0){
2667 if ((status & AliESDtrack::kTRDrefit) != 0) kink->SetStatus(1,6);
2668 if ((status & AliESDtrack::kITSout) != 0) kink->SetStatus(1,4);
2669 }
2670
2671 }
5d837844 2672 if (((status&AliESDtrack::kITSout)==0)&&(direction==1)) seed->ResetCovariance();
982aff31 2673 if ( direction ==2 &&(status & AliESDtrack::kTRDrefit) == 0 ) seed->ResetCovariance();
4d158c36 2674 if ( direction ==2 && ((status & AliESDtrack::kTPCout) == 0) ) {
2675 fSeeds->AddAt(0,i);
2676 delete seed;
2677 continue;
2678 }
2679 if ( direction ==2 &&(status & AliESDtrack::kTRDrefit) > 0 ) {
c0b978f0 2680 Double_t par0[5],par1[5],alpha,x;
2681 esd->GetInnerExternalParameters(alpha,x,par0);
4d158c36 2682 esd->GetExternalParameters(x,par1);
2683 Double_t delta1 = TMath::Abs(par0[4]-par1[4])/(0.000000001+TMath::Abs(par0[4]+par1[4]));
2684 Double_t delta2 = TMath::Abs(par0[3]-par1[3]);
51ad6848 2685 Double_t trdchi2=0;
2686 if (esd->GetTRDncls()>0) trdchi2 = esd->GetTRDchi2()/esd->GetTRDncls();
4d158c36 2687 //reset covariance if suspicious
51ad6848 2688 if ( (delta1>0.1) || (delta2>0.006) ||trdchi2>7.)
4d158c36 2689 seed->ResetCovariance();
2690 }
982aff31 2691
91162307 2692 //
2693 //
2694 // rotate to the local coordinate system
eea478d3 2695 //
2696 fSectors=fInnerSec; fN=fkNIS;
91162307 2697 Double_t alpha=seed->GetAlpha() - fSectors->GetAlphaShift();
2698 if (alpha > 2.*TMath::Pi()) alpha -= 2.*TMath::Pi();
2699 if (alpha < 0. ) alpha += 2.*TMath::Pi();
2700 Int_t ns=Int_t(alpha/fSectors->GetAlpha())%fN;
2701 alpha =ns*fSectors->GetAlpha() + fSectors->GetAlphaShift();
4d158c36 2702 if (alpha<-TMath::Pi()) alpha += 2*TMath::Pi();
2703 if (alpha>=TMath::Pi()) alpha -= 2*TMath::Pi();
91162307 2704 alpha-=seed->GetAlpha();
d9b8978b 2705 if (!seed->Rotate(alpha)) {
2706 delete seed;
2707 continue;
2708 }
d26d9159 2709 seed->fEsd = esd;
4d158c36 2710 // sign clusters
b406fdb0 2711 if (esd->GetKinkIndex(0)<=0){
2712 for (Int_t irow=0;irow<160;irow++){
2713 Int_t index = seed->GetClusterIndex2(irow);
2714 if (index>0){
2715 //
2716 AliTPCclusterMI * cl = GetClusterMI(index);
2717 seed->fClusterPointer[irow] = cl;
2718 if (cl){
2719 if ((index & 0x8000)==0){
2720 cl->Use(10); // accepted cluster
2721 }else{
2722 cl->Use(6); // close cluster not accepted
2723 }
4d158c36 2724 }else{
b406fdb0 2725 Info("ReadSeeds","Not found cluster");
2726 }
4d158c36 2727 }
2728 }
2729 }
2730 fSeeds->AddAt(seed,i);
91162307 2731 }
2732}
2733
2734
2735
2736//_____________________________________________________________________________
2737void AliTPCtrackerMI::MakeSeeds3(TObjArray * arr, Int_t sec, Int_t i1, Int_t i2, Float_t cuts[4],
2738 Float_t deltay, Int_t ddsec) {
2739 //-----------------------------------------------------------------
2740 // This function creates track seeds.
2741 // SEEDING WITH VERTEX CONSTRAIN
2742 //-----------------------------------------------------------------
2743 // cuts[0] - fP4 cut
2744 // cuts[1] - tan(phi) cut
2745 // cuts[2] - zvertex cut
2746 // cuts[3] - fP3 cut
2747 Int_t nin0 = 0;
2748 Int_t nin1 = 0;
2749 Int_t nin2 = 0;
2750 Int_t nin = 0;
2751 Int_t nout1 = 0;
2752 Int_t nout2 = 0;
2753
2754 Double_t x[5], c[15];
2755 // Int_t di = i1-i2;
2756 //
2757 AliTPCseed * seed = new AliTPCseed;
2758 Double_t alpha=fSectors->GetAlpha(), shift=fSectors->GetAlphaShift();
2759 Double_t cs=cos(alpha), sn=sin(alpha);
2760 //
2761 // Double_t x1 =fOuterSec->GetX(i1);
2762 //Double_t xx2=fOuterSec->GetX(i2);
2763
2764 Double_t x1 =GetXrow(i1);
2765 Double_t xx2=GetXrow(i2);
2766
2767 Double_t x3=GetX(), y3=GetY(), z3=GetZ();
2768
2769 Int_t imiddle = (i2+i1)/2; //middle pad row index
2770 Double_t xm = GetXrow(imiddle); // radius of middle pad-row
2771 const AliTPCRow& krm=GetRow(sec,imiddle); //middle pad -row
2772 //
2773 Int_t ns =sec;
2774
2775 const AliTPCRow& kr1=GetRow(ns,i1);
2776 Double_t ymax = GetMaxY(i1)-kr1.fDeadZone-1.5;
2777 Double_t ymaxm = GetMaxY(imiddle)-kr1.fDeadZone-1.5;
2778
2779 //
2780 // change cut on curvature if it can't reach this layer
2781 // maximal curvature set to reach it
2782 Double_t dvertexmax = TMath::Sqrt((x1-x3)*(x1-x3)+(ymax+5-y3)*(ymax+5-y3));
2783 if (dvertexmax*0.5*cuts[0]>0.85){
2784 cuts[0] = 0.85/(dvertexmax*0.5+1.);
2785 }
2786 Double_t r2min = 1/(cuts[0]*cuts[0]); //minimal square of radius given by cut
2787
2788 // Int_t ddsec = 1;
2789 if (deltay>0) ddsec = 0;
2790 // loop over clusters
2791 for (Int_t is=0; is < kr1; is++) {
2792 //
2793 if (kr1[is]->IsUsed(10)) continue;
2794 Double_t y1=kr1[is]->GetY(), z1=kr1[is]->GetZ();
2795 //if (TMath::Abs(y1)>ymax) continue;
2796
2797 if (deltay>0 && TMath::Abs(ymax-TMath::Abs(y1))> deltay ) continue; // seed only at the edge
2798
2799 // find possible directions
2800 Float_t anglez = (z1-z3)/(x1-x3);
2801 Float_t extraz = z1 - anglez*(x1-xx2); // extrapolated z
2802 //
2803 //
2804 //find rotation angles relative to line given by vertex and point 1
2805 Double_t dvertex2 = (x1-x3)*(x1-x3)+(y1-y3)*(y1-y3);
2806 Double_t dvertex = TMath::Sqrt(dvertex2);
2807 Double_t angle13 = TMath::ATan((y1-y3)/(x1-x3));
2808 Double_t cs13 = cos(-angle13), sn13 = sin(-angle13);
2809
2810 //
2811 // loop over 2 sectors
2812 Int_t dsec1=-ddsec;
2813 Int_t dsec2= ddsec;
2814 if (y1<0) dsec2= 0;
2815 if (y1>0) dsec1= 0;
2816
2817 Double_t dddz1=0; // direction of delta inclination in z axis
2818 Double_t dddz2=0;
2819 if ( (z1-z3)>0)
2820 dddz1 =1;
2821 else
2822 dddz2 =1;
2823 //
2824 for (Int_t dsec = dsec1; dsec<=dsec2;dsec++){
2825 Int_t sec2 = sec + dsec;
2826 //
2827 // AliTPCRow& kr2 = fOuterSec[(sec2+fkNOS)%fkNOS][i2];
2828 //AliTPCRow& kr2m = fOuterSec[(sec2+fkNOS)%fkNOS][imiddle];
2829 AliTPCRow& kr2 = GetRow((sec2+fkNOS)%fkNOS,i2);
2830 AliTPCRow& kr2m = GetRow((sec2+fkNOS)%fkNOS,imiddle);
2831 Int_t index1 = TMath::Max(kr2.Find(extraz-0.6-dddz1*TMath::Abs(z1)*0.05)-1,0);
2832 Int_t index2 = TMath::Min(kr2.Find(extraz+0.6+dddz2*TMath::Abs(z1)*0.05)+1,kr2);
2833
2834 // rotation angles to p1-p3
2835 Double_t cs13r = cos(-angle13+dsec*alpha)/dvertex, sn13r = sin(-angle13+dsec*alpha)/dvertex;
2836 Double_t x2, y2, z2;
2837 //
2838 // Double_t dymax = maxangle*TMath::Abs(x1-xx2);
2839
2840 //
2841 Double_t dxx0 = (xx2-x3)*cs13r;
2842 Double_t dyy0 = (xx2-x3)*sn13r;
2843 for (Int_t js=index1; js < index2; js++) {
2844 const AliTPCclusterMI *kcl = kr2[js];
2845 if (kcl->IsUsed(10)) continue;
2846 //
2847 //calcutate parameters
2848 //
2849 Double_t yy0 = dyy0 +(kcl->GetY()-y3)*cs13r;
2850 // stright track
2851 if (TMath::Abs(yy0)<0.000001) continue;
2852 Double_t xx0 = dxx0 -(kcl->GetY()-y3)*sn13r;
2853 Double_t y0 = 0.5*(xx0*xx0+yy0*yy0-xx0)/yy0;
2854 Double_t r02 = (0.25+y0*y0)*dvertex2;
2855 //curvature (radius) cut
2856 if (r02<r2min) continue;
2857
2858 nin0++;
2859 //
2860 Double_t c0 = 1/TMath::Sqrt(r02);
2861 if (yy0>0) c0*=-1.;
2862
2863
2864 //Double_t dfi0 = 2.*TMath::ASin(dvertex*c0*0.5);
2865 //Double_t dfi1 = 2.*TMath::ASin(TMath::Sqrt(yy0*yy0+(1-xx0)*(1-xx0))*dvertex*c0*0.5);
b67e07dc 2866 Double_t dfi0 = 2.*AliTPCFastMath::FastAsin(dvertex*c0*0.5);
2867 Double_t dfi1 = 2.*AliTPCFastMath::FastAsin(TMath::Sqrt(yy0*yy0+(1-xx0)*(1-xx0))*dvertex*c0*0.5);
91162307 2868 //
2869 //
2870 Double_t z0 = kcl->GetZ();
2871 Double_t zzzz2 = z1-(z1-z3)*dfi1/dfi0;
2872 if (TMath::Abs(zzzz2-z0)>0.5) continue;
2873 nin1++;
2874 //
2875 Double_t dip = (z1-z0)*c0/dfi1;
2876 Double_t x0 = (0.5*cs13+y0*sn13)*dvertex*c0;
2877 //
2878 y2 = kcl->GetY();
2879 if (dsec==0){
2880 x2 = xx2;
2881 z2 = kcl->GetZ();
2882 }
2883 else
2884 {
2885 // rotation
2886 z2 = kcl->GetZ();
2887 x2= xx2*cs-y2*sn*dsec;
2888 y2=+xx2*sn*dsec+y2*cs;
2889 }
2890
2891 x[0] = y1;
2892 x[1] = z1;
2893 x[2] = x0;
2894 x[3] = dip;
2895 x[4] = c0;
2896 //
2897 //
2898 // do we have cluster at the middle ?
2899 Double_t ym,zm;
2900 GetProlongation(x1,xm,x,ym,zm);
2901 UInt_t dummy;
2902 AliTPCclusterMI * cm=0;
2903 if (TMath::Abs(ym)-ymaxm<0){
2904 cm = krm.FindNearest2(ym,zm,1.0,0.6,dummy);
2905 if ((!cm) || (cm->IsUsed(10))) {
2906 continue;
2907 }
2908 }
2909 else{
2910 // rotate y1 to system 0
2911 // get state vector in rotated system
2912 Double_t yr1 = (-0.5*sn13+y0*cs13)*dvertex*c0;
2913 Double_t xr2 = x0*cs+yr1*sn*dsec;
2914 Double_t xr[5]={kcl->GetY(),kcl->GetZ(), xr2, dip, c0};
2915 //
2916 GetProlongation(xx2,xm,xr,ym,zm);
2917 if (TMath::Abs(ym)-ymaxm<0){
2918 cm = kr2m.FindNearest2(ym,zm,1.0,0.6,dummy);
2919 if ((!cm) || (cm->IsUsed(10))) {
2920 continue;
2921 }
2922 }
2923 }
2924
2925
2926 Double_t dym = 0;
2927 Double_t dzm = 0;
2928 if (cm){
2929 dym = ym - cm->GetY();
2930 dzm = zm - cm->GetZ();
2931 }
2932 nin2++;
2933
2934
2935 //
2936 //
2937 Double_t sy1=kr1[is]->GetSigmaY2()*2., sz1=kr1[is]->GetSigmaZ2()*2.;
2938 Double_t sy2=kcl->GetSigmaY2()*2., sz2=kcl->GetSigmaZ2()*2.;
2939 //Double_t sy3=400*3./12., sy=0.1, sz=0.1;
2940 Double_t sy3=25000*x[4]*x[4]+0.1, sy=0.1, sz=0.1;
2941 //Double_t sy3=25000*x[4]*x[4]*60+0.5, sy=0.1, sz=0.1;
2942
b67e07dc 2943 Double_t f40=(F1(x1,y1+sy,x2,y2,x3,y3)-x[4])/sy;
2944 Double_t f42=(F1(x1,y1,x2,y2+sy,x3,y3)-x[4])/sy;
2945 Double_t f43=(F1(x1,y1,x2,y2,x3,y3+sy)-x[4])/sy;
2946 Double_t f20=(F2(x1,y1+sy,x2,y2,x3,y3)-x[2])/sy;
2947 Double_t f22=(F2(x1,y1,x2,y2+sy,x3,y3)-x[2])/sy;
2948 Double_t f23=(F2(x1,y1,x2,y2,x3,y3+sy)-x[2])/sy;
91162307 2949
b67e07dc 2950 Double_t f30=(F3(x1,y1+sy,x2,y2,z1,z2)-x[3])/sy;
2951 Double_t f31=(F3(x1,y1,x2,y2,z1+sz,z2)-x[3])/sz;
2952 Double_t f32=(F3(x1,y1,x2,y2+sy,z1,z2)-x[3])/sy;
2953 Double_t f34=(F3(x1,y1,x2,y2,z1,z2+sz)-x[3])/sz;
91162307 2954
1c53abe2 2955 c[0]=sy1;
2956 c[1]=0.; c[2]=sz1;
2957 c[3]=f20*sy1; c[4]=0.; c[5]=f20*sy1*f20+f22*sy2*f22+f23*sy3*f23;
2958 c[6]=f30*sy1; c[7]=f31*sz1; c[8]=f30*sy1*f20+f32*sy2*f22;
2959 c[9]=f30*sy1*f30+f31*sz1*f31+f32*sy2*f32+f34*sz2*f34;
2960 c[10]=f40*sy1; c[11]=0.; c[12]=f40*sy1*f20+f42*sy2*f22+f43*sy3*f23;
2961 c[13]=f30*sy1*f40+f32*sy2*f42;
2962 c[14]=f40*sy1*f40+f42*sy2*f42+f43*sy3*f43;
91162307 2963
2964 // if (!BuildSeed(kr1[is],kcl,0,x1,x2,x3,x,c)) continue;
2965
1c53abe2 2966 UInt_t index=kr1.GetIndex(is);
91162307 2967 AliTPCseed *track=new(seed) AliTPCseed(index, x, c, x1, ns*alpha+shift);
2968
1c53abe2 2969 track->fIsSeeding = kTRUE;
91162307 2970 track->fSeed1 = i1;
2971 track->fSeed2 = i2;
2972 track->fSeedType=3;
c9427e08 2973
91162307 2974
2975 //if (dsec==0) {
2976 FollowProlongation(*track, (i1+i2)/2,1);
2977 Int_t foundable,found,shared;
2978 track->GetClusterStatistic((i1+i2)/2,i1, found, foundable, shared, kTRUE);
2979 if ((found<0.55*foundable) || shared>0.5*found || (track->GetSigmaY2()+track->GetSigmaZ2())>0.5){
2980 seed->Reset();
2981 seed->~AliTPCseed();
2982 continue;
2983 }
2984 //}
2985
2986 nin++;
2987 FollowProlongation(*track, i2,1);
2988
2989
2990 //Int_t rc = 1;
2991 track->fBConstrain =1;
2992 // track->fLastPoint = i1+fInnerSec->GetNRows(); // first cluster in track position
2993 track->fLastPoint = i1; // first cluster in track position
2994 track->fFirstPoint = track->fLastPoint;
2995
2996 if (track->GetNumberOfClusters()<(i1-i2)*0.5 ||
2997 track->GetNumberOfClusters() < track->fNFoundable*0.6 ||
2998 track->fNShared>0.4*track->GetNumberOfClusters() ) {
2999 seed->Reset();
3000 seed->~AliTPCseed();
c9427e08 3001 continue;
3002 }
91162307 3003 nout1++;
3004 // Z VERTEX CONDITION
3005 Double_t zv;
3006 zv = track->GetZ()+track->GetTgl()/track->GetC()*
3007 ( asin(-track->GetEta()) - asin(track->GetX()*track->GetC()-track->GetEta()));
3008 if (TMath::Abs(zv-z3)>cuts[2]) {
3009 FollowProlongation(*track, TMath::Max(i2-20,0));
3010 zv = track->GetZ()+track->GetTgl()/track->GetC()*
3011 ( asin(-track->GetEta()) - asin(track->GetX()*track->GetC()-track->GetEta()));
3012 if (TMath::Abs(zv-z3)>cuts[2]){
3013 FollowProlongation(*track, TMath::Max(i2-40,0));
3014 zv = track->GetZ()+track->GetTgl()/track->GetC()*
3015 ( asin(-track->GetEta()) - asin(track->GetX()*track->GetC()-track->GetEta()));
3016 if (TMath::Abs(zv-z3)>cuts[2] &&(track->GetNumberOfClusters() > track->fNFoundable*0.7)){
3017 // make seed without constrain
3018 AliTPCseed * track2 = MakeSeed(track,0.2,0.5,1.);
3019 FollowProlongation(*track2, i2,1);
3020 track2->fBConstrain = kFALSE;
3021 track2->fSeedType = 1;
3022 arr->AddLast(track2);
3023 seed->Reset();
3024 seed->~AliTPCseed();
3025 continue;
3026 }
3027 else{
3028 seed->Reset();
3029 seed->~AliTPCseed();
3030 continue;
3031
3032 }
3033 }
c9427e08 3034 }
1c53abe2 3035
91162307 3036 track->fSeedType =0;
3037 arr->AddLast(track);
3038 seed = new AliTPCseed;
3039 nout2++;
3040 // don't consider other combinations
3041 if (track->GetNumberOfClusters() > track->fNFoundable*0.8)
3042 break;
1c53abe2 3043 }
3044 }
3045 }
6bdc18d6 3046 if (fDebug>3){
3047 Info("MakeSeeds3","\nSeeding statistic:\t%d\t%d\t%d\t%d\t%d\t%d",nin0,nin1,nin2,nin,nout1,nout2);
91162307 3048 }
3049 delete seed;
1c53abe2 3050}
3051
1627d1c4 3052
91162307 3053void AliTPCtrackerMI::MakeSeeds5(TObjArray * arr, Int_t sec, Int_t i1, Int_t i2, Float_t cuts[4],
3054 Float_t deltay) {
3055
3056
3057
1627d1c4 3058 //-----------------------------------------------------------------
91162307 3059 // This function creates track seeds.
1627d1c4 3060 //-----------------------------------------------------------------
91162307 3061 // cuts[0] - fP4 cut
3062 // cuts[1] - tan(phi) cut
3063 // cuts[2] - zvertex cut
3064 // cuts[3] - fP3 cut
3065
3066
3067 Int_t nin0 = 0;
3068 Int_t nin1 = 0;
3069 Int_t nin2 = 0;
3070 Int_t nin = 0;
3071 Int_t nout1 = 0;
3072 Int_t nout2 = 0;
3073 Int_t nout3 =0;
3074 Double_t x[5], c[15];
3075 //
3076 // make temporary seed
3077 AliTPCseed * seed = new AliTPCseed;
1627d1c4 3078 Double_t alpha=fOuterSec->GetAlpha(), shift=fOuterSec->GetAlphaShift();
3079 // Double_t cs=cos(alpha), sn=sin(alpha);
91162307 3080 //
3081 //
1627d1c4 3082
91162307 3083 // first 3 padrows
3084 Double_t x1 = GetXrow(i1-1);
3085 const AliTPCRow& kr1=GetRow(sec,i1-1);
3086 Double_t y1max = GetMaxY(i1-1)-kr1.fDeadZone-1.5;
3087 //
3088 Double_t x1p = GetXrow(i1);
3089 const AliTPCRow& kr1p=GetRow(sec,i1);
3090 //
3091 Double_t x1m = GetXrow(i1-2);
3092 const AliTPCRow& kr1m=GetRow(sec,i1-2);
1627d1c4 3093
91162307 3094 //
3095 //last 3 padrow for seeding
3096 AliTPCRow& kr3 = GetRow((sec+fkNOS)%fkNOS,i1-7);
3097 Double_t x3 = GetXrow(i1-7);
3098 // Double_t y3max= GetMaxY(i1-7)-kr3.fDeadZone-1.5;
3099 //
3100 AliTPCRow& kr3p = GetRow((sec+fkNOS)%fkNOS,i1-6);
3101 Double_t x3p = GetXrow(i1-6);
3102 //
3103 AliTPCRow& kr3m = GetRow((sec+fkNOS)%fkNOS,i1-8);
3104 Double_t x3m = GetXrow(i1-8);
1627d1c4 3105
91162307 3106 //
3107 //
3108 // middle padrow
3109 Int_t im = i1-4; //middle pad row index
3110 Double_t xm = GetXrow(im); // radius of middle pad-row
3111 const AliTPCRow& krm=GetRow(sec,im); //middle pad -row
3112 // Double_t ymmax = GetMaxY(im)-kr1.fDeadZone-1.5;
3113 //
3114 //
3115 Double_t deltax = x1-x3;
3116 Double_t dymax = deltax*cuts[1];
3117 Double_t dzmax = deltax*cuts[3];
3118 //
3119 // loop over clusters
3120 for (Int_t is=0; is < kr1; is++) {
1627d1c4 3121 //
91162307 3122 if (kr1[is]->IsUsed(10)) continue;
3123 Double_t y1=kr1[is]->GetY(), z1=kr1[is]->GetZ();
1627d1c4 3124 //
91162307 3125 if (deltay>0 && TMath::Abs(y1max-TMath::Abs(y1))> deltay ) continue; // seed only at the edge
3126 //
3127 Int_t index1 = TMath::Max(kr3.Find(z1-dzmax)-1,0);
3128 Int_t index2 = TMath::Min(kr3.Find(z1+dzmax)+1,kr3);
3129 //
3130 Double_t y3, z3;
1627d1c4 3131 //
1627d1c4 3132 //
91162307 3133 UInt_t index;
3134 for (Int_t js=index1; js < index2; js++) {
3135 const AliTPCclusterMI *kcl = kr3[js];
3136 if (kcl->IsUsed(10)) continue;
3137 y3 = kcl->GetY();
3138 // apply angular cuts
3139 if (TMath::Abs(y1-y3)>dymax) continue;
3140 x3 = x3;
3141 z3 = kcl->GetZ();
3142 if (TMath::Abs(z1-z3)>dzmax) continue;
3143 //
3144 Double_t angley = (y1-y3)/(x1-x3);
3145 Double_t anglez = (z1-z3)/(x1-x3);
3146 //
3147 Double_t erry = TMath::Abs(angley)*(x1-x1m)*0.5+0.5;
3148 Double_t errz = TMath::Abs(anglez)*(x1-x1m)*0.5+0.5;
3149 //
3150 Double_t yyym = angley*(xm-x1)+y1;
3151 Double_t zzzm = anglez*(xm-x1)+z1;
3152
3153 const AliTPCclusterMI *kcm = krm.FindNearest2(yyym,zzzm,erry,errz,index);
3154 if (!kcm) continue;
3155 if (kcm->IsUsed(10)) continue;
3156
3157 erry = TMath::Abs(angley)*(x1-x1m)*0.4+0.5;
3158 errz = TMath::Abs(anglez)*(x1-x1m)*0.4+0.5;
3159 //
3160 //
3161 //
3162 Int_t used =0;
3163 Int_t found =0;
3164 //
3165 // look around first
3166 const AliTPCclusterMI *kc1m = kr1m.FindNearest2(angley*(x1m-x1)+y1,
3167 anglez*(x1m-x1)+z1,
3168 erry,errz,index);
3169 //
3170 if (kc1m){
3171 found++;
3172 if (kc1m->IsUsed(10)) used++;
1627d1c4 3173 }
91162307 3174 const AliTPCclusterMI *kc1p = kr1p.FindNearest2(angley*(x1p-x1)+y1,
3175 anglez*(x1p-x1)+z1,
3176 erry,errz,index);
1627d1c4 3177 //
91162307 3178 if (kc1p){
3179 found++;
3180 if (kc1p->IsUsed(10)) used++;
1627d1c4 3181 }
91162307 3182 if (used>1) continue;
3183 if (found<1) continue;
1627d1c4 3184
91162307 3185 //
3186 // look around last
3187 const AliTPCclusterMI *kc3m = kr3m.FindNearest2(angley*(x3m-x3)+y3,
3188 anglez*(x3m-x3)+z3,
3189 erry,errz,index);
3190 //
3191 if (kc3m){
3192 found++;
3193 if (kc3m->IsUsed(10)) used++;
3194 }
3195 else
3196 continue;
3197 const AliTPCclusterMI *kc3p = kr3p.FindNearest2(angley*(x3p-x3)+y3,
3198 anglez*(x3p-x3)+z3,
3199 erry,errz,index);
3200 //
3201 if (kc3p){
3202 found++;
3203 if (kc3p->IsUsed(10)) used++;
3204 }
3205 else
3206 continue;
3207 if (used>1) continue;
3208 if (found<3) continue;
3209 //
3210 Double_t x2,y2,z2;
3211 x2 = xm;
3212 y2 = kcm->GetY();
3213 z2 = kcm->GetZ();
3214 //
3215
1627d1c4 3216 x[0]=y1;
3217 x[1]=z1;
b67e07dc 3218 x[4]=F1(x1,y1,x2,y2,x3,y3);
91162307 3219 //if (TMath::Abs(x[4]) >= cuts[0]) continue;
3220 nin0++;
3221 //
b67e07dc 3222 x[2]=F2(x1,y1,x2,y2,x3,y3);
91162307 3223 nin1++;
3224 //
b67e07dc 3225 x[3]=F3n(x1,y1,x2,y2,z1,z2,x[4]);
91162307 3226 //if (TMath::Abs(x[3]) > cuts[3]) continue;
3227 nin2++;
3228 //
3229 //
3230 Double_t sy1=0.1, sz1=0.1;
3231 Double_t sy2=0.1, sz2=0.1;
3232 Double_t sy3=0.1, sy=0.1, sz=0.1;
1627d1c4 3233
b67e07dc 3234 Double_t f40=(F1(x1,y1+sy,x2,y2,x3,y3)-x[4])/sy;
3235 Double_t f42=(F1(x1,y1,x2,y2+sy,x3,y3)-x[4])/sy;
3236 Double_t f43=(F1(x1,y1,x2,y2,x3,y3+sy)-x[4])/sy;
3237 Double_t f20=(F2(x1,y1+sy,x2,y2,x3,y3)-x[2])/sy;
3238 Double_t f22=(F2(x1,y1,x2,y2+sy,x3,y3)-x[2])/sy;
3239 Double_t f23=(F2(x1,y1,x2,y2,x3,y3+sy)-x[2])/sy;
91162307 3240
b67e07dc 3241 Double_t f30=(F3(x1,y1+sy,x2,y2,z1,z2)-x[3])/sy;
3242 Double_t f31=(F3(x1,y1,x2,y2,z1+sz,z2)-x[3])/sz;
3243 Double_t f32=(F3(x1,y1,x2,y2+sy,z1,z2)-x[3])/sy;
3244 Double_t f34=(F3(x1,y1,x2,y2,z1,z2+sz)-x[3])/sz;
1627d1c4 3245
3246 c[0]=sy1;
91162307 3247 c[1]=0.; c[2]=sz1;
1627d1c4 3248 c[3]=f20*sy1; c[4]=0.; c[5]=f20*sy1*f20+f22*sy2*f22+f23*sy3*f23;
3249 c[6]=f30*sy1; c[7]=f31*sz1; c[8]=f30*sy1*f20+f32*sy2*f22;
3250 c[9]=f30*sy1*f30+f31*sz1*f31+f32*sy2*f32+f34*sz2*f34;
3251 c[10]=f40*sy1; c[11]=0.; c[12]=f40*sy1*f20+f42*sy2*f22+f43*sy3*f23;
3252 c[13]=f30*sy1*f40+f32*sy2*f42;
3253 c[14]=f40*sy1*f40+f42*sy2*f42+f43*sy3*f43;
3254
91162307 3255 // if (!BuildSeed(kr1[is],kcl,0,x1,x2,x3,x,c)) continue;
3256
3257 UInt_t index=kr1.GetIndex(is);
3258 AliTPCseed *track=new(seed) AliTPCseed(index, x, c, x1, sec*alpha+shift);
3259
3260 track->fIsSeeding = kTRUE;
3261
3262 nin++;
3263 FollowProlongation(*track, i1-7,1);
3264 if (track->GetNumberOfClusters() < track->fNFoundable*0.75 ||
3265 track->fNShared>0.6*track->GetNumberOfClusters() || ( track->GetSigmaY2()+ track->GetSigmaZ2())>0.6){
3266 seed->Reset();
3267 seed->~AliTPCseed();
3268 continue;
3269 }
3270 nout1++;
3271 nout2++;
3272 //Int_t rc = 1;
3273 FollowProlongation(*track, i2,1);
3274 track->fBConstrain =0;
3275 track->fLastPoint = i1+fInnerSec->GetNRows(); // first cluster in track position
3276 track->fFirstPoint = track->fLastPoint;
3277
3278 if (track->GetNumberOfClusters()<(i1-i2)*0.5 ||
3279 track->GetNumberOfClusters()<track->fNFoundable*0.7 ||
3280 track->fNShared>2. || track->GetChi2()/track->GetNumberOfClusters()>6 || ( track->GetSigmaY2()+ track->GetSigmaZ2())>0.5 ) {
3281 seed->Reset();
3282 seed->~AliTPCseed();
3283 continue;
3284 }
3285
3286 {
3287 FollowProlongation(*track, TMath::Max(i2-10,0),1);
3288 AliTPCseed * track2 = MakeSeed(track,0.2,0.5,0.9);
3289 FollowProlongation(*track2, i2,1);
3290 track2->fBConstrain = kFALSE;
3291 track2->fSeedType = 4;
3292 arr->AddLast(track2);
3293 seed->Reset();
3294 seed->~AliTPCseed();
3295 }
3296
3297
3298 //arr->AddLast(track);
3299 //seed = new AliTPCseed;
3300 nout3++;
3301 }
3302 }
3303
6bdc18d6 3304 if (fDebug>3){
3305 Info("MakeSeeds5","\nSeeding statiistic:\t%d\t%d\t%d\t%d\t%d\t%d",nin0,nin1,nin2,nin,nout1,nout2,nout3);
91162307 3306 }
3307 delete seed;
3308}
3309
3310
3311//_____________________________________________________________________________
176aff27 3312void AliTPCtrackerMI::MakeSeeds2(TObjArray * arr, Int_t sec, Int_t i1, Int_t i2, Float_t */*cuts[4]*/,
3313 Float_t deltay, Bool_t /*bconstrain*/) {
91162307 3314 //-----------------------------------------------------------------
3315 // This function creates track seeds - without vertex constraint
3316 //-----------------------------------------------------------------
3317 // cuts[0] - fP4 cut - not applied
3318 // cuts[1] - tan(phi) cut
3319 // cuts[2] - zvertex cut - not applied
3320 // cuts[3] - fP3 cut
3321 Int_t nin0=0;
3322 Int_t nin1=0;
3323 Int_t nin2=0;
3324 Int_t nin3=0;
3325 // Int_t nin4=0;
3326 //Int_t nin5=0;
3327
3328
3329
3330 Double_t alpha=fOuterSec->GetAlpha(), shift=fOuterSec->GetAlphaShift();
3331 // Double_t cs=cos(alpha), sn=sin(alpha);
3332 Int_t row0 = (i1+i2)/2;
3333 Int_t drow = (i1-i2)/2;
3334 const AliTPCRow& kr0=fSectors[sec][row0];
3335 AliTPCRow * kr=0;
3336
3337 AliTPCpolyTrack polytrack;
3338 Int_t nclusters=fSectors[sec][row0];
3339 AliTPCseed * seed = new AliTPCseed;
3340
3341 Int_t sumused=0;
3342 Int_t cused=0;
3343 Int_t cnused=0;
3344 for (Int_t is=0; is < nclusters; is++) { //LOOP over clusters
3345 Int_t nfound =0;
3346 Int_t nfoundable =0;
3347 for (Int_t iter =1; iter<2; iter++){ //iterations
3348 const AliTPCRow& krm=fSectors[sec][row0-iter];
3349 const AliTPCRow& krp=fSectors[sec][row0+iter];
3350 const AliTPCclusterMI * cl= kr0[is];
3351
3352 if (cl->IsUsed(10)) {
3353 cused++;
3354 }
3355 else{
3356 cnused++;
3357 }
3358 Double_t x = kr0.GetX();
3359 // Initialization of the polytrack
3360 nfound =0;
3361 nfoundable =0;
3362 polytrack.Reset();
3363 //
3364 Double_t y0= cl->GetY();
3365 Double_t z0= cl->GetZ();
3366 Float_t erry = 0;
3367 Float_t errz = 0;
3368
3369 Double_t ymax = fSectors->GetMaxY(row0)-kr0.fDeadZone-1.5;
3370 if (deltay>0 && TMath::Abs(ymax-TMath::Abs(y0))> deltay ) continue; // seed only at the edge
3371
3372 erry = (0.5)*cl->GetSigmaY2()/TMath::Sqrt(cl->GetQ())*6;
3373 errz = (0.5)*cl->GetSigmaZ2()/TMath::Sqrt(cl->GetQ())*6;
3374 polytrack.AddPoint(x,y0,z0,erry, errz);
3375
3376 sumused=0;
3377 if (cl->IsUsed(10)) sumused++;
3378
3379
3380 Float_t roady = (5*TMath::Sqrt(cl->GetSigmaY2()+0.2)+1.)*iter;
3381 Float_t roadz = (5*TMath::Sqrt(cl->GetSigmaZ2()+0.2)+1.)*iter;
3382 //
3383 x = krm.GetX();
3384 AliTPCclusterMI * cl1 = krm.FindNearest(y0,z0,roady,roadz);
3385 if (cl1 && TMath::Abs(ymax-TMath::Abs(y0))) {
3386 erry = (0.5)*cl1->GetSigmaY2()/TMath::Sqrt(cl1->GetQ())*3;
3387 errz = (0.5)*cl1->GetSigmaZ2()/TMath::Sqrt(cl1->GetQ())*3;
3388 if (cl1->IsUsed(10)) sumused++;
3389 polytrack.AddPoint(x,cl1->GetY(),cl1->GetZ(),erry,errz);
3390 }
3391 //
3392 x = krp.GetX();
3393 AliTPCclusterMI * cl2 = krp.FindNearest(y0,z0,roady,roadz);
3394 if (cl2) {
3395 erry = (0.5)*cl2->GetSigmaY2()/TMath::Sqrt(cl2->GetQ())*3;
3396 errz = (0.5)*cl2->GetSigmaZ2()/TMath::Sqrt(cl2->GetQ())*3;
3397 if (cl2->IsUsed(10)) sumused++;
3398 polytrack.AddPoint(x,cl2->GetY(),cl2->GetZ(),erry,errz);
3399 }
3400 //
3401 if (sumused>0) continue;
3402 nin0++;
3403 polytrack.UpdateParameters();
3404 // follow polytrack
3405 roadz = 1.2;
3406 roady = 1.2;
3407 //
3408 Double_t yn,zn;
3409 nfoundable = polytrack.GetN();
3410 nfound = nfoundable;
3411 //
3412 for (Int_t ddrow = iter+1; ddrow<drow;ddrow++){
3413 Float_t maxdist = 0.8*(1.+3./(ddrow));
3414 for (Int_t delta = -1;delta<=1;delta+=2){
3415 Int_t row = row0+ddrow*delta;
3416 kr = &(fSectors[sec][row]);
3417 Double_t xn = kr->GetX();
3418 Double_t ymax = fSectors->GetMaxY(row)-kr->fDeadZone-1.5;
3419 polytrack.GetFitPoint(xn,yn,zn);
3420 if (TMath::Abs(yn)>ymax) continue;
3421 nfoundable++;
3422 AliTPCclusterMI * cln = kr->FindNearest(yn,zn,roady,roadz);
3423 if (cln) {
3424 Float_t dist = TMath::Sqrt( (yn-cln->GetY())*(yn-cln->GetY())+(zn-cln->GetZ())*(zn-cln->GetZ()));
3425 if (dist<maxdist){
3426 /*
3427 erry = (dist+0.3)*cln->GetSigmaY2()/TMath::Sqrt(cln->GetQ())*(1.+1./(ddrow));
3428 errz = (dist+0.3)*cln->GetSigmaZ2()/TMath::Sqrt(cln->GetQ())*(1.+1./(ddrow));
3429 if (cln->IsUsed(10)) {
3430 // printf("used\n");
3431 sumused++;
3432 erry*=2;
3433 errz*=2;
3434 }
3435 */
3436 erry=0.1;
3437 errz=0.1;
3438 polytrack.AddPoint(xn,cln->GetY(),cln->GetZ(),erry, errz);
3439 nfound++;
3440 }
3441 }
3442 }
3443 if ( (sumused>3) || (sumused>0.5*nfound) || (nfound<0.6*nfoundable)) break;
3444 polytrack.UpdateParameters();
3445 }
3446 }
3447 if ( (sumused>3) || (sumused>0.5*nfound)) {
3448 //printf("sumused %d\n",sumused);
3449 continue;
3450 }
3451 nin1++;
3452 Double_t dy,dz;
3453 polytrack.GetFitDerivation(kr0.GetX(),dy,dz);
3454 AliTPCpolyTrack track2;
3455
3456 polytrack.Refit(track2,0.5+TMath::Abs(dy)*0.3,0.4+TMath::Abs(dz)*0.3);
3457 if (track2.GetN()<0.5*nfoundable) continue;
3458 nin2++;
3459
3460 if ((nfound>0.6*nfoundable) &&( nfoundable>0.4*(i1-i2))) {
3461 //
3462 // test seed with and without constrain
3463 for (Int_t constrain=0; constrain<=0;constrain++){
3464 // add polytrack candidate
3465
3466 Double_t x[5], c[15];
3467 Double_t x1,x2,x3,y1,y2,y3,z1,z2,z3;
3468 track2.GetBoundaries(x3,x1);
3469 x2 = (x1+x3)/2.;
3470 track2.GetFitPoint(x1,y1,z1);
3471 track2.GetFitPoint(x2,y2,z2);
3472 track2.GetFitPoint(x3,y3,z3);
3473 //
3474 //is track pointing to the vertex ?
3475 Double_t x0,y0,z0;
3476 x0=0;
3477 polytrack.GetFitPoint(x0,y0,z0);
3478
3479 if (constrain) {
3480 x2 = x3;
3481 y2 = y3;
3482 z2 = z3;
3483
3484 x3 = 0;
3485 y3 = 0;
3486 z3 = 0;
3487 }
3488 x[0]=y1;
3489 x[1]=z1;
b67e07dc 3490 x[4]=F1(x1,y1,x2,y2,x3,y3);
91162307 3491
3492 // if (TMath::Abs(x[4]) >= cuts[0]) continue; //
b67e07dc 3493 x[2]=F2(x1,y1,x2,y2,x3,y3);
91162307 3494
3495 //if (TMath::Abs(x[4]*x1-x[2]) >= cuts[1]) continue;
b67e07dc 3496 //x[3]=F3(x1,y1,x2,y2,z1,z2);
3497 x[3]=F3n(x1,y1,x3,y3,z1,z3,x[4]);
91162307 3498 //if (TMath::Abs(x[3]) > cuts[3]) continue;
3499
3500
3501 Double_t sy =0.1, sz =0.1;
3502 Double_t sy1=0.02, sz1=0.02;
3503 Double_t sy2=0.02, sz2=0.02;
3504 Double_t sy3=0.02;
3505
3506 if (constrain){
3507 sy3=25000*x[4]*x[4]+0.1, sy=0.1, sz=0.1;
3508 }
3509
b67e07dc 3510 Double_t f40=(F1(x1,y1+sy,x2,y2,x3,y3)-x[4])/sy;
3511 Double_t f42=(F1(x1,y1,x2,y2+sy,x3,y3)-x[4])/sy;
3512 Double_t f43=(F1(x1,y1,x2,y2,x3,y3+sy)-x[4])/sy;
3513 Double_t f20=(F2(x1,y1+sy,x2,y2,x3,y3)-x[2])/sy;
3514 Double_t f22=(F2(x1,y1,x2,y2+sy,x3,y3)-x[2])/sy;
3515 Double_t f23=(F2(x1,y1,x2,y2,x3,y3+sy)-x[2])/sy;
3516
3517 Double_t f30=(F3(x1,y1+sy,x3,y3,z1,z3)-x[3])/sy;
3518 Double_t f31=(F3(x1,y1,x3,y3,z1+sz,z3)-x[3])/sz;
3519 Double_t f32=(F3(x1,y1,x3,y3+sy,z1,z3)-x[3])/sy;
3520 Double_t f34=(F3(x1,y1,x3,y3,z1,z3+sz)-x[3])/sz;
91162307 3521
3522
3523 c[0]=sy1;
3524 c[1]=0.; c[2]=sz1;
3525 c[3]=f20*sy1; c[4]=0.; c[5]=f20*sy1*f20+f22*sy2*f22+f23*sy3*f23;
3526 c[6]=f30*sy1; c[7]=f31*sz1; c[8]=f30*sy1*f20+f32*sy2*f22;
3527 c[9]=f30*sy1*f30+f31*sz1*f31+f32*sy2*f32+f34*sz2*f34;
3528 c[10]=f40*sy1; c[11]=0.; c[12]=f40*sy1*f20+f42*sy2*f22+f43*sy3*f23;
3529 c[13]=f30*sy1*f40+f32*sy2*f42;
3530 c[14]=f40*sy1*f40+f42*sy2*f42+f43*sy3*f43;
3531
3532 //Int_t row1 = fSectors->GetRowNumber(x1);
3533 Int_t row1 = GetRowNumber(x1);
3534
3535 UInt_t index=0;
3536 //kr0.GetIndex(is);
3537 AliTPCseed *track=new (seed) AliTPCseed(index, x, c, x1, sec*alpha+shift);
3538 track->fIsSeeding = kTRUE;
3539 Int_t rc=FollowProlongation(*track, i2);
3540 if (constrain) track->fBConstrain =1;
3541 else
3542 track->fBConstrain =0;
3543 track->fLastPoint = row1+fInnerSec->GetNRows(); // first cluster in track position
3544 track->fFirstPoint = track->fLastPoint;
3545
3546 if (rc==0 || track->GetNumberOfClusters()<(i1-i2)*0.5 ||
3547 track->GetNumberOfClusters() < track->fNFoundable*0.6 ||
3548 track->fNShared>0.4*track->GetNumberOfClusters()) {
3549 //delete track;
3550 seed->Reset();
3551 seed->~AliTPCseed();
3552 }
3553 else {
3554 arr->AddLast(track);
3555 seed = new AliTPCseed;
3556 }
3557 nin3++;
3558 }
3559 } // if accepted seed
3560 }
6bdc18d6 3561 if (fDebug>3){
3562 Info("MakeSeeds2","\nSeeding statiistic:\t%d\t%d\t%d\t%d",nin0,nin1,nin2,nin3);
91162307 3563 }
3564 delete seed;
3565}
3566
3567
3568AliTPCseed *AliTPCtrackerMI::MakeSeed(AliTPCseed *track, Float_t r0, Float_t r1, Float_t r2)
3569{
3570 //
3571 //
d26d9159 3572 //reseed using track points
91162307 3573 Int_t p0 = int(r0*track->GetNumberOfClusters()); // point 0
3574 Int_t p1 = int(r1*track->GetNumberOfClusters());
3575 Int_t p2 = int(r2*track->GetNumberOfClusters()); // last point
176aff27 3576 Int_t pp2=0;
91162307 3577 Double_t x0[3],x1[3],x2[3];
89e09524 3578 for (Int_t i=0;i<3;i++){
3579 x0[i]=-1;
3580 x1[i]=-1;
3581 x2[i]=-1;
3582 }
91162307 3583
3584 // find track position at given ratio of the length
89e09524 3585 Int_t sec0=0, sec1=0, sec2=0;
91162307 3586 Int_t index=-1;
3587 Int_t clindex;
3588 for (Int_t i=0;i<160;i++){
3589 if (track->fClusterPointer[i]){
3590 index++;
3591 AliTPCTrackerPoint *trpoint =track->GetTrackPoint(i);
3592 if ( (index<p0) || x0[0]<0 ){
3593 if (trpoint->GetX()>1){
3594 clindex = track->GetClusterIndex2(i);
3595 if (clindex>0){
3596 x0[0] = trpoint->GetX();
3597 x0[1] = trpoint->GetY();
3598 x0[2] = trpoint->GetZ();
3599 sec0 = ((clindex&0xff000000)>>24)%18;
3600 }
3601 }
3602 }
3603
3604 if ( (index<p1) &&(trpoint->GetX()>1)){
3605 clindex = track->GetClusterIndex2(i);
3606 if (clindex>0){
3607 x1[0] = trpoint->GetX();
3608 x1[1] = trpoint->GetY();
3609 x1[2] = trpoint->GetZ();
3610 sec1 = ((clindex&0xff000000)>>24)%18;
3611 }
3612 }
3613 if ( (index<p2) &&(trpoint->GetX()>1)){
3614 clindex = track->GetClusterIndex2(i);
3615 if (clindex>0){
3616 x2[0] = trpoint->GetX();
3617 x2[1] = trpoint->GetY();
3618 x2[2] = trpoint->GetZ();
3619 sec2 = ((clindex&0xff000000)>>24)%18;
3620 pp2 = i;
3621 }
3622 }
3623 }
3624 }
3625
3626 Double_t alpha, cs,sn, xx2,yy2;
3627 //
3628 alpha = (sec1-sec2)*fSectors->GetAlpha();
3629 cs = TMath::Cos(alpha);
3630 sn = TMath::Sin(alpha);
3631 xx2= x1[0]*cs-x1[1]*sn;
3632 yy2= x1[0]*sn+x1[1]*cs;
3633 x1[0] = xx2;
3634 x1[1] = yy2;
3635 //
3636 alpha = (sec0-sec2)*fSectors->GetAlpha();
3637 cs = TMath::Cos(alpha);
3638 sn = TMath::Sin(alpha);
3639 xx2= x0[0]*cs-x0[1]*sn;
3640 yy2= x0[0]*sn+x0[1]*cs;
3641 x0[0] = xx2;
3642 x0[1] = yy2;
3643 //
3644 //
3645 //
3646 Double_t x[5],c[15];
3647 //
3648 x[0]=x2[1];
3649 x[1]=x2[2];
b67e07dc 3650 x[4]=F1(x2[0],x2[1],x1[0],x1[1],x0[0],x0[1]);
91162307 3651 // if (x[4]>1) return 0;
b67e07dc 3652 x[2]=F2(x2[0],x2[1],x1[0],x1[1],x0[0],x0[1]);
3653 x[3]=F3n(x2[0],x2[1],x0[0],x0[1],x2[2],x0[2],x[4]);
91162307 3654 //if (TMath::Abs(x[3]) > 2.2) return 0;
3655 //if (TMath::Abs(x[2]) > 1.99) return 0;
3656 //
3657 Double_t sy =0.1, sz =0.1;
3658 //
3659 Double_t sy1=0.02+track->GetSigmaY2(), sz1=0.02+track->GetSigmaZ2();
3660 Double_t sy2=0.01+track->GetSigmaY2(), sz2=0.01+track->GetSigmaZ2();
3661 Double_t sy3=0.01+track->GetSigmaY2();
3662 //
b67e07dc 3663 Double_t f40=(F1(x2[0],x2[1]+sy,x1[0],x1[1],x0[0],x0[1])-x[4])/sy;
3664 Double_t f42=(F1(x2[0],x2[1],x1[0],x1[1]+sy,x0[0],x0[1])-x[4])/sy;
3665 Double_t f43=(F1(x2[0],x2[1],x1[0],x1[1],x0[0],x0[1]+sy)-x[4])/sy;
3666 Double_t f20=(F2(x2[0],x2[1]+sy,x1[0],x1[1],x0[0],x0[1])-x[2])/sy;
3667 Double_t f22=(F2(x2[0],x2[1],x1[0],x1[1]+sy,x0[0],x0[1])-x[2])/sy;
3668 Double_t f23=(F2(x2[0],x2[1],x1[0],x1[1],x0[0],x0[1]+sy)-x[2])/sy;
3669 //
3670 Double_t f30=(F3(x2[0],x2[1]+sy,x0[0],x0[1],x2[2],x0[2])-x[3])/sy;
3671 Double_t f31=(F3(x2[0],x2[1],x0[0],x0[1],x2[2]+sz,x0[2])-x[3])/sz;
3672 Double_t f32=(F3(x2[0],x2[1],x0[0],x0[1]+sy,x2[2],x0[2])-x[3])/sy;
3673 Double_t f34=(F3(x2[0],x2[1],x0[0],x0[1],x2[2],x0[2]+sz)-x[3])/sz;
91162307 3674
3675
3676 c[0]=sy1;
3677 c[1]=0.; c[2]=sz1;
3678 c[3]=f20*sy1; c[4]=0.; c[5]=f20*sy1*f20+f22*sy2*f22+f23*sy3*f23;
3679 c[6]=f30*sy1; c[7]=f31*sz1; c[8]=f30*sy1*f20+f32*sy2*f22;
3680 c[9]=f30*sy1*f30+f31*sz1*f31+f32*sy2*f32+f34*sz2*f34;
3681 c[10]=f40*sy1; c[11]=0.; c[12]=f40*sy1*f20+f42*sy2*f22+f43*sy3*f23;
3682 c[13]=f30*sy1*f40+f32*sy2*f42;
3683 c[14]=f40*sy1*f40+f42*sy2*f42+f43*sy3*f43;
3684
3685 // Int_t row1 = fSectors->GetRowNumber(x2[0]);
3686 AliTPCseed *seed=new AliTPCseed(0, x, c, x2[0], sec2*fSectors->GetAlpha()+fSectors->GetAlphaShift());
3687 // Double_t y0,z0,y1,z1, y2,z2;
3688 //seed->GetProlongation(x0[0],y0,z0);
3689 // seed->GetProlongation(x1[0],y1,z1);
3690 //seed->GetProlongation(x2[0],y2,z2);
3691 // seed =0;
3692 seed->fLastPoint = pp2;
3693 seed->fFirstPoint = pp2;
3694
3695
3696 return seed;
3697}
3698
d26d9159 3699
3700AliTPCseed *AliTPCtrackerMI::ReSeed(AliTPCseed *track, Float_t r0, Float_t r1, Float_t r2)
3701{
3702 //
3703 //
3704 //reseed using founded clusters
3705 //
3706 // Find the number of clusters
3707 Int_t nclusters = 0;
3708 for (Int_t irow=0;irow<160;irow++){
3709 if (track->GetClusterIndex(irow)>0) nclusters++;
3710 }
3711 //
3712 Int_t ipos[3];
3713 ipos[0] = TMath::Max(int(r0*nclusters),0); // point 0 cluster
3714 ipos[1] = TMath::Min(int(r1*nclusters),nclusters-1); //
3715 ipos[2] = TMath::Min(int(r2*nclusters),nclusters-1); // last point
3716 //
3717 //
3718 Double_t xyz[3][3];
3719 Int_t row[3],sec[3]={0,0,0};
3720 //
3721 // find track row position at given ratio of the length
3722 Int_t index=-1;
3723 for (Int_t irow=0;irow<160;irow++){
3724 if (track->GetClusterIndex2(irow)<0) continue;
3725 index++;
3726 for (Int_t ipoint=0;ipoint<3;ipoint++){
3727 if (index<=ipos[ipoint]) row[ipoint] = irow;
3728 }
3729 }
3730 //
3731 //Get cluster and sector position
3732 for (Int_t ipoint=0;ipoint<3;ipoint++){
3733 Int_t clindex = track->GetClusterIndex2(row[ipoint]);
3734 AliTPCclusterMI * cl = GetClusterMI(clindex);
3735 if (cl==0) {
6bdc18d6 3736 //Error("Bug\n");
47966a6d 3737 // AliTPCclusterMI * cl = GetClusterMI(clindex);
d26d9159 3738 return 0;
3739 }
3740 sec[ipoint] = ((clindex&0xff000000)>>24)%18;
3741 xyz[ipoint][0] = GetXrow(row[ipoint]);
3742 xyz[ipoint][1] = cl->GetY();
3743 xyz[ipoint][2] = cl->GetZ();
3744 }
3745 //
3746 //
3747 // Calculate seed state vector and covariance matrix
3748
3749 Double_t alpha, cs,sn, xx2,yy2;
3750 //
3751 alpha = (sec[1]-sec[2])*fSectors->GetAlpha();
3752 cs = TMath::Cos(alpha);
3753 sn = TMath::Sin(alpha);
3754 xx2= xyz[1][0]*cs-xyz[1][1]*sn;
3755 yy2= xyz[1][0]*sn+xyz[1][1]*cs;
3756 xyz[1][0] = xx2;
3757 xyz[1][1] = yy2;
3758 //
3759 alpha = (sec[0]-sec[2])*fSectors->GetAlpha();
3760 cs = TMath::Cos(alpha);
3761 sn = TMath::Sin(alpha);
3762 xx2= xyz[0][0]*cs-xyz[0][1]*sn;
3763 yy2= xyz[0][0]*sn+xyz[0][1]*cs;
3764 xyz[0][0] = xx2;
3765 xyz[0][1] = yy2;
3766 //
3767 //
3768 //
3769 Double_t x[5],c[15];
3770 //
3771 x[0]=xyz[2][1];
3772 x[1]=xyz[2][2];
3773 x[4]=F1(xyz[2][0],xyz[2][1],xyz[1][0],xyz[1][1],xyz[0][0],xyz[0][1]);
3774 x[2]=F2(xyz[2][0],xyz[2][1],xyz[1][0],xyz[1][1],xyz[0][0],xyz[0][1]);
3775 x[3]=F3n(xyz[2][0],xyz[2][1],xyz[0][0],xyz[0][1],xyz[2][2],xyz[0][2],x[4]);
3776 //
3777 Double_t sy =0.1, sz =0.1;
3778 //
3779 Double_t sy1=0.2, sz1=0.2;
3780 Double_t sy2=0.2, sz2=0.2;
3781 Double_t sy3=0.2;
3782 //
3783 Double_t f40=(F1(xyz[2][0],xyz[2][1]+sy,xyz[1][0],xyz[1][1],xyz[0][0],xyz[0][1])-x[4])/sy;
3784 Double_t f42=(F1(xyz[2][0],xyz[2][1],xyz[1][0],xyz[1][1]+sy,xyz[0][0],xyz[0][1])-x[4])/sy;
3785 Double_t f43=(F1(xyz[2][0],xyz[2][1],xyz[1][0],xyz[1][1],xyz[0][0],xyz[0][1]+sy)-x[4])/sy;
3786 Double_t f20=(F2(xyz[2][0],xyz[2][1]+sy,xyz[1][0],xyz[1][1],xyz[0][0],xyz[0][1])-x[2])/sy;
3787 Double_t f22=(F2(xyz[2][0],xyz[2][1],xyz[1][0],xyz[1][1]+sy,xyz[0][0],xyz[0][1])-x[2])/sy;
3788 Double_t f23=(F2(xyz[2][0],xyz[2][1],xyz[1][0],xyz[1][1],xyz[0][0],xyz[0][1]+sy)-x[2])/sy;
3789 //
3790 Double_t f30=(F3(xyz[2][0],xyz[2][1]+sy,xyz[0][0],xyz[0][1],xyz[2][2],xyz[0][2])-x[3])/sy;
3791 Double_t f31=(F3(xyz[2][0],xyz[2][1],xyz[0][0],xyz[0][1],xyz[2][2]+sz,xyz[0][2])-x[3])/sz;
3792 Double_t f32=(F3(xyz[2][0],xyz[2][1],xyz[0][0],xyz[0][1]+sy,xyz[2][2],xyz[0][2])-x[3])/sy;
3793 Double_t f34=(F3(xyz[2][0],xyz[2][1],xyz[0][0],xyz[0][1],xyz[2][2],xyz[0][2]+sz)-x[3])/sz;
3794
3795
3796 c[0]=sy1;
3797 c[1]=0.; c[2]=sz1;
3798 c[3]=f20*sy1; c[4]=0.; c[5]=f20*sy1*f20+f22*sy2*f22+f23*sy3*f23;
3799 c[6]=f30*sy1; c[7]=f31*sz1; c[8]=f30*sy1*f20+f32*sy2*f22;
3800 c[9]=f30*sy1*f30+f31*sz1*f31+f32*sy2*f32+f34*sz2*f34;
3801 c[10]=f40*sy1; c[11]=0.; c[12]=f40*sy1*f20+f42*sy2*f22+f43*sy3*f23;
3802 c[13]=f30*sy1*f40+f32*sy2*f42;
3803 c[14]=f40*sy1*f40+f42*sy2*f42+f43*sy3*f43;
3804
3805 // Int_t row1 = fSectors->GetRowNumber(xyz[2][0]);
3806 AliTPCseed *seed=new AliTPCseed(0, x, c, xyz[2][0], sec[2]*fSectors->GetAlpha()+fSectors->GetAlphaShift());
3807 seed->fLastPoint = row[2];
3808 seed->fFirstPoint = row[2];
3809 return seed;
3810}
3811
eea478d3 3812
3813AliTPCseed *AliTPCtrackerMI::ReSeed(AliTPCseed *track,Int_t r0, Bool_t forward)
3814{
3815 //
3816 //
3817 //reseed using founded clusters
3818 //
3819 Double_t xyz[3][3];
4a12af72 3820 Int_t row[3]={0,0,0};
3821 Int_t sec[3]={0,0,0};
eea478d3 3822 //
3823 // forward direction
3824 if (forward){
3825 for (Int_t irow=r0;irow<160;irow++){
3826 if (track->GetClusterIndex(irow)>0){
3827 row[0] = irow;
3828 break;
3829 }
3830 }
3831 for (Int_t irow=160;irow>r0;irow--){
3832 if (track->GetClusterIndex(irow)>0){
3833 row[2] = irow;
3834 break;
3835 }
3836 }
3837 for (Int_t irow=row[2]-15;irow>row[0];irow--){
3838 if (track->GetClusterIndex(irow)>0){
3839 row[1] = irow;
3840 break;
3841 }
3842 }
3843 //
3844 }
3845 if (!forward){
3846 for (Int_t irow=0;irow<r0;irow++){
3847 if (track->GetClusterIndex(irow)>0){
3848 row[0] = irow;
3849 break;
3850 }
3851 }
3852 for (Int_t irow=r0;irow>0;irow--){
3853 if (track->GetClusterIndex(irow)>0){
3854 row[2] = irow;
3855 break;
3856 }
3857 }
3858 for (Int_t irow=row[2]-15;irow>row[0];irow--){
3859 if (track->GetClusterIndex(irow)>0){
3860 row[1] = irow;
3861 break;
3862 }
3863 }
3864 }
3865 //
3866 if ((row[2]-row[0])<20) return 0;
3867 if (row[1]==0) return 0;
3868 //
3869 //
3870 //Get cluster and sector position
3871 for (Int_t ipoint=0;ipoint<3;ipoint++){
3872 Int_t clindex = track->GetClusterIndex2(row[ipoint]);
3873 AliTPCclusterMI * cl = GetClusterMI(clindex);
3874 if (cl==0) {
3875 //Error("Bug\n");
3876 // AliTPCclusterMI * cl = GetClusterMI(clindex);
3877 return 0;
3878 }
3879 sec[ipoint] = ((clindex&0xff000000)>>24)%18;
3880 xyz[ipoint][0] = GetXrow(row[ipoint]);
3881 AliTPCTrackerPoint * point = track->GetTrackPoint(row[ipoint]);
3882 if (point&&ipoint<2){
3883 //
3884 xyz[ipoint][1] = point->GetY();
3885 xyz[ipoint][2] = point->GetZ();
3886 }
3887 else{
3888 xyz[ipoint][1] = cl->GetY();
3889 xyz[ipoint][2] = cl->GetZ();
3890 }
3891 }
3892 //
3893 //
3894 //
3895 //
3896 // Calculate seed state vector and covariance matrix
3897
3898 Double_t alpha, cs,sn, xx2,yy2;
3899 //
3900 alpha = (sec[1]-sec[2])*fSectors->GetAlpha();
3901 cs = TMath::Cos(alpha);
3902 sn = TMath::Sin(alpha);
3903 xx2= xyz[1][0]*cs-xyz[1][1]*sn;
3904 yy2= xyz[1][0]*sn+xyz[1][1]*cs;
3905 xyz[1][0] = xx2;
3906 xyz[1][1] = yy2;
3907 //
3908 alpha = (sec[0]-sec[2])*fSectors->GetAlpha();
3909 cs = TMath::Cos(alpha);
3910 sn = TMath::Sin(alpha);
3911 xx2= xyz[0][0]*cs-xyz[0][1]*sn;
3912 yy2= xyz[0][0]*sn+xyz[0][1]*cs;
3913 xyz[0][0] = xx2;
3914 xyz[0][1] = yy2;
3915 //
3916 //
3917 //
3918 Double_t x[5],c[15];
3919 //
3920 x[0]=xyz[2][1];
3921 x[1]=xyz[2][2];
3922 x[4]=F1(xyz[2][0],xyz[2][1],xyz[1][0],xyz[1][1],xyz[0][0],xyz[0][1]);
3923 x[2]=F2(xyz[2][0],xyz[2][1],xyz[1][0],xyz[1][1],xyz[0][0],xyz[0][1]);
3924 x[3]=F3n(xyz[2][0],xyz[2][1],xyz[0][0],xyz[0][1],xyz[2][2],xyz[0][2],x[4]);
3925 //
3926 Double_t sy =0.1, sz =0.1;
3927 //
3928 Double_t sy1=0.2, sz1=0.2;
3929 Double_t sy2=0.2, sz2=0.2;
3930 Double_t sy3=0.2;
3931 //
3932 Double_t f40=(F1(xyz[2][0],xyz[2][1]+sy,xyz[1][0],xyz[1][1],xyz[0][0],xyz[0][1])-x[4])/sy;
3933 Double_t f42=(F1(xyz[2][0],xyz[2][1],xyz[1][0],xyz[1][1]+sy,xyz[0][0],xyz[0][1])-x[4])/sy;
3934 Double_t f43=(F1(xyz[2][0],xyz[2][1],xyz[1][0],xyz[1][1],xyz[0][0],xyz[0][1]+sy)-x[4])/sy;
3935 Double_t f20=(F2(xyz[2][0],xyz[2][1]+sy,xyz[1][0],xyz[1][1],xyz[0][0],xyz[0][1])-x[2])/sy;
3936 Double_t f22=(F2(xyz[2][0],xyz[2][1],xyz[1][0],xyz[1][1]+sy,xyz[0][0],xyz[0][1])-x[2])/sy;
3937 Double_t f23=(F2(xyz[2][0],xyz[2][1],xyz[1][0],xyz[1][1],xyz[0][0],xyz[0][1]+sy)-x[2])/sy;
3938 //
3939 Double_t f30=(F3(xyz[2][0],xyz[2][1]+sy,xyz[0][0],xyz[0][1],xyz[2][2],xyz[0][2])-x[3])/sy;
3940 Double_t f31=(F3(xyz[2][0],xyz[2][1],xyz[0][0],xyz[0][1],xyz[2][2]+sz,xyz[0][2])-x[3])/sz;
3941 Double_t f32=(F3(xyz[2][0],xyz[2][1],xyz[0][0],xyz[0][1]+sy,xyz[2][2],xyz[0][2])-x[3])/sy;
3942 Double_t f34=(F3(xyz[2][0],xyz[2][1],xyz[0][0],xyz[0][1],xyz[2][2],xyz[0][2]+sz)-x[3])/sz;
3943
3944
3945 c[0]=sy1;
3946 c[1]=0.; c[2]=sz1;
3947 c[3]=f20*sy1; c[4]=0.; c[5]=f20*sy1*f20+f22*sy2*f22+f23*sy3*f23;
3948 c[6]=f30*sy1; c[7]=f31*sz1; c[8]=f30*sy1*f20+f32*sy2*f22;
3949 c[9]=f30*sy1*f30+f31*sz1*f31+f32*sy2*f32+f34*sz2*f34;
3950 c[10]=f40*sy1; c[11]=0.; c[12]=f40*sy1*f20+f42*sy2*f22+f43*sy3*f23;
3951 c[13]=f30*sy1*f40+f32*sy2*f42;
3952 c[14]=f40*sy1*f40+f42*sy2*f42+f43*sy3*f43;
3953
3954 // Int_t row1 = fSectors->GetRowNumber(xyz[2][0]);
3955 AliTPCseed *seed=new AliTPCseed(0, x, c, xyz[2][0], sec[2]*fSectors->GetAlpha()+fSectors->GetAlphaShift());
3956 seed->fLastPoint = row[2];
3957 seed->fFirstPoint = row[2];
3958 for (Int_t i=row[0];i<row[2];i++){
3959 seed->fIndex[i] = track->fIndex[i];
3960 }
3961
3962 return seed;
3963}
3964
51ad6848 3965void AliTPCtrackerMI::FindKinks(TObjArray * array, AliESD *esd)
3966{
3967 //
3968 // find kinks
3969 //
3970 //
eea478d3 3971
51ad6848 3972 TObjArray *kinks= new TObjArray(10000);
81e97e0d 3973 // TObjArray *v0s= new TObjArray(10000);
51ad6848 3974 Int_t nentries = array->GetEntriesFast();
3975 AliHelix *helixes = new AliHelix[nentries];
3976 Int_t *sign = new Int_t[nentries];
3977 Int_t *nclusters = new Int_t[nentries];
3978 Float_t *alpha = new Float_t[nentries];
3979 AliESDkink * kink = new AliESDkink();
3980 Int_t * usage = new Int_t[nentries];
eea478d3 3981 Float_t *zm = new Float_t[nentries];
3982 Float_t *z0 = new Float_t[nentries];
3983 Float_t *fim = new Float_t[nentries];
3984 Float_t *shared = new Float_t[nentries];
3985 Bool_t *circular = new Bool_t[nentries];
81e97e0d 3986 Float_t *dca = new Float_t[nentries];
3987 //const AliESDVertex * primvertex = esd->GetVertex();
eea478d3 3988 //
3989 // nentries = array->GetEntriesFast();
3990 //
3991
51ad6848 3992 //
3993 //
3994 for (Int_t i=0;i<nentries;i++){
3995 sign[i]=0;
3996 usage[i]=0;
3997 AliTPCseed* track = (AliTPCseed*)array->At(i);
3998 if (!track) continue;
81e97e0d 3999 track->fCircular =0;
eea478d3 4000 shared[i] = kFALSE;
51ad6848 4001 track->UpdatePoints();
4002 if (( track->GetPoints()[2]- track->GetPoints()[0])>5 && track->GetPoints()[3]>0.8){
51ad6848 4003 }
eea478d3 4004 nclusters[i]=track->GetNumberOfClusters();
4005 alpha[i] = track->GetAlpha();
4006 new (&helixes[i]) AliHelix(*track);
4007 Double_t xyz[3];
4008 helixes[i].Evaluate(0,xyz);
4009 sign[i] = (track->GetC()>0) ? -1:1;
4010 Double_t x,y,z;
4011 x=160;
4012 if (track->GetProlongation(x,y,z)){
4013 zm[i] = z;
4014 fim[i] = alpha[i]+TMath::ATan2(y,x);
4015 }
4016 else{
4017 zm[i] = track->GetZ();
4018 fim[i] = alpha[i];
4019 }
4020 z0[i]=1000;
4021 circular[i]= kFALSE;
81e97e0d 4022 if (track->GetProlongation(0,y,z)) z0[i] = z;
4023 dca[i] = track->GetD(0,0);
51ad6848 4024 }
4025 //
4026 //
4027 TStopwatch timer;
4028 timer.Start();
4029 Int_t ncandidates =0;
4030 Int_t nall =0;
4031 Int_t ntracks=0;
4032 Double_t phase[2][2],radius[2];
eea478d3 4033
4034 //
4035 // Find circling track
81e97e0d 4036 TTreeSRedirector &cstream = *fDebugStreamer;
eea478d3 4037 //
4038 for (Int_t i0=0;i0<nentries;i0++){
4039 AliTPCseed * track0 = (AliTPCseed*)array->At(i0);
4040 if (!track0) continue;
4041 if (track0->fN<40) continue;
4042 if (TMath::Abs(1./track0->fP4)>200) continue;
4043 for (Int_t i1=i0+1;i1<nentries;i1++){
4044 AliTPCseed * track1 = (AliTPCseed*)array->At(i1);
4045 if (!track1) continue;
81e97e0d 4046 if (track1->fN<40) continue;
4047 if ( TMath::Abs(track1->fP3+track0->fP3)>0.1) continue;
eea478d3 4048 if (track0->fBConstrain&&track1->fBConstrain) continue;
81e97e0d 4049 if (TMath::Abs(1./track1->fP4)>200) continue;
4050 if (track1->fP4*track0->fP4>0) continue;
4051 if (track1->fP3*track0->fP3>0) continue;
eea478d3 4052 if (max(TMath::Abs(1./track0->fP4),TMath::Abs(1./track1->fP4))>190) continue;
4053 if (track0->fBConstrain&&TMath::Abs(track1->fP4)<TMath::Abs(track0->fP4)) continue; //returning - lower momenta
4054 if (track1->fBConstrain&&TMath::Abs(track0->fP4)<TMath::Abs(track1->fP4)) continue; //returning - lower momenta
4055 //
81e97e0d 4056 Float_t mindcar = TMath::Min(TMath::Abs(dca[i0]),TMath::Abs(dca[i1]));
4057 if (mindcar<5) continue;
4058 Float_t mindcaz = TMath::Min(TMath::Abs(z0[i0]-GetZ()),TMath::Abs(z0[i1]-GetZ()));
4059 if (mindcaz<5) continue;
4060 if (mindcar+mindcaz<20) continue;
4061 //
4062 //
eea478d3 4063 Float_t xc0 = helixes[i0].GetHelix(6);
4064 Float_t yc0 = helixes[i0].GetHelix(7);
4065 Float_t r0 = helixes[i0].GetHelix(8);
4066 Float_t xc1 = helixes[i1].GetHelix(6);
4067 Float_t yc1 = helixes[i1].GetHelix(7);
4068 Float_t r1 = helixes[i1].GetHelix(8);
4069
4070 Float_t rmean = (r0+r1)*0.5;
4071 Float_t delta =TMath::Sqrt((xc1-xc0)*(xc1-xc0)+(yc1-yc0)*(yc1-yc0));
81e97e0d 4072 //if (delta>30) continue;
eea478d3 4073 if (delta>rmean*0.25) continue;
4074 if (TMath::Abs(r0-r1)/rmean>0.3) continue;
4075 //
4076 Int_t npoints = helixes[i0].GetRPHIintersections(helixes[i1], phase, radius,10);
4077 if (npoints==0) continue;
4078 helixes[i0].GetClosestPhases(helixes[i1], phase);
4079 //
4080 Double_t xyz0[3];
4081 Double_t xyz1[3];
4082 Double_t hangles[3];
4083 helixes[i0].Evaluate(phase[0][0],xyz0);
4084 helixes[i1].Evaluate(phase[0][1],xyz1);
4085
4086 helixes[i0].GetAngle(phase[0][0],helixes[i1],phase[0][1],hangles);
4087 Double_t deltah[2],deltabest;
4088 if (hangles[2]<2.8) continue;
4089 /*
4090 cstream<<"C"<<track0->fLab<<track1->fLab<<
4091 track0->fP3<<track1->fP3<<
4092 track0->fP4<<track1->fP4<<
4093 delta<<rmean<<npoints<<
4094 hangles[0]<<hangles[2]<<
4095 xyz0[2]<<xyz1[2]<<radius[0]<<"\n";
4096 */
4097 if (npoints>0){
4098 Int_t ibest=0;
81e97e0d 4099 helixes[i0].ParabolicDCA(helixes[i1],phase[0][0],phase[0][1],radius[0],deltah[0],2);
eea478d3 4100 if (npoints==2){
81e97e0d 4101 helixes[i0].ParabolicDCA(helixes[i1],phase[1][0],phase[1][1],radius[1],deltah[1],2);
eea478d3 4102 if (deltah[1]<deltah[0]) ibest=1;
4103 }
4104 deltabest = TMath::Sqrt(deltah[ibest]);
4105 helixes[i0].Evaluate(phase[ibest][0],xyz0);
4106 helixes[i1].Evaluate(phase[ibest][1],xyz1);
4107 helixes[i0].GetAngle(phase[ibest][0],helixes[i1],phase[ibest][1],hangles);
81e97e0d 4108 Double_t radiusbest = TMath::Sqrt(radius[ibest]);
eea478d3 4109 //
81e97e0d 4110 if (deltabest>6) continue;
4111 if (mindcar+mindcaz<40 && (hangles[2]<3.12||deltabest>3)) continue;
eea478d3 4112 Bool_t sign =kFALSE;
81e97e0d 4113 if (hangles[2]>3.06) sign =kTRUE;
4114 //
eea478d3 4115 if (sign){
4116 circular[i0] = kTRUE;
81e97e0d 4117 circular[i1] = kTRUE;
4118 if (TMath::Abs(track0->fP4)<TMath::Abs(track1->fP4)){
4119 track0->fCircular += 1;
4120 track1->fCircular += 2;
4121 }
4122 else{
4123 track1->fCircular += 1;
4124 track0->fCircular += 2;
4125 }
4126 }
af32720d 4127 if (sign&&0){
81e97e0d 4128 //debug stream
4129 cstream<<"Curling"<<
4130 "lab0="<<track0->fLab<<
4131 "lab1="<<track1->fLab<<
4132 "Tr0.="<<track0<<
4133 "Tr1.="<<track1<<
4134 "dca0="<<dca[i0]<<
4135 "dca1="<<dca[i1]<<
4136 "mindcar="<<mindcar<<
4137 "mindcaz="<<mindcaz<<
4138 "delta="<<delta<<
4139 "rmean="<<rmean<<
4140 "npoints="<<npoints<<
4141 "hangles0="<<hangles[0]<<
4142 "hangles2="<<hangles[2]<<
4143 "xyz0="<<xyz0[2]<<
4144 "xyzz1="<<xyz1[2]<<
4145 "z0="<<z0[i0]<<
4146 "z1="<<z0[i1]<<
4147 "radius="<<radiusbest<<
4148 "deltabest="<<deltabest<<
4149 "phase0="<<phase[ibest][0]<<
4150 "phase1="<<phase[ibest][1]<<
4151 "\n";
eea478d3 4152 }
4153 }
4154 }
4155 }
4156 //
81e97e0d 4157 // Finf kinks loop
4158 //
51ad6848 4159 //
4160 for (Int_t i =0;i<nentries;i++){
4161 if (sign[i]==0) continue;
4162 AliTPCseed * track0 = (AliTPCseed*)array->At(i);
4163 ntracks++;
4164 //
4165 Double_t cradius0 = 40*40;
4166 Double_t cradius1 = 270*270;
4167 Double_t cdist1=8.;
4168 Double_t cdist2=8.;
4169 Double_t cdist3=0.55;
4170 for (Int_t j =i+1;j<nentries;j++){
4171 nall++;
4172 if (sign[j]*sign[i]<1) continue;
4173 if ( (nclusters[i]+nclusters[j])>200) continue;
4174 if ( (nclusters[i]+nclusters[j])<80) continue;
4175 if ( TMath::Abs(zm[i]-zm[j])>60.) continue;
4176 if ( TMath::Abs(fim[i]-fim[j])>0.6 && TMath::Abs(fim[i]-fim[j])<5.7 ) continue;
4177 //AliTPCseed * track1 = (AliTPCseed*)array->At(j); Double_t phase[2][2],radius[2];
4178 Int_t npoints = helixes[i].GetRPHIintersections(helixes[j], phase, radius,20);
4179 if (npoints<1) continue;
4180 // cuts on radius
4181 if (npoints==1){
4182 if (radius[0]<cradius0||radius[0]>cradius1) continue;
4183 }
4184 else{
4185 if ( (radius[0]<cradius0||radius[0]>cradius1) && (radius[1]<cradius0||radius[1]>cradius1) ) continue;
4186 }
4187 //
4188 Double_t delta1=10000,delta2=10000;
4189 // cuts on the intersection radius
4190 helixes[i].LinearDCA(helixes[j],phase[0][0],phase[0][1],radius[0],delta1);
4191 if (radius[0]<20&&delta1<1) continue; //intersection at vertex
4192 if (radius[0]<10&&delta1<3) continue; //intersection at vertex
4193 if (npoints==2){
4194 helixes[i].LinearDCA(helixes[j],phase[1][0],phase[1][1],radius[1],delta2);
4195 if (radius[1]<20&&delta2<1) continue; //intersection at vertex
4196 if (radius[1]<10&&delta2<3) continue; //intersection at vertex
4197 }
4198 //
4199 Double_t distance1 = TMath::Min(delta1,delta2);
4200 if (distance1>cdist1) continue; // cut on DCA linear approximation
4201 //
4202 npoints = helixes[i].GetRPHIintersections(helixes[j], phase, radius,20);
4203 helixes[i].ParabolicDCA(helixes[j],phase[0][0],phase[0][1],radius[0],delta1);
4204 if (radius[0]<20&&delta1<1) continue; //intersection at vertex
4205 if (radius[0]<10&&delta1<3) continue; //intersection at vertex
4206 //
4207 if (npoints==2){
4208 helixes[i].ParabolicDCA(helixes[j],phase[1][0],phase[1][1],radius[1],delta2);
4209 if (radius[1]<20&&delta2<1) continue; //intersection at vertex
4210 if (radius[1]<10&&delta2<3) continue; //intersection at vertex
4211 }
4212 distance1 = TMath::Min(delta1,delta2);
4213 Float_t rkink =0;
4214 if (delta1<delta2){
4215 rkink = TMath::Sqrt(radius[0]);
4216 }
4217 else{
4218 rkink = TMath::Sqrt(radius[1]);
4219 }
4220 if (distance1>cdist2) continue;
4221 //
4222 //
4223 AliTPCseed * track1 = (AliTPCseed*)array->At(j);
4224 //
4225 //
4226 Int_t row0 = GetRowNumber(rkink);
4227 if (row0<10) continue;
4228 if (row0>150) continue;
4229 //
4230 //
4231 Float_t dens00=-1,dens01=-1;
4232 Float_t dens10=-1,dens11=-1;
4233 //
4234 Int_t found,foundable,shared;
4235 track0->GetClusterStatistic(0,row0-5, found, foundable,shared,kFALSE);
4236 if (foundable>5) dens00 = Float_t(found)/Float_t(foundable);
4237 track0->GetClusterStatistic(row0+5,155, found, foundable,shared,kFALSE);
4238 if (foundable>5) dens01 = Float_t(found)/Float_t(foundable);
4239 //
4240 track1->GetClusterStatistic(0,row0-5, found, foundable,shared,kFALSE);
4241 if (foundable>10) dens10 = Float_t(found)/Float_t(foundable);
4242 track1->GetClusterStatistic(row0+5,155, found, foundable,shared,kFALSE);
4243 if (foundable>10) dens11 = Float_t(found)/Float_t(foundable);
eea478d3 4244 //
51ad6848 4245 if (dens00<dens10 && dens01<dens11) continue;
4246 if (dens00>dens10 && dens01>dens11) continue;
4247 if (TMath::Max(dens00,dens10)<0.1) continue;
4248 if (TMath::Max(dens01,dens11)<0.3) continue;
4249 //
4250 if (TMath::Min(dens00,dens10)>0.6) continue;
4251 if (TMath::Min(dens01,dens11)>0.6) continue;
4252
4253 //
4254 AliTPCseed * ktrack0, *ktrack1;
4255 if (dens00>dens10){
4256 ktrack0 = track0;
4257 ktrack1 = track1;
4258 }
4259 else{
4260 ktrack0 = track1;
4261 ktrack1 = track0;
4262 }
4263 if (TMath::Abs(ktrack0->GetC())>5) continue; // cut on the curvature for mother particle
4264 AliExternalTrackParam paramm(*ktrack0);
4265 AliExternalTrackParam paramd(*ktrack1);
c9ec41e8 4266 if (row0>60&&ktrack1->GetReference().GetX()>90.) new (&paramd) AliExternalTrackParam(ktrack1->GetReference());
51ad6848 4267 //
4268 //
4269 kink->SetMother(paramm);
4270 kink->SetDaughter(paramd);
4271 kink->Update();
4272
eea478d3 4273 Float_t x[3] = { kink->GetPosition()[0],kink->GetPosition()[1],kink->GetPosition()[2]};
51ad6848 4274 Int_t index[4];
4275 fParam->Transform0to1(x,index);
4276 fParam->Transform1to2(x,index);
4277 row0 = GetRowNumber(x[0]);
4278
eea478d3 4279 if (kink->GetR()<100) continue;
4280 if (kink->GetR()>240) continue;
4281 if (kink->GetPosition()[2]/kink->GetR()>AliTPCReconstructor::GetCtgRange()) continue; //out of fiducial volume
4282 if (kink->GetDistance()>cdist3) continue;
4283 Float_t dird = kink->GetDaughterP()[0]*kink->GetPosition()[0]+kink->GetDaughterP()[1]*kink->GetPosition()[1]; // rough direction estimate
51ad6848 4284 if (dird<0) continue;
4285
eea478d3 4286 Float_t dirm = kink->GetMotherP()[0]*kink->GetPosition()[0]+kink->GetMotherP()[1]*kink->GetPosition()[1]; // rough direction estimate
51ad6848 4287 if (dirm<0) continue;
eea478d3 4288 Float_t mpt = TMath::Sqrt(kink->GetMotherP()[0]*kink->GetMotherP()[0]+kink->GetMotherP()[1]*kink->GetMotherP()[1]);
51ad6848 4289 if (mpt<0.2) continue;
4290
eea478d3 4291 if (mpt<1){
4292 //for high momenta momentum not defined well in first iteration
4293 Double_t qt = TMath::Sin(kink->GetAngle(2))*ktrack1->P();
4294 if (qt>0.35) continue;
4295 }
51ad6848 4296
eea478d3 4297 kink->SetLabel(CookLabel(ktrack0,0.4,0,row0),0);
4298 kink->SetLabel(CookLabel(ktrack1,0.4,row0,160),1);
51ad6848 4299 if (dens00>dens10){
eea478d3 4300 kink->SetTPCDensity(dens00,0,0);
4301 kink->SetTPCDensity(dens01,0,1);
4302 kink->SetTPCDensity(dens10,1,0);
4303 kink->SetTPCDensity(dens11,1,1);
4304 kink->SetIndex(i,0);
4305 kink->SetIndex(j,1);
51ad6848 4306 }
4307 else{
eea478d3 4308 kink->SetTPCDensity(dens10,0,0);
4309 kink->SetTPCDensity(dens11,0,1);
4310 kink->SetTPCDensity(dens00,1,0);
4311 kink->SetTPCDensity(dens01,1,1);
4312 kink->SetIndex(j,0);
4313 kink->SetIndex(i,1);
51ad6848 4314 }
51ad6848 4315
eea478d3 4316 if (mpt<1||kink->GetAngle(2)>0.1){
4317 // angle and densities not defined yet
4318 if (kink->GetTPCDensityFactor()<0.8) continue;
4319 if ((2-kink->GetTPCDensityFactor())*kink->GetDistance() >0.25) continue;
4320 if (kink->GetAngle(2)*ktrack0->P()<0.003) continue; //too small angle
4321 if (kink->GetAngle(2)>0.2&&kink->GetTPCDensityFactor()<1.15) continue;
4322 if (kink->GetAngle(2)>0.2&&kink->GetTPCDensity(0,1)>0.05) continue;
4323
4324 Float_t criticalangle = track0->fC22+track0->fC33;
4325 criticalangle+= track1->fC22+track1->fC33;
4326 criticalangle= 3*TMath::Sqrt(criticalangle);
4327 if (criticalangle>0.02) criticalangle=0.02;
4328 if (kink->GetAngle(2)<criticalangle) continue;
4329 }
51ad6848 4330 //
eea478d3 4331 Int_t drow = Int_t(2.+0.5/(0.05+kink->GetAngle(2))); // overlap region defined
51ad6848 4332 Float_t shapesum =0;
4333 Float_t sum = 0;
4334 for ( Int_t row = row0-drow; row<row0+drow;row++){
4335 if (row<0) continue;
4336 if (row>155) continue;
4337 if (ktrack0->fClusterPointer[row]){
4338 AliTPCTrackerPoint *point =ktrack0->GetTrackPoint(row);
4339 shapesum+=point->GetSigmaY()+point->GetSigmaZ();
4340 sum++;
4341 }
4342 if (ktrack1->fClusterPointer[row]){
4343 AliTPCTrackerPoint *point =ktrack1->GetTrackPoint(row);
4344 shapesum+=point->GetSigmaY()+point->GetSigmaZ();
4345 sum++;
4346 }
4347 }
4348 if (sum<4){
eea478d3 4349 kink->SetShapeFactor(-1.);
51ad6848 4350 }
4351 else{
eea478d3 4352 kink->SetShapeFactor(shapesum/sum);
4353 }
51ad6848 4354 // esd->AddKink(kink);
4355 kinks->AddLast(kink);
4356 kink = new AliESDkink;
4357 ncandidates++;
4358 }
4359 }
eea478d3 4360 //
4361 // sort the kinks according quality - and refit them towards vertex
4362 //
4363 Int_t nkinks = kinks->GetEntriesFast();
4364 Float_t *quality = new Float_t[nkinks];
4365 Int_t *indexes = new Int_t[nkinks];
4366 AliTPCseed *mothers = new AliTPCseed[nkinks];
4367 AliTPCseed *daughters = new AliTPCseed[nkinks];
4368 //
4369 //
51ad6848 4370 for (Int_t i=0;i<nkinks;i++){
4371 quality[i] =100000;
4372 AliESDkink *kink = (AliESDkink*)kinks->At(i);
eea478d3 4373 //
4374 // refit kinks towards vertex
4375 //
4376 Int_t index0 = kink->GetIndex(0);
4377 Int_t index1 = kink->GetIndex(1);
4378 AliTPCseed * ktrack0 = (AliTPCseed*)array->At(index0);
4379 AliTPCseed * ktrack1 = (AliTPCseed*)array->At(index1);
4380 //
4381 Int_t sumn=ktrack0->fN+ktrack1->fN;
4382 //
4383 // Refit Kink under if too small angle
4384 //
4385 if (kink->GetAngle(2)<0.05){
4386 kink->SetTPCRow0(GetRowNumber(kink->GetR()));
4387 Int_t row0 = kink->GetTPCRow0();
4388 Int_t drow = Int_t(2.+0.5/(0.05+kink->GetAngle(2)));
4389 //
4390 //
4391 Int_t last = row0-drow;
4392 if (last<40) last=40;
4393 if (last<ktrack0->fFirstPoint+25) last = ktrack0->fFirstPoint+25;
4394 AliTPCseed* seed0 = ReSeed(ktrack0,last,kFALSE);
4395 //
4396 //
4397 Int_t first = row0+drow;
4398 if (first>130) first=130;
4399 if (first>ktrack1->fLastPoint-25) first = TMath::Max(ktrack1->fLastPoint-25,30);
4400 AliTPCseed* seed1 = ReSeed(ktrack1,first,kTRUE);
4401 //
4402 if (seed0 && seed1){
4403 kink->SetStatus(1,8);
4404 if (RefitKink(*seed0,*seed1,*kink)) kink->SetStatus(1,9);
4405 row0 = GetRowNumber(kink->GetR());
4406 sumn = seed0->fN+seed1->fN;
4407 new (&mothers[i]) AliTPCseed(*seed0);
4408 new (&daughters[i]) AliTPCseed(*seed1);
4409 }
4410 else{
4411 delete kinks->RemoveAt(i);
4412 if (seed0) delete seed0;
4413 if (seed1) delete seed1;
4414 continue;
4415 }
4416 if (kink->GetDistance()>0.5 || kink->GetR()<110 || kink->GetR()>240) {
4417 delete kinks->RemoveAt(i);
4418 if (seed0) delete seed0;
4419 if (seed1) delete seed1;
4420 continue;
4421 }
4422 //
4423 delete seed0;
4424 delete seed1;
4425 }
4426 //
4427 if (kink) quality[i] = 160*((0.1+kink->GetDistance())*(2.-kink->GetTPCDensityFactor()))/(sumn+40.); //the longest -clossest will win
51ad6848 4428 }
4429 TMath::Sort(nkinks,quality,indexes,kFALSE);
eea478d3 4430 //
4431 //remove double find kinks
4432 //
4433 for (Int_t ikink0=1;ikink0<nkinks;ikink0++){
4434 AliESDkink * kink0 = (AliESDkink*) kinks->At(indexes[ikink0]);
4435 if (!kink0) continue;
4436 //
4437 for (Int_t ikink1=0;ikink1<ikink0;ikink1++){
4438 if (!kink0) continue;
4439 AliESDkink * kink1 = (AliESDkink*) kinks->At(indexes[ikink1]);
4440 if (!kink1) continue;
4441 // if not close kink continue
4442 if (TMath::Abs(kink1->GetPosition()[2]-kink0->GetPosition()[2])>10) continue;
4443 if (TMath::Abs(kink1->GetPosition()[1]-kink0->GetPosition()[1])>10) continue;
4444 if (TMath::Abs(kink1->GetPosition()[0]-kink0->GetPosition()[0])>10) continue;
4445 //
4446 AliTPCseed &mother0 = mothers[indexes[ikink0]];
4447 AliTPCseed &daughter0 = daughters[indexes[ikink0]];
4448 AliTPCseed &mother1 = mothers[indexes[ikink1]];
4449 AliTPCseed &daughter1 = daughters[indexes[ikink1]];
4450 Int_t row0 = (kink0->GetTPCRow0()+kink1->GetTPCRow0())/2;
4451 //
4452 Int_t same = 0;
4453 Int_t both = 0;
4454 Int_t samem = 0;
4455 Int_t bothm = 0;
4456 Int_t samed = 0;
4457 Int_t bothd = 0;
4458 //
4459 for (Int_t i=0;i<row0;i++){
4460 if (mother0.fIndex[i]>0 && mother1.fIndex[i]>0){
4461 both++;
4462 bothm++;
4463 if (mother0.fIndex[i]==mother1.fIndex[i]){
4464 same++;
4465 samem++;
4466 }
4467 }
4468 }
4469
4470 for (Int_t i=row0;i<158;i++){
4471 if (daughter0.fIndex[i]>0 && daughter0.fIndex[i]>0){
4472 both++;
4473 bothd++;
4474 if (mother0.fIndex[i]==mother1.fIndex[i]){
4475 same++;
4476 samed++;
4477 }
4478 }
4479 }
4480 Float_t ratio = Float_t(same+1)/Float_t(both+1);
4481 Float_t ratiom = Float_t(samem+1)/Float_t(bothm+1);
4482 Float_t ratiod = Float_t(samed+1)/Float_t(bothd+1);
4483 if (ratio>0.3 && ratiom>0.5 &&ratiod>0.5) {
4484 Int_t sum0 = mother0.fN+daughter0.fN;
4485 Int_t sum1 = mother1.fN+daughter1.fN;
4486 if (sum1>sum0){
4487 shared[kink0->GetIndex(0)]= kTRUE;
4488 shared[kink0->GetIndex(1)]= kTRUE;
4489 delete kinks->RemoveAt(indexes[ikink0]);
4490 }
4491 else{
4492 shared[kink1->GetIndex(0)]= kTRUE;
4493 shared[kink1->GetIndex(1)]= kTRUE;
4494 delete kinks->RemoveAt(indexes[ikink1]);
4495 }
4496 }
4497 }
4498 }
4499
4500
51ad6848 4501 for (Int_t i=0;i<nkinks;i++){
4502 AliESDkink * kink = (AliESDkink*) kinks->At(indexes[i]);
eea478d3 4503 if (!kink) continue;
4504 kink->SetTPCRow0(GetRowNumber(kink->GetR()));
4505 Int_t index0 = kink->GetIndex(0);
4506 Int_t index1 = kink->GetIndex(1);
4507 if (circular[index0]||circular[index1]&&kink->GetDistance()>0.2) continue;
4508 kink->SetMultiple(usage[index0],0);
4509 kink->SetMultiple(usage[index1],1);
4510 if (kink->GetMultiple()[0]+kink->GetMultiple()[1]>2) continue;
4511 if (kink->GetMultiple()[0]+kink->GetMultiple()[1]>0 && quality[indexes[i]]>0.2) continue;
4512 if (kink->GetMultiple()[0]+kink->GetMultiple()[1]>0 && kink->GetDistance()>0.2) continue;
4513 if (circular[index0]||circular[index1]&&kink->GetDistance()>0.1) continue;
51ad6848 4514
51ad6848 4515 AliTPCseed * ktrack0 = (AliTPCseed*)array->At(index0);
4516 AliTPCseed * ktrack1 = (AliTPCseed*)array->At(index1);
eea478d3 4517 if (!ktrack0 || !ktrack1) continue;
4518 Int_t index = esd->AddKink(kink);
4519 //
4520 //
4521 if ( ktrack0->fKinkIndexes[0]==0 && ktrack1->fKinkIndexes[0]==0) { //best kink
4522 if (mothers[indexes[i]].fN>20 && daughters[indexes[i]].fN>20 && (mothers[indexes[i]].fN+daughters[indexes[i]].fN)>100){
4523 new (ktrack0) AliTPCseed(mothers[indexes[i]]);
4524 new (ktrack1) AliTPCseed(daughters[indexes[i]]);
4525 }
4526 }
4527 //
51ad6848 4528 ktrack0->fKinkIndexes[usage[index0]] = -(index+1);
4529 ktrack1->fKinkIndexes[usage[index1]] = (index+1);
4530 usage[index0]++;
4531 usage[index1]++;
4532 }
eea478d3 4533 //
4534 // Remove tracks corresponding to shared kink's
4535 //
4536 for (Int_t i=0;i<nentries;i++){
4537 AliTPCseed * track0 = (AliTPCseed*)array->At(i);
4538 if (!track0) continue;
4539 if (track0->fKinkIndexes[0]!=0) continue;
4540 if (shared[i]) delete array->RemoveAt(i);
4541 }
51ad6848 4542
eea478d3 4543 //
4544 //
4545 RemoveUsed2(array,0.5,0.4,30);
4546 UnsignClusters();
81e97e0d 4547 for (Int_t i=0;i<nentries;i++){
4548 AliTPCseed * track0 = (AliTPCseed*)array->At(i);
4549 if (!track0) continue;
4550 track0->CookdEdx(0.02,0.6);
4551 track0->CookPID();
4552 }
eea478d3 4553 //
4554 for (Int_t i=0;i<nentries;i++){
4555 AliTPCseed * track0 = (AliTPCseed*)array->At(i);
4556 if (!track0) continue;
4557 if (track0->Pt()<1.4) continue;
4558 //remove double high momenta tracks - overlapped with kink candidates
4559 Int_t shared=0;
4560 Int_t all =0;
4561 for (Int_t icl=track0->fFirstPoint;icl<track0->fLastPoint; icl++){
4562 if (track0->fClusterPointer[icl]!=0){
4563 all++;
4564 if (track0->fClusterPointer[icl]->IsUsed(10)) shared++;
4565 }
4566 }
4567 if (Float_t(shared+1)/Float_t(nall+1)>0.5) {
4568 delete array->RemoveAt(i);
4569 }
4570 //
4571 if (track0->fKinkIndexes[0]!=0) continue;
4572 if (track0->GetNumberOfClusters()<80) continue;
4a12af72 4573
4574 AliTPCseed *pmother = new AliTPCseed();
4575 AliTPCseed *pdaughter = new AliTPCseed();
4576 AliESDkink *pkink = new AliESDkink;
4577
4578 AliTPCseed & mother = *pmother;
4579 AliTPCseed & daughter = *pdaughter;
4580 AliESDkink & kink = *pkink;
eea478d3 4581 if (CheckKinkPoint(track0,mother,daughter, kink)){
4a12af72 4582 if (mother.fN<30||daughter.fN<20) {
4583 delete pmother;
4584 delete pdaughter;
4585 delete pkink;
4586 continue; //too short tracks
4587 }
4588 if (mother.Pt()<1.4) {
4589 delete pmother;
4590 delete pdaughter;
4591 delete pkink;
4592 continue;
4593 }
eea478d3 4594 Int_t row0= kink.GetTPCRow0();
4595 if (kink.GetDistance()>0.5 || kink.GetR()<110. || kink.GetR()>240.) {
4a12af72 4596 delete pmother;
4597 delete pdaughter;
4598 delete pkink;
eea478d3 4599 continue;
4600 }
4601 //
4602 Int_t index = esd->AddKink(&kink);
4603 mother.fKinkIndexes[0] = -(index+1);
4604 daughter.fKinkIndexes[0] = index+1;
4605 if (mother.fN>50) {
4606 delete array->RemoveAt(i);
4607 array->AddAt(new AliTPCseed(mother),i);
4608 }
4609 else{
4610 array->AddLast(new AliTPCseed(mother));
4611 }
4612 array->AddLast(new AliTPCseed(daughter));
4613 for (Int_t icl=0;icl<row0;icl++) {
4614 if (mother.fClusterPointer[icl]) mother.fClusterPointer[icl]->Use(20);
4615 }
4616 //
4617 for (Int_t icl=row0;icl<158;icl++) {
4618 if (daughter.fClusterPointer[icl]) daughter.fClusterPointer[icl]->Use(20);
4619 }
4620 //
4621 }
4a12af72 4622 delete pmother;
4623 delete pdaughter;
4624 delete pkink;
eea478d3 4625 }
4626
4627 delete [] daughters;
4628 delete [] mothers;
4629 //
4630 //
81e97e0d 4631 delete [] dca;
eea478d3 4632 delete []circular;
4633 delete []shared;
4634 delete []quality;
4635 delete []indexes;
4636 //
4637 delete kink;
4638 delete[]fim;
51ad6848 4639 delete[] zm;
eea478d3 4640 delete[] z0;
51ad6848 4641 delete [] usage;
4642 delete[] alpha;
4643 delete[] nclusters;
4644 delete[] sign;
4645 delete[] helixes;
4646 kinks->Delete();
4647 delete kinks;
4648
eea478d3 4649 printf("Ncandidates=\t%d\t%d\t%d\t%d\n",esd->GetNumberOfKinks(),ncandidates,ntracks,nall);
51ad6848 4650 timer.Print();
4651}
4652
81e97e0d 4653void AliTPCtrackerMI::FindV0s(TObjArray * array, AliESD *esd)
4654{
4655 //
4656 // find V0s
4657 //
4658 //
4659 TObjArray *tpcv0s = new TObjArray(100000);
4660 Int_t nentries = array->GetEntriesFast();
4661 AliHelix *helixes = new AliHelix[nentries];
4662 Int_t *sign = new Int_t[nentries];
4663 Float_t *alpha = new Float_t[nentries];
4664 Float_t *z0 = new Float_t[nentries];
4665 Float_t *dca = new Float_t[nentries];
4666 Float_t *sdcar = new Float_t[nentries];
4667 Float_t *cdcar = new Float_t[nentries];
4668 Float_t *pulldcar = new Float_t[nentries];
4669 Float_t *pulldcaz = new Float_t[nentries];
4670 Float_t *pulldca = new Float_t[nentries];
4671 Bool_t *isPrim = new Bool_t[nentries];
4672 const AliESDVertex * primvertex = esd->GetVertex();
4673 Double_t zvertex = primvertex->GetZv();
4674 //
4675 // nentries = array->GetEntriesFast();
4676 //
4677 for (Int_t i=0;i<nentries;i++){
4678 sign[i]=0;
4679 isPrim[i]=0;
4680 AliTPCseed* track = (AliTPCseed*)array->At(i);
4681 if (!track) continue;
4682 track->GetV0Indexes()[0] = 0; //rest v0 indexes
4683 track->GetV0Indexes()[1] = 0; //rest v0 indexes
4684 track->GetV0Indexes()[2] = 0; //rest v0 indexes
4685 //
4686 alpha[i] = track->GetAlpha();
4687 new (&helixes[i]) AliHelix(*track);
4688 Double_t xyz[3];
4689 helixes[i].Evaluate(0,xyz);
4690 sign[i] = (track->GetC()>0) ? -1:1;
4691 Double_t x,y,z;
4692 x=160;
4693 z0[i]=1000;
4694 if (track->GetProlongation(0,y,z)) z0[i] = z;
4695 dca[i] = track->GetD(0,0);
4696 //
4697 // dca error parrameterezation + pulls
4698 //
4699 sdcar[i] = TMath::Sqrt(0.150*0.150+(100*track->fP4)*(100*track->fP4));
4700 if (TMath::Abs(track->fP3)>1) sdcar[i]*=2.5;
4701 cdcar[i] = TMath::Exp((TMath::Abs(track->fP4)-0.0106)*525.3);
4702 pulldcar[i] = (dca[i]-cdcar[i])/sdcar[i];
4703 pulldcaz[i] = (z0[i]-zvertex)/sdcar[i];
4704 pulldca[i] = TMath::Sqrt(pulldcar[i]*pulldcar[i]+pulldcaz[i]*pulldcaz[i]);
4705 if (track->fTPCr[1]+track->fTPCr[2]+track->fTPCr[3]>0.5) {
4706 if (pulldca[i]<3.) isPrim[i]=kTRUE; //pion, muon and Kaon 3 sigma cut
4707 }
4708 if (track->fTPCr[4]>0.5) {
4709 if (pulldca[i]<0.5) isPrim[i]=kTRUE; //proton 0.5 sigma cut
4710 }
4711 if (track->fTPCr[0]>0.4) {
4712 isPrim[i]=kFALSE; //electron no sigma cut
4713 }
4714 }
4715 //
4716 //
4717 TStopwatch timer;
4718 timer.Start();
4719 Int_t ncandidates =0;
4720 Int_t nall =0;
4721 Int_t ntracks=0;
4722 Double_t phase[2][2],radius[2];
4723 //
4724 // Finf V0s loop
4725 //
4726 //
4727 // //
4728 TTreeSRedirector &cstream = *fDebugStreamer;
4729 Float_t fprimvertex[3]={GetX(),GetY(),GetZ()};
4730 AliESDV0MI vertex;
4731 Double_t cradius0 = 10*10;
4732 Double_t cradius1 = 200*200;
4733 Double_t cdist1=3.;
4734 Double_t cdist2=4.;
4735 Double_t cpointAngle = 0.95;
4736 //
4737 Double_t delta[2]={10000,10000};
4738 for (Int_t i =0;i<nentries;i++){
4739 if (sign[i]==0) continue;
4740 AliTPCseed * track0 = (AliTPCseed*)array->At(i);
4741 if (!track0) continue;
4742 cstream<<"Tracks"<<
4743 "Tr0.="<<track0<<
4744 "dca="<<dca[i]<<
4745 "z0="<<z0[i]<<
4746 "zvertex="<<zvertex<<
4747 "sdcar0="<<sdcar[i]<<
4748 "cdcar0="<<cdcar[i]<<
4749 "pulldcar0="<<pulldcar[i]<<
4750 "pulldcaz0="<<pulldcaz[i]<<
4751 "pulldca0="<<pulldca[i]<<
4752 "isPrim="<<isPrim[i]<<
4753 "\n";
4754 //
4755 if (track0->fP4<0) continue;
4756 if (track0->GetKinkIndex(0)>0||isPrim[i]) continue; //daughter kink
4757 //
4758 if (TMath::Abs(helixes[i].GetHelix(4))<0.000000001) continue;
4759 ntracks++;
4760 // debug output
4761
4762
4763 for (Int_t j =0;j<nentries;j++){
4764 AliTPCseed * track1 = (AliTPCseed*)array->At(j);
4765 if (!track1) continue;
4766 if (track1->GetKinkIndex(0)>0 || isPrim[j]) continue; //daughter kink
4767 if (sign[j]*sign[i]>0) continue;
4768 if (TMath::Abs(helixes[j].GetHelix(4))<0.000001) continue;
4769 if (track0->fCircular+track1->fCircular>1) continue; //circling -returning track
4770 nall++;
4771 //
4772 // DCA to prim vertex cut
4773 //
4774 //
4775 delta[0]=10000;
4776 delta[1]=10000;
4777
4778 Int_t npoints = helixes[i].GetRPHIintersections(helixes[j], phase, radius,cdist2);
4779 if (npoints<1) continue;
4780 Int_t iclosest=0;
4781 // cuts on radius
4782 if (npoints==1){
4783 if (radius[0]<cradius0||radius[0]>cradius1) continue;
4784 helixes[i].LinearDCA(helixes[j],phase[0][0],phase[0][1],radius[0],delta[0]);
4785 if (delta[0]>cdist1) continue;
4786 }
4787 else{
4788 if (TMath::Max(radius[0],radius[1])<cradius0|| TMath::Min(radius[0],radius[1])>cradius1) continue;
4789 helixes[i].LinearDCA(helixes[j],phase[0][0],phase[0][1],radius[0],delta[0]);
4790 helixes[i].LinearDCA(helixes[j],phase[1][0],phase[1][1],radius[1],delta[1]);
4791 if (delta[1]<delta[0]) iclosest=1;
4792 if (delta[iclosest]>cdist1) continue;
4793 }
4794 helixes[i].ParabolicDCA(helixes[j],phase[iclosest][0],phase[iclosest][1],radius[iclosest],delta[iclosest]);
4795 if (radius[iclosest]<cradius0 || radius[iclosest]>cradius1 || delta[iclosest]>cdist1) continue;
4796 //
4797 Double_t pointAngle = helixes[i].GetPointAngle(helixes[j],phase[iclosest],fprimvertex);
4798 if (pointAngle<cpointAngle) continue;
4799 //
4800 Bool_t isGamma = kFALSE;
4801 vertex.SetP(*track0); //track0 - plus
4802 vertex.SetM(*track1); //track1 - minus
4803 vertex.Update(fprimvertex);
4804 if (track0->fTPCr[0]>0.3&&track1->fTPCr[0]>0.3&&vertex.GetAnglep()[2]<0.15) isGamma=kTRUE; // gamma conversion candidate
4805 Double_t pointAngle2 = vertex.GetPointAngle();
4806 //continue;
4807 if (vertex.GetPointAngle()<cpointAngle && (!isGamma)) continue; // point angle cut
4808 if (vertex.GetDist2()>2&&(!isGamma)) continue; // point angle cut
4809 Float_t sigmae = 0.15*0.15;
4810 if (vertex.GetRr()<80)
4811 sigmae += (sdcar[i]*sdcar[i]+sdcar[j]*sdcar[j])*(1.-vertex.GetRr()/80.)*(1.-vertex.GetRr()/80.);
4812 sigmae+= TMath::Sqrt(sigmae);
4813 if (vertex.GetDist2()/sigmae>3.&&(!isGamma)) continue;
4814 Float_t densb0=0,densb1=0,densa0=0,densa1=0;
4815 Int_t row0 = GetRowNumber(vertex.GetRr());
4816 if (row0>15){
4817 if (vertex.GetDist2()>0.2) continue;
4818 densb0 = track0->Density2(0,row0-5);
4819 densb1 = track1->Density2(0,row0-5);
4820 if (densb0>0.3|| densb1>0.3) continue; //clusters before vertex
4821 densa0 = track0->Density2(row0+5,row0+40);
4822 densa1 = track1->Density2(row0+5,row0+40);
4823 if ((densa0<0.4|| densa1<0.4)&&(!isGamma)) continue; //missing clusters after vertex
4824 }
4825 else{
4826 densa0 = track0->Density2(0,40); //cluster density
4827 densa1 = track1->Density2(0,40); //cluster density
4828 if ((vertex.GetRr()<80&&densa0+densa1<1.)&&(!isGamma)) continue;
4829 }
4830 vertex.SetLab(0,track0->GetLabel());
4831 vertex.SetLab(1,track1->GetLabel());
4832 vertex.SetChi2After((densa0+densa1)*0.5);
4833 vertex.SetChi2Before((densb0+densb1)*0.5);
4834 vertex.SetIndex(0,i);
4835 vertex.SetIndex(1,j);
4836 vertex.SetStatus(1); // TPC v0 candidate
4837 vertex.SetRp(track0->fTPCr);
4838 vertex.SetRm(track1->fTPCr);
4839 tpcv0s->AddLast(new AliESDV0MI(vertex));
4840 ncandidates++;
4841 {
4842 Int_t eventNr = esd->GetEventNumber();
4843 Double_t radiusm= (delta[0]<delta[1])? TMath::Sqrt(radius[0]):TMath::Sqrt(radius[1]);
4844 Double_t deltam= (delta[0]<delta[1])? TMath::Sqrt(delta[0]):TMath::Sqrt(delta[1]);
4845 cstream<<"V0"<<
4846 "Event="<<eventNr<<
4847 "vertex.="<<&vertex<<
4848 "Tr0.="<<track0<<
4849 "lab0="<<track0->fLab<<
4850 "Helix0.="<<&helixes[i]<<
4851 "Tr1.="<<track1<<
4852 "lab1="<<track1->fLab<<
4853 "Helix1.="<<&helixes[j]<<
4854 "pointAngle="<<pointAngle<<
4855 "pointAngle2="<<pointAngle2<<
4856 "dca0="<<dca[i]<<
4857 "dca1="<<dca[j]<<
4858 "z0="<<z0[i]<<
4859 "z1="<<z0[j]<<
4860 "zvertex="<<zvertex<<
4861 "circular0="<<track0->fCircular<<
4862 "circular1="<<track1->fCircular<<
4863 "npoints="<<npoints<<
4864 "radius0="<<radius[0]<<
4865 "delta0="<<delta[0]<<
4866 "radius1="<<radius[1]<<
4867 "delta1="<<delta[1]<<
4868 "radiusm="<<radiusm<<
4869 "deltam="<<deltam<<
4870 "sdcar0="<<sdcar[i]<<
4871 "sdcar1="<<sdcar[j]<<
4872 "cdcar0="<<cdcar[i]<<
4873 "cdcar1="<<cdcar[j]<<
4874 "pulldcar0="<<pulldcar[i]<<
4875 "pulldcar1="<<pulldcar[j]<<
4876 "pulldcaz0="<<pulldcaz[i]<<
4877 "pulldcaz1="<<pulldcaz[j]<<
4878 "pulldca0="<<pulldca[i]<<
4879 "pulldca1="<<pulldca[j]<<
4880 "densb0="<<densb0<<
4881 "densb1="<<densb1<<
4882 "densa0="<<densa0<<
4883 "densa1="<<densa1<<
4884 "sigmae="<<sigmae<<
4885 "\n";
4886 }
4887 }
4888 }
4889 Float_t *quality = new Float_t[ncandidates];
4890 Int_t *indexes = new Int_t[ncandidates];
4891 Int_t naccepted =0;
4892 for (Int_t i=0;i<ncandidates;i++){
4893 quality[i] = 0;
4894 AliESDV0MI *v0 = (AliESDV0MI*)tpcv0s->At(i);
4895 quality[i] = 1./(1.00001-v0->GetPointAngle()); //base point angle
4896 // quality[i] /= (0.5+v0->GetDist2());
4897 // quality[i] *= v0->GetChi2After(); //density factor
4898 Double_t minpulldca = TMath::Min(2.+pulldca[v0->GetIndex(0)],(2.+pulldca[v0->GetIndex(1)]) ); //pull
4899 Int_t index0 = v0->GetIndex(0);
4900 Int_t index1 = v0->GetIndex(1);
4901 AliTPCseed * track0 = (AliTPCseed*)array->At(index0);
4902 AliTPCseed * track1 = (AliTPCseed*)array->At(index1);
4903 if (track0->fTPCr[0]>0.3&&track1->fTPCr[0]>0.3&&v0->GetAnglep()[2]<0.15) quality[i]+=1000000; // gamma conversion candidate
4904 if (track0->fTPCr[4]>0.9||track1->fTPCr[4]>0.9&&minpulldca>4) quality[i]*=10; // lambda candidate candidate
4905 }
4906
4907 TMath::Sort(ncandidates,quality,indexes,kTRUE);
4908 //
4909 //
4910 for (Int_t i=0;i<ncandidates;i++){
4911 AliESDV0MI * v0 = (AliESDV0MI*)tpcv0s->At(indexes[i]);
4912 if (!v0) continue;
4913 Int_t index0 = v0->GetIndex(0);
4914 Int_t index1 = v0->GetIndex(1);
4915 AliTPCseed * track0 = (AliTPCseed*)array->At(index0);
4916 AliTPCseed * track1 = (AliTPCseed*)array->At(index1);
4917 if (!track0||!track1) {
4918 printf("Bug\n");
4919 continue;
4920 }
4921 Bool_t accept =kTRUE; //default accept
4922 Int_t *v0indexes0 = track0->GetV0Indexes();
4923 Int_t *v0indexes1 = track1->GetV0Indexes();
4924 //
4925 Int_t order0 = (v0indexes0[0]!=0) ? 1:0;
4926 Int_t order1 = (v0indexes1[0]!=0) ? 1:0;
4927 if (v0indexes0[1]!=0) order0 =2;
4928 if (v0indexes1[1]!=0) order1 =2;
4929 //
4930 if (v0indexes0[2]!=0) {order0=3; accept=kFALSE;}
4931 if (v0indexes0[2]!=0) {order1=3; accept=kFALSE;}
4932 //
4933 AliESDV0MI * v02 = v0;
4934 if (accept){
4935 v0->SetOrder(0,order0);
4936 v0->SetOrder(1,order1);
4937 v0->SetOrder(1,order0+order1);
4938 Int_t index = esd->AddV0MI(v0);
4939 v02 = esd->GetV0MI(index);
4940 v0indexes0[order0]=index;
4941 v0indexes1[order1]=index;
4942 naccepted++;
4943 }
4944 {
4945 Int_t eventNr = esd->GetEventNumber();
4946 cstream<<"V02"<<
4947 "Event="<<eventNr<<
4948 "vertex.="<<v0<<
4949 "vertex2.="<<v02<<
4950 "Tr0.="<<track0<<
4951 "lab0="<<track0->fLab<<
4952 "Tr1.="<<track1<<
4953 "lab1="<<track1->fLab<<
4954 "dca0="<<dca[index0]<<
4955 "dca1="<<dca[index1]<<
4956 "order0="<<order0<<
4957 "order1="<<order1<<
4958 "accept="<<accept<<
4959 "quality="<<quality[i]<<
4960 "pulldca0="<<pulldca[index0]<<
4961 "pulldca1="<<pulldca[index1]<<
4962 "index="<<i<<
4963 "\n";
4964 }
4965 }
4966
4967
4968 //
4969 //
4970 delete []quality;
4971 delete []indexes;
4972//
4973 delete [] isPrim;
4974 delete [] pulldca;
4975 delete [] pulldcaz;
4976 delete [] pulldcar;
4977 delete [] cdcar;
4978 delete [] sdcar;
4979 delete [] dca;
4980 //
4981 delete[] z0;
4982 delete[] alpha;
4983 delete[] sign;
4984 delete[] helixes;
4985 printf("TPC V0 finder : naccepted\t%d\tncandidates\t%d\tntracks\t%d\tnall\t%d\n",naccepted,ncandidates,ntracks,nall);
4986 timer.Print();
4987}
4988
eea478d3 4989Int_t AliTPCtrackerMI::RefitKink(AliTPCseed &mother, AliTPCseed &daughter, AliESDkink &kink)
4990{
4991 //
4992 // refit kink towards to the vertex
4993 //
4994 //
4995 Int_t row0 = GetRowNumber(kink.GetR());
4996 FollowProlongation(mother,0);
4997 mother.Reset(kFALSE);
4998 //
4999 FollowProlongation(daughter,row0);
5000 daughter.Reset(kFALSE);
5001 FollowBackProlongation(daughter,158);
5002 daughter.Reset(kFALSE);
5003 Int_t first = TMath::Max(row0-20,30);
5004 Int_t last = TMath::Min(row0+20,140);
5005 //
5006 const Int_t kNdiv =5;
5007 AliTPCseed param0[kNdiv]; // parameters along the track
5008 AliTPCseed param1[kNdiv]; // parameters along the track
5009 AliESDkink kinks[kNdiv]; // corresponding kink parameters
5010 //
5011 Int_t rows[kNdiv];
5012 for (Int_t irow=0; irow<kNdiv;irow++){
5013 rows[irow] = first +((last-first)*irow)/(kNdiv-1);
5014 }
5015 // store parameters along the track
5016 //
5017 for (Int_t irow=0;irow<kNdiv;irow++){
5018 FollowBackProlongation(mother, rows[irow]);
5019 FollowProlongation(daughter,rows[kNdiv-1-irow]);
5020 new(&param0[irow]) AliTPCseed(mother);
5021 new(&param1[kNdiv-1-irow]) AliTPCseed(daughter);
5022 }
5023 //
5024 // define kinks
5025 for (Int_t irow=0; irow<kNdiv-1;irow++){
5026 if (param0[irow].fN<kNdiv||param1[irow].fN<kNdiv) continue;
5027 kinks[irow].SetMother(param0[irow]);
5028 kinks[irow].SetDaughter(param1[irow]);
5029 kinks[irow].Update();
5030 }
5031 //
5032 // choose kink with best "quality"
5033 Int_t index =-1;
5034 Double_t mindist = 10000;
5035 for (Int_t irow=0;irow<kNdiv;irow++){
5036 if (param0[irow].fN<20||param1[irow].fN<20) continue;
5037 if (TMath::Abs(kinks[irow].GetR())>240.) continue;
5038 if (TMath::Abs(kinks[irow].GetR())<100.) continue;
5039 //
5040 Float_t normdist = TMath::Abs(param0[irow].fX-kinks[irow].GetR())*(0.1+kink.GetDistance());
5041 normdist/= (param0[irow].fN+param1[irow].fN+40.);
5042 if (normdist < mindist){
5043 mindist = normdist;
5044 index = irow;
5045 }
5046 }
5047 //
5048 if (index==-1) return 0;
5049 //
5050 //
5051 param0[index].Reset(kTRUE);
5052 FollowProlongation(param0[index],0);
5053 //
5054 new (&mother) AliTPCseed(param0[index]);
5055 new (&daughter) AliTPCseed(param1[index]); // daughter in vertex
5056 //
5057 kink.SetMother(mother);
5058 kink.SetDaughter(daughter);
5059 kink.Update();
5060 kink.SetTPCRow0(GetRowNumber(kink.GetR()));
5061 kink.SetTPCncls(param0[index].fN,0);
5062 kink.SetTPCncls(param1[index].fN,1);
5063 kink.SetLabel(CookLabel(&mother,0.4, 0,kink.GetTPCRow0()),0);
5064 kink.SetLabel(CookLabel(&daughter,0.4, kink.GetTPCRow0(),160),1);
5065 mother.SetLabel(kink.GetLabel(0));
5066 daughter.SetLabel(kink.GetLabel(1));
5067
5068 return 1;
5069}
51ad6848 5070
5071
5072void AliTPCtrackerMI::UpdateKinkQualityM(AliTPCseed * seed){
5073 //
5074 // update Kink quality information for mother after back propagation
5075 //
5076 if (seed->GetKinkIndex(0)>=0) return;
5077 for (Int_t ikink=0;ikink<3;ikink++){
5078 Int_t index = seed->GetKinkIndex(ikink);
5079 if (index>=0) break;
5080 index = TMath::Abs(index)-1;
5081 AliESDkink * kink = fEvent->GetKink(index);
eea478d3 5082 //kink->fTPCdensity2[0][0]=-1;
5083 //kink->fTPCdensity2[0][1]=-1;
5084 kink->SetTPCDensity2(-1,0,0);
5085 kink->SetTPCDensity2(1,0,1);
51ad6848 5086 //
eea478d3 5087 Int_t row0 = kink->GetTPCRow0() - 2 - Int_t( 0.5/ (0.05+kink->GetAngle(2)));
51ad6848 5088 if (row0<15) row0=15;
5089 //
eea478d3 5090 Int_t row1 = kink->GetTPCRow0() + 2 + Int_t( 0.5/ (0.05+kink->GetAngle(2)));
51ad6848 5091 if (row1>145) row1=145;
5092 //
5093 Int_t found,foundable,shared;
5094 seed->GetClusterStatistic(0,row0, found, foundable,shared,kFALSE);
eea478d3 5095 if (foundable>5) kink->SetTPCDensity2(Float_t(found)/Float_t(foundable),0,0);
51ad6848 5096 seed->GetClusterStatistic(row1,155, found, foundable,shared,kFALSE);
eea478d3 5097 if (foundable>5) kink->SetTPCDensity2(Float_t(found)/Float_t(foundable),0,1);
51ad6848 5098 }
5099
5100}
5101
eea478d3 5102void AliTPCtrackerMI::UpdateKinkQualityD(AliTPCseed * seed){
91162307 5103 //
eea478d3 5104 // update Kink quality information for daughter after refit
91162307 5105 //
eea478d3 5106 if (seed->GetKinkIndex(0)<=0) return;
5107 for (Int_t ikink=0;ikink<3;ikink++){
5108 Int_t index = seed->GetKinkIndex(ikink);
5109 if (index<=0) break;
5110 index = TMath::Abs(index)-1;
5111 AliESDkink * kink = fEvent->GetKink(index);
5112 kink->SetTPCDensity2(-1,1,0);
5113 kink->SetTPCDensity2(-1,1,1);
91162307 5114 //
eea478d3 5115 Int_t row0 = kink->GetTPCRow0() -2 - Int_t( 0.5/ (0.05+kink->GetAngle(2)));
5116 if (row0<15) row0=15;
5117 //
5118 Int_t row1 = kink->GetTPCRow0() +2 + Int_t( 0.5/ (0.05+kink->GetAngle(2)));
5119 if (row1>145) row1=145;
5120 //
5121 Int_t found,foundable,shared;
5122 seed->GetClusterStatistic(0,row0, found, foundable,shared,kFALSE);
5123 if (foundable>5) kink->SetTPCDensity2(Float_t(found)/Float_t(foundable),1,0);
5124 seed->GetClusterStatistic(row1,155, found, foundable,shared,kFALSE);
5125 if (foundable>5) kink->SetTPCDensity2(Float_t(found)/Float_t(foundable),1,1);
91162307 5126 }
eea478d3 5127
5128}
5129
5130
5131Int_t AliTPCtrackerMI::CheckKinkPoint(AliTPCseed*seed,AliTPCseed &mother, AliTPCseed &daughter, AliESDkink &kink)
5132{
91162307 5133 //
eea478d3 5134 // check kink point for given track
5135 // if return value=0 kink point not found
5136 // otherwise seed0 correspond to mother particle
5137 // seed1 correspond to daughter particle
5138 // kink parameter of kink point
91162307 5139
eea478d3 5140 Int_t middlerow = (seed->fFirstPoint+seed->fLastPoint)/2;
5141 Int_t first = seed->fFirstPoint;
5142 Int_t last = seed->fLastPoint;
5143 if (last-first<20) return 0; // shortest length - 2*30 = 60 pad-rows
91162307 5144
eea478d3 5145
5146 AliTPCseed *seed1 = ReSeed(seed,middlerow+20, kTRUE); //middle of chamber
5147 if (!seed1) return 0;
5148 FollowProlongation(*seed1,seed->fLastPoint-20);
5149 seed1->Reset(kTRUE);
5150 FollowProlongation(*seed1,158);
5151 seed1->Reset(kTRUE);
5152 last = seed1->fLastPoint;
5153 //
5154 AliTPCseed *seed0 = new AliTPCseed(*seed);
5155 seed0->Reset(kFALSE);
5156 seed0->Reset();
5157 //
5158 AliTPCseed param0[20]; // parameters along the track
5159 AliTPCseed param1[20]; // parameters along the track
5160 AliESDkink kinks[20]; // corresponding kink parameters
5161 Int_t rows[20];
5162 for (Int_t irow=0; irow<20;irow++){
5163 rows[irow] = first +((last-first)*irow)/19;
5164 }
5165 // store parameters along the track
5166 //
5167 for (Int_t irow=0;irow<20;irow++){
5168 FollowBackProlongation(*seed0, rows[irow]);
5169 FollowProlongation(*seed1,rows[19-irow]);
5170 new(&param0[irow]) AliTPCseed(*seed0);
5171 new(&param1[19-irow]) AliTPCseed(*seed1);
5172 }
5173 //
5174 // define kinks
5175 for (Int_t irow=0; irow<19;irow++){
5176 kinks[irow].SetMother(param0[irow]);
5177 kinks[irow].SetDaughter(param1[irow]);
5178 kinks[irow].Update();
5179 }
5180 //
5181 // choose kink with biggest change of angle
5182 Int_t index =-1;
5183 Double_t maxchange= 0;
5184 for (Int_t irow=1;irow<19;irow++){
5185 if (TMath::Abs(kinks[irow].GetR())>240.) continue;
5186 if (TMath::Abs(kinks[irow].GetR())<110.) continue;
5187 Float_t quality = TMath::Abs(kinks[irow].GetAngle(2))/(3.+TMath::Abs(kinks[irow].GetR()-param0[irow].fX));
5188 if ( quality > maxchange){
5189 maxchange = quality;
5190 index = irow;
5191 //
91162307 5192 }
5193 }
eea478d3 5194 delete seed0;
5195 delete seed1;
5196 if (index<0) return 0;
5197 //
5198 Int_t row0 = GetRowNumber(kinks[index].GetR()); //row 0 estimate
5199 seed0 = new AliTPCseed(param0[index]);
5200 seed1 = new AliTPCseed(param1[index]);
5201 seed0->Reset(kFALSE);
5202 seed1->Reset(kFALSE);
5203 seed0->ResetCovariance();
5204 seed1->ResetCovariance();
5205 FollowProlongation(*seed0,0);
5206 FollowBackProlongation(*seed1,158);
5207 new (&mother) AliTPCseed(*seed0); // backup mother at position 0
5208 seed0->Reset(kFALSE);
5209 seed1->Reset(kFALSE);
5210 seed0->ResetCovariance();
5211 seed1->ResetCovariance();
5212 //
5213 first = TMath::Max(row0-20,0);
5214 last = TMath::Min(row0+20,158);
5215 //
5216 for (Int_t irow=0; irow<20;irow++){
5217 rows[irow] = first +((last-first)*irow)/19;
5218 }
5219 // store parameters along the track
5220 //
5221 for (Int_t irow=0;irow<20;irow++){
5222 FollowBackProlongation(*seed0, rows[irow]);
5223 FollowProlongation(*seed1,rows[19-irow]);
5224 new(&param0[irow]) AliTPCseed(*seed0);
5225 new(&param1[19-irow]) AliTPCseed(*seed1);
5226 }
5227 //
5228 // define kinks
5229 for (Int_t irow=0; irow<19;irow++){
5230 kinks[irow].SetMother(param0[irow]);
5231 kinks[irow].SetDaughter(param1[irow]);
5232 // param0[irow].Dump();
5233 //param1[irow].Dump();
5234 kinks[irow].Update();
5235 }
5236 //
5237 // choose kink with biggest change of angle
5238 index =-1;
5239 maxchange= 0;
5240 for (Int_t irow=0;irow<20;irow++){
5241 if (TMath::Abs(kinks[irow].GetR())>250.) continue;
5242 if (TMath::Abs(kinks[irow].GetR())<90.) continue;
5243 Float_t quality = TMath::Abs(kinks[irow].GetAngle(2))/(3.+TMath::Abs(kinks[irow].GetR()-param0[irow].fX));
5244 if ( quality > maxchange){
5245 maxchange = quality;
5246 index = irow;
5247 //
91162307 5248 }
5249 }
5250 //
5251 //
eea478d3 5252 if (index==-1 || param0[index].fN+param1[index].fN<100){
5253 delete seed0;
5254 delete seed1;
5255 return 0;
1627d1c4 5256 }
eea478d3 5257 // Float_t anglesigma = TMath::Sqrt(param0[index].fC22+param0[index].fC33+param1[index].fC22+param1[index].fC33);
1627d1c4 5258
eea478d3 5259 kink.SetMother(param0[index]);
5260 kink.SetDaughter(param1[index]);
5261 kink.Update();
5262 row0 = GetRowNumber(kink.GetR());
5263 kink.SetTPCRow0(row0);
5264 kink.SetLabel(CookLabel(seed0,0.5,0,row0),0);
5265 kink.SetLabel(CookLabel(seed1,0.5,row0,158),1);
5266 kink.SetIndex(-10,0);
5267 kink.SetIndex(int(param0[index].fN+param1[index].fN),1);
5268 kink.SetTPCncls(param0[index].fN,0);
5269 kink.SetTPCncls(param1[index].fN,1);
5270 //
5271 //
5272 // new (&mother) AliTPCseed(param0[index]);
5273 new (&daughter) AliTPCseed(param1[index]);
5274 daughter.SetLabel(kink.GetLabel(1));
5275 param0[index].Reset(kTRUE);
5276 FollowProlongation(param0[index],0);
5277 new (&mother) AliTPCseed(param0[index]);
5278 mother.SetLabel(kink.GetLabel(0));
5279 delete seed0;
5280 delete seed1;
5281 //
5282 return 1;
1627d1c4 5283}
5284
5285
5286
5287
91162307 5288AliTPCseed* AliTPCtrackerMI::ReSeed(AliTPCseed *t)
5289{
5290 //
5291 // reseed - refit - track
5292 //
5293 Int_t first = 0;
5294 // Int_t last = fSectors->GetNRows()-1;
5295 //
5296 if (fSectors == fOuterSec){
5297 first = TMath::Max(first, t->fFirstPoint-fInnerSec->GetNRows());
5298 //last =
5299 }
5300 else
5301 first = t->fFirstPoint;
5302 //
5303 AliTPCseed * seed = MakeSeed(t,0.1,0.5,0.9);
5304 FollowBackProlongation(*t,fSectors->GetNRows()-1);
5305 t->Reset(kFALSE);
5306 FollowProlongation(*t,first);
5307 return seed;
5308}
5309
5310
5311
5312
5313
5314
5315
1c53abe2 5316//_____________________________________________________________________________
5317Int_t AliTPCtrackerMI::ReadSeeds(const TFile *inp) {
5318 //-----------------------------------------------------------------
5319 // This function reades track seeds.
5320 //-----------------------------------------------------------------
5321 TDirectory *savedir=gDirectory;
5322
5323 TFile *in=(TFile*)inp;
5324 if (!in->IsOpen()) {
5325 cerr<<"AliTPCtrackerMI::ReadSeeds(): input file is not open !\n";
5326 return 1;
5327 }
5328
5329 in->cd();
5330 TTree *seedTree=(TTree*)in->Get("Seeds");
5331 if (!seedTree) {
5332 cerr<<"AliTPCtrackerMI::ReadSeeds(): ";
5333 cerr<<"can't get a tree with track seeds !\n";
5334 return 2;
5335 }
5336 AliTPCtrack *seed=new AliTPCtrack;
5337 seedTree->SetBranchAddress("tracks",&seed);
5338
5339 if (fSeeds==0) fSeeds=new TObjArray(15000);
5340
5341 Int_t n=(Int_t)seedTree->GetEntries();
5342 for (Int_t i=0; i<n; i++) {
5343 seedTree->GetEvent(i);
bbc6cd2c 5344 fSeeds->AddLast(new AliTPCseed(*seed/*,seed->GetAlpha()*/));
1c53abe2 5345 }
5346
5347 delete seed;
5348 delete seedTree;
5349 savedir->cd();
5350 return 0;
5351}
5352
d26d9159 5353Int_t AliTPCtrackerMI::Clusters2Tracks (AliESD *esd)
5354{
5355 //
d9b8978b 5356 if (fSeeds) DeleteSeeds();
d26d9159 5357 fEvent = esd;
5358 Clusters2Tracks();
5359 if (!fSeeds) return 1;
5360 FillESD(fSeeds);
5361 return 0;
5362 //
5363}
5364
5365
1c53abe2 5366//_____________________________________________________________________________
f8aae377 5367Int_t AliTPCtrackerMI::Clusters2Tracks() {
1c53abe2 5368 //-----------------------------------------------------------------
5369 // This is a track finder.
5370 //-----------------------------------------------------------------
91162307 5371 TDirectory *savedir=gDirectory;
1c53abe2 5372 TStopwatch timer;
d26d9159 5373
91162307 5374 fIteration = 0;
5375 fSeeds = Tracking();
1c53abe2 5376
6bdc18d6 5377 if (fDebug>0){
5378 Info("Clusters2Tracks","Time for tracking: \t");timer.Print();timer.Start();
5379 }
91162307 5380 //activate again some tracks
5381 for (Int_t i=0; i<fSeeds->GetEntriesFast(); i++) {
5382 AliTPCseed *pt=(AliTPCseed*)fSeeds->UncheckedAt(i), &t=*pt;
5383 if (!pt) continue;
5384 Int_t nc=t.GetNumberOfClusters();
5385 if (nc<20) {
5386 delete fSeeds->RemoveAt(i);
5387 continue;
eea478d3 5388 }
5389 CookLabel(pt,0.1);
91162307 5390 if (pt->fRemoval==10) {
5391 if (pt->GetDensityFirst(20)>0.8 || pt->GetDensityFirst(30)>0.8 || pt->GetDensityFirst(40)>0.7)
5392 pt->Desactivate(10); // make track again active
5393 else{
5394 pt->Desactivate(20);
5395 delete fSeeds->RemoveAt(i);
5396 }
5397 }
5398 }
51ad6848 5399 //
5400 RemoveUsed2(fSeeds,0.85,0.85,0);
5401 FindKinks(fSeeds,fEvent);
81e97e0d 5402 RemoveUsed2(fSeeds,0.5,0.4,20);
5403 // //
5404// // refit short tracks
5405// //
5406 Int_t nseed=fSeeds->GetEntriesFast();
5407// for (Int_t i=0; i<nseed; i++) {
5408// AliTPCseed *pt=(AliTPCseed*)fSeeds->UncheckedAt(i), &t=*pt;
5409// if (!pt) continue;
5410// Int_t nc=t.GetNumberOfClusters();
5411// if (nc<15) {
5412// delete fSeeds->RemoveAt(i);
5413// continue;
5414// }
5415// if (pt->GetKinkIndexes()[0]!=0) continue; // ignore kink candidates
5416// if (nc>100) continue; // hopefully, enough for ITS
5417// AliTPCseed *seed2 = new AliTPCseed(*pt);
5418// //seed2->Reset(kFALSE);
5419// //pt->ResetCovariance();
5420// seed2->Modify(1);
5421// FollowBackProlongation(*seed2,158);
5422// //seed2->Reset(kFALSE);
5423// seed2->Modify(10);
5424// FollowProlongation(*seed2,0);
5425// TTreeSRedirector &cstream = *fDebugStreamer;
5426// cstream<<"Crefit"<<
5427// "Tr0.="<<pt<<
5428// "Tr1.="<<seed2<<
5429// "\n";
5430// if (seed2->fN>pt->fN){
5431// delete fSeeds->RemoveAt(i);
5432// fSeeds->AddAt(seed2,i);
5433// }else{
5434// delete seed2;
5435// }
5436// }
5437// RemoveUsed2(fSeeds,0.6,0.6,50);
5438
5439// FindV0s(fSeeds,fEvent);
51ad6848 5440 //RemoveDouble(fSeeds,0.2,0.6,11);
c9427e08 5441
1c53abe2 5442 //
91162307 5443 Int_t found = 0;
5444 for (Int_t i=0; i<nseed; i++) {
5445 AliTPCseed *pt=(AliTPCseed*)fSeeds->UncheckedAt(i), &t=*pt;
5446 if (!pt) continue;
5447 Int_t nc=t.GetNumberOfClusters();
5448 if (nc<15) {
5449 delete fSeeds->RemoveAt(i);
5450 continue;
5451 }
5452 CookLabel(pt,0.1); //For comparison only
5453 //if ((pt->IsActive() || (pt->fRemoval==10) )&& nc>50 &&pt->GetNumberOfClusters()>0.4*pt->fNFoundable){
5454 if ((pt->IsActive() || (pt->fRemoval==10) )){
d9b8978b 5455 found++;
5456 if (fDebug>0) cerr<<found<<'\r';
d26d9159 5457 pt->fLab2 = i;
91162307 5458 }
5459 else
5460 delete fSeeds->RemoveAt(i);
91162307 5461 }
5462
5463
5464 //RemoveOverlap(fSeeds,0.99,7,kTRUE);
5465 SignShared(fSeeds);
5466 //RemoveUsed(fSeeds,0.9,0.9,6);
1c53abe2 5467 //
91162307 5468 nseed=fSeeds->GetEntriesFast();
5469 found = 0;
5470 for (Int_t i=0; i<nseed; i++) {
5471 AliTPCseed *pt=(AliTPCseed*)fSeeds->UncheckedAt(i), &t=*pt;
5472 if (!pt) continue;
5473 Int_t nc=t.GetNumberOfClusters();
5474 if (nc<15) {
5475 delete fSeeds->RemoveAt(i);
5476 continue;
5477 }
5478 t.SetUniqueID(i);
5479 t.CookdEdx(0.02,0.6);
5480 // CheckKinkPoint(&t,0.05);
5481 //if ((pt->IsActive() || (pt->fRemoval==10) )&& nc>50 &&pt->GetNumberOfClusters()>0.4*pt->fNFoundable){
5482 if ((pt->IsActive() || (pt->fRemoval==10) )){
6bdc18d6 5483 found++;
5484 if (fDebug>0){
5485 cerr<<found<<'\r';
5486 }
d26d9159 5487 pt->fLab2 = i;
91162307 5488 }
5489 else
5490 delete fSeeds->RemoveAt(i);
d26d9159 5491 //AliTPCseed * seed1 = ReSeed(pt,0.05,0.5,1);
5492 //if (seed1){
5493 // FollowProlongation(*seed1,0);
5494 // Int_t n = seed1->GetNumberOfClusters();
5495 // printf("fP4\t%f\t%f\n",seed1->GetC(),pt->GetC());
5496 // printf("fN\t%d\t%d\n", seed1->GetNumberOfClusters(),pt->GetNumberOfClusters());
5497 //
5498 //}
5499 //AliTPCseed * seed2 = ReSeed(pt,0.95,0.5,0.05);
5500
91162307 5501 }
5502
5503 SortTracks(fSeeds, 1);
1c53abe2 5504
982aff31 5505 /*
91162307 5506 fIteration = 1;
982aff31 5507 PrepareForBackProlongation(fSeeds,5.);
91162307 5508 PropagateBack(fSeeds);
5509 printf("Time for back propagation: \t");timer.Print();timer.Start();
5510
5511 fIteration = 2;
1c53abe2 5512
982aff31 5513 PrepareForProlongation(fSeeds,5.);
5514 PropagateForward2(fSeeds);
d26d9159 5515
91162307 5516 printf("Time for FORWARD propagation: \t");timer.Print();timer.Start();
5517 // RemoveUsed(fSeeds,0.7,0.7,6);
5518 //RemoveOverlap(fSeeds,0.9,7,kTRUE);
d26d9159 5519
1c53abe2 5520 nseed=fSeeds->GetEntriesFast();
91162307 5521 found = 0;
5522 for (Int_t i=0; i<nseed; i++) {
1c53abe2 5523 AliTPCseed *pt=(AliTPCseed*)fSeeds->UncheckedAt(i), &t=*pt;
5524 if (!pt) continue;
5525 Int_t nc=t.GetNumberOfClusters();
91162307 5526 if (nc<15) {
5527 delete fSeeds->RemoveAt(i);
5528 continue;
5529 }
1c53abe2 5530 t.CookdEdx(0.02,0.6);
91162307 5531 // CookLabel(pt,0.1); //For comparison only
5532 //if ((pt->IsActive() || (pt->fRemoval==10) )&& nc>50 &&pt->GetNumberOfClusters()>0.4*pt->fNFoundable){
5533 if ((pt->IsActive() || (pt->fRemoval==10) )){
5534 cerr<<found++<<'\r';
5535 }
5536 else
5537 delete fSeeds->RemoveAt(i);
5538 pt->fLab2 = i;
1c53abe2 5539 }
91162307 5540 */
5541
c9427e08 5542 // fNTracks = found;
6bdc18d6 5543 if (fDebug>0){
5544 Info("Clusters2Tracks","Time for overlap removal, track writing and dedx cooking: \t"); timer.Print();timer.Start();
5545 }
91162307 5546 //
6bdc18d6 5547 // cerr<<"Number of found tracks : "<<"\t"<<found<<endl;
5548 Info("Clusters2Tracks","Number of found tracks %d",found);
91162307 5549 savedir->cd();
91162307 5550 // UnloadClusters();
d26d9159 5551 //
1c53abe2 5552 return 0;
5553}
5554
91162307 5555void AliTPCtrackerMI::Tracking(TObjArray * arr)
5556{
5557 //
5558 // tracking of the seeds
5559 //
5560
5561 fSectors = fOuterSec;
5562 ParallelTracking(arr,150,63);
5563 fSectors = fOuterSec;
5564 ParallelTracking(arr,63,0);
5565}
5566
5567TObjArray * AliTPCtrackerMI::Tracking(Int_t seedtype, Int_t i1, Int_t i2, Float_t cuts[4], Float_t dy, Int_t dsec)
5568{
5569 //
5570 //
5571 //tracking routine
5572 TObjArray * arr = new TObjArray;
5573 //
5574 fSectors = fOuterSec;
5575 TStopwatch timer;
5576 timer.Start();
5577 for (Int_t sec=0;sec<fkNOS;sec++){
5578 if (seedtype==3) MakeSeeds3(arr,sec,i1,i2,cuts,dy, dsec);
5579 if (seedtype==4) MakeSeeds5(arr,sec,i1,i2,cuts,dy);
5580 if (seedtype==2) MakeSeeds2(arr,sec,i1,i2,cuts,dy);
5581 }
5582 if (fDebug>0){
6bdc18d6 5583 Info("Tracking","\nSeeding - %d\t%d\t%d\t%d\n",seedtype,i1,i2,arr->GetEntriesFast());
91162307 5584 timer.Print();
5585 timer.Start();
5586 }
5587 Tracking(arr);
5588 if (fDebug>0){
5589 timer.Print();
5590 }
5591
5592 return arr;
5593}
5594
5595TObjArray * AliTPCtrackerMI::Tracking()
5596{
5597 //
5598 //
5599 TStopwatch timer;
5600 timer.Start();
5601 Int_t nup=fOuterSec->GetNRows()+fInnerSec->GetNRows();
5602
5603 TObjArray * seeds = new TObjArray;
5604 TObjArray * arr=0;
5605
5606 Int_t gap =20;
5607 Float_t cuts[4];
5608 cuts[0] = 0.002;
5609 cuts[1] = 1.5;
5610 cuts[2] = 3.;
5611 cuts[3] = 3.;
5612 Float_t fnumber = 3.0;
5613 Float_t fdensity = 3.0;
5614
5615 //
5616 //find primaries
5617 cuts[0]=0.0066;
5618 for (Int_t delta = 0; delta<18; delta+=6){
5619 //
5620 cuts[0]=0.0070;
5621 cuts[1] = 1.5;
5622 arr = Tracking(3,nup-1-delta,nup-1-delta-gap,cuts,-1,1);
5623 SumTracks(seeds,arr);
5624 SignClusters(seeds,fnumber,fdensity);
5625 //
5626 for (Int_t i=2;i<6;i+=2){
5627 // seed high pt tracks
5628 cuts[0]=0.0022;
5629 cuts[1]=0.3;
5630 arr = Tracking(3,nup-i-delta,nup-i-delta-gap,cuts,-1,0);
5631 SumTracks(seeds,arr);
5632 SignClusters(seeds,fnumber,fdensity);
5633 }
5634 }
5635 fnumber = 4;
5636 fdensity = 4.;
5637 // RemoveUsed(seeds,0.9,0.9,1);
5638 // UnsignClusters();
5639 // SignClusters(seeds,fnumber,fdensity);
5640
5641 //find primaries
5642 cuts[0]=0.0077;
5643 for (Int_t delta = 20; delta<120; delta+=10){
5644 //
5645 // seed high pt tracks
5646 cuts[0]=0.0060;
5647 cuts[1]=0.3;
5648 cuts[2]=6.;
5649 arr = Tracking(3,nup-delta,nup-delta-gap,cuts,-1);
5650 SumTracks(seeds,arr);
5651 SignClusters(seeds,fnumber,fdensity);
5652
5653 cuts[0]=0.003;
5654 cuts[1]=0.3;
5655 cuts[2]=6.;
5656 arr = Tracking(3,nup-delta-5,nup-delta-5-gap,cuts,-1);
5657 SumTracks(seeds,arr);
5658 SignClusters(seeds,fnumber,fdensity);
5659 }
5660
5661 cuts[0] = 0.01;
5662 cuts[1] = 2.0;
5663 cuts[2] = 3.;
5664 cuts[3] = 2.0;
5665 fnumber = 2.;
5666 fdensity = 2.;
5667
5668 if (fDebug>0){
6bdc18d6 5669 Info("Tracking()","\n\nPrimary seeding\t%d\n\n",seeds->GetEntriesFast());
91162307 5670 timer.Print();
5671 timer.Start();
5672 }
5673 // RemoveUsed(seeds,0.75,0.75,1);
5674 //UnsignClusters();
5675 //SignClusters(seeds,fnumber,fdensity);
5676
5677 // find secondaries
5678
5679 cuts[0] = 0.3;
5680 cuts[1] = 1.5;
5681 cuts[2] = 3.;
5682 cuts[3] = 1.5;
5683
5684 arr = Tracking(4,nup-1,nup-1-gap,cuts,-1);
5685 SumTracks(seeds,arr);
5686 SignClusters(seeds,fnumber,fdensity);
5687 //
5688 arr = Tracking(4,nup-2,nup-2-gap,cuts,-1);
5689 SumTracks(seeds,arr);
5690 SignClusters(seeds,fnumber,fdensity);
5691 //
5692 arr = Tracking(4,nup-3,nup-3-gap,cuts,-1);
5693 SumTracks(seeds,arr);
5694 SignClusters(seeds,fnumber,fdensity);
5695 //
5696
5697
5698 for (Int_t delta = 3; delta<30; delta+=5){
5699 //
5700 cuts[0] = 0.3;
5701 cuts[1] = 1.5;
5702 cuts[2] = 3.;
5703 cuts[3] = 1.5;
5704 arr = Tracking(4,nup-1-delta,nup-1-delta-gap,cuts,-1);
5705 SumTracks(seeds,arr);
5706 SignClusters(seeds,fnumber,fdensity);
5707 //
5708 arr = Tracking(4,nup-3-delta,nup-5-delta-gap,cuts,4);
5709 SumTracks(seeds,arr);
5710 SignClusters(seeds,fnumber,fdensity);
5711 //
5712 }
5713 fnumber = 1;
5714 fdensity = 1;
5715 //
5716 // change cuts
5717 fnumber = 2.;
5718 fdensity = 2.;
5719 cuts[0]=0.0080;
5720
5721 // find secondaries
2bd61959 5722 for (Int_t delta = 30; delta<90; delta+=10){
91162307 5723 //
5724 cuts[0] = 0.3;
2bd61959 5725 cuts[1] = 3.5;
91162307 5726 cuts[2] = 3.;
2bd61959 5727 cuts[3] = 3.5;
91162307 5728 arr = Tracking(4,nup-1-delta,nup-1-delta-gap,cuts,-1);
5729 SumTracks(seeds,arr);
5730 SignClusters(seeds,fnumber,fdensity);
5731 //
5732 arr = Tracking(4,nup-5-delta,nup-5-delta-gap,cuts,5 );
5733 SumTracks(seeds,arr);
5734 SignClusters(seeds,fnumber,fdensity);
5735 }
5736
5737 if (fDebug>0){
6bdc18d6 5738 Info("Tracking()","\n\nSecondary seeding\t%d\n\n",seeds->GetEntriesFast());
91162307 5739 timer.Print();
5740 timer.Start();
5741 }
5742
5743 return seeds;
5744 //
5745
5746}
5747
5748
47966a6d 5749void AliTPCtrackerMI::SumTracks(TObjArray *arr1,TObjArray *arr2) const
91162307 5750{
5751 //
5752 //sum tracks to common container
5753 //remove suspicious tracks
5754 Int_t nseed = arr2->GetEntriesFast();
5755 for (Int_t i=0;i<nseed;i++){
5756 AliTPCseed *pt=(AliTPCseed*)arr2->UncheckedAt(i);
5757 if (pt){
5758
5759 // NORMAL ACTIVE TRACK
5760 if (pt->IsActive()){
5761 arr1->AddLast(arr2->RemoveAt(i));
5762 continue;
5763 }
5764 //remove not usable tracks
5765 if (pt->fRemoval!=10){
5766 delete arr2->RemoveAt(i);
5767 continue;
5768 }
5769 // REMOVE VERY SHORT TRACKS
5770 if (pt->GetNumberOfClusters()<20){
5771 delete arr2->RemoveAt(i);
5772 continue;
5773 }
5774 // ENABLE ONLY ENOUGH GOOD STOPPED TRACKS
5775 if (pt->GetDensityFirst(20)>0.8 || pt->GetDensityFirst(30)>0.8 || pt->GetDensityFirst(40)>0.7)
5776 arr1->AddLast(arr2->RemoveAt(i));
5777 else{
5778 delete arr2->RemoveAt(i);
5779 }
5780 }
5781 }
5782 delete arr2;
5783}
5784
5785
1c53abe2 5786
91162307 5787void AliTPCtrackerMI::ParallelTracking(TObjArray * arr, Int_t rfirst, Int_t rlast)
1c53abe2 5788{
5789 //
5790 // try to track in parralel
5791
91162307 5792 Int_t nseed=arr->GetEntriesFast();
1c53abe2 5793 //prepare seeds for tracking
5794 for (Int_t i=0; i<nseed; i++) {
91162307 5795 AliTPCseed *pt=(AliTPCseed*)arr->UncheckedAt(i), &t=*pt;
1c53abe2 5796 if (!pt) continue;
5797 if (!t.IsActive()) continue;
5798 // follow prolongation to the first layer
91162307 5799 if ( (fSectors ==fInnerSec) || (t.fFirstPoint-fParam->GetNRowLow()>rfirst+1) )
c9427e08 5800 FollowProlongation(t, rfirst+1);
1c53abe2 5801 }
5802
5803
5804 //
982aff31 5805 for (Int_t nr=rfirst; nr>=rlast; nr--){
5806 if (nr<fInnerSec->GetNRows())
5807 fSectors = fInnerSec;
5808 else
5809 fSectors = fOuterSec;
1c53abe2 5810 // make indexes with the cluster tracks for given
1c53abe2 5811
5812 // find nearest cluster
5813 for (Int_t i=0; i<nseed; i++) {
91162307 5814 AliTPCseed *pt=(AliTPCseed*)arr->UncheckedAt(i), &t=*pt;
1c53abe2 5815 if (!pt) continue;
51ad6848 5816 if (nr==80) pt->UpdateReference();
1c53abe2 5817 if (!pt->IsActive()) continue;
91162307 5818 // if ( (fSectors ==fOuterSec) && (pt->fFirstPoint-fParam->GetNRowLow())<nr) continue;
1627d1c4 5819 if (pt->fRelativeSector>17) {
5820 continue;
5821 }
91162307 5822 UpdateClusters(t,nr);
1c53abe2 5823 }
5824 // prolonagate to the nearest cluster - if founded
5825 for (Int_t i=0; i<nseed; i++) {
91162307 5826 AliTPCseed *pt=(AliTPCseed*)arr->UncheckedAt(i);
1c53abe2 5827 if (!pt) continue;
1627d1c4 5828 if (!pt->IsActive()) continue;
91162307 5829 // if ((fSectors ==fOuterSec) && (pt->fFirstPoint-fParam->GetNRowLow())<nr) continue;
1627d1c4 5830 if (pt->fRelativeSector>17) {
5831 continue;
5832 }
91162307 5833 FollowToNextCluster(*pt,nr);
1c53abe2 5834 }
91162307 5835 }
5836}
5837
47966a6d 5838void AliTPCtrackerMI::PrepareForBackProlongation(TObjArray * arr,Float_t fac) const
91162307 5839{
5840 //
5841 //
5842 // if we use TPC track itself we have to "update" covariance
5843 //
5844 Int_t nseed= arr->GetEntriesFast();
5845 for (Int_t i=0;i<nseed;i++){
5846 AliTPCseed *pt = (AliTPCseed*)arr->UncheckedAt(i);
5847 if (pt) {
5848 pt->Modify(fac);
5849 //
5850 //rotate to current local system at first accepted point
5851 Int_t index = pt->GetClusterIndex2(pt->fFirstPoint);
5852 Int_t sec = (index&0xff000000)>>24;
5853 sec = sec%18;
5854 Float_t angle1 = fInnerSec->GetAlpha()*sec+fInnerSec->GetAlphaShift();
5855 if (angle1>TMath::Pi())
5856 angle1-=2.*TMath::Pi();
5857 Float_t angle2 = pt->GetAlpha();
5858
5859 if (TMath::Abs(angle1-angle2)>0.001){
5860 pt->Rotate(angle1-angle2);
5861 //angle2 = pt->GetAlpha();
5862 //pt->fRelativeSector = pt->GetAlpha()/fInnerSec->GetAlpha();
5863 //if (pt->GetAlpha()<0)
5864 // pt->fRelativeSector+=18;
5865 //sec = pt->fRelativeSector;
5866 }
5867
5868 }
5869
5870 }
5871
5872
5873}
47966a6d 5874void AliTPCtrackerMI::PrepareForProlongation(TObjArray * arr, Float_t fac) const
91162307 5875{
5876 //
5877 //
5878 // if we use TPC track itself we have to "update" covariance
5879 //
5880 Int_t nseed= arr->GetEntriesFast();
5881 for (Int_t i=0;i<nseed;i++){
5882 AliTPCseed *pt = (AliTPCseed*)arr->UncheckedAt(i);
5883 if (pt) {
5884 pt->Modify(fac);
5885 pt->fFirstPoint = pt->fLastPoint;
5886 }
5887
5888 }
5889
5890
5891}
5892
5893Int_t AliTPCtrackerMI::PropagateBack(TObjArray * arr)
5894{
5895 //
5896 // make back propagation
5897 //
5898 Int_t nseed= arr->GetEntriesFast();
5899 for (Int_t i=0;i<nseed;i++){
5900 AliTPCseed *pt = (AliTPCseed*)arr->UncheckedAt(i);
51ad6848 5901 if (pt&& pt->GetKinkIndex(0)<=0) {
d9b8978b 5902 //AliTPCseed *pt2 = new AliTPCseed(*pt);
91162307 5903 fSectors = fInnerSec;
d26d9159 5904 //FollowBackProlongation(*pt,fInnerSec->GetNRows()-1);
5905 //fSectors = fOuterSec;
4d158c36 5906 FollowBackProlongation(*pt,fInnerSec->GetNRows()+fOuterSec->GetNRows()-1);
5907 //if (pt->GetNumberOfClusters()<(pt->fEsd->GetTPCclusters(0)) ){
d9b8978b 5908 // Error("PropagateBack","Not prolonged track %d",pt->GetLabel());
4d158c36 5909 // FollowBackProlongation(*pt2,fInnerSec->GetNRows()+fOuterSec->GetNRows()-1);
d9b8978b 5910 //}
51ad6848 5911 }
5912 if (pt&& pt->GetKinkIndex(0)>0) {
5913 AliESDkink * kink = fEvent->GetKink(pt->GetKinkIndex(0)-1);
eea478d3 5914 pt->fFirstPoint = kink->GetTPCRow0();
51ad6848 5915 fSectors = fInnerSec;
5916 FollowBackProlongation(*pt,fInnerSec->GetNRows()+fOuterSec->GetNRows()-1);
5917 }
5918
91162307 5919 }
5920 return 0;
5921}
5922
5923
5924Int_t AliTPCtrackerMI::PropagateForward2(TObjArray * arr)
5925{
5926 //
5927 // make forward propagation
5928 //
5929 Int_t nseed= arr->GetEntriesFast();
4d158c36 5930 //
91162307 5931 for (Int_t i=0;i<nseed;i++){
5932 AliTPCseed *pt = (AliTPCseed*)arr->UncheckedAt(i);
5933 if (pt) {
91162307 5934 FollowProlongation(*pt,0);
4d158c36 5935 }
91162307 5936 }
5937 return 0;
5938}
5939
5940
5941Int_t AliTPCtrackerMI::PropagateForward()
5942{
b67e07dc 5943 //
5944 // propagate track forward
4d158c36 5945 //UnsignClusters();
d26d9159 5946 Int_t nseed = fSeeds->GetEntriesFast();
5947 for (Int_t i=0;i<nseed;i++){
5948 AliTPCseed *pt = (AliTPCseed*)fSeeds->UncheckedAt(i);
5949 if (pt){
5950 AliTPCseed &t = *pt;
5951 Double_t alpha=t.GetAlpha() - fSectors->GetAlphaShift();
5952 if (alpha > 2.*TMath::Pi()) alpha -= 2.*TMath::Pi();
5953 if (alpha < 0. ) alpha += 2.*TMath::Pi();
5954 t.fRelativeSector = Int_t(alpha/fSectors->GetAlpha()+0.0001)%fN;
5955 }
5956 }
5957
91162307 5958 fSectors = fOuterSec;
d26d9159 5959 ParallelTracking(fSeeds,fOuterSec->GetNRows()+fInnerSec->GetNRows()-1,fInnerSec->GetNRows());
91162307 5960 fSectors = fInnerSec;
d26d9159 5961 ParallelTracking(fSeeds,fInnerSec->GetNRows()-1,0);
91162307 5962 //WriteTracks();
5963 return 1;
5964}
5965
5966
5967
5968
5969
5970
5971Int_t AliTPCtrackerMI::PropagateBack(AliTPCseed * pt, Int_t row0, Int_t row1)
5972{
5973 //
5974 // make back propagation, in between row0 and row1
5975 //
1c53abe2 5976
91162307 5977 if (pt) {
5978 fSectors = fInnerSec;
5979 Int_t r1;
5980 //
5981 if (row1<fSectors->GetNRows())
5982 r1 = row1;
5983 else
5984 r1 = fSectors->GetNRows()-1;
5985
5986 if (row0<fSectors->GetNRows()&& r1>0 )
5987 FollowBackProlongation(*pt,r1);
5988 if (row1<=fSectors->GetNRows())
5989 return 0;
5990 //
5991 r1 = row1 - fSectors->GetNRows();
5992 if (r1<=0) return 0;
5993 if (r1>=fOuterSec->GetNRows()) return 0;
5994 fSectors = fOuterSec;
5995 return FollowBackProlongation(*pt,r1);
5996 }
5997 return 0;
5998}
5999
6000
6001
6002
6003void AliTPCtrackerMI::GetShape(AliTPCseed * seed, Int_t row)
6004{
6005 //
6006 //
6007 Float_t sd2 = TMath::Abs((fParam->GetZLength()-TMath::Abs(seed->GetZ())))*fParam->GetDiffL()*fParam->GetDiffL();
6008 // Float_t padlength = fParam->GetPadPitchLength(seed->fSector);
6009 Float_t padlength = GetPadPitchLength(row);
6010 //
6011 Float_t sresy = (seed->fSector < fParam->GetNSector()/2) ? 0.2 :0.3;
6012 Float_t angulary = seed->GetSnp();
6013 angulary = angulary*angulary/(1-angulary*angulary);
6014 seed->fCurrentSigmaY2 = sd2+padlength*padlength*angulary/12.+sresy*sresy;
6015 //
6016 Float_t sresz = fParam->GetZSigma();
6017 Float_t angularz = seed->GetTgl();
6018 seed->fCurrentSigmaZ2 = sd2+padlength*padlength*angularz*angularz*(1+angulary)/12.+sresz*sresz;
6019 /*
6020 Float_t wy = GetSigmaY(seed);
6021 Float_t wz = GetSigmaZ(seed);
6022 wy*=wy;
6023 wz*=wz;
6024 if (TMath::Abs(wy/seed->fCurrentSigmaY2-1)>0.0001 || TMath::Abs(wz/seed->fCurrentSigmaZ2-1)>0.0001 ){
6025 printf("problem\n");
6026 }
6027 */
1c53abe2 6028}
6029
91162307 6030
1c53abe2 6031Float_t AliTPCtrackerMI::GetSigmaY(AliTPCseed * seed)
6032{
6033 //
6034 //
c9427e08 6035 Float_t sd2 = TMath::Abs((fParam->GetZLength()-TMath::Abs(seed->GetZ())))*fParam->GetDiffL()*fParam->GetDiffL();
1c53abe2 6036 Float_t padlength = fParam->GetPadPitchLength(seed->fSector);
6037 Float_t sres = (seed->fSector < fParam->GetNSector()/2) ? 0.2 :0.3;
6038 Float_t angular = seed->GetSnp();
6039 angular = angular*angular/(1-angular*angular);
6040 // angular*=angular;
6041 //angular = TMath::Sqrt(angular/(1-angular));
6042 Float_t res = TMath::Sqrt(sd2+padlength*padlength*angular/12.+sres*sres);
6043 return res;
6044}
6045Float_t AliTPCtrackerMI::GetSigmaZ(AliTPCseed * seed)
6046{
6047 //
6048 //
c9427e08 6049 Float_t sd2 = TMath::Abs((fParam->GetZLength()-TMath::Abs(seed->GetZ())))*fParam->GetDiffL()*fParam->GetDiffL();
1c53abe2 6050 Float_t padlength = fParam->GetPadPitchLength(seed->fSector);
6051 Float_t sres = fParam->GetZSigma();
6052 Float_t angular = seed->GetTgl();
6053 Float_t res = TMath::Sqrt(sd2+padlength*padlength*angular*angular/12.+sres*sres);
6054 return res;
6055}
6056
6057
1c53abe2 6058//__________________________________________________________________________
af32720d 6059void AliTPCtrackerMI::CookLabel(AliKalmanTrack *tk, Float_t wrong) const {
1c53abe2 6060 //--------------------------------------------------------------------
6061 //This function "cooks" a track label. If label<0, this track is fake.
6062 //--------------------------------------------------------------------
af32720d 6063 AliTPCseed * t = (AliTPCseed*)tk;
1c53abe2 6064 Int_t noc=t->GetNumberOfClusters();
91162307 6065 if (noc<10){
d26d9159 6066 //printf("\nnot founded prolongation\n\n\n");
6067 //t->Dump();
91162307 6068 return ;
6069 }
6070 Int_t lb[160];
6071 Int_t mx[160];
6072 AliTPCclusterMI *clusters[160];
6073 //
6074 for (Int_t i=0;i<160;i++) {
6075 clusters[i]=0;
6076 lb[i]=mx[i]=0;
6077 }
1c53abe2 6078
6079 Int_t i;
91162307 6080 Int_t current=0;
6081 for (i=0; i<160 && current<noc; i++) {
6082
6083 Int_t index=t->GetClusterIndex2(i);
6084 if (index<=0) continue;
6085 if (index&0x8000) continue;
6086 //
6087 //clusters[current]=GetClusterMI(index);
6088 if (t->fClusterPointer[i]){
6089 clusters[current]=t->fClusterPointer[i];
6090 current++;
6091 }
1c53abe2 6092 }
91162307 6093 noc = current;
1c53abe2 6094
6095 Int_t lab=123456789;
6096 for (i=0; i<noc; i++) {
6097 AliTPCclusterMI *c=clusters[i];
91162307 6098 if (!c) continue;
1c53abe2 6099 lab=TMath::Abs(c->GetLabel(0));
6100 Int_t j;
6101 for (j=0; j<noc; j++) if (lb[j]==lab || mx[j]==0) break;
6102 lb[j]=lab;
6103 (mx[j])++;
6104 }
6105
6106 Int_t max=0;
6107 for (i=0; i<noc; i++) if (mx[i]>max) {max=mx[i]; lab=lb[i];}
6108
6109 for (i=0; i<noc; i++) {
9918f10a 6110 AliTPCclusterMI *c=clusters[i];
91162307 6111 if (!c) continue;
1c53abe2 6112 if (TMath::Abs(c->GetLabel(1)) == lab ||
6113 TMath::Abs(c->GetLabel(2)) == lab ) max++;
6114 }
6115
6116 if ((1.- Float_t(max)/noc) > wrong) lab=-lab;
6117
6118 else {
6119 Int_t tail=Int_t(0.10*noc);
6120 max=0;
91162307 6121 Int_t ind=0;
6122 for (i=1; i<=160&&ind<tail; i++) {
6123 // AliTPCclusterMI *c=clusters[noc-i];
6124 AliTPCclusterMI *c=clusters[i];
6125 if (!c) continue;
1c53abe2 6126 if (lab == TMath::Abs(c->GetLabel(0)) ||
6127 lab == TMath::Abs(c->GetLabel(1)) ||
6128 lab == TMath::Abs(c->GetLabel(2))) max++;
91162307 6129 ind++;
1c53abe2 6130 }
6131 if (max < Int_t(0.5*tail)) lab=-lab;
6132 }
6133
6134 t->SetLabel(lab);
6135
91162307 6136 // delete[] lb;
6137 //delete[] mx;
6138 //delete[] clusters;
1c53abe2 6139}
6140
47966a6d 6141
51ad6848 6142//__________________________________________________________________________
6143Int_t AliTPCtrackerMI::CookLabel(AliTPCseed *t, Float_t wrong,Int_t first, Int_t last) const {
6144 //--------------------------------------------------------------------
6145 //This function "cooks" a track label. If label<0, this track is fake.
6146 //--------------------------------------------------------------------
6147 Int_t noc=t->GetNumberOfClusters();
6148 if (noc<10){
6149 //printf("\nnot founded prolongation\n\n\n");
6150 //t->Dump();
6151 return -1;
6152 }
6153 Int_t lb[160];
6154 Int_t mx[160];
6155 AliTPCclusterMI *clusters[160];
6156 //
6157 for (Int_t i=0;i<160;i++) {
6158 clusters[i]=0;
6159 lb[i]=mx[i]=0;
6160 }
6161
6162 Int_t i;
6163 Int_t current=0;
6164 for (i=0; i<160 && current<noc; i++) {
6165 if (i<first) continue;
6166 if (i>last) continue;
6167 Int_t index=t->GetClusterIndex2(i);
6168 if (index<=0) continue;
6169 if (index&0x8000) continue;
6170 //
6171 //clusters[current]=GetClusterMI(index);
6172 if (t->fClusterPointer[i]){
6173 clusters[current]=t->fClusterPointer[i];
6174 current++;
6175 }
6176 }
6177 noc = current;
6178 if (noc<5) return -1;
6179 Int_t lab=123456789;
6180 for (i=0; i<noc; i++) {
6181 AliTPCclusterMI *c=clusters[i];
6182 if (!c) continue;
6183 lab=TMath::Abs(c->GetLabel(0));
6184 Int_t j;
6185 for (j=0; j<noc; j++) if (lb[j]==lab || mx[j]==0) break;
6186 lb[j]=lab;
6187 (mx[j])++;
6188 }
6189
6190 Int_t max=0;
6191 for (i=0; i<noc; i++) if (mx[i]>max) {max=mx[i]; lab=lb[i];}
6192
6193 for (i=0; i<noc; i++) {
6194 AliTPCclusterMI *c=clusters[i];
6195 if (!c) continue;
6196 if (TMath::Abs(c->GetLabel(1)) == lab ||
6197 TMath::Abs(c->GetLabel(2)) == lab ) max++;
6198 }
6199
6200 if ((1.- Float_t(max)/noc) > wrong) lab=-lab;
6201
6202 else {
6203 Int_t tail=Int_t(0.10*noc);
6204 max=0;
6205 Int_t ind=0;
6206 for (i=1; i<=160&&ind<tail; i++) {
6207 // AliTPCclusterMI *c=clusters[noc-i];
6208 AliTPCclusterMI *c=clusters[i];
6209 if (!c) continue;
6210 if (lab == TMath::Abs(c->GetLabel(0)) ||
6211 lab == TMath::Abs(c->GetLabel(1)) ||
6212 lab == TMath::Abs(c->GetLabel(2))) max++;
6213 ind++;
6214 }
6215 if (max < Int_t(0.5*tail)) lab=-lab;
6216 }
6217
6218 // t->SetLabel(lab);
6219 return lab;
6220 // delete[] lb;
6221 //delete[] mx;
6222 //delete[] clusters;
6223}
6224
6225
47966a6d 6226Int_t AliTPCtrackerMI::AliTPCSector::GetRowNumber(Double_t x) const
6227{
6228 //return pad row number for this x
6229 Double_t r;
6230 if (fN < 64){
6231 r=fRow[fN-1].GetX();
6232 if (x > r) return fN;
6233 r=fRow[0].GetX();
6234 if (x < r) return -1;
6235 return Int_t((x-r)/fPadPitchLength + 0.5);}
6236 else{
6237 r=fRow[fN-1].GetX();
6238 if (x > r) return fN;
6239 r=fRow[0].GetX();
6240 if (x < r) return -1;
6241 Double_t r1=fRow[64].GetX();
6242 if(x<r1){
6243 return Int_t((x-r)/f1PadPitchLength + 0.5);}
6244 else{
6245 return (Int_t((x-r1)/f2PadPitchLength + 0.5)+64);}
6246 }
6247}
6248
eea478d3 6249Int_t AliTPCtrackerMI::GetRowNumber(Double_t x[3]) const
6250{
6251 //return pad row number for given x vector
6252 Float_t phi = TMath::ATan2(x[1],x[0]);
6253 if(phi<0) phi=2.*TMath::Pi()+phi;
6254 // Get the local angle in the sector philoc
6255 const Float_t kRaddeg = 180/3.14159265358979312;
6256 Float_t phiangle = (Int_t (phi*kRaddeg/20.) + 0.5)*20./kRaddeg;
6257 Double_t localx = x[0]*TMath::Cos(phiangle)-x[1]*TMath::Sin(phiangle);
6258 return GetRowNumber(localx);
6259}
6260
1c53abe2 6261//_________________________________________________________________________
6262void AliTPCtrackerMI::AliTPCSector::Setup(const AliTPCParam *par, Int_t f) {
6263 //-----------------------------------------------------------------------
6264 // Setup inner sector
6265 //-----------------------------------------------------------------------
6266 if (f==0) {
6267 fAlpha=par->GetInnerAngle();
6268 fAlphaShift=par->GetInnerAngleShift();
6269 fPadPitchWidth=par->GetInnerPadPitchWidth();
6270 fPadPitchLength=par->GetInnerPadPitchLength();
6271 fN=par->GetNRowLow();
6272 fRow=new AliTPCRow[fN];
6273 for (Int_t i=0; i<fN; i++) {
6274 fRow[i].SetX(par->GetPadRowRadiiLow(i));
6275 fRow[i].fDeadZone =1.5; //1.5 cm of dead zone
6276 }
6277 } else {
6278 fAlpha=par->GetOuterAngle();
6279 fAlphaShift=par->GetOuterAngleShift();
6280 fPadPitchWidth = par->GetOuterPadPitchWidth();
6281 fPadPitchLength = par->GetOuter1PadPitchLength();
6282 f1PadPitchLength = par->GetOuter1PadPitchLength();
6283 f2PadPitchLength = par->GetOuter2PadPitchLength();
6284
6285 fN=par->GetNRowUp();
6286 fRow=new AliTPCRow[fN];
6287 for (Int_t i=0; i<fN; i++) {
6288 fRow[i].SetX(par->GetPadRowRadiiUp(i));
6289 fRow[i].fDeadZone =1.5; // 1.5 cm of dead zone
6290 }
6291 }
6292}
6293
b67e07dc 6294AliTPCtrackerMI::AliTPCRow::AliTPCRow() {
6295 //
6296 // default constructor
6297 fN=0;
6298 fN1=0;
6299 fN2=0;
6300 fClusters1=0;
6301 fClusters2=0;
6302}
1c53abe2 6303
6304AliTPCtrackerMI::AliTPCRow::~AliTPCRow(){
6305 //
b67e07dc 6306
1c53abe2 6307}
6308
6309
6310
1c53abe2 6311//_________________________________________________________________________
6312void
6313AliTPCtrackerMI::AliTPCRow::InsertCluster(const AliTPCclusterMI* c, UInt_t index) {
6314 //-----------------------------------------------------------------------
6315 // Insert a cluster into this pad row in accordence with its y-coordinate
6316 //-----------------------------------------------------------------------
6317 if (fN==kMaxClusterPerRow) {
6318 cerr<<"AliTPCRow::InsertCluster(): Too many clusters !\n"; return;
6319 }
6320 if (fN==0) {fIndex[0]=index; fClusters[fN++]=c; return;}
6321 Int_t i=Find(c->GetZ());
6322 memmove(fClusters+i+1 ,fClusters+i,(fN-i)*sizeof(AliTPCclusterMI*));
6323 memmove(fIndex +i+1 ,fIndex +i,(fN-i)*sizeof(UInt_t));
6324 fIndex[i]=index; fClusters[i]=c; fN++;
6325}
6326
982aff31 6327void AliTPCtrackerMI::AliTPCRow::ResetClusters() {
6328 //
6329 // reset clusters
6330 fN = 0;
6331 fN1 = 0;
6332 fN2 = 0;
6333 //delete[] fClusterArray;
6334 if (fClusters1) delete []fClusters1;
6335 if (fClusters2) delete []fClusters2;
6336 //fClusterArray=0;
6337 fClusters1 = 0;
6338 fClusters2 = 0;
6339}
6340
91162307 6341
1c53abe2 6342//___________________________________________________________________
6343Int_t AliTPCtrackerMI::AliTPCRow::Find(Double_t z) const {
6344 //-----------------------------------------------------------------------
6345 // Return the index of the nearest cluster
6346 //-----------------------------------------------------------------------
6347 if (fN==0) return 0;
6348 if (z <= fClusters[0]->GetZ()) return 0;
6349 if (z > fClusters[fN-1]->GetZ()) return fN;
6350 Int_t b=0, e=fN-1, m=(b+e)/2;
6351 for (; b<e; m=(b+e)/2) {
6352 if (z > fClusters[m]->GetZ()) b=m+1;
6353 else e=m;
6354 }
6355 return m;
6356}
6357
6358
6359
1627d1c4 6360//___________________________________________________________________
6361AliTPCclusterMI * AliTPCtrackerMI::AliTPCRow::FindNearest(Double_t y, Double_t z, Double_t roady, Double_t roadz) const {
6362 //-----------------------------------------------------------------------
6363 // Return the index of the nearest cluster in z y
6364 //-----------------------------------------------------------------------
6365 Float_t maxdistance = roady*roady + roadz*roadz;
6366
6367 AliTPCclusterMI *cl =0;
6368 for (Int_t i=Find(z-roadz); i<fN; i++) {
6369 AliTPCclusterMI *c=(AliTPCclusterMI*)(fClusters[i]);
6370 if (c->GetZ() > z+roadz) break;
6371 if ( (c->GetY()-y) > roady ) continue;
6372 Float_t distance = (c->GetZ()-z)*(c->GetZ()-z)+(c->GetY()-y)*(c->GetY()-y);
6373 if (maxdistance>distance) {
6374 maxdistance = distance;
6375 cl=c;
6376 }
6377 }
6378 return cl;
6379}
6380
91162307 6381AliTPCclusterMI * AliTPCtrackerMI::AliTPCRow::FindNearest2(Double_t y, Double_t z, Double_t roady, Double_t roadz,UInt_t & index) const
6382{
6383 //-----------------------------------------------------------------------
6384 // Return the index of the nearest cluster in z y
6385 //-----------------------------------------------------------------------
6386 Float_t maxdistance = roady*roady + roadz*roadz;
91162307 6387 AliTPCclusterMI *cl =0;
3381b665 6388
6389 //PH Check boundaries. 510 is the size of fFastCluster
6390 Int_t iz1 = Int_t(z-roadz+254.5);
6391 if (iz1<0 || iz1>=510) return cl;
6392 iz1 = TMath::Max(fFastCluster[iz1]-1,0);
6393 Int_t iz2 = Int_t(z+roadz+255.5);
6394 if (iz2<0 || iz2>=510) return cl;
6395 iz2 = TMath::Min(fFastCluster[iz2]+1,fN);
6396
91162307 6397 //FindNearest3(y,z,roady,roadz,index);
6398 // for (Int_t i=Find(z-roadz); i<fN; i++) {
6399 for (Int_t i=iz1; i<iz2; i++) {
6400 AliTPCclusterMI *c=(AliTPCclusterMI*)(fClusters[i]);
6401 if (c->GetZ() > z+roadz) break;
6402 if ( c->GetY()-y > roady ) continue;
6403 if ( y-c->GetY() > roady ) continue;
6404 Float_t distance = (c->GetZ()-z)*(c->GetZ()-z)+(c->GetY()-y)*(c->GetY()-y);
6405 if (maxdistance>distance) {
6406 maxdistance = distance;
6407 cl=c;
6408 index =i;
6409 //roady = TMath::Sqrt(maxdistance);
6410 }
6411 }
6412 return cl;
6413}
6414
6415
6416
6417AliTPCclusterMI * AliTPCtrackerMI::AliTPCRow::FindNearest3(Double_t y, Double_t z, Double_t roady, Double_t roadz,UInt_t & index) const
6418{
6419 //-----------------------------------------------------------------------
6420 // Return the index of the nearest cluster in z y
6421 //-----------------------------------------------------------------------
6422 Float_t maxdistance = roady*roady + roadz*roadz;
6423 // Int_t iz = Int_t(z+255.);
6424 AliTPCclusterMI *cl =0;
6425 for (Int_t i=Find(z-roadz); i<fN; i++) {
6426 //for (Int_t i=fFastCluster[iz-2]; i<fFastCluster[iz+2]; i++) {
6427 AliTPCclusterMI *c=(AliTPCclusterMI*)(fClusters[i]);
6428 if (c->GetZ() > z+roadz) break;
6429 if ( c->GetY()-y > roady ) continue;
6430 if ( y-c->GetY() > roady ) continue;
6431 Float_t distance = (c->GetZ()-z)*(c->GetZ()-z)+(c->GetY()-y)*(c->GetY()-y);
6432 if (maxdistance>distance) {
6433 maxdistance = distance;
6434 cl=c;
6435 index =i;
6436 //roady = TMath::Sqrt(maxdistance);
6437 }
6438 }
6439 return cl;
6440}
1627d1c4 6441
6442
6443
6444
91162307 6445
81e97e0d 6446// AliTPCTrackerPoint * AliTPCseed::GetTrackPoint(Int_t i)
6447// {
6448// //
6449// //
6450// return &fTrackPoints[i];
6451// }
91162307 6452
91162307 6453