]> 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
SetRunReconstruction renamed to SetRunLoaclReconstruction. First implementation of...
[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;
e191bb57 279 fInput = AliRunLoader::GetTreeR("TPC", kFALSE,AliConfig::GetDefaultEventFolderName());
d26d9159 280
e191bb57 281 fOutput = AliRunLoader::GetTreeT("TPC", kTRUE,AliConfig::GetDefaultEventFolderName());
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());
4d158c36 351 if ( (pt->GetNumberOfClusters()>70)&& (Float_t(pt->GetNumberOfClusters())/Float_t(pt->fNFoundable))>0.55) {
d26d9159 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);
4d158c36 1434 AliTPCclusterMI *cl=0;
1435 Int_t tpcindex= t.GetClusterIndex2(nr);
1436 //
1437 // update current shape info every 5 pad-row
1438 // if ( (nr%5==0) || t.GetNumberOfClusters()<2 || (t.fCurrentSigmaY2<0.0001) ){
1439 GetShape(&t,nr);
1440 //}
1441 //
1442 if (fIteration>0 && tpcindex>=-1){ //if we have already clusters
1443 //
1444 if (tpcindex==-1) return 0; //track in dead zone
1445 if (tpcindex>0){ //
1446 cl = t.fClusterPointer[nr];
e0656451 1447 if ( (cl==0) ) cl = GetClusterMI(tpcindex);
4d158c36 1448 t.fCurrentClusterIndex1 = tpcindex;
1449 }
1450 if (cl){
1451 Int_t relativesector = ((tpcindex&0xff000000)>>24)%18; // if previously accepted cluster in different sector
1452 Float_t angle = relativesector*fSectors->GetAlpha()+fSectors->GetAlphaShift();
1453 //
1454 if (angle<-TMath::Pi()) angle += 2*TMath::Pi();
1455 if (angle>=TMath::Pi()) angle -= 2*TMath::Pi();
1456
1457 if (TMath::Abs(angle-t.GetAlpha())>0.001){
1458 Double_t rotation = angle-t.GetAlpha();
1459 t.fRelativeSector= relativesector;
1460 t.Rotate(rotation);
1461 }
1462 t.PropagateTo(x);
1463 //
1464 t.fCurrentCluster = cl;
1465 t.fRow = nr;
1466 Int_t accept = AcceptCluster(&t,t.fCurrentCluster,1.);
1467 if ((tpcindex&0x8000)==0) accept =0;
1468 if (accept<3) {
1469 //if founded cluster is acceptible
1470 if (cl->IsUsed(11)) { // id cluster is shared inrease uncertainty
1471 t.fErrorY2 += 0.03;
1472 t.fErrorZ2 += 0.03;
1473 t.fErrorY2 *= 3;
1474 t.fErrorZ2 *= 3;
1475 }
1476 t.fNFoundable++;
1477 UpdateTrack(&t,accept);
1478 return 1;
1479 }
1480 }
1627d1c4 1481 }
4d158c36 1482 if (fIteration>1) return 0; // not look for new cluster during refitting
91162307 1483 //
4d158c36 1484 UInt_t index=0;
1485 if (TMath::Abs(t.GetSnp())>0.95 || TMath::Abs(x*t.GetC()-t.GetEta())>0.95) return 0;
1486 Double_t y=t.GetYat(x);
91162307 1487 if (TMath::Abs(y)>ymax){
1488 if (y > ymax) {
1489 t.fRelativeSector= (t.fRelativeSector+1) % fN;
1490 if (!t.Rotate(fSectors->GetAlpha()))
1491 return 0;
1492 } else if (y <-ymax) {
1493 t.fRelativeSector= (t.fRelativeSector-1+fN) % fN;
1494 if (!t.Rotate(-fSectors->GetAlpha()))
1495 return 0;
1496 }
4d158c36 1497 //return 1;
91162307 1498 }
1499 //
4d158c36 1500 if (!t.PropagateTo(x)) {
1501 if (fIteration==0) t.fRemoval = 10;
1502 return 0;
91162307 1503 }
4d158c36 1504 y=t.GetY();
1505 Double_t z=t.GetZ();
1506 //
91162307 1507 const AliTPCRow &krow=GetRow(t.fRelativeSector,nr);
1508 if ( (t.GetSigmaY2()<0) || t.GetSigmaZ2()<0) return 0;
1509 Double_t roady =1.;
1510 Double_t roadz = 1.;
1511 //
1c53abe2 1512 if (TMath::Abs(TMath::Abs(y)-ymax)<krow.fDeadZone){
1513 t.fInDead = kTRUE;
91162307 1514 t.SetClusterIndex2(nr,-1);
1c53abe2 1515 return 0;
1516 }
1517 else
1518 {
1627d1c4 1519 if (TMath::Abs(z)<(1.05*x+10)) t.fNFoundable++;
1520 else
1521 return 0;
1c53abe2 1522 }
1523 //calculate
91162307 1524 if (krow) {
1525 // cl = krow.FindNearest2(y+10.,z,roady,roadz,index);
1526 cl = krow.FindNearest2(y,z,roady,roadz,index);
1527 if (cl) t.fCurrentClusterIndex1 = krow.GetIndex(index);
1528 }
91162307 1529 if (cl) {
1530 t.fCurrentCluster = cl;
1531 t.fRow = nr;
4d158c36 1532 if (fIteration==2&&cl->IsUsed(10)) return 0;
91162307 1533 Int_t accept = AcceptCluster(&t,t.fCurrentCluster,1.);
4d158c36 1534 if (fIteration==2&&cl->IsUsed(11)) {
1535 t.fErrorY2 += 0.03;
1536 t.fErrorZ2 += 0.03;
1537 t.fErrorY2 *= 3;
1538 t.fErrorZ2 *= 3;
1539 }
d26d9159 1540 /*
91162307 1541 if (t.fCurrentCluster->IsUsed(10)){
1542 //
1543 //
c9427e08 1544
91162307 1545 t.fNShared++;
1546 if (t.fNShared>0.7*t.GetNumberOfClusters()) {
1547 t.fRemoval =10;
1548 return 0;
1549 }
1550 }
d26d9159 1551 */
91162307 1552 if (accept<3) UpdateTrack(&t,accept);
c9427e08 1553
91162307 1554 } else {
982aff31 1555 if ( fIteration==0 && t.fNFoundable*0.5 > t.GetNumberOfClusters()) t.fRemoval=10;
91162307 1556
1557 }
1558 return 1;
1559}
c9427e08 1560
91162307 1561Int_t AliTPCtrackerMI::FollowToNextFast(AliTPCseed& t, Int_t nr) {
1562 //-----------------------------------------------------------------
1563 // This function tries to find a track prolongation to next pad row
1564 //-----------------------------------------------------------------
1565 //
1566 Double_t x= GetXrow(nr), ymax=GetMaxY(nr);
1567 Double_t y,z;
1568 if (!t.GetProlongation(x,y,z)) {
1569 t.fRemoval = 10;
1570 return 0;
1571 }
1572 //
1573 //
1574 if (TMath::Abs(y)>ymax){
91162307 1575
1c53abe2 1576 if (y > ymax) {
1577 t.fRelativeSector= (t.fRelativeSector+1) % fN;
1578 if (!t.Rotate(fSectors->GetAlpha()))
1579 return 0;
1580 } else if (y <-ymax) {
1581 t.fRelativeSector= (t.fRelativeSector-1+fN) % fN;
1582 if (!t.Rotate(-fSectors->GetAlpha()))
1583 return 0;
91162307 1584 }
1585 if (!t.PropagateTo(x)) {
1586 return 0;
1587 }
1588 t.GetProlongation(x,y,z);
1589 }
1590 //
1591 // update current shape info every 3 pad-row
1592 if ( (nr%6==0) || t.GetNumberOfClusters()<2 || (t.fCurrentSigmaY2<0.0001) ){
1593 // t.fCurrentSigmaY = GetSigmaY(&t);
1594 //t.fCurrentSigmaZ = GetSigmaZ(&t);
1595 GetShape(&t,nr);
1596 }
1597 //
1598 AliTPCclusterMI *cl=0;
1599 UInt_t index=0;
1600
1601
1602 //Int_t nr2 = nr;
1603 const AliTPCRow &krow=GetRow(t.fRelativeSector,nr);
1604 if ( (t.GetSigmaY2()<0) || t.GetSigmaZ2()<0) return 0;
1605 Double_t roady =1.;
1606 Double_t roadz = 1.;
1607 //
1608 Int_t row = nr;
1609 if (TMath::Abs(TMath::Abs(y)-ymax)<krow.fDeadZone){
1610 t.fInDead = kTRUE;
1611 t.SetClusterIndex2(row,-1);
1612 return 0;
1613 }
1614 else
1615 {
1616 if (TMath::Abs(z)>(1.05*x+10)) t.SetClusterIndex2(row,-1);
1c53abe2 1617 }
91162307 1618 //calculate
1619
1620 if ((cl==0)&&(krow)) {
1621 // cl = krow.FindNearest2(y+10,z,roady,roadz,index);
1622 cl = krow.FindNearest2(y,z,roady,roadz,index);
1623
1624 if (cl) t.fCurrentClusterIndex1 = krow.GetIndex(index);
1625 }
1626
1627 if (cl) {
1628 t.fCurrentCluster = cl;
1629 // Int_t accept = AcceptCluster(&t,t.fCurrentCluster,1.);
1630 //if (accept<3){
1631 t.SetClusterIndex2(row,index);
1632 t.fClusterPointer[row] = cl;
1633 //}
1c53abe2 1634 }
1635 return 1;
1636}
1637
1638
91162307 1639
1640Int_t AliTPCtrackerMI::UpdateClusters(AliTPCseed& t, Int_t nr) {
1c53abe2 1641 //-----------------------------------------------------------------
1642 // This function tries to find a track prolongation to next pad row
1643 //-----------------------------------------------------------------
1644 t.fCurrentCluster = 0;
1645 t.fCurrentClusterIndex1 = 0;
1c53abe2 1646
1647 Double_t xt=t.GetX();
91162307 1648 Int_t row = GetRowNumber(xt)-1;
1649 Double_t ymax= GetMaxY(nr);
1650
1c53abe2 1651 if (row < nr) return 1; // don't prolongate if not information until now -
91162307 1652 if (TMath::Abs(t.GetSnp())>0.9 && t.GetNumberOfClusters()>40. && fIteration!=2) {
1653 t.fRemoval =10;
1654 return 0; // not prolongate strongly inclined tracks
1655 }
1656 if (TMath::Abs(t.GetSnp())>0.95) {
1657 t.fRemoval =10;
1658 return 0; // not prolongate strongly inclined tracks
1659 }
1660
1661 Double_t x= GetXrow(nr);
1662 Double_t y,z;
1663 //t.PropagateTo(x+0.02);
1664 //t.PropagateTo(x+0.01);
1627d1c4 1665 if (!t.PropagateTo(x)){
1627d1c4 1666 return 0;
1667 }
1c53abe2 1668 //
91162307 1669 y=t.GetY();
1670 z=t.GetZ();
1c53abe2 1671
91162307 1672 if (TMath::Abs(y)>ymax){
1673 if (y > ymax) {
1674 t.fRelativeSector= (t.fRelativeSector+1) % fN;
1675 if (!t.Rotate(fSectors->GetAlpha()))
1676 return 0;
1677 } else if (y <-ymax) {
1678 t.fRelativeSector= (t.fRelativeSector-1+fN) % fN;
1679 if (!t.Rotate(-fSectors->GetAlpha()))
1680 return 0;
1681 }
982aff31 1682 // if (!t.PropagateTo(x)){
1683 // return 0;
1684 //}
1685 return 1;
1686 //y = t.GetY();
1c53abe2 1687 }
91162307 1688 //
1c53abe2 1689
91162307 1690 AliTPCRow &krow=GetRow(t.fRelativeSector,nr);
1c53abe2 1691
1692 if (TMath::Abs(TMath::Abs(y)-ymax)<krow.fDeadZone){
1693 t.fInDead = kTRUE;
91162307 1694 t.SetClusterIndex2(nr,-1);
1c53abe2 1695 return 0;
1696 }
1697 else
1698 {
1627d1c4 1699 if (TMath::Abs(t.GetZ())<(1.05*t.GetX()+10)) t.fNFoundable++;
1700 else
1701 return 0;
1c53abe2 1702 }
1c53abe2 1703
91162307 1704 // update current
1705 if ( (nr%6==0) || t.GetNumberOfClusters()<2){
1706 // t.fCurrentSigmaY = GetSigmaY(&t);
1707 //t.fCurrentSigmaZ = GetSigmaZ(&t);
1708 GetShape(&t,nr);
1709 }
1c53abe2 1710
91162307 1711 AliTPCclusterMI *cl=0;
1712 UInt_t index=0;
1713 //
1714 Double_t roady = 1.;
1715 Double_t roadz = 1.;
1716 //
d26d9159 1717
1718 if (!cl){
1719 index = t.GetClusterIndex2(nr);
1720 if ( (index>0) && (index&0x8000)==0){
1721 cl = t.fClusterPointer[nr];
1722 if ( (cl==0) && (index>0)) cl = GetClusterMI(index);
1723 t.fCurrentClusterIndex1 = index;
1724 if (cl) {
1725 t.fCurrentCluster = cl;
1726 return 1;
1727 }
1728 }
1729 }
1730
91162307 1731 if (krow) {
1732 //cl = krow.FindNearest2(y+10,z,roady,roadz,index);
1733 cl = krow.FindNearest2(y,z,roady,roadz,index);
1734 }
d26d9159 1735
91162307 1736 if (cl) t.fCurrentClusterIndex1 = krow.GetIndex(index);
d26d9159 1737 t.fCurrentCluster = cl;
1738
91162307 1739 return 1;
1740}
1c53abe2 1741
1c53abe2 1742
91162307 1743Int_t AliTPCtrackerMI::FollowToNextCluster(AliTPCseed & t, Int_t nr) {
1744 //-----------------------------------------------------------------
1745 // This function tries to find a track prolongation to next pad row
1746 //-----------------------------------------------------------------
1c53abe2 1747
91162307 1748 //update error according neighborhoud
1c53abe2 1749
91162307 1750 if (t.fCurrentCluster) {
1751 t.fRow = nr;
8c51a605 1752 Int_t accept = AcceptCluster(&t,t.fCurrentCluster,1.);
91162307 1753
1754 if (t.fCurrentCluster->IsUsed(10)){
1755 //
1756 //
1757 // t.fErrorZ2*=2;
1758 // t.fErrorY2*=2;
1759 t.fNShared++;
1760 if (t.fNShared>0.7*t.GetNumberOfClusters()) {
1761 t.fRemoval =10;
1762 return 0;
1763 }
b364ca79 1764 }
d26d9159 1765 if (fIteration>0) accept = 0;
b364ca79 1766 if (accept<3) UpdateTrack(&t,accept);
1767
1c53abe2 1768 } else {
91162307 1769 if (fIteration==0){
1770 if ( ( (t.GetSigmaY2()+t.GetSigmaZ2())>0.16)&& t.GetNumberOfClusters()>18) t.fRemoval=10;
1771 if ( t.GetChi2()/t.GetNumberOfClusters()>6 &&t.GetNumberOfClusters()>18) t.fRemoval=10;
1772
1773 if (( (t.fNFoundable*0.5 > t.GetNumberOfClusters()) || t.fNoCluster>15)) t.fRemoval=10;
1c53abe2 1774 }
1775 }
1776 return 1;
1777}
1778
1779
1780
91162307 1781//_____________________________________________________________________________
1782Int_t AliTPCtrackerMI::FollowProlongation(AliTPCseed& t, Int_t rf, Int_t step) {
1c53abe2 1783 //-----------------------------------------------------------------
91162307 1784 // This function tries to find a track prolongation.
1c53abe2 1785 //-----------------------------------------------------------------
1786 Double_t xt=t.GetX();
1787 //
91162307 1788 Double_t alpha=t.GetAlpha() - fSectors->GetAlphaShift();
1c53abe2 1789 if (alpha > 2.*TMath::Pi()) alpha -= 2.*TMath::Pi();
1790 if (alpha < 0. ) alpha += 2.*TMath::Pi();
91162307 1791 //
1792 t.fRelativeSector = Int_t(alpha/fSectors->GetAlpha()+0.0001)%fN;
1c53abe2 1793
91162307 1794 Int_t first = GetRowNumber(xt)-1;
1795 for (Int_t nr= first; nr>=rf; nr-=step) {
982aff31 1796 if (nr<fInnerSec->GetNRows())
1797 fSectors = fInnerSec;
1798 else
1799 fSectors = fOuterSec;
91162307 1800 if (FollowToNext(t,nr)==0)
4d158c36 1801 if (!t.IsActive())
1802 return 0;
91162307 1803
1804 }
1805 return 1;
1806}
1807
1c53abe2 1808
1809//_____________________________________________________________________________
91162307 1810Int_t AliTPCtrackerMI::FollowProlongationFast(AliTPCseed& t, Int_t rf, Int_t step) {
1c53abe2 1811 //-----------------------------------------------------------------
1812 // This function tries to find a track prolongation.
1813 //-----------------------------------------------------------------
1814 Double_t xt=t.GetX();
1815 //
1816 Double_t alpha=t.GetAlpha() - fSectors->GetAlphaShift();
1817 if (alpha > 2.*TMath::Pi()) alpha -= 2.*TMath::Pi();
1818 if (alpha < 0. ) alpha += 2.*TMath::Pi();
91162307 1819 t.fRelativeSector = Int_t(alpha/fSectors->GetAlpha()+0.0001)%fN;
1820
1821 for (Int_t nr=GetRowNumber(xt)-1; nr>=rf; nr-=step) {
1822
1823 if (FollowToNextFast(t,nr)==0)
1824 if (!t.IsActive()) return 0;
1c53abe2 1825
1c53abe2 1826 }
1827 return 1;
1828}
1829
1830
91162307 1831
1832
1833
1c53abe2 1834Int_t AliTPCtrackerMI::FollowBackProlongation(AliTPCseed& t, Int_t rf) {
1835 //-----------------------------------------------------------------
1836 // This function tries to find a track prolongation.
1837 //-----------------------------------------------------------------
91162307 1838 // Double_t xt=t.GetX();
1c53abe2 1839 //
1840 Double_t alpha=t.GetAlpha() - fSectors->GetAlphaShift();
1841 if (alpha > 2.*TMath::Pi()) alpha -= 2.*TMath::Pi();
1842 if (alpha < 0. ) alpha += 2.*TMath::Pi();
91162307 1843 t.fRelativeSector = Int_t(alpha/fSectors->GetAlpha()+0.0001)%fN;
1c53abe2 1844
4d158c36 1845 Int_t first = t.fFirstPoint;
91162307 1846 //
1847 if (first<0) first=0;
4d158c36 1848 for (Int_t nr=first; nr<=rf; nr++) {
91162307 1849 //if ( (t.GetSnp()<0.9))
d26d9159 1850 if (nr<fInnerSec->GetNRows())
1851 fSectors = fInnerSec;
1852 else
1853 fSectors = fOuterSec;
1854 FollowToNext(t,nr);
1c53abe2 1855 }
1856 return 1;
1857}
1858
1859
1860
1861
1862
1863Float_t AliTPCtrackerMI::OverlapFactor(AliTPCseed * s1, AliTPCseed * s2, Int_t &sum1, Int_t & sum2)
1864{
1865 //
1866 //
1867 sum1=0;
1868 sum2=0;
1869 Int_t sum=0;
1c53abe2 1870 //
1871 Float_t dz2 =(s1->GetZ() - s2->GetZ());
c9427e08 1872 dz2*=dz2;
91162307 1873
c9427e08 1874 Float_t dy2 =TMath::Abs((s1->GetY() - s2->GetY()));
1c53abe2 1875 dy2*=dy2;
1876 Float_t distance = TMath::Sqrt(dz2+dy2);
c9427e08 1877 if (distance>4.) return 0; // if there are far away - not overlap - to reduce combinatorics
1c53abe2 1878
91162307 1879 // Int_t offset =0;
c9427e08 1880 Int_t firstpoint = TMath::Min(s1->fFirstPoint,s2->fFirstPoint);
1881 Int_t lastpoint = TMath::Max(s1->fLastPoint,s2->fLastPoint);
c9427e08 1882 if (lastpoint>160)
1883 lastpoint =160;
1884 if (firstpoint<0)
1885 firstpoint = 0;
91162307 1886 if (firstpoint>lastpoint) {
1887 firstpoint =lastpoint;
1888 // lastpoint =160;
c9427e08 1889 }
1890
1891
91162307 1892 for (Int_t i=firstpoint-1;i<lastpoint+1;i++){
1893 if (s1->GetClusterIndex2(i)>0) sum1++;
1894 if (s2->GetClusterIndex2(i)>0) sum2++;
1895 if (s1->GetClusterIndex2(i)==s2->GetClusterIndex2(i) && s1->GetClusterIndex2(i)>0) {
1c53abe2 1896 sum++;
1897 }
1898 }
91162307 1899 if (sum<5) return 0;
1900
1627d1c4 1901 Float_t summin = TMath::Min(sum1+1,sum2+1);
1902 Float_t ratio = (sum+1)/Float_t(summin);
1c53abe2 1903 return ratio;
1904}
1905
1906void AliTPCtrackerMI::SignShared(AliTPCseed * s1, AliTPCseed * s2)
1907{
1908 //
1909 //
91162307 1910 if (TMath::Abs(s1->GetC()-s2->GetC())>0.004) return;
1911 if (TMath::Abs(s1->GetTgl()-s2->GetTgl())>0.6) return;
1912
1c53abe2 1913 Float_t dz2 =(s1->GetZ() - s2->GetZ());
1914 dz2*=dz2;
1915 Float_t dy2 =(s1->GetY() - s2->GetY());
1916 dy2*=dy2;
91162307 1917 Float_t distance = dz2+dy2;
1918 if (distance>325.) return ; // if there are far away - not overlap - to reduce combinatorics
1919
1c53abe2 1920 //
91162307 1921 Int_t sumshared=0;
1922 //
1923 Int_t firstpoint = TMath::Max(s1->fFirstPoint,s2->fFirstPoint);
1924 Int_t lastpoint = TMath::Min(s1->fLastPoint,s2->fLastPoint);
1925 //
1926 if (firstpoint>=lastpoint-5) return;;
1c53abe2 1927
91162307 1928 for (Int_t i=firstpoint;i<lastpoint;i++){
1929 // if ( (s1->GetClusterIndex2(i)&0xFFFF8FFF)==(s2->GetClusterIndex2(i)&0xFFFF8FFF) && s1->GetClusterIndex2(i)>0) {
1930 if ( (s1->GetClusterIndex2(i))==(s2->GetClusterIndex2(i)) && s1->GetClusterIndex2(i)>0) {
1931 sumshared++;
1932 }
1933 }
1934 if (sumshared>4){
1935 // sign clusters
1936 //
1937 for (Int_t i=firstpoint;i<lastpoint;i++){
1938 // if ( (s1->GetClusterIndex2(i)&0xFFFF8FFF)==(s2->GetClusterIndex2(i)&0xFFFF8FFF) && s1->GetClusterIndex2(i)>0) {
1939 if ( (s1->GetClusterIndex2(i))==(s2->GetClusterIndex2(i)) && s1->GetClusterIndex2(i)>0) {
1940 AliTPCTrackerPoint *p1 = s1->GetTrackPoint(i);
1941 AliTPCTrackerPoint *p2 = s2->GetTrackPoint(i);;
1942 if (s1->IsActive()&&s2->IsActive()){
1943 p1->fIsShared = kTRUE;
1944 p2->fIsShared = kTRUE;
1945 }
1946 }
1947 }
1948 }
1949 //
1950 if (sumshared>10){
1951 for (Int_t i=0;i<4;i++){
1952 if (s1->fOverlapLabels[3*i]==0){
1953 s1->fOverlapLabels[3*i] = s2->GetLabel();
1954 s1->fOverlapLabels[3*i+1] = sumshared;
1955 s1->fOverlapLabels[3*i+2] = s2->GetUniqueID();
1956 break;
1957 }
1958 }
1959 for (Int_t i=0;i<4;i++){
1960 if (s2->fOverlapLabels[3*i]==0){
1961 s2->fOverlapLabels[3*i] = s1->GetLabel();
1962 s2->fOverlapLabels[3*i+1] = sumshared;
1963 s2->fOverlapLabels[3*i+2] = s1->GetUniqueID();
1964 break;
1965 }
1966 }
1967 }
1c53abe2 1968
91162307 1969}
1c53abe2 1970
91162307 1971void AliTPCtrackerMI::SignShared(TObjArray * arr)
1972{
1c53abe2 1973 //
91162307 1974 //sort trackss according sectors
1975 //
c9427e08 1976 for (Int_t i=0; i<arr->GetEntriesFast(); i++) {
1977 AliTPCseed *pt=(AliTPCseed*)arr->UncheckedAt(i);
91162307 1978 if (!pt) continue;
1979 //if (pt) RotateToLocal(pt);
1980 pt->fSort = 0;
c9427e08 1981 }
91162307 1982 arr->UnSort();
1c53abe2 1983 arr->Sort(); // sorting according z
1984 arr->Expand(arr->GetEntries());
91162307 1985 //
1986 //
1c53abe2 1987 Int_t nseed=arr->GetEntriesFast();
1c53abe2 1988 for (Int_t i=0; i<nseed; i++) {
1989 AliTPCseed *pt=(AliTPCseed*)arr->UncheckedAt(i);
91162307 1990 if (!pt) continue;
1991 for (Int_t j=0;j<=12;j++){
1992 pt->fOverlapLabels[j] =0;
1c53abe2 1993 }
91162307 1994 }
1995 for (Int_t i=0; i<nseed; i++) {
1996 AliTPCseed *pt=(AliTPCseed*)arr->UncheckedAt(i);
1997 if (!pt) continue;
1998 if (pt->fRemoval>10) continue;
1c53abe2 1999 for (Int_t j=i+1; j<nseed; j++){
2000 AliTPCseed *pt2=(AliTPCseed*)arr->UncheckedAt(j);
91162307 2001 // if (pt2){
2002 if (pt2->fRemoval<=10) {
2003 if ( TMath::Abs(pt->fRelativeSector-pt2->fRelativeSector)>0) break;
2004 SignShared(pt,pt2);
c9427e08 2005 }
91162307 2006 }
2007 }
2008}
2009
2010void AliTPCtrackerMI::RemoveDouble(TObjArray * arr, Float_t factor1, Float_t factor2, Int_t removalindex)
2011{
2012 //
2013 //sort trackss according sectors
2014 //
2015 if (fDebug&1) {
6bdc18d6 2016 Info("RemoveDouble","Number of tracks before double removal- %d\n",arr->GetEntries());
91162307 2017 }
2018 //
2019 for (Int_t i=0; i<arr->GetEntriesFast(); i++) {
2020 AliTPCseed *pt=(AliTPCseed*)arr->UncheckedAt(i);
2021 if (!pt) continue;
2022 pt->fSort = 0;
2023 }
2024 arr->UnSort();
2025 arr->Sort(); // sorting according z
2026 arr->Expand(arr->GetEntries());
2027 //
2028 //reset overlap labels
2029 //
2030 Int_t nseed=arr->GetEntriesFast();
2031 for (Int_t i=0; i<nseed; i++) {
2032 AliTPCseed *pt=(AliTPCseed*)arr->UncheckedAt(i);
2033 if (!pt) continue;
2034 pt->SetUniqueID(i);
2035 for (Int_t j=0;j<=12;j++){
2036 pt->fOverlapLabels[j] =0;
1c53abe2 2037 }
2038 }
91162307 2039 //
2040 //sign shared tracks
1c53abe2 2041 for (Int_t i=0; i<nseed; i++) {
2042 AliTPCseed *pt=(AliTPCseed*)arr->UncheckedAt(i);
91162307 2043 if (!pt) continue;
2044 if (pt->fRemoval>10) continue;
2045 Float_t deltac = pt->GetC()*0.1;
2046 for (Int_t j=i+1; j<nseed; j++){
2047 AliTPCseed *pt2=(AliTPCseed*)arr->UncheckedAt(j);
2048 // if (pt2){
2049 if (pt2->fRemoval<=10) {
2050 if ( TMath::Abs(pt->fRelativeSector-pt2->fRelativeSector)>0) break;
2051 if (TMath::Abs(pt->GetC() -pt2->GetC())>deltac) continue;
2052 if (TMath::Abs(pt->GetTgl()-pt2->GetTgl())>0.05) continue;
2053 //
2054 SignShared(pt,pt2);
2055 }
1c53abe2 2056 }
1c53abe2 2057 }
91162307 2058 //
2059 // remove highly shared tracks
2060 for (Int_t i=0; i<nseed; i++) {
2061 AliTPCseed *pt=(AliTPCseed*)arr->UncheckedAt(i);
2062 if (!pt) continue;
2063 if (pt->fRemoval>10) continue;
2064 //
2065 Int_t sumshared =0;
2066 for (Int_t j=0;j<4;j++){
2067 sumshared = pt->fOverlapLabels[j*3+1];
2068 }
2069 Float_t factor = factor1;
2070 if (pt->fRemoval>0) factor = factor2;
2071 if (sumshared/pt->GetNumberOfClusters()>factor){
2072 for (Int_t j=0;j<4;j++){
2073 if (pt->fOverlapLabels[3*j]==0) continue;
2074 if (pt->fOverlapLabels[3*j+1]<5) continue;
2075 if (pt->fRemoval==removalindex) continue;
2076 AliTPCseed * pt2 = (AliTPCseed*)arr->UncheckedAt(pt->fOverlapLabels[3*j+2]);
2077 if (!pt2) continue;
2078 if (pt2->GetSigma2C()<pt->GetSigma2C()){
2079 // pt->fRemoval = removalindex;
2080 delete arr->RemoveAt(i);
2081 break;
1c53abe2 2082 }
91162307 2083 }
1c53abe2 2084 }
91162307 2085 }
2086 arr->Compress();
2087 if (fDebug&1) {
6bdc18d6 2088 Info("RemoveDouble","Number of tracks after double removal- %d\n",arr->GetEntries());
91162307 2089 }
2090}
2091
2092
2093
1c53abe2 2094
2095
91162307 2096
47966a6d 2097void AliTPCtrackerMI::SortTracks(TObjArray * arr, Int_t mode) const
91162307 2098{
2099 //
2100 //sort tracks in array according mode criteria
2101 Int_t nseed = arr->GetEntriesFast();
2102 for (Int_t i=0; i<nseed; i++) {
2103 AliTPCseed *pt=(AliTPCseed*)arr->UncheckedAt(i);
2104 if (!pt) {
2105 continue;
2106 }
2107 pt->fSort = mode;
2108 }
2109 arr->UnSort();
2110 arr->Sort();
1c53abe2 2111}
c9427e08 2112
91162307 2113void AliTPCtrackerMI::RemoveUsed(TObjArray * arr, Float_t factor1, Float_t factor2, Int_t removalindex)
c9427e08 2114{
2115
2116 //Loop over all tracks and remove "overlaps"
2117 //
2118 //
2119 Int_t nseed = arr->GetEntriesFast();
2120 Int_t good =0;
91162307 2121
c9427e08 2122 for (Int_t i=0; i<nseed; i++) {
2123 AliTPCseed *pt=(AliTPCseed*)arr->UncheckedAt(i);
2124 if (!pt) {
91162307 2125 delete arr->RemoveAt(i);
c9427e08 2126 }
91162307 2127 else{
2128 pt->fSort =1;
2129 pt->fBSigned = kFALSE;
c9427e08 2130 }
91162307 2131 }
2132 arr->Compress();
2133 nseed = arr->GetEntriesFast();
2134 arr->UnSort();
2135 arr->Sort();
2136 //
2137 //unsign used
2138 UnsignClusters();
2139 //
2140 for (Int_t i=0; i<nseed; i++) {
2141 AliTPCseed *pt=(AliTPCseed*)arr->UncheckedAt(i);
2142 if (!pt) {
2143 continue;
2144 }
2145 Int_t found,foundable,shared;
2146 if (pt->IsActive())
2147 pt->GetClusterStatistic(0,160,found, foundable,shared,kFALSE);
2148 else
2149 pt->GetClusterStatistic(0,160,found, foundable,shared,kTRUE);
2150 //
2151 Double_t factor = factor2;
2152 if (pt->fBConstrain) factor = factor1;
2153
2154 if ((Float_t(shared)/Float_t(found))>factor){
c9427e08 2155 pt->Desactivate(removalindex);
91162307 2156 continue;
2157 }
2158
2159 good++;
2160 for (Int_t i=0; i<160; i++) {
2161 Int_t index=pt->GetClusterIndex2(i);
2162 if (index<0 || index&0x8000 ) continue;
2163 AliTPCclusterMI *c= pt->fClusterPointer[i];
2164 if (!c) continue;
2165 // if (!c->IsUsed(10)) c->Use(10);
2166 //if (pt->IsActive())
2167 c->Use(10);
2168 //else
2169 // c->Use(5);
c9427e08 2170 }
91162307 2171
c9427e08 2172 }
2173 fNtracks = good;
6bdc18d6 2174 if (fDebug>0){
2175 Info("RemoveUsed","\n*****\nNumber of good tracks after shared removal\t%d\n",fNtracks);
2176 }
c9427e08 2177}
2178
91162307 2179void AliTPCtrackerMI::UnsignClusters()
1c53abe2 2180{
91162307 2181 //
2182 // loop over all clusters and unsign them
2183 //
2184
2185 for (Int_t sec=0;sec<fkNIS;sec++){
2186 for (Int_t row=0;row<fInnerSec->GetNRows();row++){
2187 AliTPCclusterMI *cl = fInnerSec[sec][row].fClusters1;
2188 for (Int_t icl =0;icl< fInnerSec[sec][row].fN1;icl++)
2189 // if (cl[icl].IsUsed(10))
2190 cl[icl].Use(-1);
2191 cl = fInnerSec[sec][row].fClusters2;
2192 for (Int_t icl =0;icl< fInnerSec[sec][row].fN2;icl++)
2193 //if (cl[icl].IsUsed(10))
2194 cl[icl].Use(-1);
2195 }
2196 }
2197
2198 for (Int_t sec=0;sec<fkNOS;sec++){
2199 for (Int_t row=0;row<fOuterSec->GetNRows();row++){
2200 AliTPCclusterMI *cl = fOuterSec[sec][row].fClusters1;
2201 for (Int_t icl =0;icl< fOuterSec[sec][row].fN1;icl++)
2202 //if (cl[icl].IsUsed(10))
2203 cl[icl].Use(-1);
2204 cl = fOuterSec[sec][row].fClusters2;
2205 for (Int_t icl =0;icl< fOuterSec[sec][row].fN2;icl++)
2206 //if (cl[icl].IsUsed(10))
2207 cl[icl].Use(-1);
2208 }
2209 }
2210
1c53abe2 2211}
2212
91162307 2213
2214
732b9e78 2215void AliTPCtrackerMI::SignClusters(TObjArray * arr, Float_t fnumber, Float_t fdensity)
1c53abe2 2216{
2217 //
91162307 2218 //sign clusters to be "used"
2219 //
2220 // snumber and sdensity sign number of sigmas - bellow mean value to be accepted
2221 // loop over "primaries"
2222
2223 Float_t sumdens=0;
2224 Float_t sumdens2=0;
2225 Float_t sumn =0;
2226 Float_t sumn2 =0;
2227 Float_t sumchi =0;
2228 Float_t sumchi2 =0;
2229
2230 Float_t sum =0;
2231
1c53abe2 2232 TStopwatch timer;
91162307 2233 timer.Start();
1c53abe2 2234
91162307 2235 Int_t nseed = arr->GetEntriesFast();
2236 for (Int_t i=0; i<nseed; i++) {
2237 AliTPCseed *pt=(AliTPCseed*)arr->UncheckedAt(i);
2238 if (!pt) {
2239 continue;
2240 }
2241 if (!(pt->IsActive())) continue;
2242 Float_t dens = pt->GetNumberOfClusters()/Float_t(pt->fNFoundable);
2243 if ( (dens>0.7) && (pt->GetNumberOfClusters()>70)){
2244 sumdens += dens;
2245 sumdens2+= dens*dens;
2246 sumn += pt->GetNumberOfClusters();
2247 sumn2 += pt->GetNumberOfClusters()*pt->GetNumberOfClusters();
2248 Float_t chi2 = pt->GetChi2()/pt->GetNumberOfClusters();
2249 if (chi2>5) chi2=5;
2250 sumchi +=chi2;
2251 sumchi2 +=chi2*chi2;
2252 sum++;
2253 }
1627d1c4 2254 }
91162307 2255
2256 Float_t mdensity = 0.9;
2257 Float_t meann = 130;
2258 Float_t meanchi = 1;
2259 Float_t sdensity = 0.1;
2260 Float_t smeann = 10;
2261 Float_t smeanchi =0.4;
1627d1c4 2262
91162307 2263
2264 if (sum>20){
2265 mdensity = sumdens/sum;
2266 meann = sumn/sum;
2267 meanchi = sumchi/sum;
2268 //
2269 sdensity = sumdens2/sum-mdensity*mdensity;
2270 sdensity = TMath::Sqrt(sdensity);
2271 //
2272 smeann = sumn2/sum-meann*meann;
2273 smeann = TMath::Sqrt(smeann);
2274 //
2275 smeanchi = sumchi2/sum - meanchi*meanchi;
2276 smeanchi = TMath::Sqrt(smeanchi);
2277 }
2278
2279
2280 //REMOVE SHORT DELTAS or tracks going out of sensitive volume of TPC
2281 //
2282 for (Int_t i=0; i<nseed; i++) {
2283 AliTPCseed *pt=(AliTPCseed*)arr->UncheckedAt(i);
2284 if (!pt) {
2285 continue;
1c53abe2 2286 }
91162307 2287 if (pt->fBSigned) continue;
2288 if (pt->fBConstrain) continue;
2289 //if (!(pt->IsActive())) continue;
2290 /*
2291 Int_t found,foundable,shared;
2292 pt->GetClusterStatistic(0,160,found, foundable,shared);
2293 if (shared/float(found)>0.3) {
2294 if (shared/float(found)>0.9 ){
2295 //delete arr->RemoveAt(i);
2296 }
2297 continue;
c9427e08 2298 }
91162307 2299 */
2300 Bool_t isok =kFALSE;
2301 if ( (pt->fNShared/pt->GetNumberOfClusters()<0.5) &&pt->GetNumberOfClusters()>60)
2302 isok = kTRUE;
2303 if ((TMath::Abs(1/pt->GetC())<100.) && (pt->fNShared/pt->GetNumberOfClusters()<0.7))
2304 isok =kTRUE;
2305 if (TMath::Abs(pt->GetZ()/pt->GetX())>1.1)
2306 isok =kTRUE;
2307 if ( (TMath::Abs(pt->GetSnp()>0.7) && pt->GetD(0,0)>60.))
2308 isok =kTRUE;
2309
2310 if (isok)
2311 for (Int_t i=0; i<160; i++) {
2312 Int_t index=pt->GetClusterIndex2(i);
2313 if (index<0) continue;
2314 AliTPCclusterMI *c= pt->fClusterPointer[i];
2315 if (!c) continue;
2316 //if (!(c->IsUsed(10))) c->Use();
2317 c->Use(10);
2318 }
2319 }
2320
c9427e08 2321
1c53abe2 2322 //
91162307 2323 Double_t maxchi = meanchi+2.*smeanchi;
2324
2325 for (Int_t i=0; i<nseed; i++) {
2326 AliTPCseed *pt=(AliTPCseed*)arr->UncheckedAt(i);
2327 if (!pt) {
1c53abe2 2328 continue;
91162307 2329 }
2330 //if (!(pt->IsActive())) continue;
2331 if (pt->fBSigned) continue;
2332 Double_t chi = pt->GetChi2()/pt->GetNumberOfClusters();
2333 if (chi>maxchi) continue;
2334
2335 Float_t bfactor=1;
2336 Float_t dens = pt->GetNumberOfClusters()/Float_t(pt->fNFoundable);
2337
2338 //sign only tracks with enoug big density at the beginning
2339
2340 if ((pt->GetDensityFirst(40)<0.75) && pt->GetNumberOfClusters()<meann) continue;
2341
2342
3e5d0aa2 2343 Double_t mindens = TMath::Max(double(mdensity-sdensity*fdensity*bfactor),0.65);
91162307 2344 Double_t minn = TMath::Max(Int_t(meann-fnumber*smeann*bfactor),50);
2345
2346 // if (pt->fBConstrain) mindens = TMath::Max(mdensity-sdensity*fdensity*bfactor,0.65);
2347 if ( (pt->fRemoval==10) && (pt->GetSnp()>0.8)&&(dens>mindens))
2348 minn=0;
2349
2350 if ((dens>mindens && pt->GetNumberOfClusters()>minn) && chi<maxchi ){
2351 //Int_t noc=pt->GetNumberOfClusters();
2352 pt->fBSigned = kTRUE;
2353 for (Int_t i=0; i<160; i++) {
2354
2355 Int_t index=pt->GetClusterIndex2(i);
2356 if (index<0) continue;
2357 AliTPCclusterMI *c= pt->fClusterPointer[i];
2358 if (!c) continue;
2359 // if (!(c->IsUsed(10))) c->Use();
2360 c->Use(10);
2361 }
1c53abe2 2362 }
91162307 2363 }
2364 // gLastCheck = nseed;
2365 // arr->Compress();
2366 if (fDebug>0){
2367 timer.Print();
2368 }
1c53abe2 2369}
2370
2371
47966a6d 2372void AliTPCtrackerMI::StopNotActive(TObjArray * arr, Int_t row0, Float_t th0, Float_t th1, Float_t th2) const
91162307 2373{
2374 // stop not active tracks
2375 // take th1 as threshold for number of founded to number of foundable on last 10 active rows
2376 // take th2 as threshold for number of founded to number of foundable on last 20 active rows
2377 Int_t nseed = arr->GetEntriesFast();
2378 //
2379 for (Int_t i=0; i<nseed; i++) {
2380 AliTPCseed *pt=(AliTPCseed*)arr->UncheckedAt(i);
2381 if (!pt) {
2382 continue;
2383 }
2384 if (!(pt->IsActive())) continue;
2385 StopNotActive(pt,row0,th0, th1,th2);
2386 }
2387}
1c53abe2 2388
1c53abe2 2389
1c53abe2 2390
91162307 2391void AliTPCtrackerMI::StopNotActive(AliTPCseed * seed, Int_t row0, Float_t th0, Float_t th1,
47966a6d 2392 Float_t th2) const
91162307 2393{
2394 // stop not active tracks
2395 // take th1 as threshold for number of founded to number of foundable on last 10 active rows
2396 // take th2 as threshold for number of founded to number of foundable on last 20 active rows
2397 Int_t sumgood1 = 0;
2398 Int_t sumgood2 = 0;
2399 Int_t foundable = 0;
2400 Int_t maxindex = seed->fLastPoint; //last foundable row
2401 if (seed->fNFoundable*th0 > seed->GetNumberOfClusters()) {
2402 seed->Desactivate(10) ;
2403 return;
2404 }
1c53abe2 2405
3e5d0aa2 2406 for (Int_t i=row0; i<maxindex; i++){
91162307 2407 Int_t index = seed->GetClusterIndex2(i);
2408 if (index!=-1) foundable++;
2409 //if (!c) continue;
2410 if (foundable<=30) sumgood1++;
2411 if (foundable<=50) {
2412 sumgood2++;
2413 }
2414 else{
2415 break;
2416 }
2417 }
2418 if (foundable>=30.){
2419 if (sumgood1<(th1*30.)) seed->Desactivate(10);
2420 }
2421 if (foundable>=50)
2422 if (sumgood2<(th2*50.)) seed->Desactivate(10);
2423}
1c53abe2 2424
1c53abe2 2425
d26d9159 2426Int_t AliTPCtrackerMI::RefitInward(AliESD *event)
2427{
2428 //
2429 // back propagation of ESD tracks
2430 //
2431 //return 0;
2432 fEvent = event;
2433 ReadSeeds(event,2);
2434 fIteration=2;
982aff31 2435 //PrepareForProlongation(fSeeds,1);
2436 PropagateForward2(fSeeds);
4d158c36 2437 Int_t ntracks=0;
d26d9159 2438 Int_t nseed = fSeeds->GetEntriesFast();
2439 for (Int_t i=0;i<nseed;i++){
2440 AliTPCseed * seed = (AliTPCseed*) fSeeds->UncheckedAt(i);
4d158c36 2441 if (!seed) continue;
d26d9159 2442 seed->PropagateTo(fParam->GetInnerRadiusLow());
2443 AliESDtrack *esd=event->GetTrack(i);
2444 seed->CookdEdx(0.02,0.6);
2445 CookLabel(seed,0.1); //For comparison only
4d158c36 2446 if (seed->GetNumberOfClusters()>60){
2447 esd->UpdateTrackParams(seed,AliESDtrack::kTPCrefit);
2448 ntracks++;
d26d9159 2449 }
2450 else{
2451 //printf("problem\n");
2452 }
2453 }
4d158c36 2454 Info("RefitInward","Number of refitted tracks %d",ntracks);
d26d9159 2455 fEvent =0;
2456 //WriteTracks();
2457 return 0;
2458}
2459
1c53abe2 2460
91162307 2461Int_t AliTPCtrackerMI::PropagateBack(AliESD *event)
2462{
2463 //
2464 // back propagation of ESD tracks
2465 //
1c53abe2 2466
91162307 2467 fEvent = event;
d26d9159 2468 fIteration = 1;
2469 ReadSeeds(event,0);
91162307 2470 PropagateBack(fSeeds);
2471 Int_t nseed = fSeeds->GetEntriesFast();
4d158c36 2472 Int_t ntracks=0;
91162307 2473 for (Int_t i=0;i<nseed;i++){
2474 AliTPCseed * seed = (AliTPCseed*) fSeeds->UncheckedAt(i);
d9e62e7e 2475 if (!seed) continue;
91162307 2476 AliESDtrack *esd=event->GetTrack(i);
d26d9159 2477 seed->CookdEdx(0.02,0.6);
91162307 2478 CookLabel(seed,0.1); //For comparison only
4d158c36 2479 if (seed->GetNumberOfClusters()>60){
2480 esd->UpdateTrackParams(seed,AliESDtrack::kTPCout);
2481 ntracks++;
2482 }
91162307 2483 }
4d158c36 2484 Info("PropagateBack","Number of back propagated tracks %d",ntracks);
91162307 2485 fEvent =0;
d26d9159 2486 //WriteTracks();
91162307 2487 return 0;
2488}
2489
2490
2491void AliTPCtrackerMI::DeleteSeeds()
2492{
b67e07dc 2493 //
2494 //delete Seeds
91162307 2495 Int_t nseed = fSeeds->GetEntriesFast();
2496 for (Int_t i=0;i<nseed;i++){
2497 AliTPCseed * seed = (AliTPCseed*)fSeeds->At(i);
2498 if (seed) delete fSeeds->RemoveAt(i);
2499 }
2500 delete fSeeds;
2501 fSeeds =0;
2502}
2503
d26d9159 2504void AliTPCtrackerMI::ReadSeeds(AliESD *event, Int_t direction)
91162307 2505{
2506 //
2507 //read seeds from the event
2508
2509 Int_t nentr=event->GetNumberOfTracks();
6bdc18d6 2510 if (fDebug>0){
2511 Info("ReadSeeds", "Number of ESD tracks: %d\n", nentr);
2512 }
91162307 2513 if (fSeeds)
2514 DeleteSeeds();
2515 if (!fSeeds){
4d158c36 2516 fSeeds = new TObjArray(nentr);
91162307 2517 }
4d158c36 2518 UnsignClusters();
2519 // Int_t ntrk=0;
91162307 2520 for (Int_t i=0; i<nentr; i++) {
2521 AliESDtrack *esd=event->GetTrack(i);
2522 ULong_t status=esd->GetStatus();
b67e07dc 2523 AliTPCtrack t(*esd);
91162307 2524 AliTPCseed *seed = new AliTPCseed(t,t.GetAlpha());
982aff31 2525 if ((status==AliESDtrack::kTPCin)&&(direction==1)) seed->ResetCovariance();
2526 if ( direction ==2 &&(status & AliESDtrack::kTRDrefit) == 0 ) seed->ResetCovariance();
4d158c36 2527 if ( direction ==2 && ((status & AliESDtrack::kTPCout) == 0) ) {
2528 fSeeds->AddAt(0,i);
2529 delete seed;
2530 continue;
2531 }
2532 if ( direction ==2 &&(status & AliESDtrack::kTRDrefit) > 0 ) {
2533 Double_t par0[5],par1[5],x;
2534 esd->GetInnerExternalParameters(x,par0);
2535 esd->GetExternalParameters(x,par1);
2536 Double_t delta1 = TMath::Abs(par0[4]-par1[4])/(0.000000001+TMath::Abs(par0[4]+par1[4]));
2537 Double_t delta2 = TMath::Abs(par0[3]-par1[3]);
2538 //reset covariance if suspicious
2539 if ( (delta1>0.1) || (delta2>0.006))
2540 seed->ResetCovariance();
2541 }
982aff31 2542
91162307 2543 //
2544 //
2545 // rotate to the local coordinate system
2546
2547 fSectors=fInnerSec; fN=fkNIS;
2548
2549 Double_t alpha=seed->GetAlpha() - fSectors->GetAlphaShift();
2550 if (alpha > 2.*TMath::Pi()) alpha -= 2.*TMath::Pi();
2551 if (alpha < 0. ) alpha += 2.*TMath::Pi();
2552 Int_t ns=Int_t(alpha/fSectors->GetAlpha())%fN;
2553 alpha =ns*fSectors->GetAlpha() + fSectors->GetAlphaShift();
4d158c36 2554 if (alpha<-TMath::Pi()) alpha += 2*TMath::Pi();
2555 if (alpha>=TMath::Pi()) alpha -= 2*TMath::Pi();
91162307 2556 alpha-=seed->GetAlpha();
d9b8978b 2557 if (!seed->Rotate(alpha)) {
2558 delete seed;
2559 continue;
2560 }
d26d9159 2561 seed->fEsd = esd;
91162307 2562 //
d26d9159 2563 //seed->PropagateTo(fSectors->GetX(0));
91162307 2564 //
2565 // Int_t index = esd->GetTPCindex();
2566 //AliTPCseed * seed2= (AliTPCseed*)fSeeds->At(index);
d26d9159 2567 //if (direction==2){
2568 // AliTPCseed * seed2 = ReSeed(seed,0.,0.5,1.);
2569 // if (seed2) {
2570 // delete seed;
2571 // seed = seed2;
2572 // }
2573 //}
4d158c36 2574 //
2575 // sign clusters
2576 for (Int_t irow=0;irow<160;irow++){
2577 Int_t index = seed->GetClusterIndex2(irow);
2578 if (index>0){
2579 //
2580 AliTPCclusterMI * cl = GetClusterMI(index);
2581 seed->fClusterPointer[irow] = cl;
2582 if (cl){
2583 if ((index & 0x8000)==0){
2584 cl->Use(10); // accepted cluster
2585 }else{
2586 cl->Use(6); // close cluster not accepted
2587 }
2588 }else{
2589 Info("ReadSeeds","Not found cluster");
2590 }
2591 }
2592 }
2593 fSeeds->AddAt(seed,i);
91162307 2594 }
2595}
2596
2597
2598
2599//_____________________________________________________________________________
2600void AliTPCtrackerMI::MakeSeeds3(TObjArray * arr, Int_t sec, Int_t i1, Int_t i2, Float_t cuts[4],
2601 Float_t deltay, Int_t ddsec) {
2602 //-----------------------------------------------------------------
2603 // This function creates track seeds.
2604 // SEEDING WITH VERTEX CONSTRAIN
2605 //-----------------------------------------------------------------
2606 // cuts[0] - fP4 cut
2607 // cuts[1] - tan(phi) cut
2608 // cuts[2] - zvertex cut
2609 // cuts[3] - fP3 cut
2610 Int_t nin0 = 0;
2611 Int_t nin1 = 0;
2612 Int_t nin2 = 0;
2613 Int_t nin = 0;
2614 Int_t nout1 = 0;
2615 Int_t nout2 = 0;
2616
2617 Double_t x[5], c[15];
2618 // Int_t di = i1-i2;
2619 //
2620 AliTPCseed * seed = new AliTPCseed;
2621 Double_t alpha=fSectors->GetAlpha(), shift=fSectors->GetAlphaShift();
2622 Double_t cs=cos(alpha), sn=sin(alpha);
2623 //
2624 // Double_t x1 =fOuterSec->GetX(i1);
2625 //Double_t xx2=fOuterSec->GetX(i2);
2626
2627 Double_t x1 =GetXrow(i1);
2628 Double_t xx2=GetXrow(i2);
2629
2630 Double_t x3=GetX(), y3=GetY(), z3=GetZ();
2631
2632 Int_t imiddle = (i2+i1)/2; //middle pad row index
2633 Double_t xm = GetXrow(imiddle); // radius of middle pad-row
2634 const AliTPCRow& krm=GetRow(sec,imiddle); //middle pad -row
2635 //
2636 Int_t ns =sec;
2637
2638 const AliTPCRow& kr1=GetRow(ns,i1);
2639 Double_t ymax = GetMaxY(i1)-kr1.fDeadZone-1.5;
2640 Double_t ymaxm = GetMaxY(imiddle)-kr1.fDeadZone-1.5;
2641
2642 //
2643 // change cut on curvature if it can't reach this layer
2644 // maximal curvature set to reach it
2645 Double_t dvertexmax = TMath::Sqrt((x1-x3)*(x1-x3)+(ymax+5-y3)*(ymax+5-y3));
2646 if (dvertexmax*0.5*cuts[0]>0.85){
2647 cuts[0] = 0.85/(dvertexmax*0.5+1.);
2648 }
2649 Double_t r2min = 1/(cuts[0]*cuts[0]); //minimal square of radius given by cut
2650
2651 // Int_t ddsec = 1;
2652 if (deltay>0) ddsec = 0;
2653 // loop over clusters
2654 for (Int_t is=0; is < kr1; is++) {
2655 //
2656 if (kr1[is]->IsUsed(10)) continue;
2657 Double_t y1=kr1[is]->GetY(), z1=kr1[is]->GetZ();
2658 //if (TMath::Abs(y1)>ymax) continue;
2659
2660 if (deltay>0 && TMath::Abs(ymax-TMath::Abs(y1))> deltay ) continue; // seed only at the edge
2661
2662 // find possible directions
2663 Float_t anglez = (z1-z3)/(x1-x3);
2664 Float_t extraz = z1 - anglez*(x1-xx2); // extrapolated z
2665 //
2666 //
2667 //find rotation angles relative to line given by vertex and point 1
2668 Double_t dvertex2 = (x1-x3)*(x1-x3)+(y1-y3)*(y1-y3);
2669 Double_t dvertex = TMath::Sqrt(dvertex2);
2670 Double_t angle13 = TMath::ATan((y1-y3)/(x1-x3));
2671 Double_t cs13 = cos(-angle13), sn13 = sin(-angle13);
2672
2673 //
2674 // loop over 2 sectors
2675 Int_t dsec1=-ddsec;
2676 Int_t dsec2= ddsec;
2677 if (y1<0) dsec2= 0;
2678 if (y1>0) dsec1= 0;
2679
2680 Double_t dddz1=0; // direction of delta inclination in z axis
2681 Double_t dddz2=0;
2682 if ( (z1-z3)>0)
2683 dddz1 =1;
2684 else
2685 dddz2 =1;
2686 //
2687 for (Int_t dsec = dsec1; dsec<=dsec2;dsec++){
2688 Int_t sec2 = sec + dsec;
2689 //
2690 // AliTPCRow& kr2 = fOuterSec[(sec2+fkNOS)%fkNOS][i2];
2691 //AliTPCRow& kr2m = fOuterSec[(sec2+fkNOS)%fkNOS][imiddle];
2692 AliTPCRow& kr2 = GetRow((sec2+fkNOS)%fkNOS,i2);
2693 AliTPCRow& kr2m = GetRow((sec2+fkNOS)%fkNOS,imiddle);
2694 Int_t index1 = TMath::Max(kr2.Find(extraz-0.6-dddz1*TMath::Abs(z1)*0.05)-1,0);
2695 Int_t index2 = TMath::Min(kr2.Find(extraz+0.6+dddz2*TMath::Abs(z1)*0.05)+1,kr2);
2696
2697 // rotation angles to p1-p3
2698 Double_t cs13r = cos(-angle13+dsec*alpha)/dvertex, sn13r = sin(-angle13+dsec*alpha)/dvertex;
2699 Double_t x2, y2, z2;
2700 //
2701 // Double_t dymax = maxangle*TMath::Abs(x1-xx2);
2702
2703 //
2704 Double_t dxx0 = (xx2-x3)*cs13r;
2705 Double_t dyy0 = (xx2-x3)*sn13r;
2706 for (Int_t js=index1; js < index2; js++) {
2707 const AliTPCclusterMI *kcl = kr2[js];
2708 if (kcl->IsUsed(10)) continue;
2709 //
2710 //calcutate parameters
2711 //
2712 Double_t yy0 = dyy0 +(kcl->GetY()-y3)*cs13r;
2713 // stright track
2714 if (TMath::Abs(yy0)<0.000001) continue;
2715 Double_t xx0 = dxx0 -(kcl->GetY()-y3)*sn13r;
2716 Double_t y0 = 0.5*(xx0*xx0+yy0*yy0-xx0)/yy0;
2717 Double_t r02 = (0.25+y0*y0)*dvertex2;
2718 //curvature (radius) cut
2719 if (r02<r2min) continue;
2720
2721 nin0++;
2722 //
2723 Double_t c0 = 1/TMath::Sqrt(r02);
2724 if (yy0>0) c0*=-1.;
2725
2726
2727 //Double_t dfi0 = 2.*TMath::ASin(dvertex*c0*0.5);
2728 //Double_t dfi1 = 2.*TMath::ASin(TMath::Sqrt(yy0*yy0+(1-xx0)*(1-xx0))*dvertex*c0*0.5);
b67e07dc 2729 Double_t dfi0 = 2.*AliTPCFastMath::FastAsin(dvertex*c0*0.5);
2730 Double_t dfi1 = 2.*AliTPCFastMath::FastAsin(TMath::Sqrt(yy0*yy0+(1-xx0)*(1-xx0))*dvertex*c0*0.5);
91162307 2731 //
2732 //
2733 Double_t z0 = kcl->GetZ();
2734 Double_t zzzz2 = z1-(z1-z3)*dfi1/dfi0;
2735 if (TMath::Abs(zzzz2-z0)>0.5) continue;
2736 nin1++;
2737 //
2738 Double_t dip = (z1-z0)*c0/dfi1;
2739 Double_t x0 = (0.5*cs13+y0*sn13)*dvertex*c0;
2740 //
2741 y2 = kcl->GetY();
2742 if (dsec==0){
2743 x2 = xx2;
2744 z2 = kcl->GetZ();
2745 }
2746 else
2747 {
2748 // rotation
2749 z2 = kcl->GetZ();
2750 x2= xx2*cs-y2*sn*dsec;
2751 y2=+xx2*sn*dsec+y2*cs;
2752 }
2753
2754 x[0] = y1;
2755 x[1] = z1;
2756 x[2] = x0;
2757 x[3] = dip;
2758 x[4] = c0;
2759 //
2760 //
2761 // do we have cluster at the middle ?
2762 Double_t ym,zm;
2763 GetProlongation(x1,xm,x,ym,zm);
2764 UInt_t dummy;
2765 AliTPCclusterMI * cm=0;
2766 if (TMath::Abs(ym)-ymaxm<0){
2767 cm = krm.FindNearest2(ym,zm,1.0,0.6,dummy);
2768 if ((!cm) || (cm->IsUsed(10))) {
2769 continue;
2770 }
2771 }
2772 else{
2773 // rotate y1 to system 0
2774 // get state vector in rotated system
2775 Double_t yr1 = (-0.5*sn13+y0*cs13)*dvertex*c0;
2776 Double_t xr2 = x0*cs+yr1*sn*dsec;
2777 Double_t xr[5]={kcl->GetY(),kcl->GetZ(), xr2, dip, c0};
2778 //
2779 GetProlongation(xx2,xm,xr,ym,zm);
2780 if (TMath::Abs(ym)-ymaxm<0){
2781 cm = kr2m.FindNearest2(ym,zm,1.0,0.6,dummy);
2782 if ((!cm) || (cm->IsUsed(10))) {
2783 continue;
2784 }
2785 }
2786 }
2787
2788
2789 Double_t dym = 0;
2790 Double_t dzm = 0;
2791 if (cm){
2792 dym = ym - cm->GetY();
2793 dzm = zm - cm->GetZ();
2794 }
2795 nin2++;
2796
2797
2798 //
2799 //
2800 Double_t sy1=kr1[is]->GetSigmaY2()*2., sz1=kr1[is]->GetSigmaZ2()*2.;
2801 Double_t sy2=kcl->GetSigmaY2()*2., sz2=kcl->GetSigmaZ2()*2.;
2802 //Double_t sy3=400*3./12., sy=0.1, sz=0.1;
2803 Double_t sy3=25000*x[4]*x[4]+0.1, sy=0.1, sz=0.1;
2804 //Double_t sy3=25000*x[4]*x[4]*60+0.5, sy=0.1, sz=0.1;
2805
b67e07dc 2806 Double_t f40=(F1(x1,y1+sy,x2,y2,x3,y3)-x[4])/sy;
2807 Double_t f42=(F1(x1,y1,x2,y2+sy,x3,y3)-x[4])/sy;
2808 Double_t f43=(F1(x1,y1,x2,y2,x3,y3+sy)-x[4])/sy;
2809 Double_t f20=(F2(x1,y1+sy,x2,y2,x3,y3)-x[2])/sy;
2810 Double_t f22=(F2(x1,y1,x2,y2+sy,x3,y3)-x[2])/sy;
2811 Double_t f23=(F2(x1,y1,x2,y2,x3,y3+sy)-x[2])/sy;
91162307 2812
b67e07dc 2813 Double_t f30=(F3(x1,y1+sy,x2,y2,z1,z2)-x[3])/sy;
2814 Double_t f31=(F3(x1,y1,x2,y2,z1+sz,z2)-x[3])/sz;
2815 Double_t f32=(F3(x1,y1,x2,y2+sy,z1,z2)-x[3])/sy;
2816 Double_t f34=(F3(x1,y1,x2,y2,z1,z2+sz)-x[3])/sz;
91162307 2817
1c53abe2 2818 c[0]=sy1;
2819 c[1]=0.; c[2]=sz1;
2820 c[3]=f20*sy1; c[4]=0.; c[5]=f20*sy1*f20+f22*sy2*f22+f23*sy3*f23;
2821 c[6]=f30*sy1; c[7]=f31*sz1; c[8]=f30*sy1*f20+f32*sy2*f22;
2822 c[9]=f30*sy1*f30+f31*sz1*f31+f32*sy2*f32+f34*sz2*f34;
2823 c[10]=f40*sy1; c[11]=0.; c[12]=f40*sy1*f20+f42*sy2*f22+f43*sy3*f23;
2824 c[13]=f30*sy1*f40+f32*sy2*f42;
2825 c[14]=f40*sy1*f40+f42*sy2*f42+f43*sy3*f43;
91162307 2826
2827 // if (!BuildSeed(kr1[is],kcl,0,x1,x2,x3,x,c)) continue;
2828
1c53abe2 2829 UInt_t index=kr1.GetIndex(is);
91162307 2830 AliTPCseed *track=new(seed) AliTPCseed(index, x, c, x1, ns*alpha+shift);
2831
1c53abe2 2832 track->fIsSeeding = kTRUE;
91162307 2833 track->fSeed1 = i1;
2834 track->fSeed2 = i2;
2835 track->fSeedType=3;
c9427e08 2836
91162307 2837
2838 //if (dsec==0) {
2839 FollowProlongation(*track, (i1+i2)/2,1);
2840 Int_t foundable,found,shared;
2841 track->GetClusterStatistic((i1+i2)/2,i1, found, foundable, shared, kTRUE);
2842 if ((found<0.55*foundable) || shared>0.5*found || (track->GetSigmaY2()+track->GetSigmaZ2())>0.5){
2843 seed->Reset();
2844 seed->~AliTPCseed();
2845 continue;
2846 }
2847 //}
2848
2849 nin++;
2850 FollowProlongation(*track, i2,1);
2851
2852
2853 //Int_t rc = 1;
2854 track->fBConstrain =1;
2855 // track->fLastPoint = i1+fInnerSec->GetNRows(); // first cluster in track position
2856 track->fLastPoint = i1; // first cluster in track position
2857 track->fFirstPoint = track->fLastPoint;
2858
2859 if (track->GetNumberOfClusters()<(i1-i2)*0.5 ||
2860 track->GetNumberOfClusters() < track->fNFoundable*0.6 ||
2861 track->fNShared>0.4*track->GetNumberOfClusters() ) {
2862 seed->Reset();
2863 seed->~AliTPCseed();
c9427e08 2864 continue;
2865 }
91162307 2866 nout1++;
2867 // Z VERTEX CONDITION
2868 Double_t zv;
2869 zv = track->GetZ()+track->GetTgl()/track->GetC()*
2870 ( asin(-track->GetEta()) - asin(track->GetX()*track->GetC()-track->GetEta()));
2871 if (TMath::Abs(zv-z3)>cuts[2]) {
2872 FollowProlongation(*track, TMath::Max(i2-20,0));
2873 zv = track->GetZ()+track->GetTgl()/track->GetC()*
2874 ( asin(-track->GetEta()) - asin(track->GetX()*track->GetC()-track->GetEta()));
2875 if (TMath::Abs(zv-z3)>cuts[2]){
2876 FollowProlongation(*track, TMath::Max(i2-40,0));
2877 zv = track->GetZ()+track->GetTgl()/track->GetC()*
2878 ( asin(-track->GetEta()) - asin(track->GetX()*track->GetC()-track->GetEta()));
2879 if (TMath::Abs(zv-z3)>cuts[2] &&(track->GetNumberOfClusters() > track->fNFoundable*0.7)){
2880 // make seed without constrain
2881 AliTPCseed * track2 = MakeSeed(track,0.2,0.5,1.);
2882 FollowProlongation(*track2, i2,1);
2883 track2->fBConstrain = kFALSE;
2884 track2->fSeedType = 1;
2885 arr->AddLast(track2);
2886 seed->Reset();
2887 seed->~AliTPCseed();
2888 continue;
2889 }
2890 else{
2891 seed->Reset();
2892 seed->~AliTPCseed();
2893 continue;
2894
2895 }
2896 }
c9427e08 2897 }
1c53abe2 2898
91162307 2899 track->fSeedType =0;
2900 arr->AddLast(track);
2901 seed = new AliTPCseed;
2902 nout2++;
2903 // don't consider other combinations
2904 if (track->GetNumberOfClusters() > track->fNFoundable*0.8)
2905 break;
1c53abe2 2906 }
2907 }
2908 }
6bdc18d6 2909 if (fDebug>3){
2910 Info("MakeSeeds3","\nSeeding statistic:\t%d\t%d\t%d\t%d\t%d\t%d",nin0,nin1,nin2,nin,nout1,nout2);
91162307 2911 }
2912 delete seed;
1c53abe2 2913}
2914
1627d1c4 2915
91162307 2916void AliTPCtrackerMI::MakeSeeds5(TObjArray * arr, Int_t sec, Int_t i1, Int_t i2, Float_t cuts[4],
2917 Float_t deltay) {
2918
2919
2920
1627d1c4 2921 //-----------------------------------------------------------------
91162307 2922 // This function creates track seeds.
1627d1c4 2923 //-----------------------------------------------------------------
91162307 2924 // cuts[0] - fP4 cut
2925 // cuts[1] - tan(phi) cut
2926 // cuts[2] - zvertex cut
2927 // cuts[3] - fP3 cut
2928
2929
2930 Int_t nin0 = 0;
2931 Int_t nin1 = 0;
2932 Int_t nin2 = 0;
2933 Int_t nin = 0;
2934 Int_t nout1 = 0;
2935 Int_t nout2 = 0;
2936 Int_t nout3 =0;
2937 Double_t x[5], c[15];
2938 //
2939 // make temporary seed
2940 AliTPCseed * seed = new AliTPCseed;
1627d1c4 2941 Double_t alpha=fOuterSec->GetAlpha(), shift=fOuterSec->GetAlphaShift();
2942 // Double_t cs=cos(alpha), sn=sin(alpha);
91162307 2943 //
2944 //
1627d1c4 2945
91162307 2946 // first 3 padrows
2947 Double_t x1 = GetXrow(i1-1);
2948 const AliTPCRow& kr1=GetRow(sec,i1-1);
2949 Double_t y1max = GetMaxY(i1-1)-kr1.fDeadZone-1.5;
2950 //
2951 Double_t x1p = GetXrow(i1);
2952 const AliTPCRow& kr1p=GetRow(sec,i1);
2953 //
2954 Double_t x1m = GetXrow(i1-2);
2955 const AliTPCRow& kr1m=GetRow(sec,i1-2);
1627d1c4 2956
91162307 2957 //
2958 //last 3 padrow for seeding
2959 AliTPCRow& kr3 = GetRow((sec+fkNOS)%fkNOS,i1-7);
2960 Double_t x3 = GetXrow(i1-7);
2961 // Double_t y3max= GetMaxY(i1-7)-kr3.fDeadZone-1.5;
2962 //
2963 AliTPCRow& kr3p = GetRow((sec+fkNOS)%fkNOS,i1-6);
2964 Double_t x3p = GetXrow(i1-6);
2965 //
2966 AliTPCRow& kr3m = GetRow((sec+fkNOS)%fkNOS,i1-8);
2967 Double_t x3m = GetXrow(i1-8);
1627d1c4 2968
91162307 2969 //
2970 //
2971 // middle padrow
2972 Int_t im = i1-4; //middle pad row index
2973 Double_t xm = GetXrow(im); // radius of middle pad-row
2974 const AliTPCRow& krm=GetRow(sec,im); //middle pad -row
2975 // Double_t ymmax = GetMaxY(im)-kr1.fDeadZone-1.5;
2976 //
2977 //
2978 Double_t deltax = x1-x3;
2979 Double_t dymax = deltax*cuts[1];
2980 Double_t dzmax = deltax*cuts[3];
2981 //
2982 // loop over clusters
2983 for (Int_t is=0; is < kr1; is++) {
1627d1c4 2984 //
91162307 2985 if (kr1[is]->IsUsed(10)) continue;
2986 Double_t y1=kr1[is]->GetY(), z1=kr1[is]->GetZ();
1627d1c4 2987 //
91162307 2988 if (deltay>0 && TMath::Abs(y1max-TMath::Abs(y1))> deltay ) continue; // seed only at the edge
2989 //
2990 Int_t index1 = TMath::Max(kr3.Find(z1-dzmax)-1,0);
2991 Int_t index2 = TMath::Min(kr3.Find(z1+dzmax)+1,kr3);
2992 //
2993 Double_t y3, z3;
1627d1c4 2994 //
1627d1c4 2995 //
91162307 2996 UInt_t index;
2997 for (Int_t js=index1; js < index2; js++) {
2998 const AliTPCclusterMI *kcl = kr3[js];
2999 if (kcl->IsUsed(10)) continue;
3000 y3 = kcl->GetY();
3001 // apply angular cuts
3002 if (TMath::Abs(y1-y3)>dymax) continue;
3003 x3 = x3;
3004 z3 = kcl->GetZ();
3005 if (TMath::Abs(z1-z3)>dzmax) continue;
3006 //
3007 Double_t angley = (y1-y3)/(x1-x3);
3008 Double_t anglez = (z1-z3)/(x1-x3);
3009 //
3010 Double_t erry = TMath::Abs(angley)*(x1-x1m)*0.5+0.5;
3011 Double_t errz = TMath::Abs(anglez)*(x1-x1m)*0.5+0.5;
3012 //
3013 Double_t yyym = angley*(xm-x1)+y1;
3014 Double_t zzzm = anglez*(xm-x1)+z1;
3015
3016 const AliTPCclusterMI *kcm = krm.FindNearest2(yyym,zzzm,erry,errz,index);
3017 if (!kcm) continue;
3018 if (kcm->IsUsed(10)) continue;
3019
3020 erry = TMath::Abs(angley)*(x1-x1m)*0.4+0.5;
3021 errz = TMath::Abs(anglez)*(x1-x1m)*0.4+0.5;
3022 //
3023 //
3024 //
3025 Int_t used =0;
3026 Int_t found =0;
3027 //
3028 // look around first
3029 const AliTPCclusterMI *kc1m = kr1m.FindNearest2(angley*(x1m-x1)+y1,
3030 anglez*(x1m-x1)+z1,
3031 erry,errz,index);
3032 //
3033 if (kc1m){
3034 found++;
3035 if (kc1m->IsUsed(10)) used++;
1627d1c4 3036 }
91162307 3037 const AliTPCclusterMI *kc1p = kr1p.FindNearest2(angley*(x1p-x1)+y1,
3038 anglez*(x1p-x1)+z1,
3039 erry,errz,index);
1627d1c4 3040 //
91162307 3041 if (kc1p){
3042 found++;
3043 if (kc1p->IsUsed(10)) used++;
1627d1c4 3044 }
91162307 3045 if (used>1) continue;
3046 if (found<1) continue;
1627d1c4 3047
91162307 3048 //
3049 // look around last
3050 const AliTPCclusterMI *kc3m = kr3m.FindNearest2(angley*(x3m-x3)+y3,
3051 anglez*(x3m-x3)+z3,
3052 erry,errz,index);
3053 //
3054 if (kc3m){
3055 found++;
3056 if (kc3m->IsUsed(10)) used++;
3057 }
3058 else
3059 continue;
3060 const AliTPCclusterMI *kc3p = kr3p.FindNearest2(angley*(x3p-x3)+y3,
3061 anglez*(x3p-x3)+z3,
3062 erry,errz,index);
3063 //
3064 if (kc3p){
3065 found++;
3066 if (kc3p->IsUsed(10)) used++;
3067 }
3068 else
3069 continue;
3070 if (used>1) continue;
3071 if (found<3) continue;
3072 //
3073 Double_t x2,y2,z2;
3074 x2 = xm;
3075 y2 = kcm->GetY();
3076 z2 = kcm->GetZ();
3077 //
3078
1627d1c4 3079 x[0]=y1;
3080 x[1]=z1;
b67e07dc 3081 x[4]=F1(x1,y1,x2,y2,x3,y3);
91162307 3082 //if (TMath::Abs(x[4]) >= cuts[0]) continue;
3083 nin0++;
3084 //
b67e07dc 3085 x[2]=F2(x1,y1,x2,y2,x3,y3);
91162307 3086 nin1++;
3087 //
b67e07dc 3088 x[3]=F3n(x1,y1,x2,y2,z1,z2,x[4]);
91162307 3089 //if (TMath::Abs(x[3]) > cuts[3]) continue;
3090 nin2++;
3091 //
3092 //
3093 Double_t sy1=0.1, sz1=0.1;
3094 Double_t sy2=0.1, sz2=0.1;
3095 Double_t sy3=0.1, sy=0.1, sz=0.1;
1627d1c4 3096
b67e07dc 3097 Double_t f40=(F1(x1,y1+sy,x2,y2,x3,y3)-x[4])/sy;
3098 Double_t f42=(F1(x1,y1,x2,y2+sy,x3,y3)-x[4])/sy;
3099 Double_t f43=(F1(x1,y1,x2,y2,x3,y3+sy)-x[4])/sy;
3100 Double_t f20=(F2(x1,y1+sy,x2,y2,x3,y3)-x[2])/sy;
3101 Double_t f22=(F2(x1,y1,x2,y2+sy,x3,y3)-x[2])/sy;
3102 Double_t f23=(F2(x1,y1,x2,y2,x3,y3+sy)-x[2])/sy;
91162307 3103
b67e07dc 3104 Double_t f30=(F3(x1,y1+sy,x2,y2,z1,z2)-x[3])/sy;
3105 Double_t f31=(F3(x1,y1,x2,y2,z1+sz,z2)-x[3])/sz;
3106 Double_t f32=(F3(x1,y1,x2,y2+sy,z1,z2)-x[3])/sy;
3107 Double_t f34=(F3(x1,y1,x2,y2,z1,z2+sz)-x[3])/sz;
1627d1c4 3108
3109 c[0]=sy1;
91162307 3110 c[1]=0.; c[2]=sz1;
1627d1c4 3111 c[3]=f20*sy1; c[4]=0.; c[5]=f20*sy1*f20+f22*sy2*f22+f23*sy3*f23;
3112 c[6]=f30*sy1; c[7]=f31*sz1; c[8]=f30*sy1*f20+f32*sy2*f22;
3113 c[9]=f30*sy1*f30+f31*sz1*f31+f32*sy2*f32+f34*sz2*f34;
3114 c[10]=f40*sy1; c[11]=0.; c[12]=f40*sy1*f20+f42*sy2*f22+f43*sy3*f23;
3115 c[13]=f30*sy1*f40+f32*sy2*f42;
3116 c[14]=f40*sy1*f40+f42*sy2*f42+f43*sy3*f43;
3117
91162307 3118 // if (!BuildSeed(kr1[is],kcl,0,x1,x2,x3,x,c)) continue;
3119
3120 UInt_t index=kr1.GetIndex(is);
3121 AliTPCseed *track=new(seed) AliTPCseed(index, x, c, x1, sec*alpha+shift);
3122
3123 track->fIsSeeding = kTRUE;
3124
3125 nin++;
3126 FollowProlongation(*track, i1-7,1);
3127 if (track->GetNumberOfClusters() < track->fNFoundable*0.75 ||
3128 track->fNShared>0.6*track->GetNumberOfClusters() || ( track->GetSigmaY2()+ track->GetSigmaZ2())>0.6){
3129 seed->Reset();
3130 seed->~AliTPCseed();
3131 continue;
3132 }
3133 nout1++;
3134 nout2++;
3135 //Int_t rc = 1;
3136 FollowProlongation(*track, i2,1);
3137 track->fBConstrain =0;
3138 track->fLastPoint = i1+fInnerSec->GetNRows(); // first cluster in track position
3139 track->fFirstPoint = track->fLastPoint;
3140
3141 if (track->GetNumberOfClusters()<(i1-i2)*0.5 ||
3142 track->GetNumberOfClusters()<track->fNFoundable*0.7 ||
3143 track->fNShared>2. || track->GetChi2()/track->GetNumberOfClusters()>6 || ( track->GetSigmaY2()+ track->GetSigmaZ2())>0.5 ) {
3144 seed->Reset();
3145 seed->~AliTPCseed();
3146 continue;
3147 }
3148
3149 {
3150 FollowProlongation(*track, TMath::Max(i2-10,0),1);
3151 AliTPCseed * track2 = MakeSeed(track,0.2,0.5,0.9);
3152 FollowProlongation(*track2, i2,1);
3153 track2->fBConstrain = kFALSE;
3154 track2->fSeedType = 4;
3155 arr->AddLast(track2);
3156 seed->Reset();
3157 seed->~AliTPCseed();
3158 }
3159
3160
3161 //arr->AddLast(track);
3162 //seed = new AliTPCseed;
3163 nout3++;
3164 }
3165 }
3166
6bdc18d6 3167 if (fDebug>3){
3168 Info("MakeSeeds5","\nSeeding statiistic:\t%d\t%d\t%d\t%d\t%d\t%d",nin0,nin1,nin2,nin,nout1,nout2,nout3);
91162307 3169 }
3170 delete seed;
3171}
3172
3173
3174//_____________________________________________________________________________
176aff27 3175void AliTPCtrackerMI::MakeSeeds2(TObjArray * arr, Int_t sec, Int_t i1, Int_t i2, Float_t */*cuts[4]*/,
3176 Float_t deltay, Bool_t /*bconstrain*/) {
91162307 3177 //-----------------------------------------------------------------
3178 // This function creates track seeds - without vertex constraint
3179 //-----------------------------------------------------------------
3180 // cuts[0] - fP4 cut - not applied
3181 // cuts[1] - tan(phi) cut
3182 // cuts[2] - zvertex cut - not applied
3183 // cuts[3] - fP3 cut
3184 Int_t nin0=0;
3185 Int_t nin1=0;
3186 Int_t nin2=0;
3187 Int_t nin3=0;
3188 // Int_t nin4=0;
3189 //Int_t nin5=0;
3190
3191
3192
3193 Double_t alpha=fOuterSec->GetAlpha(), shift=fOuterSec->GetAlphaShift();
3194 // Double_t cs=cos(alpha), sn=sin(alpha);
3195 Int_t row0 = (i1+i2)/2;
3196 Int_t drow = (i1-i2)/2;
3197 const AliTPCRow& kr0=fSectors[sec][row0];
3198 AliTPCRow * kr=0;
3199
3200 AliTPCpolyTrack polytrack;
3201 Int_t nclusters=fSectors[sec][row0];
3202 AliTPCseed * seed = new AliTPCseed;
3203
3204 Int_t sumused=0;
3205 Int_t cused=0;
3206 Int_t cnused=0;
3207 for (Int_t is=0; is < nclusters; is++) { //LOOP over clusters
3208 Int_t nfound =0;
3209 Int_t nfoundable =0;
3210 for (Int_t iter =1; iter<2; iter++){ //iterations
3211 const AliTPCRow& krm=fSectors[sec][row0-iter];
3212 const AliTPCRow& krp=fSectors[sec][row0+iter];
3213 const AliTPCclusterMI * cl= kr0[is];
3214
3215 if (cl->IsUsed(10)) {
3216 cused++;
3217 }
3218 else{
3219 cnused++;
3220 }
3221 Double_t x = kr0.GetX();
3222 // Initialization of the polytrack
3223 nfound =0;
3224 nfoundable =0;
3225 polytrack.Reset();
3226 //
3227 Double_t y0= cl->GetY();
3228 Double_t z0= cl->GetZ();
3229 Float_t erry = 0;
3230 Float_t errz = 0;
3231
3232 Double_t ymax = fSectors->GetMaxY(row0)-kr0.fDeadZone-1.5;
3233 if (deltay>0 && TMath::Abs(ymax-TMath::Abs(y0))> deltay ) continue; // seed only at the edge
3234
3235 erry = (0.5)*cl->GetSigmaY2()/TMath::Sqrt(cl->GetQ())*6;
3236 errz = (0.5)*cl->GetSigmaZ2()/TMath::Sqrt(cl->GetQ())*6;
3237 polytrack.AddPoint(x,y0,z0,erry, errz);
3238
3239 sumused=0;
3240 if (cl->IsUsed(10)) sumused++;
3241
3242
3243 Float_t roady = (5*TMath::Sqrt(cl->GetSigmaY2()+0.2)+1.)*iter;
3244 Float_t roadz = (5*TMath::Sqrt(cl->GetSigmaZ2()+0.2)+1.)*iter;
3245 //
3246 x = krm.GetX();
3247 AliTPCclusterMI * cl1 = krm.FindNearest(y0,z0,roady,roadz);
3248 if (cl1 && TMath::Abs(ymax-TMath::Abs(y0))) {
3249 erry = (0.5)*cl1->GetSigmaY2()/TMath::Sqrt(cl1->GetQ())*3;
3250 errz = (0.5)*cl1->GetSigmaZ2()/TMath::Sqrt(cl1->GetQ())*3;
3251 if (cl1->IsUsed(10)) sumused++;
3252 polytrack.AddPoint(x,cl1->GetY(),cl1->GetZ(),erry,errz);
3253 }
3254 //
3255 x = krp.GetX();
3256 AliTPCclusterMI * cl2 = krp.FindNearest(y0,z0,roady,roadz);
3257 if (cl2) {
3258 erry = (0.5)*cl2->GetSigmaY2()/TMath::Sqrt(cl2->GetQ())*3;
3259 errz = (0.5)*cl2->GetSigmaZ2()/TMath::Sqrt(cl2->GetQ())*3;
3260 if (cl2->IsUsed(10)) sumused++;
3261 polytrack.AddPoint(x,cl2->GetY(),cl2->GetZ(),erry,errz);
3262 }
3263 //
3264 if (sumused>0) continue;
3265 nin0++;
3266 polytrack.UpdateParameters();
3267 // follow polytrack
3268 roadz = 1.2;
3269 roady = 1.2;
3270 //
3271 Double_t yn,zn;
3272 nfoundable = polytrack.GetN();
3273 nfound = nfoundable;
3274 //
3275 for (Int_t ddrow = iter+1; ddrow<drow;ddrow++){
3276 Float_t maxdist = 0.8*(1.+3./(ddrow));
3277 for (Int_t delta = -1;delta<=1;delta+=2){
3278 Int_t row = row0+ddrow*delta;
3279 kr = &(fSectors[sec][row]);
3280 Double_t xn = kr->GetX();
3281 Double_t ymax = fSectors->GetMaxY(row)-kr->fDeadZone-1.5;
3282 polytrack.GetFitPoint(xn,yn,zn);
3283 if (TMath::Abs(yn)>ymax) continue;
3284 nfoundable++;
3285 AliTPCclusterMI * cln = kr->FindNearest(yn,zn,roady,roadz);
3286 if (cln) {
3287 Float_t dist = TMath::Sqrt( (yn-cln->GetY())*(yn-cln->GetY())+(zn-cln->GetZ())*(zn-cln->GetZ()));
3288 if (dist<maxdist){
3289 /*
3290 erry = (dist+0.3)*cln->GetSigmaY2()/TMath::Sqrt(cln->GetQ())*(1.+1./(ddrow));
3291 errz = (dist+0.3)*cln->GetSigmaZ2()/TMath::Sqrt(cln->GetQ())*(1.+1./(ddrow));
3292 if (cln->IsUsed(10)) {
3293 // printf("used\n");
3294 sumused++;
3295 erry*=2;
3296 errz*=2;
3297 }
3298 */
3299 erry=0.1;
3300 errz=0.1;
3301 polytrack.AddPoint(xn,cln->GetY(),cln->GetZ(),erry, errz);
3302 nfound++;
3303 }
3304 }
3305 }
3306 if ( (sumused>3) || (sumused>0.5*nfound) || (nfound<0.6*nfoundable)) break;
3307 polytrack.UpdateParameters();
3308 }
3309 }
3310 if ( (sumused>3) || (sumused>0.5*nfound)) {
3311 //printf("sumused %d\n",sumused);
3312 continue;
3313 }
3314 nin1++;
3315 Double_t dy,dz;
3316 polytrack.GetFitDerivation(kr0.GetX(),dy,dz);
3317 AliTPCpolyTrack track2;
3318
3319 polytrack.Refit(track2,0.5+TMath::Abs(dy)*0.3,0.4+TMath::Abs(dz)*0.3);
3320 if (track2.GetN()<0.5*nfoundable) continue;
3321 nin2++;
3322
3323 if ((nfound>0.6*nfoundable) &&( nfoundable>0.4*(i1-i2))) {
3324 //
3325 // test seed with and without constrain
3326 for (Int_t constrain=0; constrain<=0;constrain++){
3327 // add polytrack candidate
3328
3329 Double_t x[5], c[15];
3330 Double_t x1,x2,x3,y1,y2,y3,z1,z2,z3;
3331 track2.GetBoundaries(x3,x1);
3332 x2 = (x1+x3)/2.;
3333 track2.GetFitPoint(x1,y1,z1);
3334 track2.GetFitPoint(x2,y2,z2);
3335 track2.GetFitPoint(x3,y3,z3);
3336 //
3337 //is track pointing to the vertex ?
3338 Double_t x0,y0,z0;
3339 x0=0;
3340 polytrack.GetFitPoint(x0,y0,z0);
3341
3342 if (constrain) {
3343 x2 = x3;
3344 y2 = y3;
3345 z2 = z3;
3346
3347 x3 = 0;
3348 y3 = 0;
3349 z3 = 0;
3350 }
3351 x[0]=y1;
3352 x[1]=z1;
b67e07dc 3353 x[4]=F1(x1,y1,x2,y2,x3,y3);
91162307 3354
3355 // if (TMath::Abs(x[4]) >= cuts[0]) continue; //
b67e07dc 3356 x[2]=F2(x1,y1,x2,y2,x3,y3);
91162307 3357
3358 //if (TMath::Abs(x[4]*x1-x[2]) >= cuts[1]) continue;
b67e07dc 3359 //x[3]=F3(x1,y1,x2,y2,z1,z2);
3360 x[3]=F3n(x1,y1,x3,y3,z1,z3,x[4]);
91162307 3361 //if (TMath::Abs(x[3]) > cuts[3]) continue;
3362
3363
3364 Double_t sy =0.1, sz =0.1;
3365 Double_t sy1=0.02, sz1=0.02;
3366 Double_t sy2=0.02, sz2=0.02;
3367 Double_t sy3=0.02;
3368
3369 if (constrain){
3370 sy3=25000*x[4]*x[4]+0.1, sy=0.1, sz=0.1;
3371 }
3372
b67e07dc 3373 Double_t f40=(F1(x1,y1+sy,x2,y2,x3,y3)-x[4])/sy;
3374 Double_t f42=(F1(x1,y1,x2,y2+sy,x3,y3)-x[4])/sy;
3375 Double_t f43=(F1(x1,y1,x2,y2,x3,y3+sy)-x[4])/sy;
3376 Double_t f20=(F2(x1,y1+sy,x2,y2,x3,y3)-x[2])/sy;
3377 Double_t f22=(F2(x1,y1,x2,y2+sy,x3,y3)-x[2])/sy;
3378 Double_t f23=(F2(x1,y1,x2,y2,x3,y3+sy)-x[2])/sy;
3379
3380 Double_t f30=(F3(x1,y1+sy,x3,y3,z1,z3)-x[3])/sy;
3381 Double_t f31=(F3(x1,y1,x3,y3,z1+sz,z3)-x[3])/sz;
3382 Double_t f32=(F3(x1,y1,x3,y3+sy,z1,z3)-x[3])/sy;
3383 Double_t f34=(F3(x1,y1,x3,y3,z1,z3+sz)-x[3])/sz;
91162307 3384
3385
3386 c[0]=sy1;
3387 c[1]=0.; c[2]=sz1;
3388 c[3]=f20*sy1; c[4]=0.; c[5]=f20*sy1*f20+f22*sy2*f22+f23*sy3*f23;
3389 c[6]=f30*sy1; c[7]=f31*sz1; c[8]=f30*sy1*f20+f32*sy2*f22;
3390 c[9]=f30*sy1*f30+f31*sz1*f31+f32*sy2*f32+f34*sz2*f34;
3391 c[10]=f40*sy1; c[11]=0.; c[12]=f40*sy1*f20+f42*sy2*f22+f43*sy3*f23;
3392 c[13]=f30*sy1*f40+f32*sy2*f42;
3393 c[14]=f40*sy1*f40+f42*sy2*f42+f43*sy3*f43;
3394
3395 //Int_t row1 = fSectors->GetRowNumber(x1);
3396 Int_t row1 = GetRowNumber(x1);
3397
3398 UInt_t index=0;
3399 //kr0.GetIndex(is);
3400 AliTPCseed *track=new (seed) AliTPCseed(index, x, c, x1, sec*alpha+shift);
3401 track->fIsSeeding = kTRUE;
3402 Int_t rc=FollowProlongation(*track, i2);
3403 if (constrain) track->fBConstrain =1;
3404 else
3405 track->fBConstrain =0;
3406 track->fLastPoint = row1+fInnerSec->GetNRows(); // first cluster in track position
3407 track->fFirstPoint = track->fLastPoint;
3408
3409 if (rc==0 || track->GetNumberOfClusters()<(i1-i2)*0.5 ||
3410 track->GetNumberOfClusters() < track->fNFoundable*0.6 ||
3411 track->fNShared>0.4*track->GetNumberOfClusters()) {
3412 //delete track;
3413 seed->Reset();
3414 seed->~AliTPCseed();
3415 }
3416 else {
3417 arr->AddLast(track);
3418 seed = new AliTPCseed;
3419 }
3420 nin3++;
3421 }
3422 } // if accepted seed
3423 }
6bdc18d6 3424 if (fDebug>3){
3425 Info("MakeSeeds2","\nSeeding statiistic:\t%d\t%d\t%d\t%d",nin0,nin1,nin2,nin3);
91162307 3426 }
3427 delete seed;
3428}
3429
3430
3431AliTPCseed *AliTPCtrackerMI::MakeSeed(AliTPCseed *track, Float_t r0, Float_t r1, Float_t r2)
3432{
3433 //
3434 //
d26d9159 3435 //reseed using track points
91162307 3436 Int_t p0 = int(r0*track->GetNumberOfClusters()); // point 0
3437 Int_t p1 = int(r1*track->GetNumberOfClusters());
3438 Int_t p2 = int(r2*track->GetNumberOfClusters()); // last point
176aff27 3439 Int_t pp2=0;
91162307 3440 Double_t x0[3],x1[3],x2[3];
3441 x0[0]=-1;
3442 x0[0]=-1;
3443 x0[0]=-1;
3444
3445 // find track position at given ratio of the length
3446 Int_t sec0, sec1, sec2;
176aff27 3447 sec0=0;
3448 sec1=0;
3449 sec2=0;
91162307 3450 Int_t index=-1;
3451 Int_t clindex;
3452 for (Int_t i=0;i<160;i++){
3453 if (track->fClusterPointer[i]){
3454 index++;
3455 AliTPCTrackerPoint *trpoint =track->GetTrackPoint(i);
3456 if ( (index<p0) || x0[0]<0 ){
3457 if (trpoint->GetX()>1){
3458 clindex = track->GetClusterIndex2(i);
3459 if (clindex>0){
3460 x0[0] = trpoint->GetX();
3461 x0[1] = trpoint->GetY();
3462 x0[2] = trpoint->GetZ();
3463 sec0 = ((clindex&0xff000000)>>24)%18;
3464 }
3465 }
3466 }
3467
3468 if ( (index<p1) &&(trpoint->GetX()>1)){
3469 clindex = track->GetClusterIndex2(i);
3470 if (clindex>0){
3471 x1[0] = trpoint->GetX();
3472 x1[1] = trpoint->GetY();
3473 x1[2] = trpoint->GetZ();
3474 sec1 = ((clindex&0xff000000)>>24)%18;
3475 }
3476 }
3477 if ( (index<p2) &&(trpoint->GetX()>1)){
3478 clindex = track->GetClusterIndex2(i);
3479 if (clindex>0){
3480 x2[0] = trpoint->GetX();
3481 x2[1] = trpoint->GetY();
3482 x2[2] = trpoint->GetZ();
3483 sec2 = ((clindex&0xff000000)>>24)%18;
3484 pp2 = i;
3485 }
3486 }
3487 }
3488 }
3489
3490 Double_t alpha, cs,sn, xx2,yy2;
3491 //
3492 alpha = (sec1-sec2)*fSectors->GetAlpha();
3493 cs = TMath::Cos(alpha);
3494 sn = TMath::Sin(alpha);
3495 xx2= x1[0]*cs-x1[1]*sn;
3496 yy2= x1[0]*sn+x1[1]*cs;
3497 x1[0] = xx2;
3498 x1[1] = yy2;
3499 //
3500 alpha = (sec0-sec2)*fSectors->GetAlpha();
3501 cs = TMath::Cos(alpha);
3502 sn = TMath::Sin(alpha);
3503 xx2= x0[0]*cs-x0[1]*sn;
3504 yy2= x0[0]*sn+x0[1]*cs;
3505 x0[0] = xx2;
3506 x0[1] = yy2;
3507 //
3508 //
3509 //
3510 Double_t x[5],c[15];
3511 //
3512 x[0]=x2[1];
3513 x[1]=x2[2];
b67e07dc 3514 x[4]=F1(x2[0],x2[1],x1[0],x1[1],x0[0],x0[1]);
91162307 3515 // if (x[4]>1) return 0;
b67e07dc 3516 x[2]=F2(x2[0],x2[1],x1[0],x1[1],x0[0],x0[1]);
3517 x[3]=F3n(x2[0],x2[1],x0[0],x0[1],x2[2],x0[2],x[4]);
91162307 3518 //if (TMath::Abs(x[3]) > 2.2) return 0;
3519 //if (TMath::Abs(x[2]) > 1.99) return 0;
3520 //
3521 Double_t sy =0.1, sz =0.1;
3522 //
3523 Double_t sy1=0.02+track->GetSigmaY2(), sz1=0.02+track->GetSigmaZ2();
3524 Double_t sy2=0.01+track->GetSigmaY2(), sz2=0.01+track->GetSigmaZ2();
3525 Double_t sy3=0.01+track->GetSigmaY2();
3526 //
b67e07dc 3527 Double_t f40=(F1(x2[0],x2[1]+sy,x1[0],x1[1],x0[0],x0[1])-x[4])/sy;
3528 Double_t f42=(F1(x2[0],x2[1],x1[0],x1[1]+sy,x0[0],x0[1])-x[4])/sy;
3529 Double_t f43=(F1(x2[0],x2[1],x1[0],x1[1],x0[0],x0[1]+sy)-x[4])/sy;
3530 Double_t f20=(F2(x2[0],x2[1]+sy,x1[0],x1[1],x0[0],x0[1])-x[2])/sy;
3531 Double_t f22=(F2(x2[0],x2[1],x1[0],x1[1]+sy,x0[0],x0[1])-x[2])/sy;
3532 Double_t f23=(F2(x2[0],x2[1],x1[0],x1[1],x0[0],x0[1]+sy)-x[2])/sy;
3533 //
3534 Double_t f30=(F3(x2[0],x2[1]+sy,x0[0],x0[1],x2[2],x0[2])-x[3])/sy;
3535 Double_t f31=(F3(x2[0],x2[1],x0[0],x0[1],x2[2]+sz,x0[2])-x[3])/sz;
3536 Double_t f32=(F3(x2[0],x2[1],x0[0],x0[1]+sy,x2[2],x0[2])-x[3])/sy;
3537 Double_t f34=(F3(x2[0],x2[1],x0[0],x0[1],x2[2],x0[2]+sz)-x[3])/sz;
91162307 3538
3539
3540 c[0]=sy1;
3541 c[1]=0.; c[2]=sz1;
3542 c[3]=f20*sy1; c[4]=0.; c[5]=f20*sy1*f20+f22*sy2*f22+f23*sy3*f23;
3543 c[6]=f30*sy1; c[7]=f31*sz1; c[8]=f30*sy1*f20+f32*sy2*f22;
3544 c[9]=f30*sy1*f30+f31*sz1*f31+f32*sy2*f32+f34*sz2*f34;
3545 c[10]=f40*sy1; c[11]=0.; c[12]=f40*sy1*f20+f42*sy2*f22+f43*sy3*f23;
3546 c[13]=f30*sy1*f40+f32*sy2*f42;
3547 c[14]=f40*sy1*f40+f42*sy2*f42+f43*sy3*f43;
3548
3549 // Int_t row1 = fSectors->GetRowNumber(x2[0]);
3550 AliTPCseed *seed=new AliTPCseed(0, x, c, x2[0], sec2*fSectors->GetAlpha()+fSectors->GetAlphaShift());
3551 // Double_t y0,z0,y1,z1, y2,z2;
3552 //seed->GetProlongation(x0[0],y0,z0);
3553 // seed->GetProlongation(x1[0],y1,z1);
3554 //seed->GetProlongation(x2[0],y2,z2);
3555 // seed =0;
3556 seed->fLastPoint = pp2;
3557 seed->fFirstPoint = pp2;
3558
3559
3560 return seed;
3561}
3562
d26d9159 3563
3564AliTPCseed *AliTPCtrackerMI::ReSeed(AliTPCseed *track, Float_t r0, Float_t r1, Float_t r2)
3565{
3566 //
3567 //
3568 //reseed using founded clusters
3569 //
3570 // Find the number of clusters
3571 Int_t nclusters = 0;
3572 for (Int_t irow=0;irow<160;irow++){
3573 if (track->GetClusterIndex(irow)>0) nclusters++;
3574 }
3575 //
3576 Int_t ipos[3];
3577 ipos[0] = TMath::Max(int(r0*nclusters),0); // point 0 cluster
3578 ipos[1] = TMath::Min(int(r1*nclusters),nclusters-1); //
3579 ipos[2] = TMath::Min(int(r2*nclusters),nclusters-1); // last point
3580 //
3581 //
3582 Double_t xyz[3][3];
3583 Int_t row[3],sec[3]={0,0,0};
3584 //
3585 // find track row position at given ratio of the length
3586 Int_t index=-1;
3587 for (Int_t irow=0;irow<160;irow++){
3588 if (track->GetClusterIndex2(irow)<0) continue;
3589 index++;
3590 for (Int_t ipoint=0;ipoint<3;ipoint++){
3591 if (index<=ipos[ipoint]) row[ipoint] = irow;
3592 }
3593 }
3594 //
3595 //Get cluster and sector position
3596 for (Int_t ipoint=0;ipoint<3;ipoint++){
3597 Int_t clindex = track->GetClusterIndex2(row[ipoint]);
3598 AliTPCclusterMI * cl = GetClusterMI(clindex);
3599 if (cl==0) {
6bdc18d6 3600 //Error("Bug\n");
47966a6d 3601 // AliTPCclusterMI * cl = GetClusterMI(clindex);
d26d9159 3602 return 0;
3603 }
3604 sec[ipoint] = ((clindex&0xff000000)>>24)%18;
3605 xyz[ipoint][0] = GetXrow(row[ipoint]);
3606 xyz[ipoint][1] = cl->GetY();
3607 xyz[ipoint][2] = cl->GetZ();
3608 }
3609 //
3610 //
3611 // Calculate seed state vector and covariance matrix
3612
3613 Double_t alpha, cs,sn, xx2,yy2;
3614 //
3615 alpha = (sec[1]-sec[2])*fSectors->GetAlpha();
3616 cs = TMath::Cos(alpha);
3617 sn = TMath::Sin(alpha);
3618 xx2= xyz[1][0]*cs-xyz[1][1]*sn;
3619 yy2= xyz[1][0]*sn+xyz[1][1]*cs;
3620 xyz[1][0] = xx2;
3621 xyz[1][1] = yy2;
3622 //
3623 alpha = (sec[0]-sec[2])*fSectors->GetAlpha();
3624 cs = TMath::Cos(alpha);
3625 sn = TMath::Sin(alpha);
3626 xx2= xyz[0][0]*cs-xyz[0][1]*sn;
3627 yy2= xyz[0][0]*sn+xyz[0][1]*cs;
3628 xyz[0][0] = xx2;
3629 xyz[0][1] = yy2;
3630 //
3631 //
3632 //
3633 Double_t x[5],c[15];
3634 //
3635 x[0]=xyz[2][1];
3636 x[1]=xyz[2][2];
3637 x[4]=F1(xyz[2][0],xyz[2][1],xyz[1][0],xyz[1][1],xyz[0][0],xyz[0][1]);
3638 x[2]=F2(xyz[2][0],xyz[2][1],xyz[1][0],xyz[1][1],xyz[0][0],xyz[0][1]);
3639 x[3]=F3n(xyz[2][0],xyz[2][1],xyz[0][0],xyz[0][1],xyz[2][2],xyz[0][2],x[4]);
3640 //
3641 Double_t sy =0.1, sz =0.1;
3642 //
3643 Double_t sy1=0.2, sz1=0.2;
3644 Double_t sy2=0.2, sz2=0.2;
3645 Double_t sy3=0.2;
3646 //
3647 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;
3648 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;
3649 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;
3650 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;
3651 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;
3652 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;
3653 //
3654 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;
3655 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;
3656 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;
3657 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;
3658
3659
3660 c[0]=sy1;
3661 c[1]=0.; c[2]=sz1;
3662 c[3]=f20*sy1; c[4]=0.; c[5]=f20*sy1*f20+f22*sy2*f22+f23*sy3*f23;
3663 c[6]=f30*sy1; c[7]=f31*sz1; c[8]=f30*sy1*f20+f32*sy2*f22;
3664 c[9]=f30*sy1*f30+f31*sz1*f31+f32*sy2*f32+f34*sz2*f34;
3665 c[10]=f40*sy1; c[11]=0.; c[12]=f40*sy1*f20+f42*sy2*f22+f43*sy3*f23;
3666 c[13]=f30*sy1*f40+f32*sy2*f42;
3667 c[14]=f40*sy1*f40+f42*sy2*f42+f43*sy3*f43;
3668
3669 // Int_t row1 = fSectors->GetRowNumber(xyz[2][0]);
3670 AliTPCseed *seed=new AliTPCseed(0, x, c, xyz[2][0], sec[2]*fSectors->GetAlpha()+fSectors->GetAlphaShift());
3671 seed->fLastPoint = row[2];
3672 seed->fFirstPoint = row[2];
3673 return seed;
3674}
3675
91162307 3676Int_t AliTPCtrackerMI::CheckKinkPoint(AliTPCseed*seed, Float_t th)
3677{
3678 //
3679 //
3680 //
3681 for (Int_t i=0;i<12;i++) seed->fKinkPoint[i]=0;
3682 //
3683 if (TMath::Abs(seed->GetC())>0.01) return 0;
3684 //
3685
3686 Float_t x[160], y[160], erry[160], z[160], errz[160];
3687 Int_t sec[160];
3688 Float_t xt[160], yt[160], zt[160];
3689 Int_t i1 = 200;
3690 Int_t i2 = 0;
3691 Int_t secm = -1;
3692 Int_t padm = -1;
3693 Int_t middle = seed->GetNumberOfClusters()/2;
3694 //
3695 //
3696 // find central sector, get local cooordinates
3697 Int_t count = 0;
3698 for (Int_t i=seed->fFirstPoint;i<=seed->fLastPoint;i++) {
3699 sec[i]= seed->GetClusterSector(i)%18;
3700 x[i] = GetXrow(i);
3701 if (sec[i]>=0) {
3702 AliTPCclusterMI * cl = seed->fClusterPointer[i];
3703 // if (cl==0) cl = GetClusterMI(seed->GetClusterIndex2(i));
3704 if (cl==0) {
3705 sec[i] = -1;
3706 continue;
3707 }
3708 //
3709 //
3710 if (i>i2) i2 = i; //last point with cluster
3711 if (i2<i1) i1 = i; //first point with cluster
3712 y[i] = cl->GetY();
3713 z[i] = cl->GetZ();
3714 AliTPCTrackerPoint * point = seed->GetTrackPoint(i);
3715 xt[i] = x[i];
3716 yt[i] = point->GetY();
3717 zt[i] = point->GetZ();
3718
3719 if (point->GetX()>0){
3720 erry[i] = point->GetErrY();
3721 errz[i] = point->GetErrZ();
3722 }
3723
3724 count++;
3725 if (count<middle) {
3726 secm = sec[i]; //central sector
3727 padm = i; //middle point with cluster
3728 }
3729 }
3730 }
3731 //
3732 // rotate position to global coordinate system connected to sector at last the point
3733 //
3734 for (Int_t i=i1;i<=i2;i++){
3735 //
3736 if (sec[i]<0) continue;
3737 Double_t alpha = (sec[i2]-sec[i])*fSectors->GetAlpha();
3738 Double_t cs = TMath::Cos(alpha);
3739 Double_t sn = TMath::Sin(alpha);
3740 Float_t xx2= x[i]*cs+y[i]*sn;
3741 Float_t yy2= -x[i]*sn+y[i]*cs;
3742 x[i] = xx2;
3743 y[i] = yy2;
3744 //
3745 xx2= xt[i]*cs+yt[i]*sn;
3746 yy2= -xt[i]*sn+yt[i]*cs;
3747 xt[i] = xx2;
3748 yt[i] = yy2;
3749
3750 }
3751 //get "state" vector
3752 Double_t xh[5],xm = x[padm];
3753 xh[0]=yt[i2];
3754 xh[1]=zt[i2];
b67e07dc 3755 xh[4]=F1(xt[i2],yt[i2],xt[padm],yt[padm],xt[i1],yt[i1]);
3756 xh[2]=F2(xt[i2],yt[i2],xt[padm],yt[padm],xt[i1],yt[i1]);
3757 xh[3]=F3n(xt[i2],yt[i2],xt[i1],yt[i1],zt[i2],zt[i1],xh[4]);
91162307 3758 //
3759 //
3760 for (Int_t i=i1;i<=i2;i++){
3761 Double_t yy,zz;
3762 if (sec[i]<0) continue;
3763 GetProlongation(x[i2], x[i],xh,yy,zz);
3764 if (TMath::Abs(y[i]-yy)>4||TMath::Abs(z[i]-zz)>4){
3765 //Double_t xxh[5];
b67e07dc 3766 //xxh[4]=F1old(x[i2],y[i2],x[padm],y[padm],x[i1],y[i1]);
3767 //xxh[2]=F2old(x[i2],y[i2],x[padm],y[padm],x[i1],y[i1]);
6bdc18d6 3768 Error("AliTPCtrackerMI::CheckKinkPoint","problem\n");
91162307 3769 }
3770 y[i] = y[i] - yy;
3771 z[i] = z[i] - zz;
3772 }
3773 Float_t dyup[160],dydown[160], dzup[160], dzdown[160];
3774 Float_t yup[160], ydown[160], zup[160], zdown[160];
3775
3776 AliTPCpolyTrack ptrack1,ptrack2;
3777 //
3778 // derivation up
3779 for (Int_t i=i1;i<=i2;i++){
3780 AliTPCclusterMI * cl = seed->fClusterPointer[i];
3781 if (!cl) continue;
3782 if (cl->GetType()<0) continue;
3783 if (cl->GetType()>10) continue;
3784
3785 if (sec[i]>=0){
3786 ptrack1.AddPoint(x[i]-xm,y[i],z[i],0.1,0.1);
3787 }
3788 if (ptrack1.GetN()>4.){
3789 ptrack1.UpdateParameters();
3790 Double_t ddy,ddz;
3791 ptrack1.GetFitDerivation(x[i]-xm,ddy,ddz);
3792 Double_t yy,zz;
3793 ptrack1.GetFitPoint(x[i]-xm,yy,zz);
3794
3795 dyup[i] = ddy;
3796 dzup[i] = ddz;
3797 yup[i] = yy;
3798 zup[i] = zz;
3799
3800 }
3801 else{
3802 dyup[i]=0.; //not enough points
3803 }
3804 }
3805 //
3806 // derivation down
3807 for (Int_t i=i2;i>=i1;i--){
3808 AliTPCclusterMI * cl = seed->fClusterPointer[i];
3809 if (!cl) continue;
3810 if (cl->GetType()<0) continue;
3811 if (cl->GetType()>10) continue;
3812 if (sec[i]>=0){
3813 ptrack2.AddPoint(x[i]-xm,y[i],z[i],0.1,0.1);
3814 }
3815 if (ptrack2.GetN()>4){
3816 ptrack2.UpdateParameters();
3817 Double_t ddy,ddz;
3818 ptrack2.GetFitDerivation(x[i]-xm,ddy,ddz);
3819 Double_t yy,zz;
3820 ptrack2.GetFitPoint(x[i]-xm,yy,zz);
3821
3822 dydown[i] = ddy;
3823 dzdown[i] = ddz;
3824 ydown[i] = yy;
3825 zdown[i] = zz;
3826 }
3827 else{
3828 dydown[i]=0.; //not enough points
3829 }
3830 }
3831 //
3832 //
3833 // find maximal difference of the derivation
3834 for (Int_t i=0;i<12;i++) seed->fKinkPoint[i]=0;
3835
3836
3837 for (Int_t i=i1+10;i<i2-10;i++){
3838 if ( (TMath::Abs(dydown[i])<0.00000001) || (TMath::Abs(dyup[i])<0.00000001) ||i<30)continue;
3839 // printf("%f\t%f\t%f\t%f\t%f\n",x[i],dydown[i],dyup[i],dzdown[i],dzup[i]);
3840 //
3841 Float_t ddy = TMath::Abs(dydown[i]-dyup[i]);
3842 Float_t ddz = TMath::Abs(dzdown[i]-dzup[i]);
3843 if ( (ddy+ddz)> th){
3844 seed->fKinkPoint[0] = i;
3845 seed->fKinkPoint[1] = ddy;
3846 seed->fKinkPoint[2] = ddz;
3847 th = ddy+ddz;
3848 }
3849 }
3850
3851 if (fTreeDebug){
3852 //
3853 //write information to the debug tree
3854 TBranch * br = fTreeDebug->GetBranch("debug");
3855 TClonesArray * arr = new TClonesArray("AliTPCTrackPoint2");
3856 arr->ExpandCreateFast(i2-i1);
3857 br->SetAddress(&arr);
3858 //
3859 AliTPCclusterMI cldummy;
3860 cldummy.SetQ(0);
3861 AliTPCTrackPoint2 pdummy;
3862 pdummy.GetTPoint().fIsShared = 10;
3863 //
3864 Double_t alpha = sec[i2]*fSectors->GetAlpha();
3865 Double_t cs = TMath::Cos(alpha);
3866 Double_t sn = TMath::Sin(alpha);
3867
3868 for (Int_t i=i1;i<i2;i++){
3869 AliTPCTrackPoint2 *trpoint = (AliTPCTrackPoint2*)arr->UncheckedAt(i-i1);
3870 //cluster info
3871 AliTPCclusterMI * cl0 = seed->fClusterPointer[i];
3872 //
3873 AliTPCTrackerPoint * point = seed->GetTrackPoint(i);
3874
3875 if (cl0){
3876 Double_t x = GetXrow(i);
3877 trpoint->GetTPoint() = *point;
3878 trpoint->GetCPoint() = *cl0;
3879 trpoint->GetCPoint().SetQ(TMath::Abs(cl0->GetQ()));
3880 trpoint->fID = seed->GetUniqueID();
3881 trpoint->fLab = seed->GetLabel();
3882 //
3883 trpoint->fGX = cs *x + sn*point->GetY();
3884 trpoint->fGY = -sn *x + cs*point->GetY() ;
3885 trpoint->fGZ = point->GetZ();
3886 //
3887 trpoint->fDY = y[i];
3888 trpoint->fDZ = z[i];
3889 //
3890 trpoint->fDYU = dyup[i];
3891 trpoint->fDZU = dzup[i];
3892 //
3893 trpoint->fDYD = dydown[i];
3894 trpoint->fDZD = dzdown[i];
3895 //
3896 if (TMath::Abs(dyup[i])>0.00000000001 &&TMath::Abs(dydown[i])>0.00000000001){
3897 trpoint->fDDY = dydown[i]-dyup[i];
3898 trpoint->fDDZ = dzdown[i]-dzup[i];
3899 }else{
3900 trpoint->fDDY = 0.;
3901 trpoint->fDDZ = 0.;
3902 }
3903 }
3904 else{
3905 *trpoint = pdummy;
3906 trpoint->GetCPoint()= cldummy;
3907 trpoint->fID = -1;
3908 }
3909 //
1627d1c4 3910 }
91162307 3911 fTreeDebug->Fill();
1627d1c4 3912 }
3913
3914
91162307 3915 return 0;
1627d1c4 3916
3917}
3918
3919
3920
3921
3922
91162307 3923AliTPCseed* AliTPCtrackerMI::ReSeed(AliTPCseed *t)
3924{
3925 //
3926 // reseed - refit - track
3927 //
3928 Int_t first = 0;
3929 // Int_t last = fSectors->GetNRows()-1;
3930 //
3931 if (fSectors == fOuterSec){
3932 first = TMath::Max(first, t->fFirstPoint-fInnerSec->GetNRows());
3933 //last =
3934 }
3935 else
3936 first = t->fFirstPoint;
3937 //
3938 AliTPCseed * seed = MakeSeed(t,0.1,0.5,0.9);
3939 FollowBackProlongation(*t,fSectors->GetNRows()-1);
3940 t->Reset(kFALSE);
3941 FollowProlongation(*t,first);
3942 return seed;
3943}
3944
3945
3946
3947
3948
3949
3950
1c53abe2 3951//_____________________________________________________________________________
3952Int_t AliTPCtrackerMI::ReadSeeds(const TFile *inp) {
3953 //-----------------------------------------------------------------
3954 // This function reades track seeds.
3955 //-----------------------------------------------------------------
3956 TDirectory *savedir=gDirectory;
3957
3958 TFile *in=(TFile*)inp;
3959 if (!in->IsOpen()) {
3960 cerr<<"AliTPCtrackerMI::ReadSeeds(): input file is not open !\n";
3961 return 1;
3962 }
3963
3964 in->cd();
3965 TTree *seedTree=(TTree*)in->Get("Seeds");
3966 if (!seedTree) {
3967 cerr<<"AliTPCtrackerMI::ReadSeeds(): ";
3968 cerr<<"can't get a tree with track seeds !\n";
3969 return 2;
3970 }
3971 AliTPCtrack *seed=new AliTPCtrack;
3972 seedTree->SetBranchAddress("tracks",&seed);
3973
3974 if (fSeeds==0) fSeeds=new TObjArray(15000);
3975
3976 Int_t n=(Int_t)seedTree->GetEntries();
3977 for (Int_t i=0; i<n; i++) {
3978 seedTree->GetEvent(i);
3979 fSeeds->AddLast(new AliTPCseed(*seed,seed->GetAlpha()));
3980 }
3981
3982 delete seed;
3983 delete seedTree;
3984 savedir->cd();
3985 return 0;
3986}
3987
d26d9159 3988Int_t AliTPCtrackerMI::Clusters2Tracks (AliESD *esd)
3989{
3990 //
d9b8978b 3991 if (fSeeds) DeleteSeeds();
d26d9159 3992 fEvent = esd;
3993 Clusters2Tracks();
3994 if (!fSeeds) return 1;
3995 FillESD(fSeeds);
3996 return 0;
3997 //
3998}
3999
4000
1c53abe2 4001//_____________________________________________________________________________
f8aae377 4002Int_t AliTPCtrackerMI::Clusters2Tracks() {
1c53abe2 4003 //-----------------------------------------------------------------
4004 // This is a track finder.
4005 //-----------------------------------------------------------------
91162307 4006 TDirectory *savedir=gDirectory;
1c53abe2 4007 TStopwatch timer;
d26d9159 4008
91162307 4009 fIteration = 0;
4010 fSeeds = Tracking();
1c53abe2 4011
6bdc18d6 4012 if (fDebug>0){
4013 Info("Clusters2Tracks","Time for tracking: \t");timer.Print();timer.Start();
4014 }
91162307 4015 //activate again some tracks
4016 for (Int_t i=0; i<fSeeds->GetEntriesFast(); i++) {
4017 AliTPCseed *pt=(AliTPCseed*)fSeeds->UncheckedAt(i), &t=*pt;
4018 if (!pt) continue;
4019 Int_t nc=t.GetNumberOfClusters();
4020 if (nc<20) {
4021 delete fSeeds->RemoveAt(i);
4022 continue;
4023 }
4024 if (pt->fRemoval==10) {
4025 if (pt->GetDensityFirst(20)>0.8 || pt->GetDensityFirst(30)>0.8 || pt->GetDensityFirst(40)>0.7)
4026 pt->Desactivate(10); // make track again active
4027 else{
4028 pt->Desactivate(20);
4029 delete fSeeds->RemoveAt(i);
4030 }
4031 }
4032 }
4033 RemoveDouble(fSeeds,0.2,0.6,11);
91162307 4034 RemoveUsed(fSeeds,0.5,0.5,6);
c9427e08 4035
1c53abe2 4036 //
91162307 4037 Int_t nseed=fSeeds->GetEntriesFast();
4038 Int_t found = 0;
4039 for (Int_t i=0; i<nseed; i++) {
4040 AliTPCseed *pt=(AliTPCseed*)fSeeds->UncheckedAt(i), &t=*pt;
4041 if (!pt) continue;
4042 Int_t nc=t.GetNumberOfClusters();
4043 if (nc<15) {
4044 delete fSeeds->RemoveAt(i);
4045 continue;
4046 }
4047 CookLabel(pt,0.1); //For comparison only
4048 //if ((pt->IsActive() || (pt->fRemoval==10) )&& nc>50 &&pt->GetNumberOfClusters()>0.4*pt->fNFoundable){
4049 if ((pt->IsActive() || (pt->fRemoval==10) )){
d9b8978b 4050 found++;
4051 if (fDebug>0) cerr<<found<<'\r';
d26d9159 4052 pt->fLab2 = i;
91162307 4053 }
4054 else
4055 delete fSeeds->RemoveAt(i);
91162307 4056 }
4057
4058
4059 //RemoveOverlap(fSeeds,0.99,7,kTRUE);
4060 SignShared(fSeeds);
4061 //RemoveUsed(fSeeds,0.9,0.9,6);
1c53abe2 4062 //
91162307 4063 nseed=fSeeds->GetEntriesFast();
4064 found = 0;
4065 for (Int_t i=0; i<nseed; i++) {
4066 AliTPCseed *pt=(AliTPCseed*)fSeeds->UncheckedAt(i), &t=*pt;
4067 if (!pt) continue;
4068 Int_t nc=t.GetNumberOfClusters();
4069 if (nc<15) {
4070 delete fSeeds->RemoveAt(i);
4071 continue;
4072 }
4073 t.SetUniqueID(i);
4074 t.CookdEdx(0.02,0.6);
4075 // CheckKinkPoint(&t,0.05);
4076 //if ((pt->IsActive() || (pt->fRemoval==10) )&& nc>50 &&pt->GetNumberOfClusters()>0.4*pt->fNFoundable){
4077 if ((pt->IsActive() || (pt->fRemoval==10) )){
6bdc18d6 4078 found++;
4079 if (fDebug>0){
4080 cerr<<found<<'\r';
4081 }
d26d9159 4082 pt->fLab2 = i;
91162307 4083 }
4084 else
4085 delete fSeeds->RemoveAt(i);
d26d9159 4086 //AliTPCseed * seed1 = ReSeed(pt,0.05,0.5,1);
4087 //if (seed1){
4088 // FollowProlongation(*seed1,0);
4089 // Int_t n = seed1->GetNumberOfClusters();
4090 // printf("fP4\t%f\t%f\n",seed1->GetC(),pt->GetC());
4091 // printf("fN\t%d\t%d\n", seed1->GetNumberOfClusters(),pt->GetNumberOfClusters());
4092 //
4093 //}
4094 //AliTPCseed * seed2 = ReSeed(pt,0.95,0.5,0.05);
4095
91162307 4096 }
4097
4098 SortTracks(fSeeds, 1);
1c53abe2 4099
982aff31 4100 /*
91162307 4101 fIteration = 1;
982aff31 4102 PrepareForBackProlongation(fSeeds,5.);
91162307 4103 PropagateBack(fSeeds);
4104 printf("Time for back propagation: \t");timer.Print();timer.Start();
4105
4106 fIteration = 2;
1c53abe2 4107
982aff31 4108 PrepareForProlongation(fSeeds,5.);
4109 PropagateForward2(fSeeds);
d26d9159 4110
91162307 4111 printf("Time for FORWARD propagation: \t");timer.Print();timer.Start();
4112 // RemoveUsed(fSeeds,0.7,0.7,6);
4113 //RemoveOverlap(fSeeds,0.9,7,kTRUE);
d26d9159 4114
1c53abe2 4115 nseed=fSeeds->GetEntriesFast();
91162307 4116 found = 0;
4117 for (Int_t i=0; i<nseed; i++) {
1c53abe2 4118 AliTPCseed *pt=(AliTPCseed*)fSeeds->UncheckedAt(i), &t=*pt;
4119 if (!pt) continue;
4120 Int_t nc=t.GetNumberOfClusters();
91162307 4121 if (nc<15) {
4122 delete fSeeds->RemoveAt(i);
4123 continue;
4124 }
1c53abe2 4125 t.CookdEdx(0.02,0.6);
91162307 4126 // CookLabel(pt,0.1); //For comparison only
4127 //if ((pt->IsActive() || (pt->fRemoval==10) )&& nc>50 &&pt->GetNumberOfClusters()>0.4*pt->fNFoundable){
4128 if ((pt->IsActive() || (pt->fRemoval==10) )){
4129 cerr<<found++<<'\r';
4130 }
4131 else
4132 delete fSeeds->RemoveAt(i);
4133 pt->fLab2 = i;
1c53abe2 4134 }
91162307 4135 */
4136
c9427e08 4137 // fNTracks = found;
6bdc18d6 4138 if (fDebug>0){
4139 Info("Clusters2Tracks","Time for overlap removal, track writing and dedx cooking: \t"); timer.Print();timer.Start();
4140 }
91162307 4141 //
6bdc18d6 4142 // cerr<<"Number of found tracks : "<<"\t"<<found<<endl;
4143 Info("Clusters2Tracks","Number of found tracks %d",found);
91162307 4144 savedir->cd();
91162307 4145 // UnloadClusters();
d26d9159 4146 //
1c53abe2 4147 return 0;
4148}
4149
91162307 4150void AliTPCtrackerMI::Tracking(TObjArray * arr)
4151{
4152 //
4153 // tracking of the seeds
4154 //
4155
4156 fSectors = fOuterSec;
4157 ParallelTracking(arr,150,63);
4158 fSectors = fOuterSec;
4159 ParallelTracking(arr,63,0);
4160}
4161
4162TObjArray * AliTPCtrackerMI::Tracking(Int_t seedtype, Int_t i1, Int_t i2, Float_t cuts[4], Float_t dy, Int_t dsec)
4163{
4164 //
4165 //
4166 //tracking routine
4167 TObjArray * arr = new TObjArray;
4168 //
4169 fSectors = fOuterSec;
4170 TStopwatch timer;
4171 timer.Start();
4172 for (Int_t sec=0;sec<fkNOS;sec++){
4173 if (seedtype==3) MakeSeeds3(arr,sec,i1,i2,cuts,dy, dsec);
4174 if (seedtype==4) MakeSeeds5(arr,sec,i1,i2,cuts,dy);
4175 if (seedtype==2) MakeSeeds2(arr,sec,i1,i2,cuts,dy);
4176 }
4177 if (fDebug>0){
6bdc18d6 4178 Info("Tracking","\nSeeding - %d\t%d\t%d\t%d\n",seedtype,i1,i2,arr->GetEntriesFast());
91162307 4179 timer.Print();
4180 timer.Start();
4181 }
4182 Tracking(arr);
4183 if (fDebug>0){
4184 timer.Print();
4185 }
4186
4187 return arr;
4188}
4189
4190TObjArray * AliTPCtrackerMI::Tracking()
4191{
4192 //
4193 //
4194 TStopwatch timer;
4195 timer.Start();
4196 Int_t nup=fOuterSec->GetNRows()+fInnerSec->GetNRows();
4197
4198 TObjArray * seeds = new TObjArray;
4199 TObjArray * arr=0;
4200
4201 Int_t gap =20;
4202 Float_t cuts[4];
4203 cuts[0] = 0.002;
4204 cuts[1] = 1.5;
4205 cuts[2] = 3.;
4206 cuts[3] = 3.;
4207 Float_t fnumber = 3.0;
4208 Float_t fdensity = 3.0;
4209
4210 //
4211 //find primaries
4212 cuts[0]=0.0066;
4213 for (Int_t delta = 0; delta<18; delta+=6){
4214 //
4215 cuts[0]=0.0070;
4216 cuts[1] = 1.5;
4217 arr = Tracking(3,nup-1-delta,nup-1-delta-gap,cuts,-1,1);
4218 SumTracks(seeds,arr);
4219 SignClusters(seeds,fnumber,fdensity);
4220 //
4221 for (Int_t i=2;i<6;i+=2){
4222 // seed high pt tracks
4223 cuts[0]=0.0022;
4224 cuts[1]=0.3;
4225 arr = Tracking(3,nup-i-delta,nup-i-delta-gap,cuts,-1,0);
4226 SumTracks(seeds,arr);
4227 SignClusters(seeds,fnumber,fdensity);
4228 }
4229 }
4230 fnumber = 4;
4231 fdensity = 4.;
4232 // RemoveUsed(seeds,0.9,0.9,1);
4233 // UnsignClusters();
4234 // SignClusters(seeds,fnumber,fdensity);
4235
4236 //find primaries
4237 cuts[0]=0.0077;
4238 for (Int_t delta = 20; delta<120; delta+=10){
4239 //
4240 // seed high pt tracks
4241 cuts[0]=0.0060;
4242 cuts[1]=0.3;
4243 cuts[2]=6.;
4244 arr = Tracking(3,nup-delta,nup-delta-gap,cuts,-1);
4245 SumTracks(seeds,arr);
4246 SignClusters(seeds,fnumber,fdensity);
4247
4248 cuts[0]=0.003;
4249 cuts[1]=0.3;
4250 cuts[2]=6.;
4251 arr = Tracking(3,nup-delta-5,nup-delta-5-gap,cuts,-1);
4252 SumTracks(seeds,arr);
4253 SignClusters(seeds,fnumber,fdensity);
4254 }
4255
4256 cuts[0] = 0.01;
4257 cuts[1] = 2.0;
4258 cuts[2] = 3.;
4259 cuts[3] = 2.0;
4260 fnumber = 2.;
4261 fdensity = 2.;
4262
4263 if (fDebug>0){
6bdc18d6 4264 Info("Tracking()","\n\nPrimary seeding\t%d\n\n",seeds->GetEntriesFast());
91162307 4265 timer.Print();
4266 timer.Start();
4267 }
4268 // RemoveUsed(seeds,0.75,0.75,1);
4269 //UnsignClusters();
4270 //SignClusters(seeds,fnumber,fdensity);
4271
4272 // find secondaries
4273
4274 cuts[0] = 0.3;
4275 cuts[1] = 1.5;
4276 cuts[2] = 3.;
4277 cuts[3] = 1.5;
4278
4279 arr = Tracking(4,nup-1,nup-1-gap,cuts,-1);
4280 SumTracks(seeds,arr);
4281 SignClusters(seeds,fnumber,fdensity);
4282 //
4283 arr = Tracking(4,nup-2,nup-2-gap,cuts,-1);
4284 SumTracks(seeds,arr);
4285 SignClusters(seeds,fnumber,fdensity);
4286 //
4287 arr = Tracking(4,nup-3,nup-3-gap,cuts,-1);
4288 SumTracks(seeds,arr);
4289 SignClusters(seeds,fnumber,fdensity);
4290 //
4291
4292
4293 for (Int_t delta = 3; delta<30; delta+=5){
4294 //
4295 cuts[0] = 0.3;
4296 cuts[1] = 1.5;
4297 cuts[2] = 3.;
4298 cuts[3] = 1.5;
4299 arr = Tracking(4,nup-1-delta,nup-1-delta-gap,cuts,-1);
4300 SumTracks(seeds,arr);
4301 SignClusters(seeds,fnumber,fdensity);
4302 //
4303 arr = Tracking(4,nup-3-delta,nup-5-delta-gap,cuts,4);
4304 SumTracks(seeds,arr);
4305 SignClusters(seeds,fnumber,fdensity);
4306 //
4307 }
4308 fnumber = 1;
4309 fdensity = 1;
4310 //
4311 // change cuts
4312 fnumber = 2.;
4313 fdensity = 2.;
4314 cuts[0]=0.0080;
4315
4316 // find secondaries
4317 for (Int_t delta = 30; delta<70; delta+=10){
4318 //
4319 cuts[0] = 0.3;
4320 cuts[1] = 1.5;
4321 cuts[2] = 3.;
4322 cuts[3] = 1.5;
4323 arr = Tracking(4,nup-1-delta,nup-1-delta-gap,cuts,-1);
4324 SumTracks(seeds,arr);
4325 SignClusters(seeds,fnumber,fdensity);
4326 //
4327 arr = Tracking(4,nup-5-delta,nup-5-delta-gap,cuts,5 );
4328 SumTracks(seeds,arr);
4329 SignClusters(seeds,fnumber,fdensity);
4330 }
4331
4332 if (fDebug>0){
6bdc18d6 4333 Info("Tracking()","\n\nSecondary seeding\t%d\n\n",seeds->GetEntriesFast());
91162307 4334 timer.Print();
4335 timer.Start();
4336 }
4337
4338 return seeds;
4339 //
4340
4341}
4342
4343
47966a6d 4344void AliTPCtrackerMI::SumTracks(TObjArray *arr1,TObjArray *arr2) const
91162307 4345{
4346 //
4347 //sum tracks to common container
4348 //remove suspicious tracks
4349 Int_t nseed = arr2->GetEntriesFast();
4350 for (Int_t i=0;i<nseed;i++){
4351 AliTPCseed *pt=(AliTPCseed*)arr2->UncheckedAt(i);
4352 if (pt){
4353
4354 // NORMAL ACTIVE TRACK
4355 if (pt->IsActive()){
4356 arr1->AddLast(arr2->RemoveAt(i));
4357 continue;
4358 }
4359 //remove not usable tracks
4360 if (pt->fRemoval!=10){
4361 delete arr2->RemoveAt(i);
4362 continue;
4363 }
4364 // REMOVE VERY SHORT TRACKS
4365 if (pt->GetNumberOfClusters()<20){
4366 delete arr2->RemoveAt(i);
4367 continue;
4368 }
4369 // ENABLE ONLY ENOUGH GOOD STOPPED TRACKS
4370 if (pt->GetDensityFirst(20)>0.8 || pt->GetDensityFirst(30)>0.8 || pt->GetDensityFirst(40)>0.7)
4371 arr1->AddLast(arr2->RemoveAt(i));
4372 else{
4373 delete arr2->RemoveAt(i);
4374 }
4375 }
4376 }
4377 delete arr2;
4378}
4379
4380
1c53abe2 4381
91162307 4382void AliTPCtrackerMI::ParallelTracking(TObjArray * arr, Int_t rfirst, Int_t rlast)
1c53abe2 4383{
4384 //
4385 // try to track in parralel
4386
91162307 4387 Int_t nseed=arr->GetEntriesFast();
1c53abe2 4388 //prepare seeds for tracking
4389 for (Int_t i=0; i<nseed; i++) {
91162307 4390 AliTPCseed *pt=(AliTPCseed*)arr->UncheckedAt(i), &t=*pt;
1c53abe2 4391 if (!pt) continue;
4392 if (!t.IsActive()) continue;
4393 // follow prolongation to the first layer
91162307 4394 if ( (fSectors ==fInnerSec) || (t.fFirstPoint-fParam->GetNRowLow()>rfirst+1) )
c9427e08 4395 FollowProlongation(t, rfirst+1);
1c53abe2 4396 }
4397
4398
4399 //
982aff31 4400 for (Int_t nr=rfirst; nr>=rlast; nr--){
4401 if (nr<fInnerSec->GetNRows())
4402 fSectors = fInnerSec;
4403 else
4404 fSectors = fOuterSec;
1c53abe2 4405 // make indexes with the cluster tracks for given
1c53abe2 4406
4407 // find nearest cluster
4408 for (Int_t i=0; i<nseed; i++) {
91162307 4409 AliTPCseed *pt=(AliTPCseed*)arr->UncheckedAt(i), &t=*pt;
1c53abe2 4410 if (!pt) continue;
4411 if (!pt->IsActive()) continue;
91162307 4412 // if ( (fSectors ==fOuterSec) && (pt->fFirstPoint-fParam->GetNRowLow())<nr) continue;
1627d1c4 4413 if (pt->fRelativeSector>17) {
4414 continue;
4415 }
91162307 4416 UpdateClusters(t,nr);
1c53abe2 4417 }
4418 // prolonagate to the nearest cluster - if founded
4419 for (Int_t i=0; i<nseed; i++) {
91162307 4420 AliTPCseed *pt=(AliTPCseed*)arr->UncheckedAt(i);
1c53abe2 4421 if (!pt) continue;
1627d1c4 4422 if (!pt->IsActive()) continue;
91162307 4423 // if ((fSectors ==fOuterSec) && (pt->fFirstPoint-fParam->GetNRowLow())<nr) continue;
1627d1c4 4424 if (pt->fRelativeSector>17) {
4425 continue;
4426 }
91162307 4427 FollowToNextCluster(*pt,nr);
1c53abe2 4428 }
91162307 4429 }
4430}
4431
47966a6d 4432void AliTPCtrackerMI::PrepareForBackProlongation(TObjArray * arr,Float_t fac) const
91162307 4433{
4434 //
4435 //
4436 // if we use TPC track itself we have to "update" covariance
4437 //
4438 Int_t nseed= arr->GetEntriesFast();
4439 for (Int_t i=0;i<nseed;i++){
4440 AliTPCseed *pt = (AliTPCseed*)arr->UncheckedAt(i);
4441 if (pt) {
4442 pt->Modify(fac);
4443 //
4444 //rotate to current local system at first accepted point
4445 Int_t index = pt->GetClusterIndex2(pt->fFirstPoint);
4446 Int_t sec = (index&0xff000000)>>24;
4447 sec = sec%18;
4448 Float_t angle1 = fInnerSec->GetAlpha()*sec+fInnerSec->GetAlphaShift();
4449 if (angle1>TMath::Pi())
4450 angle1-=2.*TMath::Pi();
4451 Float_t angle2 = pt->GetAlpha();
4452
4453 if (TMath::Abs(angle1-angle2)>0.001){
4454 pt->Rotate(angle1-angle2);
4455 //angle2 = pt->GetAlpha();
4456 //pt->fRelativeSector = pt->GetAlpha()/fInnerSec->GetAlpha();
4457 //if (pt->GetAlpha()<0)
4458 // pt->fRelativeSector+=18;
4459 //sec = pt->fRelativeSector;
4460 }
4461
4462 }
4463
4464 }
4465
4466
4467}
47966a6d 4468void AliTPCtrackerMI::PrepareForProlongation(TObjArray * arr, Float_t fac) const
91162307 4469{
4470 //
4471 //
4472 // if we use TPC track itself we have to "update" covariance
4473 //
4474 Int_t nseed= arr->GetEntriesFast();
4475 for (Int_t i=0;i<nseed;i++){
4476 AliTPCseed *pt = (AliTPCseed*)arr->UncheckedAt(i);
4477 if (pt) {
4478 pt->Modify(fac);
4479 pt->fFirstPoint = pt->fLastPoint;
4480 }
4481
4482 }
4483
4484
4485}
4486
4487Int_t AliTPCtrackerMI::PropagateBack(TObjArray * arr)
4488{
4489 //
4490 // make back propagation
4491 //
4492 Int_t nseed= arr->GetEntriesFast();
4493 for (Int_t i=0;i<nseed;i++){
4494 AliTPCseed *pt = (AliTPCseed*)arr->UncheckedAt(i);
4495 if (pt) {
d9b8978b 4496 //AliTPCseed *pt2 = new AliTPCseed(*pt);
91162307 4497 fSectors = fInnerSec;
d26d9159 4498 //FollowBackProlongation(*pt,fInnerSec->GetNRows()-1);
4499 //fSectors = fOuterSec;
4d158c36 4500 FollowBackProlongation(*pt,fInnerSec->GetNRows()+fOuterSec->GetNRows()-1);
4501 //if (pt->GetNumberOfClusters()<(pt->fEsd->GetTPCclusters(0)) ){
d9b8978b 4502 // Error("PropagateBack","Not prolonged track %d",pt->GetLabel());
4d158c36 4503 // FollowBackProlongation(*pt2,fInnerSec->GetNRows()+fOuterSec->GetNRows()-1);
d9b8978b 4504 //}
91162307 4505 }
4506 }
4507 return 0;
4508}
4509
4510
4511Int_t AliTPCtrackerMI::PropagateForward2(TObjArray * arr)
4512{
4513 //
4514 // make forward propagation
4515 //
4516 Int_t nseed= arr->GetEntriesFast();
4d158c36 4517 //
91162307 4518 for (Int_t i=0;i<nseed;i++){
4519 AliTPCseed *pt = (AliTPCseed*)arr->UncheckedAt(i);
4520 if (pt) {
91162307 4521 FollowProlongation(*pt,0);
4d158c36 4522 }
91162307 4523 }
4524 return 0;
4525}
4526
4527
4528Int_t AliTPCtrackerMI::PropagateForward()
4529{
b67e07dc 4530 //
4531 // propagate track forward
4d158c36 4532 //UnsignClusters();
d26d9159 4533 Int_t nseed = fSeeds->GetEntriesFast();
4534 for (Int_t i=0;i<nseed;i++){
4535 AliTPCseed *pt = (AliTPCseed*)fSeeds->UncheckedAt(i);
4536 if (pt){
4537 AliTPCseed &t = *pt;
4538 Double_t alpha=t.GetAlpha() - fSectors->GetAlphaShift();
4539 if (alpha > 2.*TMath::Pi()) alpha -= 2.*TMath::Pi();
4540 if (alpha < 0. ) alpha += 2.*TMath::Pi();
4541 t.fRelativeSector = Int_t(alpha/fSectors->GetAlpha()+0.0001)%fN;
4542 }
4543 }
4544
91162307 4545 fSectors = fOuterSec;
d26d9159 4546 ParallelTracking(fSeeds,fOuterSec->GetNRows()+fInnerSec->GetNRows()-1,fInnerSec->GetNRows());
91162307 4547 fSectors = fInnerSec;
d26d9159 4548 ParallelTracking(fSeeds,fInnerSec->GetNRows()-1,0);
91162307 4549 //WriteTracks();
4550 return 1;
4551}
4552
4553
4554
4555
4556
4557
4558Int_t AliTPCtrackerMI::PropagateBack(AliTPCseed * pt, Int_t row0, Int_t row1)
4559{
4560 //
4561 // make back propagation, in between row0 and row1
4562 //
1c53abe2 4563
91162307 4564 if (pt) {
4565 fSectors = fInnerSec;
4566 Int_t r1;
4567 //
4568 if (row1<fSectors->GetNRows())
4569 r1 = row1;
4570 else
4571 r1 = fSectors->GetNRows()-1;
4572
4573 if (row0<fSectors->GetNRows()&& r1>0 )
4574 FollowBackProlongation(*pt,r1);
4575 if (row1<=fSectors->GetNRows())
4576 return 0;
4577 //
4578 r1 = row1 - fSectors->GetNRows();
4579 if (r1<=0) return 0;
4580 if (r1>=fOuterSec->GetNRows()) return 0;
4581 fSectors = fOuterSec;
4582 return FollowBackProlongation(*pt,r1);
4583 }
4584 return 0;
4585}
4586
4587
4588
4589
4590void AliTPCtrackerMI::GetShape(AliTPCseed * seed, Int_t row)
4591{
4592 //
4593 //
4594 Float_t sd2 = TMath::Abs((fParam->GetZLength()-TMath::Abs(seed->GetZ())))*fParam->GetDiffL()*fParam->GetDiffL();
4595 // Float_t padlength = fParam->GetPadPitchLength(seed->fSector);
4596 Float_t padlength = GetPadPitchLength(row);
4597 //
4598 Float_t sresy = (seed->fSector < fParam->GetNSector()/2) ? 0.2 :0.3;
4599 Float_t angulary = seed->GetSnp();
4600 angulary = angulary*angulary/(1-angulary*angulary);
4601 seed->fCurrentSigmaY2 = sd2+padlength*padlength*angulary/12.+sresy*sresy;
4602 //
4603 Float_t sresz = fParam->GetZSigma();
4604 Float_t angularz = seed->GetTgl();
4605 seed->fCurrentSigmaZ2 = sd2+padlength*padlength*angularz*angularz*(1+angulary)/12.+sresz*sresz;
4606 /*
4607 Float_t wy = GetSigmaY(seed);
4608 Float_t wz = GetSigmaZ(seed);
4609 wy*=wy;
4610 wz*=wz;
4611 if (TMath::Abs(wy/seed->fCurrentSigmaY2-1)>0.0001 || TMath::Abs(wz/seed->fCurrentSigmaZ2-1)>0.0001 ){
4612 printf("problem\n");
4613 }
4614 */
1c53abe2 4615}
4616
91162307 4617
1c53abe2 4618Float_t AliTPCtrackerMI::GetSigmaY(AliTPCseed * seed)
4619{
4620 //
4621 //
c9427e08 4622 Float_t sd2 = TMath::Abs((fParam->GetZLength()-TMath::Abs(seed->GetZ())))*fParam->GetDiffL()*fParam->GetDiffL();
1c53abe2 4623 Float_t padlength = fParam->GetPadPitchLength(seed->fSector);
4624 Float_t sres = (seed->fSector < fParam->GetNSector()/2) ? 0.2 :0.3;
4625 Float_t angular = seed->GetSnp();
4626 angular = angular*angular/(1-angular*angular);
4627 // angular*=angular;
4628 //angular = TMath::Sqrt(angular/(1-angular));
4629 Float_t res = TMath::Sqrt(sd2+padlength*padlength*angular/12.+sres*sres);
4630 return res;
4631}
4632Float_t AliTPCtrackerMI::GetSigmaZ(AliTPCseed * seed)
4633{
4634 //
4635 //
c9427e08 4636 Float_t sd2 = TMath::Abs((fParam->GetZLength()-TMath::Abs(seed->GetZ())))*fParam->GetDiffL()*fParam->GetDiffL();
1c53abe2 4637 Float_t padlength = fParam->GetPadPitchLength(seed->fSector);
4638 Float_t sres = fParam->GetZSigma();
4639 Float_t angular = seed->GetTgl();
4640 Float_t res = TMath::Sqrt(sd2+padlength*padlength*angular*angular/12.+sres*sres);
4641 return res;
4642}
4643
4644
4645
1c53abe2 4646
4647//__________________________________________________________________________
91162307 4648void AliTPCtrackerMI::CookLabel(AliTPCseed *t, Float_t wrong) const {
1c53abe2 4649 //--------------------------------------------------------------------
4650 //This function "cooks" a track label. If label<0, this track is fake.
4651 //--------------------------------------------------------------------
4652 Int_t noc=t->GetNumberOfClusters();
91162307 4653 if (noc<10){
d26d9159 4654 //printf("\nnot founded prolongation\n\n\n");
4655 //t->Dump();
91162307 4656 return ;
4657 }
4658 Int_t lb[160];
4659 Int_t mx[160];
4660 AliTPCclusterMI *clusters[160];
4661 //
4662 for (Int_t i=0;i<160;i++) {
4663 clusters[i]=0;
4664 lb[i]=mx[i]=0;
4665 }
1c53abe2 4666
4667 Int_t i;
91162307 4668 Int_t current=0;
4669 for (i=0; i<160 && current<noc; i++) {
4670
4671 Int_t index=t->GetClusterIndex2(i);
4672 if (index<=0) continue;
4673 if (index&0x8000) continue;
4674 //
4675 //clusters[current]=GetClusterMI(index);
4676 if (t->fClusterPointer[i]){
4677 clusters[current]=t->fClusterPointer[i];
4678 current++;
4679 }
1c53abe2 4680 }
91162307 4681 noc = current;
1c53abe2 4682
4683 Int_t lab=123456789;
4684 for (i=0; i<noc; i++) {
4685 AliTPCclusterMI *c=clusters[i];
91162307 4686 if (!c) continue;
1c53abe2 4687 lab=TMath::Abs(c->GetLabel(0));
4688 Int_t j;
4689 for (j=0; j<noc; j++) if (lb[j]==lab || mx[j]==0) break;
4690 lb[j]=lab;
4691 (mx[j])++;
4692 }
4693
4694 Int_t max=0;
4695 for (i=0; i<noc; i++) if (mx[i]>max) {max=mx[i]; lab=lb[i];}
4696
4697 for (i=0; i<noc; i++) {
9918f10a 4698 AliTPCclusterMI *c=clusters[i];
91162307 4699 if (!c) continue;
1c53abe2 4700 if (TMath::Abs(c->GetLabel(1)) == lab ||
4701 TMath::Abs(c->GetLabel(2)) == lab ) max++;
4702 }
4703
4704 if ((1.- Float_t(max)/noc) > wrong) lab=-lab;
4705
4706 else {
4707 Int_t tail=Int_t(0.10*noc);
4708 max=0;
91162307 4709 Int_t ind=0;
4710 for (i=1; i<=160&&ind<tail; i++) {
4711 // AliTPCclusterMI *c=clusters[noc-i];
4712 AliTPCclusterMI *c=clusters[i];
4713 if (!c) continue;
1c53abe2 4714 if (lab == TMath::Abs(c->GetLabel(0)) ||
4715 lab == TMath::Abs(c->GetLabel(1)) ||
4716 lab == TMath::Abs(c->GetLabel(2))) max++;
91162307 4717 ind++;
1c53abe2 4718 }
4719 if (max < Int_t(0.5*tail)) lab=-lab;
4720 }
4721
4722 t->SetLabel(lab);
4723
91162307 4724 // delete[] lb;
4725 //delete[] mx;
4726 //delete[] clusters;
1c53abe2 4727}
4728
47966a6d 4729
4730Int_t AliTPCtrackerMI::AliTPCSector::GetRowNumber(Double_t x) const
4731{
4732 //return pad row number for this x
4733 Double_t r;
4734 if (fN < 64){
4735 r=fRow[fN-1].GetX();
4736 if (x > r) return fN;
4737 r=fRow[0].GetX();
4738 if (x < r) return -1;
4739 return Int_t((x-r)/fPadPitchLength + 0.5);}
4740 else{
4741 r=fRow[fN-1].GetX();
4742 if (x > r) return fN;
4743 r=fRow[0].GetX();
4744 if (x < r) return -1;
4745 Double_t r1=fRow[64].GetX();
4746 if(x<r1){
4747 return Int_t((x-r)/f1PadPitchLength + 0.5);}
4748 else{
4749 return (Int_t((x-r1)/f2PadPitchLength + 0.5)+64);}
4750 }
4751}
4752
1c53abe2 4753//_________________________________________________________________________
4754void AliTPCtrackerMI::AliTPCSector::Setup(const AliTPCParam *par, Int_t f) {
4755 //-----------------------------------------------------------------------
4756 // Setup inner sector
4757 //-----------------------------------------------------------------------
4758 if (f==0) {
4759 fAlpha=par->GetInnerAngle();
4760 fAlphaShift=par->GetInnerAngleShift();
4761 fPadPitchWidth=par->GetInnerPadPitchWidth();
4762 fPadPitchLength=par->GetInnerPadPitchLength();
4763 fN=par->GetNRowLow();
4764 fRow=new AliTPCRow[fN];
4765 for (Int_t i=0; i<fN; i++) {
4766 fRow[i].SetX(par->GetPadRowRadiiLow(i));
4767 fRow[i].fDeadZone =1.5; //1.5 cm of dead zone
4768 }
4769 } else {
4770 fAlpha=par->GetOuterAngle();
4771 fAlphaShift=par->GetOuterAngleShift();
4772 fPadPitchWidth = par->GetOuterPadPitchWidth();
4773 fPadPitchLength = par->GetOuter1PadPitchLength();
4774 f1PadPitchLength = par->GetOuter1PadPitchLength();
4775 f2PadPitchLength = par->GetOuter2PadPitchLength();
4776
4777 fN=par->GetNRowUp();
4778 fRow=new AliTPCRow[fN];
4779 for (Int_t i=0; i<fN; i++) {
4780 fRow[i].SetX(par->GetPadRowRadiiUp(i));
4781 fRow[i].fDeadZone =1.5; // 1.5 cm of dead zone
4782 }
4783 }
4784}
4785
b67e07dc 4786AliTPCtrackerMI::AliTPCRow::AliTPCRow() {
4787 //
4788 // default constructor
4789 fN=0;
4790 fN1=0;
4791 fN2=0;
4792 fClusters1=0;
4793 fClusters2=0;
4794}
1c53abe2 4795
4796AliTPCtrackerMI::AliTPCRow::~AliTPCRow(){
4797 //
b67e07dc 4798
1c53abe2 4799}
4800
4801
4802
1c53abe2 4803//_________________________________________________________________________
4804void
4805AliTPCtrackerMI::AliTPCRow::InsertCluster(const AliTPCclusterMI* c, UInt_t index) {
4806 //-----------------------------------------------------------------------
4807 // Insert a cluster into this pad row in accordence with its y-coordinate
4808 //-----------------------------------------------------------------------
4809 if (fN==kMaxClusterPerRow) {
4810 cerr<<"AliTPCRow::InsertCluster(): Too many clusters !\n"; return;
4811 }
4812 if (fN==0) {fIndex[0]=index; fClusters[fN++]=c; return;}
4813 Int_t i=Find(c->GetZ());
4814 memmove(fClusters+i+1 ,fClusters+i,(fN-i)*sizeof(AliTPCclusterMI*));
4815 memmove(fIndex +i+1 ,fIndex +i,(fN-i)*sizeof(UInt_t));
4816 fIndex[i]=index; fClusters[i]=c; fN++;
4817}
4818
982aff31 4819void AliTPCtrackerMI::AliTPCRow::ResetClusters() {
4820 //
4821 // reset clusters
4822 fN = 0;
4823 fN1 = 0;
4824 fN2 = 0;
4825 //delete[] fClusterArray;
4826 if (fClusters1) delete []fClusters1;
4827 if (fClusters2) delete []fClusters2;
4828 //fClusterArray=0;
4829 fClusters1 = 0;
4830 fClusters2 = 0;
4831}
4832
91162307 4833
1c53abe2 4834//___________________________________________________________________
4835Int_t AliTPCtrackerMI::AliTPCRow::Find(Double_t z) const {
4836 //-----------------------------------------------------------------------
4837 // Return the index of the nearest cluster
4838 //-----------------------------------------------------------------------
4839 if (fN==0) return 0;
4840 if (z <= fClusters[0]->GetZ()) return 0;
4841 if (z > fClusters[fN-1]->GetZ()) return fN;
4842 Int_t b=0, e=fN-1, m=(b+e)/2;
4843 for (; b<e; m=(b+e)/2) {
4844 if (z > fClusters[m]->GetZ()) b=m+1;
4845 else e=m;
4846 }
4847 return m;
4848}
4849
4850
4851
1627d1c4 4852//___________________________________________________________________
4853AliTPCclusterMI * AliTPCtrackerMI::AliTPCRow::FindNearest(Double_t y, Double_t z, Double_t roady, Double_t roadz) const {
4854 //-----------------------------------------------------------------------
4855 // Return the index of the nearest cluster in z y
4856 //-----------------------------------------------------------------------
4857 Float_t maxdistance = roady*roady + roadz*roadz;
4858
4859 AliTPCclusterMI *cl =0;
4860 for (Int_t i=Find(z-roadz); i<fN; i++) {
4861 AliTPCclusterMI *c=(AliTPCclusterMI*)(fClusters[i]);
4862 if (c->GetZ() > z+roadz) break;
4863 if ( (c->GetY()-y) > roady ) continue;
4864 Float_t distance = (c->GetZ()-z)*(c->GetZ()-z)+(c->GetY()-y)*(c->GetY()-y);
4865 if (maxdistance>distance) {
4866 maxdistance = distance;
4867 cl=c;
4868 }
4869 }
4870 return cl;
4871}
4872
91162307 4873AliTPCclusterMI * AliTPCtrackerMI::AliTPCRow::FindNearest2(Double_t y, Double_t z, Double_t roady, Double_t roadz,UInt_t & index) const
4874{
4875 //-----------------------------------------------------------------------
4876 // Return the index of the nearest cluster in z y
4877 //-----------------------------------------------------------------------
4878 Float_t maxdistance = roady*roady + roadz*roadz;
4879 Int_t iz1 = TMath::Max(fFastCluster[Int_t(z-roadz+254.5)]-1,0);
4880 Int_t iz2 = TMath::Min(fFastCluster[Int_t(z+roadz+255.5)]+1,fN);
4881
4882 AliTPCclusterMI *cl =0;
4883 //FindNearest3(y,z,roady,roadz,index);
4884 // for (Int_t i=Find(z-roadz); i<fN; i++) {
4885 for (Int_t i=iz1; i<iz2; i++) {
4886 AliTPCclusterMI *c=(AliTPCclusterMI*)(fClusters[i]);
4887 if (c->GetZ() > z+roadz) break;
4888 if ( c->GetY()-y > roady ) continue;
4889 if ( y-c->GetY() > roady ) continue;
4890 Float_t distance = (c->GetZ()-z)*(c->GetZ()-z)+(c->GetY()-y)*(c->GetY()-y);
4891 if (maxdistance>distance) {
4892 maxdistance = distance;
4893 cl=c;
4894 index =i;
4895 //roady = TMath::Sqrt(maxdistance);
4896 }
4897 }
4898 return cl;
4899}
4900
4901
4902
4903AliTPCclusterMI * AliTPCtrackerMI::AliTPCRow::FindNearest3(Double_t y, Double_t z, Double_t roady, Double_t roadz,UInt_t & index) const
4904{
4905 //-----------------------------------------------------------------------
4906 // Return the index of the nearest cluster in z y
4907 //-----------------------------------------------------------------------
4908 Float_t maxdistance = roady*roady + roadz*roadz;
4909 // Int_t iz = Int_t(z+255.);
4910 AliTPCclusterMI *cl =0;
4911 for (Int_t i=Find(z-roadz); i<fN; i++) {
4912 //for (Int_t i=fFastCluster[iz-2]; i<fFastCluster[iz+2]; i++) {
4913 AliTPCclusterMI *c=(AliTPCclusterMI*)(fClusters[i]);
4914 if (c->GetZ() > z+roadz) break;
4915 if ( c->GetY()-y > roady ) continue;
4916 if ( y-c->GetY() > roady ) continue;
4917 Float_t distance = (c->GetZ()-z)*(c->GetZ()-z)+(c->GetY()-y)*(c->GetY()-y);
4918 if (maxdistance>distance) {
4919 maxdistance = distance;
4920 cl=c;
4921 index =i;
4922 //roady = TMath::Sqrt(maxdistance);
4923 }
4924 }
4925 return cl;
4926}
1627d1c4 4927
4928
4929
4930
1c53abe2 4931AliTPCseed::AliTPCseed():AliTPCtrack(){
4932 //
4933 fRow=0;
4934 fRemoval =0;
91162307 4935 for (Int_t i=0;i<200;i++) SetClusterIndex2(i,-3);
4936 for (Int_t i=0;i<160;i++) fClusterPointer[i]=0;
4937
1c53abe2 4938 fPoints = 0;
4939 fEPoints = 0;
4940 fNFoundable =0;
4941 fNShared =0;
1c53abe2 4942 fRemoval = 0;
91162307 4943 fSort =0;
4944 fFirstPoint =0;
4945 fNoCluster =0;
4946 fBSigned = kFALSE;
4947 fSeed1 =-1;
4948 fSeed2 =-1;
b67e07dc 4949 fCurrentCluster =0;
4d158c36 4950 fCurrentSigmaY2=0;
4951 fCurrentSigmaZ2=0;
1c53abe2 4952}
4953
4954AliTPCseed::AliTPCseed(const AliTPCtrack &t):AliTPCtrack(t){
b67e07dc 4955 //
4956 //copy constructor
1c53abe2 4957 fPoints = 0;
4958 fEPoints = 0;
4959 fNShared =0;
91162307 4960 // fTrackPoints =0;
1c53abe2 4961 fRemoval =0;
91162307 4962 fSort =0;
4963 for (Int_t i=0;i<160;i++) {
4964 fClusterPointer[i] = 0;
4965 Int_t index = t.GetClusterIndex(i);
4d158c36 4966 if (index>=-1){
91162307 4967 SetClusterIndex2(i,index);
4968 }
4969 else{
4970 SetClusterIndex2(i,-3);
4971 }
4972 }
4973 fFirstPoint =0;
4974 fNoCluster =0;
4975 fBSigned = kFALSE;
4976 fSeed1 =-1;
4977 fSeed2 =-1;
b67e07dc 4978 fCurrentCluster =0;
4d158c36 4979 fCurrentSigmaY2=0;
4980 fCurrentSigmaZ2=0;
1c53abe2 4981}
4982
4983AliTPCseed::AliTPCseed(const AliKalmanTrack &t, Double_t a):AliTPCtrack(t,a){
b67e07dc 4984 //
4985 //copy constructor
1c53abe2 4986 fRow=0;
91162307 4987 for (Int_t i=0;i<160;i++) {
4988 fClusterPointer[i] = 0;
4989 Int_t index = t.GetClusterIndex(i);
4990 SetClusterIndex2(i,index);
4991 }
4992
1c53abe2 4993 fPoints = 0;
4994 fEPoints = 0;
4995 fNFoundable =0;
4996 fNShared =0;
91162307 4997 // fTrackPoints =0;
1c53abe2 4998 fRemoval =0;
91162307 4999 fSort = 0;
5000 fFirstPoint =0;
5001 fNoCluster =0;
5002 fBSigned = kFALSE;
5003 fSeed1 =-1;
5004 fSeed2 =-1;
b67e07dc 5005 fCurrentCluster =0;
4d158c36 5006 fCurrentSigmaY2=0;
5007 fCurrentSigmaZ2=0;
5008
1c53abe2 5009}
5010
5011AliTPCseed::AliTPCseed(UInt_t index, const Double_t xx[5], const Double_t cc[15],
5012 Double_t xr, Double_t alpha):
5013 AliTPCtrack(index, xx, cc, xr, alpha) {
5014 //
5015 //
b67e07dc 5016 //constructor
1c53abe2 5017 fRow =0;
91162307 5018 for (Int_t i=0;i<200;i++) SetClusterIndex2(i,-3);
5019 for (Int_t i=0;i<160;i++) fClusterPointer[i]=0;
1c53abe2 5020 fPoints = 0;
5021 fEPoints = 0;
5022 fNFoundable =0;
5023 fNShared = 0;
91162307 5024 // fTrackPoints =0;
1c53abe2 5025 fRemoval =0;
91162307 5026 fSort =0;
5027 fFirstPoint =0;
5028 // fHelixIn = new TClonesArray("AliHelix",0);
5029 //fHelixOut = new TClonesArray("AliHelix",0);
5030 fNoCluster =0;
5031 fBSigned = kFALSE;
5032 fSeed1 =-1;
5033 fSeed2 =-1;
b67e07dc 5034 fCurrentCluster =0;
4d158c36 5035 fCurrentSigmaY2=0;
5036 fCurrentSigmaZ2=0;
1c53abe2 5037}
5038
5039AliTPCseed::~AliTPCseed(){
b67e07dc 5040 //
5041 // destructor
1c53abe2 5042 if (fPoints) delete fPoints;
5043 fPoints =0;
91162307 5044 if (fEPoints) delete fEPoints;
1c53abe2 5045 fEPoints = 0;
91162307 5046 fNoCluster =0;
1c53abe2 5047}
5048
91162307 5049AliTPCTrackerPoint * AliTPCseed::GetTrackPoint(Int_t i)
1c53abe2 5050{
5051 //
5052 //
91162307 5053 return &fTrackPoints[i];
1c53abe2 5054}
5055
5056void AliTPCseed::RebuildSeed()
5057{
5058 //
5059 // rebuild seed to be ready for storing
91162307 5060 AliTPCclusterMI cldummy;
5061 cldummy.SetQ(0);
5062 AliTPCTrackPoint pdummy;
5063 pdummy.GetTPoint().fIsShared = 10;
1c53abe2 5064 for (Int_t i=0;i<160;i++){
91162307 5065 AliTPCclusterMI * cl0 = fClusterPointer[i];
5066 AliTPCTrackPoint *trpoint = (AliTPCTrackPoint*)fPoints->UncheckedAt(i);
5067 if (cl0){
5068 trpoint->GetTPoint() = *(GetTrackPoint(i));
5069 trpoint->GetCPoint() = *cl0;
5070 trpoint->GetCPoint().SetQ(TMath::Abs(cl0->GetQ()));
5071 }
5072 else{
5073 *trpoint = pdummy;
5074 trpoint->GetCPoint()= cldummy;
5075 }
5076
5077 }
5078
5079}
5080
5081
5082Double_t AliTPCseed::GetDensityFirst(Int_t n)
5083{
5084 //
5085 //
5086 // return cluster for n rows bellow first point
5087 Int_t nfoundable = 1;
5088 Int_t nfound = 1;
5089 for (Int_t i=fLastPoint-1;i>0&&nfoundable<n; i--){
5090 Int_t index = GetClusterIndex2(i);
5091 if (index!=-1) nfoundable++;
5092 if (index>0) nfound++;
1c53abe2 5093 }
91162307 5094 if (nfoundable<n) return 0;
5095 return Double_t(nfound)/Double_t(nfoundable);
5096
5097}
1c53abe2 5098
91162307 5099
5100void AliTPCseed::GetClusterStatistic(Int_t first, Int_t last, Int_t &found, Int_t &foundable, Int_t &shared, Bool_t plus2)
5101{
5102 // get cluster stat. on given region
5103 //
5104 found = 0;
5105 foundable = 0;
5106 shared =0;
5107 for (Int_t i=first;i<last; i++){
5108 Int_t index = GetClusterIndex2(i);
5109 if (index!=-1) foundable++;
5110 if (fClusterPointer[i]) {
5111 found++;
5112 }
5113 else
5114 continue;
5115
5116 if (fClusterPointer[i]->IsUsed(10)) {
5117 shared++;
5118 continue;
5119 }
5120 if (!plus2) continue; //take also neighborhoud
5121 //
5122 if ( (i>0) && fClusterPointer[i-1]){
5123 if (fClusterPointer[i-1]->IsUsed(10)) {
5124 shared++;
5125 continue;
5126 }
5127 }
5128 if ( fClusterPointer[i+1]){
5129 if (fClusterPointer[i+1]->IsUsed(10)) {
5130 shared++;
5131 continue;
5132 }
5133 }
5134
5135 }
6bdc18d6 5136 //if (shared>found){
5137 //Error("AliTPCseed::GetClusterStatistic","problem\n");
5138 //}
1c53abe2 5139}
5140
5141//_____________________________________________________________________________
91162307 5142void AliTPCseed::CookdEdx(Double_t low, Double_t up,Int_t i1, Int_t i2, Bool_t onlyused) {
1c53abe2 5143 //-----------------------------------------------------------------
5144 // This funtion calculates dE/dX within the "low" and "up" cuts.
5145 //-----------------------------------------------------------------
5146
5147 Float_t amp[200];
5148 Float_t angular[200];
5149 Float_t weight[200];
5150 Int_t index[200];
5151 //Int_t nc = 0;
5152 // TClonesArray & arr = *fPoints;
5153 Float_t meanlog = 100.;
5154
5155 Float_t mean[4] = {0,0,0,0};
5156 Float_t sigma[4] = {1000,1000,1000,1000};
5157 Int_t nc[4] = {0,0,0,0};
5158 Float_t norm[4] = {1000,1000,1000,1000};
5159 //
5160 //
5161 fNShared =0;
5162
5163 for (Int_t of =0; of<4; of++){
91162307 5164 for (Int_t i=of+i1;i<i2;i+=4)
1c53abe2 5165 {
91162307 5166 Int_t index = fIndex[i];
5167 if (index<0||index&0x8000) continue;
5168
1c53abe2 5169 //AliTPCTrackPoint * point = (AliTPCTrackPoint *) arr.At(i);
91162307 5170 AliTPCTrackerPoint * point = GetTrackPoint(i);
5171 //AliTPCTrackerPoint * pointm = GetTrackPoint(i-1);
5172 //AliTPCTrackerPoint * pointp = 0;
5173 //if (i<159) pointp = GetTrackPoint(i+1);
5174
1c53abe2 5175 if (point==0) continue;
91162307 5176 AliTPCclusterMI * cl = fClusterPointer[i];
5177 if (cl==0) continue;
5178 if (onlyused && (!cl->IsUsed(10))) continue;
5179 if (cl->IsUsed(11)) {
1c53abe2 5180 fNShared++;
5181 continue;
5182 }
91162307 5183 Int_t type = cl->GetType();
5184 //if (point->fIsShared){
5185 // fNShared++;
5186 // continue;
5187 //}
5188 //if (pointm)
5189 // if (pointm->fIsShared) continue;
5190 //if (pointp)
5191 // if (pointp->fIsShared) continue;
5192
5193 if (type<0) continue;
5194 //if (type>10) continue;
5195 //if (point->GetErrY()==0) continue;
5196 //if (point->GetErrZ()==0) continue;
5197
5198 //Float_t ddy = (point->GetY()-cl->GetY())/point->GetErrY();
5199 //Float_t ddz = (point->GetZ()-cl->GetZ())/point->GetErrZ();
5200 //if ((ddy*ddy+ddz*ddz)>10) continue;
5201
5202
5203 // if (point->GetCPoint().GetMax()<5) continue;
5204 if (cl->GetMax()<5) continue;
5205 Float_t angley = point->GetAngleY();
5206 Float_t anglez = point->GetAngleZ();
5207
5208 Float_t rsigmay2 = point->GetSigmaY();
5209 Float_t rsigmaz2 = point->GetSigmaZ();
5210 /*
5211 Float_t ns = 1.;
5212 if (pointm){
5213 rsigmay += pointm->GetTPoint().GetSigmaY();
5214 rsigmaz += pointm->GetTPoint().GetSigmaZ();
5215 ns+=1.;
5216 }
5217 if (pointp){
5218 rsigmay += pointp->GetTPoint().GetSigmaY();
5219 rsigmaz += pointp->GetTPoint().GetSigmaZ();
5220 ns+=1.;
5221 }
5222 rsigmay/=ns;
5223 rsigmaz/=ns;
5224 */
5225
5226 Float_t rsigma = TMath::Sqrt(rsigmay2*rsigmaz2);
1c53abe2 5227
5228 Float_t ampc = 0; // normalization to the number of electrons
5229 if (i>64){
91162307 5230 // ampc = 1.*point->GetCPoint().GetMax();
5231 ampc = 1.*cl->GetMax();
1c53abe2 5232 //ampc = 1.*point->GetCPoint().GetQ();
5233 // AliTPCClusterPoint & p = point->GetCPoint();
5234 // Float_t dy = TMath::Abs(Int_t( TMath::Abs(p.GetY()/0.6)) - TMath::Abs(p.GetY()/0.6)+0.5);
5235 // Float_t iz = (250.0-TMath::Abs(p.GetZ())+0.11)/0.566;
5236 //Float_t dz =
5237 // TMath::Abs( Int_t(iz) - iz + 0.5);
5238 //ampc *= 1.15*(1-0.3*dy);
5239 //ampc *= 1.15*(1-0.3*dz);
1627d1c4 5240 // Float_t zfactor = (1.05-0.0004*TMath::Abs(point->GetCPoint().GetZ()));
5241 //ampc *=zfactor;
1c53abe2 5242 }
5243 else{
91162307 5244 //ampc = 1.0*point->GetCPoint().GetMax();
5245 ampc = 1.0*cl->GetMax();
1c53abe2 5246 //ampc = 1.0*point->GetCPoint().GetQ();
5247 //AliTPCClusterPoint & p = point->GetCPoint();
5248 // Float_t dy = TMath::Abs(Int_t( TMath::Abs(p.GetY()/0.4)) - TMath::Abs(p.GetY()/0.4)+0.5);
5249 //Float_t iz = (250.0-TMath::Abs(p.GetZ())+0.11)/0.566;
5250 //Float_t dz =
5251 // TMath::Abs( Int_t(iz) - iz + 0.5);
5252
5253 //ampc *= 1.15*(1-0.3*dy);
5254 //ampc *= 1.15*(1-0.3*dz);
1627d1c4 5255 // Float_t zfactor = (1.02-0.000*TMath::Abs(point->GetCPoint().GetZ()));
5256 //ampc *=zfactor;
1c53abe2 5257
5258 }
5259 ampc *= 2.0; // put mean value to channel 50
5260 //ampc *= 0.58; // put mean value to channel 50
5261 Float_t w = 1.;
5262 // if (type>0) w = 1./(type/2.-0.5);
91162307 5263 // Float_t z = TMath::Abs(cl->GetZ());
1c53abe2 5264 if (i<64) {
5265 ampc /= 0.6;
1627d1c4 5266 //ampc /= (1+0.0008*z);
5267 } else
5268 if (i>128){
5269 ampc /=1.5;
5270 //ampc /= (1+0.0008*z);
5271 }else{
5272 //ampc /= (1+0.0008*z);
5273 }
5274
1c53abe2 5275 if (type<0) { //amp at the border - lower weight
5276 // w*= 2.;
1627d1c4 5277
1c53abe2 5278 continue;
5279 }
5280 if (rsigma>1.5) ampc/=1.3; // if big backround
5281 amp[nc[of]] = ampc;
5282 angular[nc[of]] = TMath::Sqrt(1.+angley*angley+anglez*anglez);
5283 weight[nc[of]] = w;
5284 nc[of]++;
5285 }
5286
5287 TMath::Sort(nc[of],amp,index,kFALSE);
5288 Float_t sumamp=0;
5289 Float_t sumamp2=0;
5290 Float_t sumw=0;
5291 //meanlog = amp[index[Int_t(nc[of]*0.33)]];
91162307 5292 meanlog = 50;
1c53abe2 5293 for (Int_t i=int(nc[of]*low+0.5);i<int(nc[of]*up+0.5);i++){
5294 Float_t ampl = amp[index[i]]/angular[index[i]];
5295 ampl = meanlog*TMath::Log(1.+ampl/meanlog);
5296 //
5297 sumw += weight[index[i]];
5298 sumamp += weight[index[i]]*ampl;
5299 sumamp2 += weight[index[i]]*ampl*ampl;
5300 norm[of] += angular[index[i]]*weight[index[i]];
5301 }
5302 if (sumw<1){
5303 SetdEdx(0);
5304 }
5305 else {
5306 norm[of] /= sumw;
5307 mean[of] = sumamp/sumw;
5308 sigma[of] = sumamp2/sumw-mean[of]*mean[of];
5309 if (sigma[of]>0.1)
5310 sigma[of] = TMath::Sqrt(sigma[of]);
5311 else
5312 sigma[of] = 1000;
5313
5314 mean[of] = (TMath::Exp(mean[of]/meanlog)-1)*meanlog;
5315 //mean *=(1-0.02*(sigma/(mean*0.17)-1.));
5316 //mean *=(1-0.1*(norm-1.));
5317 }
5318 }
5319
5320 Float_t dedx =0;
5321 fSdEdx =0;
5322 fMAngular =0;
5323 // mean[0]*= (1-0.05*(sigma[0]/(0.01+mean[1]*0.18)-1));
5324 // mean[1]*= (1-0.05*(sigma[1]/(0.01+mean[0]*0.18)-1));
5325
5326
5327 // dedx = (mean[0]* TMath::Sqrt((1.+nc[0]))+ mean[1]* TMath::Sqrt((1.+nc[1])) )/
5328 // ( TMath::Sqrt((1.+nc[0]))+TMath::Sqrt((1.+nc[1])));
5329
5330 Int_t norm2 = 0;
5331 Int_t norm3 = 0;
5332 for (Int_t i =0;i<4;i++){
5333 if (nc[i]>2&&nc[i]<1000){
5334 dedx += mean[i] *nc[i];
5335 fSdEdx += sigma[i]*(nc[i]-2);
5336 fMAngular += norm[i] *nc[i];
5337 norm2 += nc[i];
5338 norm3 += nc[i]-2;
5339 }
5340 fDEDX[i] = mean[i];
5341 fSDEDX[i] = sigma[i];
5342 fNCDEDX[i]= nc[i];
5343 }
5344
5345 if (norm3>0){
5346 dedx /=norm2;
5347 fSdEdx /=norm3;
5348 fMAngular/=norm2;
5349 }
5350 else{
5351 SetdEdx(0);
5352 return;
5353 }
5354 // Float_t dedx1 =dedx;
91162307 5355 /*
1c53abe2 5356 dedx =0;
5357 for (Int_t i =0;i<4;i++){
5358 if (nc[i]>2&&nc[i]<1000){
5359 mean[i] = mean[i]*(1-0.12*(sigma[i]/(fSdEdx)-1.));
5360 dedx += mean[i] *nc[i];
5361 }
5362 fDEDX[i] = mean[i];
5363 }
5364 dedx /= norm2;
91162307 5365 */
1c53abe2 5366
5367
5368 SetdEdx(dedx);
5369
5370 //mi deDX
5371
5372
5373
5374 //Very rough PID
5375 Double_t p=TMath::Sqrt((1.+ GetTgl()*GetTgl())/(Get1Pt()*Get1Pt()));
5376
5377 if (p<0.6) {
5378 if (dedx < 39.+ 12./(p+0.25)/(p+0.25)) { SetMass(0.13957); return;}
5379 if (dedx < 39.+ 12./p/p) { SetMass(0.49368); return;}
5380 SetMass(0.93827); return;
5381 }
5382
5383 if (p<1.2) {
5384 if (dedx < 39.+ 12./(p+0.25)/(p+0.25)) { SetMass(0.13957); return;}
5385 SetMass(0.93827); return;
5386 }
5387
5388 SetMass(0.13957); return;
5389
5390}
5391
5392
91162307 5393
5394/*
5395
5396
5397
5398void AliTPCseed::CookdEdx2(Double_t low, Double_t up) {
5399 //-----------------------------------------------------------------
5400 // This funtion calculates dE/dX within the "low" and "up" cuts.
5401 //-----------------------------------------------------------------
5402
5403 Float_t amp[200];
5404 Float_t angular[200];
5405 Float_t weight[200];
5406 Int_t index[200];
5407 Bool_t inlimit[200];
5408 for (Int_t i=0;i<200;i++) inlimit[i]=kFALSE;
5409 for (Int_t i=0;i<200;i++) amp[i]=10000;
5410 for (Int_t i=0;i<200;i++) angular[i]= 1;;
5411
5412
5413 //
5414 Float_t meanlog = 100.;
5415 Int_t indexde[4]={0,64,128,160};
5416
5417 Float_t amean =0;
5418 Float_t asigma =0;
5419 Float_t anc =0;
5420 Float_t anorm =0;
5421
5422 Float_t mean[4] = {0,0,0,0};
5423 Float_t sigma[4] = {1000,1000,1000,1000};
5424 Int_t nc[4] = {0,0,0,0};
5425 Float_t norm[4] = {1000,1000,1000,1000};
5426 //
5427 //
5428 fNShared =0;
5429
5430 // for (Int_t of =0; of<3; of++){
5431 // for (Int_t i=indexde[of];i<indexde[of+1];i++)
5432 for (Int_t i =0; i<160;i++)
5433 {
5434 AliTPCTrackPoint * point = GetTrackPoint(i);
5435 if (point==0) continue;
5436 if (point->fIsShared){
5437 fNShared++;
5438 continue;
5439 }
5440 Int_t type = point->GetCPoint().GetType();
5441 if (type<0) continue;
5442 if (point->GetCPoint().GetMax()<5) continue;
5443 Float_t angley = point->GetTPoint().GetAngleY();
5444 Float_t anglez = point->GetTPoint().GetAngleZ();
5445 Float_t rsigmay = point->GetCPoint().GetSigmaY();
5446 Float_t rsigmaz = point->GetCPoint().GetSigmaZ();
5447 Float_t rsigma = TMath::Sqrt(rsigmay*rsigmaz);
5448
5449 Float_t ampc = 0; // normalization to the number of electrons
5450 if (i>64){
5451 ampc = point->GetCPoint().GetMax();
5452 }
5453 else{
5454 ampc = point->GetCPoint().GetMax();
5455 }
5456 ampc *= 2.0; // put mean value to channel 50
5457 // ampc *= 0.565; // put mean value to channel 50
5458
5459 Float_t w = 1.;
5460 Float_t z = TMath::Abs(point->GetCPoint().GetZ());
5461 if (i<64) {
5462 ampc /= 0.63;
5463 } else
5464 if (i>128){
5465 ampc /=1.51;
5466 }
5467 if (type<0) { //amp at the border - lower weight
5468 continue;
5469 }
5470 if (rsigma>1.5) ampc/=1.3; // if big backround
5471 angular[i] = TMath::Sqrt(1.+angley*angley+anglez*anglez);
5472 amp[i] = ampc/angular[i];
5473 weight[i] = w;
5474 anc++;
5475 }
5476
5477 TMath::Sort(159,amp,index,kFALSE);
5478 for (Int_t i=int(anc*low+0.5);i<int(anc*up+0.5);i++){
5479 inlimit[index[i]] = kTRUE; // take all clusters
5480 }
5481
5482 // meanlog = amp[index[Int_t(anc*0.3)]];
5483 meanlog =10000.;
5484 for (Int_t of =0; of<3; of++){
5485 Float_t sumamp=0;
5486 Float_t sumamp2=0;
5487 Float_t sumw=0;
5488 for (Int_t i=indexde[of];i<indexde[of+1];i++)
5489 {
5490 if (inlimit[i]==kFALSE) continue;
5491 Float_t ampl = amp[i];
5492 ///angular[i];
5493 ampl = meanlog*TMath::Log(1.+ampl/meanlog);
5494 //
5495 sumw += weight[i];
5496 sumamp += weight[i]*ampl;
5497 sumamp2 += weight[i]*ampl*ampl;
5498 norm[of] += angular[i]*weight[i];
5499 nc[of]++;
5500 }
5501 if (sumw<1){
5502 SetdEdx(0);
5503 }
5504 else {
5505 norm[of] /= sumw;
5506 mean[of] = sumamp/sumw;
5507 sigma[of] = sumamp2/sumw-mean[of]*mean[of];
5508 if (sigma[of]>0.1)
5509 sigma[of] = TMath::Sqrt(sigma[of]);
5510 else
5511 sigma[of] = 1000;
5512 mean[of] = (TMath::Exp(mean[of]/meanlog)-1)*meanlog;
5513 }
5514 }
5515
5516 Float_t dedx =0;
5517 fSdEdx =0;
5518 fMAngular =0;
5519 //
5520 Int_t norm2 = 0;
5521 Int_t norm3 = 0;
5522 Float_t www[3] = {12.,14.,17.};
5523 //Float_t www[3] = {1.,1.,1.};
5524
5525 for (Int_t i =0;i<3;i++){
5526 if (nc[i]>2&&nc[i]<1000){
5527 dedx += mean[i] *nc[i]*www[i]/sigma[i];
5528 fSdEdx += sigma[i]*(nc[i]-2)*www[i]/sigma[i];
5529 fMAngular += norm[i] *nc[i];
5530 norm2 += nc[i]*www[i]/sigma[i];
5531 norm3 += (nc[i]-2)*www[i]/sigma[i];
5532 }
5533 fDEDX[i] = mean[i];
5534 fSDEDX[i] = sigma[i];
5535 fNCDEDX[i]= nc[i];
5536 }
5537
5538 if (norm3>0){
5539 dedx /=norm2;
5540 fSdEdx /=norm3;
5541 fMAngular/=norm2;
5542 }
5543 else{
5544 SetdEdx(0);
5545 return;
5546 }
5547 // Float_t dedx1 =dedx;
5548
5549 dedx =0;
5550 Float_t norm4 = 0;
5551 for (Int_t i =0;i<3;i++){
5552 if (nc[i]>2&&nc[i]<1000&&sigma[i]>3){
5553 //mean[i] = mean[i]*(1+0.08*(sigma[i]/(fSdEdx)-1.));
5554 dedx += mean[i] *(nc[i])/(sigma[i]);
5555 norm4 += (nc[i])/(sigma[i]);
5556 }
5557 fDEDX[i] = mean[i];
5558 }
5559 if (norm4>0) dedx /= norm4;
5560
5561
5562
5563 SetdEdx(dedx);
5564
5565 //mi deDX
5566
5567}
5568
5569*/