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