Update the TPC quality info after the propagation back (M.Ivanov)
[u/mrichter/AliRoot.git] / TPC / AliTPCtrackerMI.cxx
CommitLineData
1c53abe2 1/**************************************************************************
2 * Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *
3 * *
4 * Author: The ALICE Off-line Project. *
5 * Contributors are mentioned in the code where appropriate. *
6 * *
7 * Permission to use, copy, modify and distribute this software and its *
8 * documentation strictly for non-commercial purposes is hereby granted *
9 * without fee, provided that the above copyright notice appears in all *
10 * copies and that both the copyright notice and this permission notice *
11 * appear in the supporting documentation. The authors make no claims *
12 * about the suitability of this software for any purpose. It is *
13 * provided "as is" without express or implied warranty. *
14 **************************************************************************/
15
1c53abe2 16
17//-------------------------------------------------------
18// Implementation of the TPC tracker
19//
20// Origin: Marian Ivanov Marian.Ivanov@cern.ch
21//
47966a6d 22// AliTPC parallel tracker -
23// How to use? -
24// run AliTPCFindClusters.C macro - clusters neccessary for tracker are founded
25// run AliTPCFindTracksMI.C macro - to find tracks
26// tracks are written to AliTPCtracks.root file
27// for comparison also seeds are written to the same file - to special branch
1c53abe2 28//-------------------------------------------------------
47966a6d 29
30
31/* $Id$ */
32
cc5e9db0 33#include "Riostream.h"
6d171107 34#include <TClonesArray.h>
35#include <TFile.h>
36#include <TObjArray.h>
37#include <TTree.h>
1c53abe2 38
47966a6d 39#include "AliComplexCluster.h"
91162307 40#include "AliESD.h"
9996a03b 41#include "AliESDkink.h"
91162307 42#include "AliHelix.h"
91162307 43#include "AliRunLoader.h"
6d171107 44#include "AliTPCClustersRow.h"
45#include "AliTPCParam.h"
9996a03b 46#include "AliTPCReconstructor.h"
6d171107 47#include "AliTPCclusterMI.h"
48#include "AliTPCpolyTrack.h"
81e97e0d 49#include "AliTPCreco.h"
50#include "AliTPCseed.h"
b67e07dc 51#include "AliTPCtrackerMI.h"
6d171107 52#include "TStopwatch.h"
81e97e0d 53#include "AliTPCReconstructor.h"
54#include "AliESDkink.h"
55#include "AliPID.h"
eea478d3 56#include "TTreeStream.h"
5d837844 57#include "AliAlignObj.h"
58#include "AliTrackPointArray.h"
59
6d171107 60//
c9427e08 61
91162307 62ClassImp(AliTPCtrackerMI)
c9427e08 63
64
b67e07dc 65class AliTPCFastMath {
91162307 66public:
b67e07dc 67 AliTPCFastMath();
91162307 68 static Double_t FastAsin(Double_t x);
69 private:
b67e07dc 70 static Double_t fgFastAsin[20000]; //lookup table for fast asin computation
91162307 71};
c9427e08 72
b67e07dc 73Double_t AliTPCFastMath::fgFastAsin[20000];
2274b54b 74AliTPCFastMath gAliTPCFastMath; // needed to fill the LUT
c9427e08 75
b67e07dc 76AliTPCFastMath::AliTPCFastMath(){
77 //
78 // initialized lookup table;
91162307 79 for (Int_t i=0;i<10000;i++){
80 fgFastAsin[2*i] = TMath::ASin(i/10000.);
81 fgFastAsin[2*i+1] = (TMath::ASin((i+1)/10000.)-fgFastAsin[2*i]);
82 }
c9427e08 83}
84
b67e07dc 85Double_t AliTPCFastMath::FastAsin(Double_t x){
86 //
87 // return asin using lookup table
91162307 88 if (x>0){
89 Int_t index = int(x*10000);
90 return fgFastAsin[2*index]+(x*10000.-index)*fgFastAsin[2*index+1];
91 }
92 x*=-1;
93 Int_t index = int(x*10000);
94 return -(fgFastAsin[2*index]+(x*10000.-index)*fgFastAsin[2*index+1]);
1c53abe2 95}
96
97
98
99
91162307 100Int_t AliTPCtrackerMI::UpdateTrack(AliTPCseed * track, Int_t accept){
b67e07dc 101 //
102 //update track information using current cluster - track->fCurrentCluster
103
1c53abe2 104
91162307 105 AliTPCclusterMI* c =track->fCurrentCluster;
106 if (accept>0) track->fCurrentClusterIndex1 |=0x8000; //sign not accepted clusters
c9427e08 107
91162307 108 UInt_t i = track->fCurrentClusterIndex1;
1c53abe2 109
110 Int_t sec=(i&0xff000000)>>24;
91162307 111 //Int_t row = (i&0x00ff0000)>>16;
1c53abe2 112 track->fRow=(i&0x00ff0000)>>16;
113 track->fSector = sec;
114 // Int_t index = i&0xFFFF;
115 if (sec>=fParam->GetNInnerSector()) track->fRow += fParam->GetNRowLow();
d26d9159 116 track->SetClusterIndex2(track->fRow, i);
91162307 117 //track->fFirstPoint = row;
118 //if ( track->fLastPoint<row) track->fLastPoint =row;
119 // if (track->fRow<0 || track->fRow>160) {
120 // printf("problem\n");
121 //}
122 if (track->fFirstPoint>track->fRow)
123 track->fFirstPoint = track->fRow;
124 if (track->fLastPoint<track->fRow)
125 track->fLastPoint = track->fRow;
126
127
128 track->fClusterPointer[track->fRow] = c;
1c53abe2 129 //
130
1c53abe2 131 Float_t angle2 = track->GetSnp()*track->GetSnp();
132 angle2 = TMath::Sqrt(angle2/(1-angle2));
133 //
134 //SET NEW Track Point
135 //
91162307 136 // if (debug)
137 {
138 AliTPCTrackerPoint &point =*(track->GetTrackPoint(track->fRow));
1c53abe2 139 //
91162307 140 point.SetSigmaY(c->GetSigmaY2()/track->fCurrentSigmaY2);
141 point.SetSigmaZ(c->GetSigmaZ2()/track->fCurrentSigmaZ2);
142 point.SetErrY(sqrt(track->fErrorY2));
143 point.SetErrZ(sqrt(track->fErrorZ2));
1c53abe2 144 //
91162307 145 point.SetX(track->GetX());
146 point.SetY(track->GetY());
147 point.SetZ(track->GetZ());
148 point.SetAngleY(angle2);
149 point.SetAngleZ(track->GetTgl());
150 if (point.fIsShared){
151 track->fErrorY2 *= 4;
152 track->fErrorZ2 *= 4;
153 }
154 }
155
156 Double_t chi2 = track->GetPredictedChi2(track->fCurrentCluster);
157 //
158 track->fErrorY2 *= 1.3;
159 track->fErrorY2 += 0.01;
160 track->fErrorZ2 *= 1.3;
161 track->fErrorZ2 += 0.005;
162 //}
163 if (accept>0) return 0;
164 if (track->GetNumberOfClusters()%20==0){
165 // if (track->fHelixIn){
166 // TClonesArray & larr = *(track->fHelixIn);
167 // Int_t ihelix = larr.GetEntriesFast();
168 // new(larr[ihelix]) AliHelix(*track) ;
169 //}
1c53abe2 170 }
91162307 171 track->fNoCluster =0;
172 return track->Update(c,chi2,i);
173}
174
175
176
177Int_t AliTPCtrackerMI::AcceptCluster(AliTPCseed * seed, AliTPCclusterMI * cluster, Float_t factor,
178 Float_t cory, Float_t corz)
179{
1c53abe2 180 //
91162307 181 // decide according desired precision to accept given
182 // cluster for tracking
183 Double_t sy2=ErrY2(seed,cluster)*cory;
184 Double_t sz2=ErrZ2(seed,cluster)*corz;
185 //sy2=ErrY2(seed,cluster)*cory;
186 //sz2=ErrZ2(seed,cluster)*cory;
1c53abe2 187
91162307 188 Double_t sdistancey2 = sy2+seed->GetSigmaY2();
189 Double_t sdistancez2 = sz2+seed->GetSigmaZ2();
190
191 Double_t rdistancey2 = (seed->fCurrentCluster->GetY()-seed->GetY())*
192 (seed->fCurrentCluster->GetY()-seed->GetY())/sdistancey2;
193 Double_t rdistancez2 = (seed->fCurrentCluster->GetZ()-seed->GetZ())*
194 (seed->fCurrentCluster->GetZ()-seed->GetZ())/sdistancez2;
195
196 Double_t rdistance2 = rdistancey2+rdistancez2;
197 //Int_t accept =0;
1c53abe2 198
91162307 199 if (rdistance2>16) return 3;
200
201
202 if ((rdistancey2>9.*factor || rdistancez2>9.*factor) && cluster->GetType()==0)
203 return 2; //suspisiouce - will be changed
204
205 if ((rdistancey2>6.25*factor || rdistancez2>6.25*factor) && cluster->GetType()>0)
206 // strict cut on overlaped cluster
207 return 2; //suspisiouce - will be changed
208
209 if ( (rdistancey2>1.*factor || rdistancez2>6.25*factor )
210 && cluster->GetType()<0){
211 seed->fNFoundable--;
212 return 2;
1c53abe2 213 }
91162307 214 return 0;
215}
216
217
1c53abe2 218
1c53abe2 219
1c53abe2 220//_____________________________________________________________________________
f8aae377 221AliTPCtrackerMI::AliTPCtrackerMI(const AliTPCParam *par):
1c53abe2 222AliTracker(), fkNIS(par->GetNInnerSector()/2), fkNOS(par->GetNOuterSector()/2)
223{
224 //---------------------------------------------------------------------
225 // The main TPC tracker constructor
226 //---------------------------------------------------------------------
227 fInnerSec=new AliTPCSector[fkNIS];
228 fOuterSec=new AliTPCSector[fkNOS];
91162307 229
1c53abe2 230 Int_t i;
231 for (i=0; i<fkNIS; i++) fInnerSec[i].Setup(par,0);
232 for (i=0; i<fkNOS; i++) fOuterSec[i].Setup(par,1);
233
234 fN=0; fSectors=0;
235
1c53abe2 236 fSeeds=0;
237 fNtracks = 0;
91162307 238 fParam = par;
239 Int_t nrowlow = par->GetNRowLow();
240 Int_t nrowup = par->GetNRowUp();
241
242
243 for (Int_t i=0;i<nrowlow;i++){
244 fXRow[i] = par->GetPadRowRadiiLow(i);
245 fPadLength[i]= par->GetPadPitchLength(0,i);
246 fYMax[i] = fXRow[i]*TMath::Tan(0.5*par->GetInnerAngle());
247 }
248
249
250 for (Int_t i=0;i<nrowup;i++){
251 fXRow[i+nrowlow] = par->GetPadRowRadiiUp(i);
252 fPadLength[i+nrowlow] = par->GetPadPitchLength(60,i);
253 fYMax[i+nrowlow] = fXRow[i+nrowlow]*TMath::Tan(0.5*par->GetOuterAngle());
254 }
255 fSeeds=0;
256 //
257 fInput = 0;
258 fOutput = 0;
259 fSeedTree = 0;
260 fTreeDebug =0;
261 fNewIO =0;
262 fDebug =0;
263 fEvent =0;
81e97e0d 264 fDebugStreamer = new TTreeSRedirector("TPCdebug.root");
1c53abe2 265}
2fc0c115 266//________________________________________________________________________
58251ea0 267AliTPCtrackerMI::AliTPCtrackerMI(const AliTPCtrackerMI &t):
268 AliTracker(t),
269 fkNIS(t.fkNIS),
270 fkNOS(t.fkNOS)
271{
2fc0c115 272 //------------------------------------
273 // dummy copy constructor
274 //------------------------------------------------------------------
275}
276AliTPCtrackerMI & AliTPCtrackerMI::operator=(const AliTPCtrackerMI& /*r*/){
277 //------------------------------
278 // dummy
279 //--------------------------------------------------------------
280 return *this;
281}
1c53abe2 282//_____________________________________________________________________________
283AliTPCtrackerMI::~AliTPCtrackerMI() {
284 //------------------------------------------------------------------
285 // TPC tracker destructor
286 //------------------------------------------------------------------
287 delete[] fInnerSec;
288 delete[] fOuterSec;
289 if (fSeeds) {
290 fSeeds->Delete();
291 delete fSeeds;
292 }
81e97e0d 293 if (fDebugStreamer) delete fDebugStreamer;
1c53abe2 294}
295
91162307 296void AliTPCtrackerMI::SetIO()
297{
1c53abe2 298 //
91162307 299 fNewIO = kTRUE;
e191bb57 300 fInput = AliRunLoader::GetTreeR("TPC", kFALSE,AliConfig::GetDefaultEventFolderName());
d26d9159 301
e191bb57 302 fOutput = AliRunLoader::GetTreeT("TPC", kTRUE,AliConfig::GetDefaultEventFolderName());
d26d9159 303 if (fOutput){
304 AliTPCtrack *iotrack= new AliTPCtrack;
305 fOutput->Branch("tracks","AliTPCtrack",&iotrack,32000,100);
306 delete iotrack;
307 }
91162307 308}
1c53abe2 309
d26d9159 310
91162307 311void AliTPCtrackerMI::SetIO(TTree * input, TTree * output, AliESD * event)
312{
1c53abe2 313
91162307 314 // set input
315 fNewIO = kFALSE;
316 fInput = 0;
317 fOutput = 0;
318 fSeedTree = 0;
319 fTreeDebug =0;
320 fInput = input;
321 if (input==0){
322 return;
323 }
324 //set output
325 fOutput = output;
326 if (output){
327 AliTPCtrack *iotrack= new AliTPCtrack;
328 // iotrack->fHelixIn = new TClonesArray("AliHelix");
329 //iotrack->fHelixOut = new TClonesArray("AliHelix");
330 fOutput->Branch("tracks","AliTPCtrack",&iotrack,32000,100);
331 delete iotrack;
332 }
333 if (output && (fDebug&2)){
334 //write the full seed information if specified in debug mode
335 //
336 fSeedTree = new TTree("Seeds","Seeds");
337 AliTPCseed * vseed = new AliTPCseed;
338 //
339 TClonesArray * arrtr = new TClonesArray("AliTPCTrackPoint",160);
340 arrtr->ExpandCreateFast(160);
341 TClonesArray * arre = new TClonesArray("AliTPCExactPoint",160);
342 //
343 vseed->fPoints = arrtr;
344 vseed->fEPoints = arre;
345 // vseed->fClusterPoints = arrcl;
346 fSeedTree->Branch("seeds","AliTPCseed",&vseed,32000,99);
347 delete arrtr;
348 delete arre;
349 fTreeDebug = new TTree("trackDebug","trackDebug");
350 TClonesArray * arrd = new TClonesArray("AliTPCTrackPoint2",0);
351 fTreeDebug->Branch("debug",&arrd,32000,99);
1c53abe2 352 }
1c53abe2 353
1c53abe2 354
91162307 355 //set ESD event
356 fEvent = event;
357}
1c53abe2 358
d26d9159 359void AliTPCtrackerMI::FillESD(TObjArray* arr)
91162307 360{
47966a6d 361 //
362 //
363 //fill esds using updated tracks
91162307 364 if (fEvent){
365 // write tracks to the event
366 // store index of the track
d26d9159 367 Int_t nseed=arr->GetEntriesFast();
51ad6848 368 //FindKinks(arr,fEvent);
91162307 369 for (Int_t i=0; i<nseed; i++) {
d26d9159 370 AliTPCseed *pt=(AliTPCseed*)arr->UncheckedAt(i);
91162307 371 if (!pt) continue;
51ad6848 372 pt->UpdatePoints();
eea478d3 373 // pt->PropagateTo(fParam->GetInnerRadiusLow());
374 if (pt->GetKinkIndex(0)<=0){ //don't propagate daughter tracks
375 pt->PropagateTo(fParam->GetInnerRadiusLow());
376 }
51ad6848 377
378 if (( pt->GetPoints()[2]- pt->GetPoints()[0])>5 && pt->GetPoints()[3]>0.8){
379 AliESDtrack iotrack;
380 iotrack.UpdateTrackParams(pt,AliESDtrack::kTPCin);
381 iotrack.SetTPCPoints(pt->GetPoints());
382 iotrack.SetKinkIndexes(pt->GetKinkIndexes());
81e97e0d 383 iotrack.SetV0Indexes(pt->GetV0Indexes());
384 // iotrack.SetTPCpid(pt->fTPCr);
51ad6848 385 //iotrack.SetTPCindex(i);
386 fEvent->AddTrack(&iotrack);
387 continue;
388 }
389
4d158c36 390 if ( (pt->GetNumberOfClusters()>70)&& (Float_t(pt->GetNumberOfClusters())/Float_t(pt->fNFoundable))>0.55) {
d26d9159 391 AliESDtrack iotrack;
51ad6848 392 iotrack.UpdateTrackParams(pt,AliESDtrack::kTPCin);
393 iotrack.SetTPCPoints(pt->GetPoints());
d26d9159 394 //iotrack.SetTPCindex(i);
51ad6848 395 iotrack.SetKinkIndexes(pt->GetKinkIndexes());
81e97e0d 396 iotrack.SetV0Indexes(pt->GetV0Indexes());
397 // iotrack.SetTPCpid(pt->fTPCr);
d26d9159 398 fEvent->AddTrack(&iotrack);
a42a6bae 399 continue;
400 }
51ad6848 401 //
402 // short tracks - maybe decays
403
a42a6bae 404 if ( (pt->GetNumberOfClusters()>30) && (Float_t(pt->GetNumberOfClusters())/Float_t(pt->fNFoundable))>0.70) {
405 Int_t found,foundable,shared;
406 pt->GetClusterStatistic(0,60,found, foundable,shared,kFALSE);
407 if ( (found>20) && (pt->fNShared/float(pt->GetNumberOfClusters())<0.2)){
408 AliESDtrack iotrack;
409 iotrack.UpdateTrackParams(pt,AliESDtrack::kTPCin);
410 //iotrack.SetTPCindex(i);
51ad6848 411 iotrack.SetTPCPoints(pt->GetPoints());
412 iotrack.SetKinkIndexes(pt->GetKinkIndexes());
81e97e0d 413 iotrack.SetV0Indexes(pt->GetV0Indexes());
414 //iotrack.SetTPCpid(pt->fTPCr);
a42a6bae 415 fEvent->AddTrack(&iotrack);
416 continue;
417 }
418 }
419
420 if ( (pt->GetNumberOfClusters()>20) && (Float_t(pt->GetNumberOfClusters())/Float_t(pt->fNFoundable))>0.8) {
421 Int_t found,foundable,shared;
422 pt->GetClusterStatistic(0,60,found, foundable,shared,kFALSE);
423 if (found<20) continue;
424 if (pt->fNShared/float(pt->GetNumberOfClusters())>0.2) continue;
425 //
426 AliESDtrack iotrack;
427 iotrack.UpdateTrackParams(pt,AliESDtrack::kTPCin);
51ad6848 428 iotrack.SetTPCPoints(pt->GetPoints());
429 iotrack.SetKinkIndexes(pt->GetKinkIndexes());
81e97e0d 430 iotrack.SetV0Indexes(pt->GetV0Indexes());
431 //iotrack.SetTPCpid(pt->fTPCr);
51ad6848 432 //iotrack.SetTPCindex(i);
433 fEvent->AddTrack(&iotrack);
434 continue;
435 }
436 // short tracks - secondaties
437 //
438 if ( (pt->GetNumberOfClusters()>30) ) {
439 Int_t found,foundable,shared;
440 pt->GetClusterStatistic(128,158,found, foundable,shared,kFALSE);
441 if ( (found>20) && (pt->fNShared/float(pt->GetNumberOfClusters())<0.2) &&float(found)/float(foundable)>0.8){
442 AliESDtrack iotrack;
443 iotrack.UpdateTrackParams(pt,AliESDtrack::kTPCin);
444 iotrack.SetTPCPoints(pt->GetPoints());
445 iotrack.SetKinkIndexes(pt->GetKinkIndexes());
81e97e0d 446 iotrack.SetV0Indexes(pt->GetV0Indexes());
447 //iotrack.SetTPCpid(pt->fTPCr);
51ad6848 448 //iotrack.SetTPCindex(i);
449 fEvent->AddTrack(&iotrack);
450 continue;
451 }
452 }
453
454 if ( (pt->GetNumberOfClusters()>15)) {
455 Int_t found,foundable,shared;
456 pt->GetClusterStatistic(138,158,found, foundable,shared,kFALSE);
457 if (found<15) continue;
458 if (pt->fNShared/float(pt->GetNumberOfClusters())>0.2) continue;
459 if (float(found)/float(foundable)<0.8) continue;
460 //
461 AliESDtrack iotrack;
462 iotrack.UpdateTrackParams(pt,AliESDtrack::kTPCin);
463 iotrack.SetTPCPoints(pt->GetPoints());
464 iotrack.SetKinkIndexes(pt->GetKinkIndexes());
81e97e0d 465 iotrack.SetV0Indexes(pt->GetV0Indexes());
466 // iotrack.SetTPCpid(pt->fTPCr);
a42a6bae 467 //iotrack.SetTPCindex(i);
468 fEvent->AddTrack(&iotrack);
469 continue;
470 }
91162307 471 }
1c53abe2 472 }
51ad6848 473 printf("Number of filled ESDs-\t%d\n",fEvent->GetNumberOfTracks());
d26d9159 474}
475
47966a6d 476void AliTPCtrackerMI::WriteTracks(TTree * tree)
477{
d26d9159 478 //
47966a6d 479 // write tracks from seed array to selected tree
d26d9159 480 //
481 fOutput = tree;
482 if (fOutput){
483 AliTPCtrack *iotrack= new AliTPCtrack;
484 fOutput->Branch("tracks","AliTPCtrack",&iotrack,32000,100);
485 }
486 WriteTracks();
487}
488
489void AliTPCtrackerMI::WriteTracks()
490{
491 //
492 // write tracks to the given output tree -
493 // output specified with SetIO routine
494 if (!fSeeds) return;
495 if (!fOutput){
496 SetIO();
497 }
1c53abe2 498
91162307 499 if (fOutput){
500 AliTPCtrack *iotrack= 0;
501 Int_t nseed=fSeeds->GetEntriesFast();
982aff31 502 //for (Int_t i=0; i<nseed; i++) {
503 // iotrack= (AliTPCtrack*)fSeeds->UncheckedAt(i);
504 // if (iotrack) break;
505 //}
91162307 506 //TBranch * br = fOutput->Branch("tracks","AliTPCtrack",&iotrack,32000,100);
507 TBranch * br = fOutput->GetBranch("tracks");
508 br->SetAddress(&iotrack);
509 //
510 for (Int_t i=0; i<nseed; i++) {
511 AliTPCseed *pt=(AliTPCseed*)fSeeds->UncheckedAt(i);
512 if (!pt) continue;
982aff31 513 AliTPCtrack * track = new AliTPCtrack(*pt);
514 iotrack = track;
91162307 515 pt->fLab2 =i;
516 // br->SetAddress(&iotrack);
517 fOutput->Fill();
982aff31 518 delete track;
91162307 519 iotrack =0;
520 }
982aff31 521 //fOutput->GetDirectory()->cd();
522 //fOutput->Write();
91162307 523 }
d26d9159 524 // delete iotrack;
525 //
91162307 526 if (fSeedTree){
527 //write the full seed information if specified in debug mode
528
529 AliTPCseed * vseed = new AliTPCseed;
530 //
531 TClonesArray * arrtr = new TClonesArray("AliTPCTrackPoint",160);
532 arrtr->ExpandCreateFast(160);
533 //TClonesArray * arrcl = new TClonesArray("AliTPCclusterMI",160);
534 //arrcl->ExpandCreateFast(160);
535 TClonesArray * arre = new TClonesArray("AliTPCExactPoint",160);
536 //
537 vseed->fPoints = arrtr;
538 vseed->fEPoints = arre;
539 // vseed->fClusterPoints = arrcl;
540 //TBranch * brseed = seedtree->Branch("seeds","AliTPCseed",&vseed,32000,99);
541 TBranch * brseed = fSeedTree->GetBranch("seeds");
542
543 Int_t nseed=fSeeds->GetEntriesFast();
544
545 for (Int_t i=0; i<nseed; i++) {
546 AliTPCseed *pt=(AliTPCseed*)fSeeds->UncheckedAt(i);
547 if (!pt) continue;
548 pt->fPoints = arrtr;
549 // pt->fClusterPoints = arrcl;
550 pt->fEPoints = arre;
551 pt->RebuildSeed();
552 vseed = pt;
553 brseed->SetAddress(&vseed);
554 fSeedTree->Fill();
555 pt->fPoints = 0;
556 pt->fEPoints = 0;
557 // pt->fClusterPoints = 0;
558 }
559 fSeedTree->Write();
560 if (fTreeDebug) fTreeDebug->Write();
561 }
1c53abe2 562
91162307 563}
1c53abe2 564
1c53abe2 565
1c53abe2 566
567
91162307 568Double_t AliTPCtrackerMI::ErrY2(AliTPCseed* seed, AliTPCclusterMI * cl){
569 //
570 //
571 //seed->SetErrorY2(0.1);
572 //return 0.1;
573 //calculate look-up table at the beginning
574 static Bool_t ginit = kFALSE;
575 static Float_t gnoise1,gnoise2,gnoise3;
576 static Float_t ggg1[10000];
577 static Float_t ggg2[10000];
578 static Float_t ggg3[10000];
579 static Float_t glandau1[10000];
580 static Float_t glandau2[10000];
581 static Float_t glandau3[10000];
582 //
583 static Float_t gcor01[500];
584 static Float_t gcor02[500];
585 static Float_t gcorp[500];
586 //
1c53abe2 587
91162307 588 //
589 if (ginit==kFALSE){
590 for (Int_t i=1;i<500;i++){
591 Float_t rsigma = float(i)/100.;
592 gcor02[i] = TMath::Max(0.78 +TMath::Exp(7.4*(rsigma-1.2)),0.6);
593 gcor01[i] = TMath::Max(0.72 +TMath::Exp(3.36*(rsigma-1.2)),0.6);
594 gcorp[i] = TMath::Max(TMath::Power((rsigma+0.5),1.5),1.2);
595 }
1c53abe2 596
91162307 597 //
598 for (Int_t i=3;i<10000;i++){
599 //
600 //
601 // inner sector
602 Float_t amp = float(i);
603 Float_t padlength =0.75;
604 gnoise1 = 0.0004/padlength;
605 Float_t nel = 0.268*amp;
606 Float_t nprim = 0.155*amp;
607 ggg1[i] = fParam->GetDiffT()*fParam->GetDiffT()*(2+0.001*nel/(padlength*padlength))/nel;
608 glandau1[i] = (2.+0.12*nprim)*0.5* (2.+nprim*nprim*0.001/(padlength*padlength))/nprim;
609 if (glandau1[i]>1) glandau1[i]=1;
610 glandau1[i]*=padlength*padlength/12.;
611 //
612 // outer short
613 padlength =1.;
614 gnoise2 = 0.0004/padlength;
615 nel = 0.3*amp;
616 nprim = 0.133*amp;
617 ggg2[i] = fParam->GetDiffT()*fParam->GetDiffT()*(2+0.0008*nel/(padlength*padlength))/nel;
618 glandau2[i] = (2.+0.12*nprim)*0.5*(2.+nprim*nprim*0.001/(padlength*padlength))/nprim;
619 if (glandau2[i]>1) glandau2[i]=1;
620 glandau2[i]*=padlength*padlength/12.;
621 //
622 //
623 // outer long
624 padlength =1.5;
625 gnoise3 = 0.0004/padlength;
626 nel = 0.3*amp;
627 nprim = 0.133*amp;
628 ggg3[i] = fParam->GetDiffT()*fParam->GetDiffT()*(2+0.0008*nel/(padlength*padlength))/nel;
629 glandau3[i] = (2.+0.12*nprim)*0.5*(2.+nprim*nprim*0.001/(padlength*padlength))/nprim;
630 if (glandau3[i]>1) glandau3[i]=1;
631 glandau3[i]*=padlength*padlength/12.;
632 //
633 }
634 ginit = kTRUE;
635 }
1c53abe2 636 //
637 //
91162307 638 //
639 Int_t amp = int(TMath::Abs(cl->GetQ()));
640 if (amp>9999) {
641 seed->SetErrorY2(1.);
642 return 1.;
643 }
1c53abe2 644 Float_t snoise2;
c9427e08 645 Float_t z = TMath::Abs(fParam->GetZLength()-TMath::Abs(seed->GetZ()));
91162307 646 Int_t ctype = cl->GetType();
647 Float_t padlength= GetPadPitchLength(seed->fRow);
648 Float_t angle2 = seed->GetSnp()*seed->GetSnp();
649 angle2 = angle2/(1-angle2);
650 //
651 //cluster "quality"
652 Int_t rsigmay = int(100.*cl->GetSigmaY2()/(seed->fCurrentSigmaY2));
653 Float_t res;
1c53abe2 654 //
1c53abe2 655 if (fSectors==fInnerSec){
91162307 656 snoise2 = gnoise1;
657 res = ggg1[amp]*z+glandau1[amp]*angle2;
658 if (ctype==0) res *= gcor01[rsigmay];
659 if ((ctype>0)){
660 res+=0.002;
661 res*= gcorp[rsigmay];
662 }
1c53abe2 663 }
664 else {
91162307 665 if (padlength<1.1){
666 snoise2 = gnoise2;
667 res = ggg2[amp]*z+glandau2[amp]*angle2;
668 if (ctype==0) res *= gcor02[rsigmay];
669 if ((ctype>0)){
670 res+=0.002;
671 res*= gcorp[rsigmay];
672 }
673 }
674 else{
675 snoise2 = gnoise3;
676 res = ggg3[amp]*z+glandau3[amp]*angle2;
677 if (ctype==0) res *= gcor02[rsigmay];
678 if ((ctype>0)){
679 res+=0.002;
680 res*= gcorp[rsigmay];
681 }
682 }
683 }
1c53abe2 684
91162307 685 if (ctype<0){
686 res+=0.005;
687 res*=2.4; // overestimate error 2 times
688 }
689 res+= snoise2;
690
1c53abe2 691 if (res<2*snoise2)
91162307 692 res = 2*snoise2;
693
694 seed->SetErrorY2(res);
1c53abe2 695 return res;
1c53abe2 696
697
91162307 698}
c9427e08 699
700
701
91162307 702Double_t AliTPCtrackerMI::ErrZ2(AliTPCseed* seed, AliTPCclusterMI * cl){
703 //
704 //
705 //seed->SetErrorY2(0.1);
706 //return 0.1;
707 //calculate look-up table at the beginning
708 static Bool_t ginit = kFALSE;
709 static Float_t gnoise1,gnoise2,gnoise3;
710 static Float_t ggg1[10000];
711 static Float_t ggg2[10000];
712 static Float_t ggg3[10000];
713 static Float_t glandau1[10000];
714 static Float_t glandau2[10000];
715 static Float_t glandau3[10000];
716 //
717 static Float_t gcor01[1000];
718 static Float_t gcor02[1000];
719 static Float_t gcorp[1000];
1627d1c4 720 //
1627d1c4 721
91162307 722 //
723 if (ginit==kFALSE){
724 for (Int_t i=1;i<1000;i++){
725 Float_t rsigma = float(i)/100.;
726 gcor02[i] = TMath::Max(0.81 +TMath::Exp(6.8*(rsigma-1.2)),0.6);
727 gcor01[i] = TMath::Max(0.72 +TMath::Exp(2.04*(rsigma-1.2)),0.6);
728 gcorp[i] = TMath::Max(TMath::Power((rsigma+0.5),1.5),1.2);
729 }
1c53abe2 730
91162307 731 //
732 for (Int_t i=3;i<10000;i++){
733 //
734 //
735 // inner sector
736 Float_t amp = float(i);
737 Float_t padlength =0.75;
738 gnoise1 = 0.0004/padlength;
739 Float_t nel = 0.268*amp;
740 Float_t nprim = 0.155*amp;
741 ggg1[i] = fParam->GetDiffT()*fParam->GetDiffT()*(2+0.001*nel/(padlength*padlength))/nel;
742 glandau1[i] = (2.+0.12*nprim)*0.5* (2.+nprim*nprim*0.001/(padlength*padlength))/nprim;
743 if (glandau1[i]>1) glandau1[i]=1;
744 glandau1[i]*=padlength*padlength/12.;
745 //
746 // outer short
747 padlength =1.;
748 gnoise2 = 0.0004/padlength;
749 nel = 0.3*amp;
750 nprim = 0.133*amp;
751 ggg2[i] = fParam->GetDiffT()*fParam->GetDiffT()*(2+0.0008*nel/(padlength*padlength))/nel;
752 glandau2[i] = (2.+0.12*nprim)*0.5*(2.+nprim*nprim*0.001/(padlength*padlength))/nprim;
753 if (glandau2[i]>1) glandau2[i]=1;
754 glandau2[i]*=padlength*padlength/12.;
755 //
756 //
757 // outer long
758 padlength =1.5;
759 gnoise3 = 0.0004/padlength;
760 nel = 0.3*amp;
761 nprim = 0.133*amp;
762 ggg3[i] = fParam->GetDiffT()*fParam->GetDiffT()*(2+0.0008*nel/(padlength*padlength))/nel;
763 glandau3[i] = (2.+0.12*nprim)*0.5*(2.+nprim*nprim*0.001/(padlength*padlength))/nprim;
764 if (glandau3[i]>1) glandau3[i]=1;
765 glandau3[i]*=padlength*padlength/12.;
766 //
767 }
768 ginit = kTRUE;
769 }
770 //
771 //
772 //
773 Int_t amp = int(TMath::Abs(cl->GetQ()));
774 if (amp>9999) {
775 seed->SetErrorY2(1.);
776 return 1.;
777 }
778 Float_t snoise2;
779 Float_t z = TMath::Abs(fParam->GetZLength()-TMath::Abs(seed->GetZ()));
780 Int_t ctype = cl->GetType();
781 Float_t padlength= GetPadPitchLength(seed->fRow);
782 //
783 Float_t angle2 = seed->GetSnp()*seed->GetSnp();
784 // if (angle2<0.6) angle2 = 0.6;
785 angle2 = seed->GetTgl()*seed->GetTgl()*(1+angle2/(1-angle2));
786 //
787 //cluster "quality"
788 Int_t rsigmaz = int(100.*cl->GetSigmaZ2()/(seed->fCurrentSigmaZ2));
789 Float_t res;
790 //
791 if (fSectors==fInnerSec){
792 snoise2 = gnoise1;
793 res = ggg1[amp]*z+glandau1[amp]*angle2;
794 if (ctype==0) res *= gcor01[rsigmaz];
795 if ((ctype>0)){
796 res+=0.002;
797 res*= gcorp[rsigmaz];
798 }
799 }
800 else {
801 if (padlength<1.1){
802 snoise2 = gnoise2;
803 res = ggg2[amp]*z+glandau2[amp]*angle2;
804 if (ctype==0) res *= gcor02[rsigmaz];
805 if ((ctype>0)){
806 res+=0.002;
807 res*= gcorp[rsigmaz];
808 }
809 }
810 else{
811 snoise2 = gnoise3;
812 res = ggg3[amp]*z+glandau3[amp]*angle2;
813 if (ctype==0) res *= gcor02[rsigmaz];
814 if ((ctype>0)){
815 res+=0.002;
816 res*= gcorp[rsigmaz];
817 }
818 }
819 }
820
821 if (ctype<0){
822 res+=0.002;
823 res*=1.3;
824 }
825 if ((ctype<0) &&amp<70){
826 res+=0.002;
827 res*=1.3;
828 }
829 res += snoise2;
830 if (res<2*snoise2)
831 res = 2*snoise2;
832 if (res>3) res =3;
833 seed->SetErrorZ2(res);
834 return res;
835}
836
837
838
839/*
840Double_t AliTPCtrackerMI::ErrZ2(AliTPCseed* seed, AliTPCclusterMI * cl){
841 //
842 //
843 //seed->SetErrorZ2(0.1);
844 //return 0.1;
845
846 Float_t snoise2;
847 Float_t z = TMath::Abs(fParam->GetZLength()-TMath::Abs(seed->GetZ()));
848 //
849 Float_t rsigmaz = cl->GetSigmaZ2()/(seed->fCurrentSigmaZ2);
850 Int_t ctype = cl->GetType();
851 Float_t amp = TMath::Abs(cl->GetQ());
852
853 Float_t nel;
854 Float_t nprim;
855 //
856 Float_t landau=2 ; //landau fluctuation part
857 Float_t gg=2; // gg fluctuation part
858 Float_t padlength= GetPadPitchLength(seed->GetX());
859
860 if (fSectors==fInnerSec){
861 snoise2 = 0.0004/padlength;
862 nel = 0.268*amp;
863 nprim = 0.155*amp;
864 gg = (2+0.001*nel/(padlength*padlength))/nel;
865 landau = (2.+0.12*nprim)*0.5*(2.+nprim*nprim*0.001/(padlength*padlength))/nprim;
866 if (landau>1) landau=1;
867 }
868 else {
869 snoise2 = 0.0004/padlength;
870 nel = 0.3*amp;
871 nprim = 0.133*amp;
872 gg = (2+0.0008*nel/(padlength*padlength))/nel;
873 landau = (2.+0.12*nprim)*0.5*(2.+nprim*nprim*0.001/(padlength*padlength))/nprim;
874 if (landau>1) landau=1;
875 }
876 Float_t sdiff = gg*fParam->GetDiffT()*fParam->GetDiffT()*z;
877
878 //
879 Float_t angle2 = seed->GetSnp()*seed->GetSnp();
880 angle2 = TMath::Sqrt((1-angle2));
881 if (angle2<0.6) angle2 = 0.6;
882 //angle2 = 1;
883
884 Float_t angle = seed->GetTgl()/angle2;
885 Float_t angular = landau*angle*angle*padlength*padlength/12.;
886 Float_t res = sdiff + angular;
887
888
889 if ((ctype==0) && (fSectors ==fOuterSec))
890 res *= 0.81 +TMath::Exp(6.8*(rsigmaz-1.2));
891
892 if ((ctype==0) && (fSectors ==fInnerSec))
893 res *= 0.72 +TMath::Exp(2.04*(rsigmaz-1.2));
894
895 if ((ctype>0)){
896 res+=0.005;
897 res*= TMath::Power(rsigmaz+0.5,1.5); //0.31+0.147*ctype;
898 }
899 if (ctype<0){
900 res+=0.002;
901 res*=1.3;
902 }
903 if ((ctype<0) &&amp<70){
904 res+=0.002;
905 res*=1.3;
906 }
907 res += snoise2;
908 if (res<2*snoise2)
909 res = 2*snoise2;
910
911 seed->SetErrorZ2(res);
912 return res;
913}
914*/
915
916
917
1c53abe2 918
c9427e08 919void AliTPCtrackerMI::RotateToLocal(AliTPCseed *seed)
920{
921 //rotate to track "local coordinata
922 Float_t x = seed->GetX();
923 Float_t y = seed->GetY();
924 Float_t ymax = x*TMath::Tan(0.5*fSectors->GetAlpha());
91162307 925
c9427e08 926 if (y > ymax) {
927 seed->fRelativeSector= (seed->fRelativeSector+1) % fN;
928 if (!seed->Rotate(fSectors->GetAlpha()))
929 return;
930 } else if (y <-ymax) {
931 seed->fRelativeSector= (seed->fRelativeSector-1+fN) % fN;
932 if (!seed->Rotate(-fSectors->GetAlpha()))
933 return;
934 }
1c53abe2 935
c9427e08 936}
1c53abe2 937
938
939
1c53abe2 940//_____________________________________________________________________________
b67e07dc 941Double_t AliTPCtrackerMI::F1old(Double_t x1,Double_t y1,
1c53abe2 942 Double_t x2,Double_t y2,
943 Double_t x3,Double_t y3)
944{
945 //-----------------------------------------------------------------
946 // Initial approximation of the track curvature
947 //-----------------------------------------------------------------
948 Double_t d=(x2-x1)*(y3-y2)-(x3-x2)*(y2-y1);
949 Double_t a=0.5*((y3-y2)*(y2*y2-y1*y1+x2*x2-x1*x1)-
950 (y2-y1)*(y3*y3-y2*y2+x3*x3-x2*x2));
951 Double_t b=0.5*((x2-x1)*(y3*y3-y2*y2+x3*x3-x2*x2)-
952 (x3-x2)*(y2*y2-y1*y1+x2*x2-x1*x1));
953
954 Double_t xr=TMath::Abs(d/(d*x1-a)), yr=d/(d*y1-b);
91162307 955 if ( xr*xr+yr*yr<=0.00000000000001) return 100;
1c53abe2 956 return -xr*yr/sqrt(xr*xr+yr*yr);
957}
958
959
91162307 960
1c53abe2 961//_____________________________________________________________________________
b67e07dc 962Double_t AliTPCtrackerMI::F1(Double_t x1,Double_t y1,
91162307 963 Double_t x2,Double_t y2,
964 Double_t x3,Double_t y3)
965{
966 //-----------------------------------------------------------------
967 // Initial approximation of the track curvature
968 //-----------------------------------------------------------------
969 x3 -=x1;
970 x2 -=x1;
971 y3 -=y1;
972 y2 -=y1;
973 //
974 Double_t det = x3*y2-x2*y3;
975 if (det==0) {
976 return 100;
977 }
978 //
979 Double_t u = 0.5* (x2*(x2-x3)+y2*(y2-y3))/det;
980 Double_t x0 = x3*0.5-y3*u;
981 Double_t y0 = y3*0.5+x3*u;
982 Double_t c2 = 1/TMath::Sqrt(x0*x0+y0*y0);
983 if (det<0) c2*=-1;
984 return c2;
985}
986
987
b67e07dc 988Double_t AliTPCtrackerMI::F2(Double_t x1,Double_t y1,
1c53abe2 989 Double_t x2,Double_t y2,
990 Double_t x3,Double_t y3)
91162307 991{
992 //-----------------------------------------------------------------
993 // Initial approximation of the track curvature
994 //-----------------------------------------------------------------
995 x3 -=x1;
996 x2 -=x1;
997 y3 -=y1;
998 y2 -=y1;
999 //
1000 Double_t det = x3*y2-x2*y3;
1001 if (det==0) {
1002 return 100;
1003 }
1004 //
1005 Double_t u = 0.5* (x2*(x2-x3)+y2*(y2-y3))/det;
1006 Double_t x0 = x3*0.5-y3*u;
1007 Double_t y0 = y3*0.5+x3*u;
1008 Double_t c2 = 1/TMath::Sqrt(x0*x0+y0*y0);
1009 if (det<0) c2*=-1;
1010 x0+=x1;
1011 x0*=c2;
1012 return x0;
1013}
1014
1015
1016
1017//_____________________________________________________________________________
b67e07dc 1018Double_t AliTPCtrackerMI::F2old(Double_t x1,Double_t y1,
91162307 1019 Double_t x2,Double_t y2,
1020 Double_t x3,Double_t y3)
1c53abe2 1021{
1022 //-----------------------------------------------------------------
1023 // Initial approximation of the track curvature times center of curvature
1024 //-----------------------------------------------------------------
1025 Double_t d=(x2-x1)*(y3-y2)-(x3-x2)*(y2-y1);
1026 Double_t a=0.5*((y3-y2)*(y2*y2-y1*y1+x2*x2-x1*x1)-
1027 (y2-y1)*(y3*y3-y2*y2+x3*x3-x2*x2));
1028 Double_t b=0.5*((x2-x1)*(y3*y3-y2*y2+x3*x3-x2*x2)-
1029 (x3-x2)*(y2*y2-y1*y1+x2*x2-x1*x1));
1030
1031 Double_t xr=TMath::Abs(d/(d*x1-a)), yr=d/(d*y1-b);
1032
1033 return -a/(d*y1-b)*xr/sqrt(xr*xr+yr*yr);
1034}
1035
1036//_____________________________________________________________________________
b67e07dc 1037Double_t AliTPCtrackerMI::F3(Double_t x1,Double_t y1,
1c53abe2 1038 Double_t x2,Double_t y2,
1039 Double_t z1,Double_t z2)
1040{
1041 //-----------------------------------------------------------------
1042 // Initial approximation of the tangent of the track dip angle
1043 //-----------------------------------------------------------------
1044 return (z1 - z2)/sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));
1045}
1046
1047
b67e07dc 1048Double_t AliTPCtrackerMI::F3n(Double_t x1,Double_t y1,
91162307 1049 Double_t x2,Double_t y2,
1050 Double_t z1,Double_t z2, Double_t c)
1c53abe2 1051{
91162307 1052 //-----------------------------------------------------------------
1053 // Initial approximation of the tangent of the track dip angle
1054 //-----------------------------------------------------------------
1055
1056 // Double_t angle1;
1057
1058 //angle1 = (z1-z2)*c/(TMath::ASin(c*x1-ni)-TMath::ASin(c*x2-ni));
1c53abe2 1059 //
91162307 1060 Double_t d = TMath::Sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));
1061 if (TMath::Abs(d*c*0.5)>1) return 0;
1062 // Double_t angle2 = TMath::ASin(d*c*0.5);
b67e07dc 1063 // Double_t angle2 = AliTPCFastMath::FastAsin(d*c*0.5);
1064 Double_t angle2 = (d*c*0.5>0.1)? TMath::ASin(d*c*0.5): AliTPCFastMath::FastAsin(d*c*0.5);
91162307 1065
1066 angle2 = (z1-z2)*c/(angle2*2.);
1067 return angle2;
1068}
1069
1070Bool_t AliTPCtrackerMI::GetProlongation(Double_t x1, Double_t x2, Double_t x[5], Double_t &y, Double_t &z)
1071{//-----------------------------------------------------------------
1072 // This function find proloncation of a track to a reference plane x=x2.
1073 //-----------------------------------------------------------------
1074
1075 Double_t dx=x2-x1;
1076
1077 if (TMath::Abs(x[4]*x1 - x[2]) >= 0.999) {
1078 return kFALSE;
1c53abe2 1079 }
f8aae377 1080
91162307 1081 Double_t c1=x[4]*x1 - x[2], r1=sqrt(1.- c1*c1);
1082 Double_t c2=x[4]*x2 - x[2], r2=sqrt(1.- c2*c2);
1083 y = x[0];
1084 z = x[1];
1085
1086 Double_t dy = dx*(c1+c2)/(r1+r2);
1087 Double_t dz = 0;
1088 //
1089 Double_t delta = x[4]*dx*(c1+c2)/(c1*r2 + c2*r1);
1090
1091 if (TMath::Abs(delta)>0.01){
1092 dz = x[3]*TMath::ASin(delta)/x[4];
1093 }else{
b67e07dc 1094 dz = x[3]*AliTPCFastMath::FastAsin(delta)/x[4];
91162307 1095 }
1096
b67e07dc 1097 //dz = x[3]*AliTPCFastMath::FastAsin(delta)/x[4];
f8aae377 1098
91162307 1099 y+=dy;
1100 z+=dz;
1101
1102 return kTRUE;
1c53abe2 1103}
1104
d26d9159 1105Int_t AliTPCtrackerMI::LoadClusters (TTree *tree)
1106{
1107 //
1108 //
1109 fInput = tree;
1110 return LoadClusters();
1111}
91162307 1112
1113Int_t AliTPCtrackerMI::LoadClusters()
1c53abe2 1114{
1115 //
1116 // load clusters to the memory
91162307 1117 AliTPCClustersRow *clrow= new AliTPCClustersRow;
1118 clrow->SetClass("AliTPCclusterMI");
1119 clrow->SetArray(0);
1120 clrow->GetArray()->ExpandCreateFast(10000);
1121 //
1122 // TTree * tree = fClustersArray.GetTree();
1123
1124 TTree * tree = fInput;
1125 TBranch * br = tree->GetBranch("Segment");
1126 br->SetAddress(&clrow);
1127 //
1128 Int_t j=Int_t(tree->GetEntries());
1c53abe2 1129 for (Int_t i=0; i<j; i++) {
91162307 1130 br->GetEntry(i);
1131 //
1132 Int_t sec,row;
1133 fParam->AdjustSectorRow(clrow->GetID(),sec,row);
1134 //
1135 AliTPCRow * tpcrow=0;
1136 Int_t left=0;
1137 if (sec<fkNIS*2){
1138 tpcrow = &(fInnerSec[sec%fkNIS][row]);
1139 left = sec/fkNIS;
1140 }
1141 else{
1142 tpcrow = &(fOuterSec[(sec-fkNIS*2)%fkNOS][row]);
1143 left = (sec-fkNIS*2)/fkNOS;
1144 }
1145 if (left ==0){
1146 tpcrow->fN1 = clrow->GetArray()->GetEntriesFast();
1147 tpcrow->fClusters1 = new AliTPCclusterMI[tpcrow->fN1];
1148 for (Int_t i=0;i<tpcrow->fN1;i++)
1149 tpcrow->fClusters1[i] = *(AliTPCclusterMI*)(clrow->GetArray()->At(i));
1150 }
1151 if (left ==1){
1152 tpcrow->fN2 = clrow->GetArray()->GetEntriesFast();
1153 tpcrow->fClusters2 = new AliTPCclusterMI[tpcrow->fN2];
1154 for (Int_t i=0;i<tpcrow->fN2;i++)
1155 tpcrow->fClusters2[i] = *(AliTPCclusterMI*)(clrow->GetArray()->At(i));
1156 }
1c53abe2 1157 }
91162307 1158 //
1159 delete clrow;
1160 LoadOuterSectors();
1161 LoadInnerSectors();
1162 return 0;
1c53abe2 1163}
1164
1165
91162307 1166void AliTPCtrackerMI::UnloadClusters()
1167{
1168 //
1169 // unload clusters from the memory
1170 //
1171 Int_t nrows = fOuterSec->GetNRows();
1172 for (Int_t sec = 0;sec<fkNOS;sec++)
1173 for (Int_t row = 0;row<nrows;row++){
1174 AliTPCRow* tpcrow = &(fOuterSec[sec%fkNOS][row]);
982aff31 1175 // if (tpcrow){
1176 // if (tpcrow->fClusters1) delete []tpcrow->fClusters1;
1177 // if (tpcrow->fClusters2) delete []tpcrow->fClusters2;
1178 //}
1179 tpcrow->ResetClusters();
1c53abe2 1180 }
91162307 1181 //
1182 nrows = fInnerSec->GetNRows();
1183 for (Int_t sec = 0;sec<fkNIS;sec++)
1184 for (Int_t row = 0;row<nrows;row++){
1185 AliTPCRow* tpcrow = &(fInnerSec[sec%fkNIS][row]);
982aff31 1186 //if (tpcrow){
1187 // if (tpcrow->fClusters1) delete []tpcrow->fClusters1;
1188 //if (tpcrow->fClusters2) delete []tpcrow->fClusters2;
1189 //}
1190 tpcrow->ResetClusters();
91162307 1191 }
1192
1193 return ;
1c53abe2 1194}
1195
1196
1197//_____________________________________________________________________________
91162307 1198Int_t AliTPCtrackerMI::LoadOuterSectors() {
1c53abe2 1199 //-----------------------------------------------------------------
91162307 1200 // This function fills outer TPC sectors with clusters.
1c53abe2 1201 //-----------------------------------------------------------------
91162307 1202 Int_t nrows = fOuterSec->GetNRows();
1203 UInt_t index=0;
1204 for (Int_t sec = 0;sec<fkNOS;sec++)
1205 for (Int_t row = 0;row<nrows;row++){
1206 AliTPCRow* tpcrow = &(fOuterSec[sec%fkNOS][row]);
1207 Int_t sec2 = sec+2*fkNIS;
1208 //left
1209 Int_t ncl = tpcrow->fN1;
1210 while (ncl--) {
1211 AliTPCclusterMI *c= &(tpcrow->fClusters1[ncl]);
1212 index=(((sec2<<8)+row)<<16)+ncl;
1213 tpcrow->InsertCluster(c,index);
1214 }
1215 //right
1216 ncl = tpcrow->fN2;
1217 while (ncl--) {
1218 AliTPCclusterMI *c= &(tpcrow->fClusters2[ncl]);
1219 index=((((sec2+fkNOS)<<8)+row)<<16)+ncl;
1220 tpcrow->InsertCluster(c,index);
1221 }
1222 //
1223 // write indexes for fast acces
1224 //
1225 for (Int_t i=0;i<510;i++)
1226 tpcrow->fFastCluster[i]=-1;
1227 for (Int_t i=0;i<tpcrow->GetN();i++){
1228 Int_t zi = Int_t((*tpcrow)[i]->GetZ()+255.);
1229 tpcrow->fFastCluster[zi]=i; // write index
1230 }
1231 Int_t last = 0;
1232 for (Int_t i=0;i<510;i++){
1233 if (tpcrow->fFastCluster[i]<0)
1234 tpcrow->fFastCluster[i] = last;
1235 else
1236 last = tpcrow->fFastCluster[i];
1237 }
1238 }
1239 fN=fkNOS;
1240 fSectors=fOuterSec;
1241 return 0;
1242}
1243
1244
1245//_____________________________________________________________________________
1246Int_t AliTPCtrackerMI::LoadInnerSectors() {
1247 //-----------------------------------------------------------------
1248 // This function fills inner TPC sectors with clusters.
1249 //-----------------------------------------------------------------
1250 Int_t nrows = fInnerSec->GetNRows();
1251 UInt_t index=0;
1252 for (Int_t sec = 0;sec<fkNIS;sec++)
1253 for (Int_t row = 0;row<nrows;row++){
1254 AliTPCRow* tpcrow = &(fInnerSec[sec%fkNIS][row]);
1255 //
1256 //left
1257 Int_t ncl = tpcrow->fN1;
1258 while (ncl--) {
1259 AliTPCclusterMI *c= &(tpcrow->fClusters1[ncl]);
1260 index=(((sec<<8)+row)<<16)+ncl;
1261 tpcrow->InsertCluster(c,index);
1262 }
1263 //right
1264 ncl = tpcrow->fN2;
1265 while (ncl--) {
1266 AliTPCclusterMI *c= &(tpcrow->fClusters2[ncl]);
1267 index=((((sec+fkNIS)<<8)+row)<<16)+ncl;
1268 tpcrow->InsertCluster(c,index);
1269 }
1270 //
1271 // write indexes for fast acces
1272 //
1273 for (Int_t i=0;i<510;i++)
1274 tpcrow->fFastCluster[i]=-1;
1275 for (Int_t i=0;i<tpcrow->GetN();i++){
1276 Int_t zi = Int_t((*tpcrow)[i]->GetZ()+255.);
1277 tpcrow->fFastCluster[zi]=i; // write index
1278 }
1279 Int_t last = 0;
1280 for (Int_t i=0;i<510;i++){
1281 if (tpcrow->fFastCluster[i]<0)
1282 tpcrow->fFastCluster[i] = last;
1283 else
1284 last = tpcrow->fFastCluster[i];
1285 }
1c53abe2 1286
91162307 1287 }
1288
1c53abe2 1289 fN=fkNIS;
1290 fSectors=fInnerSec;
91162307 1291 return 0;
1292}
1293
1294
1295
1296//_________________________________________________________________________
1297AliTPCclusterMI *AliTPCtrackerMI::GetClusterMI(Int_t index) const {
1298 //--------------------------------------------------------------------
1299 // Return pointer to a given cluster
1300 //--------------------------------------------------------------------
1301 Int_t sec=(index&0xff000000)>>24;
1302 Int_t row=(index&0x00ff0000)>>16;
d26d9159 1303 Int_t ncl=(index&0x00007fff)>>00;
91162307 1304
1305 const AliTPCRow * tpcrow=0;
1306 AliTPCclusterMI * clrow =0;
3da363a1 1307
91162307 1308 if (sec<fkNIS*2){
1309 tpcrow = &(fInnerSec[sec%fkNIS][row]);
3da363a1 1310 if (tpcrow==0) return 0;
1311
1312 if (sec<fkNIS) {
1313 if (tpcrow->fN1<=ncl) return 0;
91162307 1314 clrow = tpcrow->fClusters1;
3da363a1 1315 }
1316 else {
1317 if (tpcrow->fN2<=ncl) return 0;
91162307 1318 clrow = tpcrow->fClusters2;
3da363a1 1319 }
91162307 1320 }
3da363a1 1321 else {
91162307 1322 tpcrow = &(fOuterSec[(sec-fkNIS*2)%fkNOS][row]);
3da363a1 1323 if (tpcrow==0) return 0;
1324
1325 if (sec-2*fkNIS<fkNOS) {
1326 if (tpcrow->fN1<=ncl) return 0;
91162307 1327 clrow = tpcrow->fClusters1;
3da363a1 1328 }
1329 else {
1330 if (tpcrow->fN2<=ncl) return 0;
91162307 1331 clrow = tpcrow->fClusters2;
3da363a1 1332 }
91162307 1333 }
3da363a1 1334
91162307 1335 return &(clrow[ncl]);
1336
1c53abe2 1337}
1338
91162307 1339
1340
1c53abe2 1341Int_t AliTPCtrackerMI::FollowToNext(AliTPCseed& t, Int_t nr) {
1342 //-----------------------------------------------------------------
1343 // This function tries to find a track prolongation to next pad row
1344 //-----------------------------------------------------------------
1c53abe2 1345 //
91162307 1346 Double_t x= GetXrow(nr), ymax=GetMaxY(nr);
4d158c36 1347 AliTPCclusterMI *cl=0;
1348 Int_t tpcindex= t.GetClusterIndex2(nr);
1349 //
1350 // update current shape info every 5 pad-row
1351 // if ( (nr%5==0) || t.GetNumberOfClusters()<2 || (t.fCurrentSigmaY2<0.0001) ){
1352 GetShape(&t,nr);
1353 //}
1354 //
1355 if (fIteration>0 && tpcindex>=-1){ //if we have already clusters
1356 //
1357 if (tpcindex==-1) return 0; //track in dead zone
1358 if (tpcindex>0){ //
1359 cl = t.fClusterPointer[nr];
e0656451 1360 if ( (cl==0) ) cl = GetClusterMI(tpcindex);
4d158c36 1361 t.fCurrentClusterIndex1 = tpcindex;
1362 }
1363 if (cl){
1364 Int_t relativesector = ((tpcindex&0xff000000)>>24)%18; // if previously accepted cluster in different sector
1365 Float_t angle = relativesector*fSectors->GetAlpha()+fSectors->GetAlphaShift();
1366 //
1367 if (angle<-TMath::Pi()) angle += 2*TMath::Pi();
1368 if (angle>=TMath::Pi()) angle -= 2*TMath::Pi();
1369
1370 if (TMath::Abs(angle-t.GetAlpha())>0.001){
1371 Double_t rotation = angle-t.GetAlpha();
1372 t.fRelativeSector= relativesector;
1373 t.Rotate(rotation);
1374 }
1375 t.PropagateTo(x);
1376 //
1377 t.fCurrentCluster = cl;
1378 t.fRow = nr;
1379 Int_t accept = AcceptCluster(&t,t.fCurrentCluster,1.);
1380 if ((tpcindex&0x8000)==0) accept =0;
1381 if (accept<3) {
1382 //if founded cluster is acceptible
1383 if (cl->IsUsed(11)) { // id cluster is shared inrease uncertainty
1384 t.fErrorY2 += 0.03;
1385 t.fErrorZ2 += 0.03;
1386 t.fErrorY2 *= 3;
1387 t.fErrorZ2 *= 3;
1388 }
1389 t.fNFoundable++;
1390 UpdateTrack(&t,accept);
1391 return 1;
1392 }
1393 }
1627d1c4 1394 }
b406fdb0 1395 if (fIteration>1) {t.fNFoundable++; return 0;} // not look for new cluster during refitting
91162307 1396 //
4d158c36 1397 UInt_t index=0;
1398 if (TMath::Abs(t.GetSnp())>0.95 || TMath::Abs(x*t.GetC()-t.GetEta())>0.95) return 0;
1399 Double_t y=t.GetYat(x);
91162307 1400 if (TMath::Abs(y)>ymax){
1401 if (y > ymax) {
1402 t.fRelativeSector= (t.fRelativeSector+1) % fN;
1403 if (!t.Rotate(fSectors->GetAlpha()))
1404 return 0;
1405 } else if (y <-ymax) {
1406 t.fRelativeSector= (t.fRelativeSector-1+fN) % fN;
1407 if (!t.Rotate(-fSectors->GetAlpha()))
1408 return 0;
1409 }
4d158c36 1410 //return 1;
91162307 1411 }
1412 //
4d158c36 1413 if (!t.PropagateTo(x)) {
1414 if (fIteration==0) t.fRemoval = 10;
1415 return 0;
91162307 1416 }
4d158c36 1417 y=t.GetY();
1418 Double_t z=t.GetZ();
1419 //
91162307 1420 const AliTPCRow &krow=GetRow(t.fRelativeSector,nr);
1421 if ( (t.GetSigmaY2()<0) || t.GetSigmaZ2()<0) return 0;
1422 Double_t roady =1.;
1423 Double_t roadz = 1.;
1424 //
1c53abe2 1425 if (TMath::Abs(TMath::Abs(y)-ymax)<krow.fDeadZone){
1426 t.fInDead = kTRUE;
91162307 1427 t.SetClusterIndex2(nr,-1);
1c53abe2 1428 return 0;
1429 }
1430 else
1431 {
ab4179bf 1432 if (TMath::Abs(z)<(AliTPCReconstructor::GetCtgRange()*x+10) && TMath::Abs(z)<fParam->GetZLength() ) t.fNFoundable++;
1627d1c4 1433 else
1434 return 0;
1c53abe2 1435 }
1436 //calculate
91162307 1437 if (krow) {
1438 // cl = krow.FindNearest2(y+10.,z,roady,roadz,index);
1439 cl = krow.FindNearest2(y,z,roady,roadz,index);
1440 if (cl) t.fCurrentClusterIndex1 = krow.GetIndex(index);
1441 }
91162307 1442 if (cl) {
1443 t.fCurrentCluster = cl;
1444 t.fRow = nr;
4d158c36 1445 if (fIteration==2&&cl->IsUsed(10)) return 0;
91162307 1446 Int_t accept = AcceptCluster(&t,t.fCurrentCluster,1.);
4d158c36 1447 if (fIteration==2&&cl->IsUsed(11)) {
1448 t.fErrorY2 += 0.03;
1449 t.fErrorZ2 += 0.03;
1450 t.fErrorY2 *= 3;
1451 t.fErrorZ2 *= 3;
1452 }
d26d9159 1453 /*
91162307 1454 if (t.fCurrentCluster->IsUsed(10)){
1455 //
1456 //
c9427e08 1457
91162307 1458 t.fNShared++;
1459 if (t.fNShared>0.7*t.GetNumberOfClusters()) {
1460 t.fRemoval =10;
1461 return 0;
1462 }
1463 }
d26d9159 1464 */
91162307 1465 if (accept<3) UpdateTrack(&t,accept);
c9427e08 1466
91162307 1467 } else {
982aff31 1468 if ( fIteration==0 && t.fNFoundable*0.5 > t.GetNumberOfClusters()) t.fRemoval=10;
91162307 1469
1470 }
1471 return 1;
1472}
c9427e08 1473
91162307 1474Int_t AliTPCtrackerMI::FollowToNextFast(AliTPCseed& t, Int_t nr) {
1475 //-----------------------------------------------------------------
1476 // This function tries to find a track prolongation to next pad row
1477 //-----------------------------------------------------------------
1478 //
1479 Double_t x= GetXrow(nr), ymax=GetMaxY(nr);
1480 Double_t y,z;
1481 if (!t.GetProlongation(x,y,z)) {
1482 t.fRemoval = 10;
1483 return 0;
1484 }
1485 //
1486 //
1487 if (TMath::Abs(y)>ymax){
91162307 1488
1c53abe2 1489 if (y > ymax) {
1490 t.fRelativeSector= (t.fRelativeSector+1) % fN;
1491 if (!t.Rotate(fSectors->GetAlpha()))
1492 return 0;
1493 } else if (y <-ymax) {
1494 t.fRelativeSector= (t.fRelativeSector-1+fN) % fN;
1495 if (!t.Rotate(-fSectors->GetAlpha()))
1496 return 0;
91162307 1497 }
1498 if (!t.PropagateTo(x)) {
1499 return 0;
1500 }
1501 t.GetProlongation(x,y,z);
1502 }
1503 //
1504 // update current shape info every 3 pad-row
1505 if ( (nr%6==0) || t.GetNumberOfClusters()<2 || (t.fCurrentSigmaY2<0.0001) ){
1506 // t.fCurrentSigmaY = GetSigmaY(&t);
1507 //t.fCurrentSigmaZ = GetSigmaZ(&t);
1508 GetShape(&t,nr);
1509 }
1510 //
1511 AliTPCclusterMI *cl=0;
1512 UInt_t index=0;
1513
1514
1515 //Int_t nr2 = nr;
1516 const AliTPCRow &krow=GetRow(t.fRelativeSector,nr);
1517 if ( (t.GetSigmaY2()<0) || t.GetSigmaZ2()<0) return 0;
1518 Double_t roady =1.;
1519 Double_t roadz = 1.;
1520 //
1521 Int_t row = nr;
1522 if (TMath::Abs(TMath::Abs(y)-ymax)<krow.fDeadZone){
1523 t.fInDead = kTRUE;
1524 t.SetClusterIndex2(row,-1);
1525 return 0;
1526 }
1527 else
1528 {
d7a11555 1529 if (TMath::Abs(z)>(AliTPCReconstructor::GetCtgRange()*x+10)) t.SetClusterIndex2(row,-1);
1c53abe2 1530 }
91162307 1531 //calculate
1532
1533 if ((cl==0)&&(krow)) {
1534 // cl = krow.FindNearest2(y+10,z,roady,roadz,index);
1535 cl = krow.FindNearest2(y,z,roady,roadz,index);
1536
1537 if (cl) t.fCurrentClusterIndex1 = krow.GetIndex(index);
1538 }
1539
1540 if (cl) {
1541 t.fCurrentCluster = cl;
1542 // Int_t accept = AcceptCluster(&t,t.fCurrentCluster,1.);
1543 //if (accept<3){
1544 t.SetClusterIndex2(row,index);
1545 t.fClusterPointer[row] = cl;
1546 //}
1c53abe2 1547 }
1548 return 1;
1549}
1550
1551
91162307 1552
5d837844 1553//_________________________________________________________________________
1554Bool_t AliTPCtrackerMI::GetTrackPoint(Int_t index, AliTrackPoint &p ) const
1555{
1556 // Get track space point by index
1557 // return false in case the cluster doesn't exist
1558 AliTPCclusterMI *cl = GetClusterMI(index);
1559 if (!cl) return kFALSE;
1560 Int_t sector = (index&0xff000000)>>24;
1561 Int_t row = (index&0x00ff0000)>>16;
1562 Float_t xyz[3];
1563 xyz[0] = fParam->GetPadRowRadii(sector,row);
1564 xyz[1] = cl->GetY();
1565 xyz[2] = cl->GetZ();
1566 Float_t sin,cos;
1567 fParam->AdjustCosSin(sector,cos,sin);
1568 Float_t x = cos*xyz[0]-sin*xyz[1];
1569 Float_t y = cos*xyz[1]+sin*xyz[0];
1570 Float_t cov[6];
1571 Float_t sigmaY2 = 0.027*cl->GetSigmaY2();
1572 if (sector < fParam->GetNInnerSector()) sigmaY2 *= 2.07;
1573 Float_t sigmaZ2 = 0.066*cl->GetSigmaZ2();
1574 if (sector < fParam->GetNInnerSector()) sigmaZ2 *= 1.77;
1575 cov[0] = sin*sin*sigmaY2;
1576 cov[1] = -sin*cos*sigmaY2;
1577 cov[2] = 0.;
1578 cov[3] = cos*cos*sigmaY2;
1579 cov[4] = 0.;
1580 cov[5] = sigmaZ2;
1581 p.SetXYZ(x,y,xyz[2],cov);
1582 AliAlignObj::ELayerID iLayer;
1583 Int_t idet;
1584 if (sector < fParam->GetNInnerSector()) {
1585 iLayer = AliAlignObj::kTPC1;
1586 idet = sector;
1587 }
1588 else {
1589 iLayer = AliAlignObj::kTPC2;
1590 idet = sector - fParam->GetNInnerSector();
1591 }
1592 UShort_t volid = AliAlignObj::LayerToVolUID(iLayer,idet);
1593 p.SetVolumeID(volid);
1594 return kTRUE;
1595}
1596
1597
1598
91162307 1599Int_t AliTPCtrackerMI::UpdateClusters(AliTPCseed& t, Int_t nr) {
1c53abe2 1600 //-----------------------------------------------------------------
1601 // This function tries to find a track prolongation to next pad row
1602 //-----------------------------------------------------------------
1603 t.fCurrentCluster = 0;
1604 t.fCurrentClusterIndex1 = 0;
1c53abe2 1605
1606 Double_t xt=t.GetX();
91162307 1607 Int_t row = GetRowNumber(xt)-1;
1608 Double_t ymax= GetMaxY(nr);
1609
1c53abe2 1610 if (row < nr) return 1; // don't prolongate if not information until now -
91162307 1611 if (TMath::Abs(t.GetSnp())>0.9 && t.GetNumberOfClusters()>40. && fIteration!=2) {
1612 t.fRemoval =10;
1613 return 0; // not prolongate strongly inclined tracks
1614 }
1615 if (TMath::Abs(t.GetSnp())>0.95) {
1616 t.fRemoval =10;
1617 return 0; // not prolongate strongly inclined tracks
1618 }
1619
1620 Double_t x= GetXrow(nr);
1621 Double_t y,z;
1622 //t.PropagateTo(x+0.02);
1623 //t.PropagateTo(x+0.01);
1627d1c4 1624 if (!t.PropagateTo(x)){
1627d1c4 1625 return 0;
1626 }
1c53abe2 1627 //
91162307 1628 y=t.GetY();
1629 z=t.GetZ();
1c53abe2 1630
91162307 1631 if (TMath::Abs(y)>ymax){
1632 if (y > ymax) {
1633 t.fRelativeSector= (t.fRelativeSector+1) % fN;
1634 if (!t.Rotate(fSectors->GetAlpha()))
1635 return 0;
1636 } else if (y <-ymax) {
1637 t.fRelativeSector= (t.fRelativeSector-1+fN) % fN;
1638 if (!t.Rotate(-fSectors->GetAlpha()))
1639 return 0;
1640 }
982aff31 1641 // if (!t.PropagateTo(x)){
1642 // return 0;
1643 //}
1644 return 1;
1645 //y = t.GetY();
1c53abe2 1646 }
91162307 1647 //
1c53abe2 1648
91162307 1649 AliTPCRow &krow=GetRow(t.fRelativeSector,nr);
1c53abe2 1650
1651 if (TMath::Abs(TMath::Abs(y)-ymax)<krow.fDeadZone){
1652 t.fInDead = kTRUE;
91162307 1653 t.SetClusterIndex2(nr,-1);
1c53abe2 1654 return 0;
1655 }
1656 else
1657 {
d7a11555 1658 if (TMath::Abs(t.GetZ())<(AliTPCReconstructor::GetCtgRange()*t.GetX()+10)) t.fNFoundable++;
1627d1c4 1659 else
1660 return 0;
1c53abe2 1661 }
1c53abe2 1662
91162307 1663 // update current
1664 if ( (nr%6==0) || t.GetNumberOfClusters()<2){
1665 // t.fCurrentSigmaY = GetSigmaY(&t);
1666 //t.fCurrentSigmaZ = GetSigmaZ(&t);
1667 GetShape(&t,nr);
1668 }
1c53abe2 1669
91162307 1670 AliTPCclusterMI *cl=0;
d184f295 1671 Int_t index=0;
91162307 1672 //
1673 Double_t roady = 1.;
1674 Double_t roadz = 1.;
1675 //
d26d9159 1676
1677 if (!cl){
1678 index = t.GetClusterIndex2(nr);
1679 if ( (index>0) && (index&0x8000)==0){
1680 cl = t.fClusterPointer[nr];
1681 if ( (cl==0) && (index>0)) cl = GetClusterMI(index);
1682 t.fCurrentClusterIndex1 = index;
1683 if (cl) {
1684 t.fCurrentCluster = cl;
1685 return 1;
1686 }
1687 }
1688 }
1689
3d172d79 1690 // if (index<0) return 0;
1691 UInt_t uindex = TMath::Abs(index);
d184f295 1692
91162307 1693 if (krow) {
d184f295 1694 //cl = krow.FindNearest2(y+10,z,roady,roadz,uindex);
1695 cl = krow.FindNearest2(y,z,roady,roadz,uindex);
91162307 1696 }
d26d9159 1697
d184f295 1698 if (cl) t.fCurrentClusterIndex1 = krow.GetIndex(uindex);
d26d9159 1699 t.fCurrentCluster = cl;
1700
91162307 1701 return 1;
1702}
1c53abe2 1703
1c53abe2 1704
91162307 1705Int_t AliTPCtrackerMI::FollowToNextCluster(AliTPCseed & t, Int_t nr) {
1706 //-----------------------------------------------------------------
1707 // This function tries to find a track prolongation to next pad row
1708 //-----------------------------------------------------------------
1c53abe2 1709
91162307 1710 //update error according neighborhoud
1c53abe2 1711
91162307 1712 if (t.fCurrentCluster) {
1713 t.fRow = nr;
8c51a605 1714 Int_t accept = AcceptCluster(&t,t.fCurrentCluster,1.);
91162307 1715
1716 if (t.fCurrentCluster->IsUsed(10)){
1717 //
1718 //
1719 // t.fErrorZ2*=2;
1720 // t.fErrorY2*=2;
1721 t.fNShared++;
1722 if (t.fNShared>0.7*t.GetNumberOfClusters()) {
1723 t.fRemoval =10;
1724 return 0;
1725 }
b364ca79 1726 }
d26d9159 1727 if (fIteration>0) accept = 0;
b364ca79 1728 if (accept<3) UpdateTrack(&t,accept);
1729
1c53abe2 1730 } else {
91162307 1731 if (fIteration==0){
1732 if ( ( (t.GetSigmaY2()+t.GetSigmaZ2())>0.16)&& t.GetNumberOfClusters()>18) t.fRemoval=10;
1733 if ( t.GetChi2()/t.GetNumberOfClusters()>6 &&t.GetNumberOfClusters()>18) t.fRemoval=10;
1734
1735 if (( (t.fNFoundable*0.5 > t.GetNumberOfClusters()) || t.fNoCluster>15)) t.fRemoval=10;
1c53abe2 1736 }
1737 }
1738 return 1;
1739}
1740
1741
1742
91162307 1743//_____________________________________________________________________________
1744Int_t AliTPCtrackerMI::FollowProlongation(AliTPCseed& t, Int_t rf, Int_t step) {
1c53abe2 1745 //-----------------------------------------------------------------
91162307 1746 // This function tries to find a track prolongation.
1c53abe2 1747 //-----------------------------------------------------------------
1748 Double_t xt=t.GetX();
1749 //
91162307 1750 Double_t alpha=t.GetAlpha() - fSectors->GetAlphaShift();
1c53abe2 1751 if (alpha > 2.*TMath::Pi()) alpha -= 2.*TMath::Pi();
1752 if (alpha < 0. ) alpha += 2.*TMath::Pi();
91162307 1753 //
1754 t.fRelativeSector = Int_t(alpha/fSectors->GetAlpha()+0.0001)%fN;
1c53abe2 1755
91162307 1756 Int_t first = GetRowNumber(xt)-1;
51ad6848 1757 for (Int_t nr= first; nr>=rf; nr-=step) {
1758 // update kink info
1759 if (t.GetKinkIndexes()[0]>0){
1760 for (Int_t i=0;i<3;i++){
1761 Int_t index = t.GetKinkIndexes()[i];
1762 if (index==0) break;
1763 if (index<0) continue;
1764 //
1765 AliESDkink * kink = fEvent->GetKink(index-1);
1766 if (!kink){
1767 printf("PROBLEM\n");
1768 }
1769 else{
eea478d3 1770 Int_t kinkrow = kink->GetTPCRow0()+2+Int_t(0.5/(0.05+kink->GetAngle(2)));
51ad6848 1771 if (kinkrow==nr){
1772 AliExternalTrackParam paramd(t);
1773 kink->SetDaughter(paramd);
eea478d3 1774 kink->SetStatus(2,5);
51ad6848 1775 kink->Update();
51ad6848 1776 }
1777 }
1778 }
1779 }
1780
1781 if (nr==80) t.UpdateReference();
982aff31 1782 if (nr<fInnerSec->GetNRows())
1783 fSectors = fInnerSec;
1784 else
1785 fSectors = fOuterSec;
91162307 1786 if (FollowToNext(t,nr)==0)
4d158c36 1787 if (!t.IsActive())
1788 return 0;
91162307 1789
1790 }
1791 return 1;
1792}
1793
1c53abe2 1794
1795//_____________________________________________________________________________
91162307 1796Int_t AliTPCtrackerMI::FollowProlongationFast(AliTPCseed& t, Int_t rf, Int_t step) {
1c53abe2 1797 //-----------------------------------------------------------------
1798 // This function tries to find a track prolongation.
1799 //-----------------------------------------------------------------
1800 Double_t xt=t.GetX();
1801 //
1802 Double_t alpha=t.GetAlpha() - fSectors->GetAlphaShift();
1803 if (alpha > 2.*TMath::Pi()) alpha -= 2.*TMath::Pi();
1804 if (alpha < 0. ) alpha += 2.*TMath::Pi();
91162307 1805 t.fRelativeSector = Int_t(alpha/fSectors->GetAlpha()+0.0001)%fN;
1806
1807 for (Int_t nr=GetRowNumber(xt)-1; nr>=rf; nr-=step) {
1808
1809 if (FollowToNextFast(t,nr)==0)
1810 if (!t.IsActive()) return 0;
1c53abe2 1811
1c53abe2 1812 }
1813 return 1;
1814}
1815
1816
91162307 1817
1818
1819
1c53abe2 1820Int_t AliTPCtrackerMI::FollowBackProlongation(AliTPCseed& t, Int_t rf) {
1821 //-----------------------------------------------------------------
1822 // This function tries to find a track prolongation.
1823 //-----------------------------------------------------------------
1c53abe2 1824 //
eea478d3 1825 Double_t xt=t.GetX();
1c53abe2 1826 Double_t alpha=t.GetAlpha() - fSectors->GetAlphaShift();
1827 if (alpha > 2.*TMath::Pi()) alpha -= 2.*TMath::Pi();
1828 if (alpha < 0. ) alpha += 2.*TMath::Pi();
91162307 1829 t.fRelativeSector = Int_t(alpha/fSectors->GetAlpha()+0.0001)%fN;
1c53abe2 1830
4d158c36 1831 Int_t first = t.fFirstPoint;
eea478d3 1832 if (first<GetRowNumber(xt)+1) first = GetRowNumber(xt)+1;
91162307 1833 //
1834 if (first<0) first=0;
4d158c36 1835 for (Int_t nr=first; nr<=rf; nr++) {
2bd61959 1836 if ( (TMath::Abs(t.GetSnp())>0.95)) break;
51ad6848 1837 if (t.GetKinkIndexes()[0]<0){
1838 for (Int_t i=0;i<3;i++){
1839 Int_t index = t.GetKinkIndexes()[i];
1840 if (index==0) break;
1841 if (index>0) continue;
1842 index = TMath::Abs(index);
1843 AliESDkink * kink = fEvent->GetKink(index-1);
1844 if (!kink){
1845 printf("PROBLEM\n");
1846 }
1847 else{
eea478d3 1848 Int_t kinkrow = kink->GetTPCRow0()-2-Int_t(0.5/(0.05+kink->GetAngle(2)));
51ad6848 1849 if (kinkrow==nr){
1850 AliExternalTrackParam paramm(t);
1851 kink->SetMother(paramm);
eea478d3 1852 kink->SetStatus(2,1);
51ad6848 1853 kink->Update();
51ad6848 1854 }
1855 }
eea478d3 1856 }
51ad6848 1857 }
eea478d3 1858 //
d26d9159 1859 if (nr<fInnerSec->GetNRows())
1860 fSectors = fInnerSec;
1861 else
1862 fSectors = fOuterSec;
1863 FollowToNext(t,nr);
1c53abe2 1864 }
1865 return 1;
1866}
1867
1868
1869
1870
1871
1872Float_t AliTPCtrackerMI::OverlapFactor(AliTPCseed * s1, AliTPCseed * s2, Int_t &sum1, Int_t & sum2)
1873{
1874 //
1875 //
1876 sum1=0;
1877 sum2=0;
1878 Int_t sum=0;
1c53abe2 1879 //
1880 Float_t dz2 =(s1->GetZ() - s2->GetZ());
c9427e08 1881 dz2*=dz2;
91162307 1882
c9427e08 1883 Float_t dy2 =TMath::Abs((s1->GetY() - s2->GetY()));
1c53abe2 1884 dy2*=dy2;
1885 Float_t distance = TMath::Sqrt(dz2+dy2);
c9427e08 1886 if (distance>4.) return 0; // if there are far away - not overlap - to reduce combinatorics
1c53abe2 1887
91162307 1888 // Int_t offset =0;
c9427e08 1889 Int_t firstpoint = TMath::Min(s1->fFirstPoint,s2->fFirstPoint);
1890 Int_t lastpoint = TMath::Max(s1->fLastPoint,s2->fLastPoint);
c9427e08 1891 if (lastpoint>160)
1892 lastpoint =160;
1893 if (firstpoint<0)
1894 firstpoint = 0;
91162307 1895 if (firstpoint>lastpoint) {
1896 firstpoint =lastpoint;
1897 // lastpoint =160;
c9427e08 1898 }
1899
1900
91162307 1901 for (Int_t i=firstpoint-1;i<lastpoint+1;i++){
1902 if (s1->GetClusterIndex2(i)>0) sum1++;
1903 if (s2->GetClusterIndex2(i)>0) sum2++;
1904 if (s1->GetClusterIndex2(i)==s2->GetClusterIndex2(i) && s1->GetClusterIndex2(i)>0) {
1c53abe2 1905 sum++;
1906 }
1907 }
91162307 1908 if (sum<5) return 0;
1909
1627d1c4 1910 Float_t summin = TMath::Min(sum1+1,sum2+1);
1911 Float_t ratio = (sum+1)/Float_t(summin);
1c53abe2 1912 return ratio;
1913}
1914
1915void AliTPCtrackerMI::SignShared(AliTPCseed * s1, AliTPCseed * s2)
1916{
1917 //
1918 //
91162307 1919 if (TMath::Abs(s1->GetC()-s2->GetC())>0.004) return;
1920 if (TMath::Abs(s1->GetTgl()-s2->GetTgl())>0.6) return;
1921
1c53abe2 1922 Float_t dz2 =(s1->GetZ() - s2->GetZ());
1923 dz2*=dz2;
1924 Float_t dy2 =(s1->GetY() - s2->GetY());
1925 dy2*=dy2;
91162307 1926 Float_t distance = dz2+dy2;
1927 if (distance>325.) return ; // if there are far away - not overlap - to reduce combinatorics
1928
1c53abe2 1929 //
91162307 1930 Int_t sumshared=0;
1931 //
1932 Int_t firstpoint = TMath::Max(s1->fFirstPoint,s2->fFirstPoint);
1933 Int_t lastpoint = TMath::Min(s1->fLastPoint,s2->fLastPoint);
1934 //
1935 if (firstpoint>=lastpoint-5) return;;
1c53abe2 1936
91162307 1937 for (Int_t i=firstpoint;i<lastpoint;i++){
1938 // if ( (s1->GetClusterIndex2(i)&0xFFFF8FFF)==(s2->GetClusterIndex2(i)&0xFFFF8FFF) && s1->GetClusterIndex2(i)>0) {
1939 if ( (s1->GetClusterIndex2(i))==(s2->GetClusterIndex2(i)) && s1->GetClusterIndex2(i)>0) {
1940 sumshared++;
1941 }
1942 }
1943 if (sumshared>4){
1944 // sign clusters
1945 //
1946 for (Int_t i=firstpoint;i<lastpoint;i++){
1947 // if ( (s1->GetClusterIndex2(i)&0xFFFF8FFF)==(s2->GetClusterIndex2(i)&0xFFFF8FFF) && s1->GetClusterIndex2(i)>0) {
1948 if ( (s1->GetClusterIndex2(i))==(s2->GetClusterIndex2(i)) && s1->GetClusterIndex2(i)>0) {
1949 AliTPCTrackerPoint *p1 = s1->GetTrackPoint(i);
1950 AliTPCTrackerPoint *p2 = s2->GetTrackPoint(i);;
1951 if (s1->IsActive()&&s2->IsActive()){
1952 p1->fIsShared = kTRUE;
1953 p2->fIsShared = kTRUE;
1954 }
1955 }
1956 }
1957 }
1958 //
1959 if (sumshared>10){
1960 for (Int_t i=0;i<4;i++){
1961 if (s1->fOverlapLabels[3*i]==0){
1962 s1->fOverlapLabels[3*i] = s2->GetLabel();
1963 s1->fOverlapLabels[3*i+1] = sumshared;
1964 s1->fOverlapLabels[3*i+2] = s2->GetUniqueID();
1965 break;
1966 }
1967 }
1968 for (Int_t i=0;i<4;i++){
1969 if (s2->fOverlapLabels[3*i]==0){
1970 s2->fOverlapLabels[3*i] = s1->GetLabel();
1971 s2->fOverlapLabels[3*i+1] = sumshared;
1972 s2->fOverlapLabels[3*i+2] = s1->GetUniqueID();
1973 break;
1974 }
1975 }
1976 }
1c53abe2 1977
91162307 1978}
1c53abe2 1979
91162307 1980void AliTPCtrackerMI::SignShared(TObjArray * arr)
1981{
1c53abe2 1982 //
91162307 1983 //sort trackss according sectors
1984 //
c9427e08 1985 for (Int_t i=0; i<arr->GetEntriesFast(); i++) {
1986 AliTPCseed *pt=(AliTPCseed*)arr->UncheckedAt(i);
91162307 1987 if (!pt) continue;
1988 //if (pt) RotateToLocal(pt);
1989 pt->fSort = 0;
c9427e08 1990 }
91162307 1991 arr->UnSort();
1c53abe2 1992 arr->Sort(); // sorting according z
1993 arr->Expand(arr->GetEntries());
91162307 1994 //
1995 //
1c53abe2 1996 Int_t nseed=arr->GetEntriesFast();
1c53abe2 1997 for (Int_t i=0; i<nseed; i++) {
1998 AliTPCseed *pt=(AliTPCseed*)arr->UncheckedAt(i);
91162307 1999 if (!pt) continue;
2000 for (Int_t j=0;j<=12;j++){
2001 pt->fOverlapLabels[j] =0;
1c53abe2 2002 }
91162307 2003 }
2004 for (Int_t i=0; i<nseed; i++) {
2005 AliTPCseed *pt=(AliTPCseed*)arr->UncheckedAt(i);
2006 if (!pt) continue;
2007 if (pt->fRemoval>10) continue;
1c53abe2 2008 for (Int_t j=i+1; j<nseed; j++){
2009 AliTPCseed *pt2=(AliTPCseed*)arr->UncheckedAt(j);
91162307 2010 // if (pt2){
2011 if (pt2->fRemoval<=10) {
2012 if ( TMath::Abs(pt->fRelativeSector-pt2->fRelativeSector)>0) break;
2013 SignShared(pt,pt2);
c9427e08 2014 }
91162307 2015 }
2016 }
2017}
2018
2019void AliTPCtrackerMI::RemoveDouble(TObjArray * arr, Float_t factor1, Float_t factor2, Int_t removalindex)
2020{
2021 //
2022 //sort trackss according sectors
2023 //
2024 if (fDebug&1) {
6bdc18d6 2025 Info("RemoveDouble","Number of tracks before double removal- %d\n",arr->GetEntries());
91162307 2026 }
2027 //
2028 for (Int_t i=0; i<arr->GetEntriesFast(); i++) {
2029 AliTPCseed *pt=(AliTPCseed*)arr->UncheckedAt(i);
2030 if (!pt) continue;
2031 pt->fSort = 0;
2032 }
2033 arr->UnSort();
2034 arr->Sort(); // sorting according z
2035 arr->Expand(arr->GetEntries());
2036 //
2037 //reset overlap labels
2038 //
2039 Int_t nseed=arr->GetEntriesFast();
2040 for (Int_t i=0; i<nseed; i++) {
2041 AliTPCseed *pt=(AliTPCseed*)arr->UncheckedAt(i);
2042 if (!pt) continue;
2043 pt->SetUniqueID(i);
2044 for (Int_t j=0;j<=12;j++){
2045 pt->fOverlapLabels[j] =0;
1c53abe2 2046 }
2047 }
91162307 2048 //
2049 //sign shared tracks
1c53abe2 2050 for (Int_t i=0; i<nseed; i++) {
2051 AliTPCseed *pt=(AliTPCseed*)arr->UncheckedAt(i);
91162307 2052 if (!pt) continue;
2053 if (pt->fRemoval>10) continue;
2054 Float_t deltac = pt->GetC()*0.1;
2055 for (Int_t j=i+1; j<nseed; j++){
2056 AliTPCseed *pt2=(AliTPCseed*)arr->UncheckedAt(j);
2057 // if (pt2){
2058 if (pt2->fRemoval<=10) {
2059 if ( TMath::Abs(pt->fRelativeSector-pt2->fRelativeSector)>0) break;
2060 if (TMath::Abs(pt->GetC() -pt2->GetC())>deltac) continue;
2061 if (TMath::Abs(pt->GetTgl()-pt2->GetTgl())>0.05) continue;
2062 //
2063 SignShared(pt,pt2);
2064 }
1c53abe2 2065 }
1c53abe2 2066 }
91162307 2067 //
2068 // remove highly shared tracks
2069 for (Int_t i=0; i<nseed; i++) {
2070 AliTPCseed *pt=(AliTPCseed*)arr->UncheckedAt(i);
2071 if (!pt) continue;
2072 if (pt->fRemoval>10) continue;
2073 //
2074 Int_t sumshared =0;
2075 for (Int_t j=0;j<4;j++){
2076 sumshared = pt->fOverlapLabels[j*3+1];
2077 }
2078 Float_t factor = factor1;
2079 if (pt->fRemoval>0) factor = factor2;
2080 if (sumshared/pt->GetNumberOfClusters()>factor){
2081 for (Int_t j=0;j<4;j++){
2082 if (pt->fOverlapLabels[3*j]==0) continue;
2083 if (pt->fOverlapLabels[3*j+1]<5) continue;
2084 if (pt->fRemoval==removalindex) continue;
2085 AliTPCseed * pt2 = (AliTPCseed*)arr->UncheckedAt(pt->fOverlapLabels[3*j+2]);
2086 if (!pt2) continue;
2087 if (pt2->GetSigma2C()<pt->GetSigma2C()){
2088 // pt->fRemoval = removalindex;
2089 delete arr->RemoveAt(i);
2090 break;
1c53abe2 2091 }
91162307 2092 }
1c53abe2 2093 }
91162307 2094 }
2095 arr->Compress();
2096 if (fDebug&1) {
6bdc18d6 2097 Info("RemoveDouble","Number of tracks after double removal- %d\n",arr->GetEntries());
91162307 2098 }
2099}
2100
2101
2102
1c53abe2 2103
2104
91162307 2105
47966a6d 2106void AliTPCtrackerMI::SortTracks(TObjArray * arr, Int_t mode) const
91162307 2107{
2108 //
2109 //sort tracks in array according mode criteria
2110 Int_t nseed = arr->GetEntriesFast();
2111 for (Int_t i=0; i<nseed; i++) {
2112 AliTPCseed *pt=(AliTPCseed*)arr->UncheckedAt(i);
2113 if (!pt) {
2114 continue;
2115 }
2116 pt->fSort = mode;
2117 }
2118 arr->UnSort();
2119 arr->Sort();
1c53abe2 2120}
c9427e08 2121
91162307 2122void AliTPCtrackerMI::RemoveUsed(TObjArray * arr, Float_t factor1, Float_t factor2, Int_t removalindex)
c9427e08 2123{
2124
2125 //Loop over all tracks and remove "overlaps"
2126 //
2127 //
2128 Int_t nseed = arr->GetEntriesFast();
2129 Int_t good =0;
91162307 2130
c9427e08 2131 for (Int_t i=0; i<nseed; i++) {
2132 AliTPCseed *pt=(AliTPCseed*)arr->UncheckedAt(i);
2133 if (!pt) {
91162307 2134 delete arr->RemoveAt(i);
c9427e08 2135 }
91162307 2136 else{
2137 pt->fSort =1;
2138 pt->fBSigned = kFALSE;
c9427e08 2139 }
91162307 2140 }
2141 arr->Compress();
2142 nseed = arr->GetEntriesFast();
2143 arr->UnSort();
2144 arr->Sort();
2145 //
2146 //unsign used
2147 UnsignClusters();
2148 //
2149 for (Int_t i=0; i<nseed; i++) {
2150 AliTPCseed *pt=(AliTPCseed*)arr->UncheckedAt(i);
2151 if (!pt) {
2152 continue;
2153 }
2154 Int_t found,foundable,shared;
2155 if (pt->IsActive())
2156 pt->GetClusterStatistic(0,160,found, foundable,shared,kFALSE);
2157 else
2158 pt->GetClusterStatistic(0,160,found, foundable,shared,kTRUE);
2159 //
2160 Double_t factor = factor2;
2161 if (pt->fBConstrain) factor = factor1;
2162
2163 if ((Float_t(shared)/Float_t(found))>factor){
c9427e08 2164 pt->Desactivate(removalindex);
91162307 2165 continue;
2166 }
2167
2168 good++;
2169 for (Int_t i=0; i<160; i++) {
2170 Int_t index=pt->GetClusterIndex2(i);
2171 if (index<0 || index&0x8000 ) continue;
2172 AliTPCclusterMI *c= pt->fClusterPointer[i];
2173 if (!c) continue;
2174 // if (!c->IsUsed(10)) c->Use(10);
2175 //if (pt->IsActive())
2176 c->Use(10);
2177 //else
2178 // c->Use(5);
c9427e08 2179 }
91162307 2180
c9427e08 2181 }
2182 fNtracks = good;
6bdc18d6 2183 if (fDebug>0){
2184 Info("RemoveUsed","\n*****\nNumber of good tracks after shared removal\t%d\n",fNtracks);
2185 }
c9427e08 2186}
2187
51ad6848 2188
2189void AliTPCtrackerMI::RemoveUsed2(TObjArray * arr, Float_t factor1, Float_t factor2, Int_t minimal)
2190{
2191
2192 //Loop over all tracks and remove "overlaps"
2193 //
2194 //
2195 UnsignClusters();
2196 //
2197 Int_t nseed = arr->GetEntriesFast();
2198 Float_t * quality = new Float_t[nseed];
2199 Int_t * indexes = new Int_t[nseed];
2200 Int_t good =0;
2201 //
2202 //
2203 for (Int_t i=0; i<nseed; i++) {
2204 AliTPCseed *pt=(AliTPCseed*)arr->UncheckedAt(i);
2205 if (!pt){
2206 quality[i]=-1;
2207 continue;
2208 }
2209 pt->UpdatePoints(); //select first last max dens points
2210 Float_t * points = pt->GetPoints();
2211 if (points[3]<0.8) quality[i] =-1;
2212 //
2213 quality[i] = (points[2]-points[0])+pt->GetNumberOfClusters();
2214 }
2215 TMath::Sort(nseed,quality,indexes);
2216 //
2217 //
2218 for (Int_t itrack=0; itrack<nseed; itrack++) {
2219 Int_t trackindex = indexes[itrack];
2220 AliTPCseed *pt=(AliTPCseed*)arr->UncheckedAt(trackindex);
2221 if (quality[trackindex]<0){
2222 if (pt) {
2223 delete arr->RemoveAt(trackindex);
2224 }
2225 else{
2226 arr->RemoveAt(trackindex);
2227 }
2228 continue;
2229 }
2230 //
2231 Int_t first = Int_t(pt->GetPoints()[0]);
2232 Int_t last = Int_t(pt->GetPoints()[2]);
2233 Double_t factor = (pt->fBConstrain) ? factor1: factor2;
2234 //
2235 Int_t found,foundable,shared;
2236 pt->GetClusterStatistic(first,last, found, foundable,shared,kFALSE);
eea478d3 2237 Float_t sharedfactor = Float_t(shared+1)/Float_t(found+1);
b406fdb0 2238 Bool_t itsgold =kFALSE;
2239 if (pt->fEsd){
2240 UInt_t dummy[12];
2241 if (pt->fEsd->GetITSclusters(dummy)>4) itsgold= kTRUE;
51ad6848 2242 }
b406fdb0 2243 if (!itsgold){
2244 //
2245 if (Float_t(shared+1)/Float_t(found+1)>factor){
2246 if (pt->GetKinkIndexes()[0]!=0) continue; //don't remove tracks - part of the kinks
2247 delete arr->RemoveAt(trackindex);
2248 continue;
2249 }
2250 if (pt->GetNumberOfClusters()<50&&(found-0.5*shared)<minimal){ //remove short tracks
2251 if (pt->GetKinkIndexes()[0]!=0) continue; //don't remove tracks - part of the kinks
2252 delete arr->RemoveAt(trackindex);
2253 continue;
2254 }
51ad6848 2255 }
2256
2257 good++;
2258 if (sharedfactor>0.4) continue;
b406fdb0 2259 if (pt->GetKinkIndexes()[0]>0) continue;
51ad6848 2260 for (Int_t i=first; i<last; i++) {
2261 Int_t index=pt->GetClusterIndex2(i);
2262 // if (index<0 || index&0x8000 ) continue;
2263 if (index<0 || index&0x8000 ) continue;
2264 AliTPCclusterMI *c= pt->fClusterPointer[i];
2265 if (!c) continue;
2266 c->Use(10);
2267 }
2268 }
2269 fNtracks = good;
2270 if (fDebug>0){
2271 Info("RemoveUsed","\n*****\nNumber of good tracks after shared removal\t%d\n",fNtracks);
2272 }
2273 delete []quality;
2274 delete []indexes;
2275}
2276
91162307 2277void AliTPCtrackerMI::UnsignClusters()
1c53abe2 2278{
91162307 2279 //
2280 // loop over all clusters and unsign them
2281 //
2282
2283 for (Int_t sec=0;sec<fkNIS;sec++){
2284 for (Int_t row=0;row<fInnerSec->GetNRows();row++){
2285 AliTPCclusterMI *cl = fInnerSec[sec][row].fClusters1;
2286 for (Int_t icl =0;icl< fInnerSec[sec][row].fN1;icl++)
2287 // if (cl[icl].IsUsed(10))
2288 cl[icl].Use(-1);
2289 cl = fInnerSec[sec][row].fClusters2;
2290 for (Int_t icl =0;icl< fInnerSec[sec][row].fN2;icl++)
2291 //if (cl[icl].IsUsed(10))
2292 cl[icl].Use(-1);
2293 }
2294 }
2295
2296 for (Int_t sec=0;sec<fkNOS;sec++){
2297 for (Int_t row=0;row<fOuterSec->GetNRows();row++){
2298 AliTPCclusterMI *cl = fOuterSec[sec][row].fClusters1;
2299 for (Int_t icl =0;icl< fOuterSec[sec][row].fN1;icl++)
2300 //if (cl[icl].IsUsed(10))
2301 cl[icl].Use(-1);
2302 cl = fOuterSec[sec][row].fClusters2;
2303 for (Int_t icl =0;icl< fOuterSec[sec][row].fN2;icl++)
2304 //if (cl[icl].IsUsed(10))
2305 cl[icl].Use(-1);
2306 }
2307 }
2308
1c53abe2 2309}
2310
91162307 2311
2312
732b9e78 2313void AliTPCtrackerMI::SignClusters(TObjArray * arr, Float_t fnumber, Float_t fdensity)
1c53abe2 2314{
2315 //
91162307 2316 //sign clusters to be "used"
2317 //
2318 // snumber and sdensity sign number of sigmas - bellow mean value to be accepted
2319 // loop over "primaries"
2320
2321 Float_t sumdens=0;
2322 Float_t sumdens2=0;
2323 Float_t sumn =0;
2324 Float_t sumn2 =0;
2325 Float_t sumchi =0;
2326 Float_t sumchi2 =0;
2327
2328 Float_t sum =0;
2329
1c53abe2 2330 TStopwatch timer;
91162307 2331 timer.Start();
1c53abe2 2332
91162307 2333 Int_t nseed = arr->GetEntriesFast();
2334 for (Int_t i=0; i<nseed; i++) {
2335 AliTPCseed *pt=(AliTPCseed*)arr->UncheckedAt(i);
2336 if (!pt) {
2337 continue;
2338 }
2339 if (!(pt->IsActive())) continue;
2340 Float_t dens = pt->GetNumberOfClusters()/Float_t(pt->fNFoundable);
2341 if ( (dens>0.7) && (pt->GetNumberOfClusters()>70)){
2342 sumdens += dens;
2343 sumdens2+= dens*dens;
2344 sumn += pt->GetNumberOfClusters();
2345 sumn2 += pt->GetNumberOfClusters()*pt->GetNumberOfClusters();
2346 Float_t chi2 = pt->GetChi2()/pt->GetNumberOfClusters();
2347 if (chi2>5) chi2=5;
2348 sumchi +=chi2;
2349 sumchi2 +=chi2*chi2;
2350 sum++;
2351 }
1627d1c4 2352 }
91162307 2353
2354 Float_t mdensity = 0.9;
2355 Float_t meann = 130;
2356 Float_t meanchi = 1;
2357 Float_t sdensity = 0.1;
2358 Float_t smeann = 10;
2359 Float_t smeanchi =0.4;
1627d1c4 2360
91162307 2361
2362 if (sum>20){
2363 mdensity = sumdens/sum;
2364 meann = sumn/sum;
2365 meanchi = sumchi/sum;
2366 //
2367 sdensity = sumdens2/sum-mdensity*mdensity;
2368 sdensity = TMath::Sqrt(sdensity);
2369 //
2370 smeann = sumn2/sum-meann*meann;
2371 smeann = TMath::Sqrt(smeann);
2372 //
2373 smeanchi = sumchi2/sum - meanchi*meanchi;
2374 smeanchi = TMath::Sqrt(smeanchi);
2375 }
2376
2377
2378 //REMOVE SHORT DELTAS or tracks going out of sensitive volume of TPC
2379 //
2380 for (Int_t i=0; i<nseed; i++) {
2381 AliTPCseed *pt=(AliTPCseed*)arr->UncheckedAt(i);
2382 if (!pt) {
2383 continue;
1c53abe2 2384 }
91162307 2385 if (pt->fBSigned) continue;
2386 if (pt->fBConstrain) continue;
2387 //if (!(pt->IsActive())) continue;
2388 /*
2389 Int_t found,foundable,shared;
2390 pt->GetClusterStatistic(0,160,found, foundable,shared);
2391 if (shared/float(found)>0.3) {
2392 if (shared/float(found)>0.9 ){
2393 //delete arr->RemoveAt(i);
2394 }
2395 continue;
c9427e08 2396 }
91162307 2397 */
2398 Bool_t isok =kFALSE;
2399 if ( (pt->fNShared/pt->GetNumberOfClusters()<0.5) &&pt->GetNumberOfClusters()>60)
2400 isok = kTRUE;
2401 if ((TMath::Abs(1/pt->GetC())<100.) && (pt->fNShared/pt->GetNumberOfClusters()<0.7))
2402 isok =kTRUE;
2403 if (TMath::Abs(pt->GetZ()/pt->GetX())>1.1)
2404 isok =kTRUE;
2405 if ( (TMath::Abs(pt->GetSnp()>0.7) && pt->GetD(0,0)>60.))
2406 isok =kTRUE;
2407
2408 if (isok)
2409 for (Int_t i=0; i<160; i++) {
2410 Int_t index=pt->GetClusterIndex2(i);
2411 if (index<0) continue;
2412 AliTPCclusterMI *c= pt->fClusterPointer[i];
2413 if (!c) continue;
2414 //if (!(c->IsUsed(10))) c->Use();
2415 c->Use(10);
2416 }
2417 }
2418
c9427e08 2419
1c53abe2 2420 //
91162307 2421 Double_t maxchi = meanchi+2.*smeanchi;
2422
2423 for (Int_t i=0; i<nseed; i++) {
2424 AliTPCseed *pt=(AliTPCseed*)arr->UncheckedAt(i);
2425 if (!pt) {
1c53abe2 2426 continue;
91162307 2427 }
2428 //if (!(pt->IsActive())) continue;
2429 if (pt->fBSigned) continue;
2430 Double_t chi = pt->GetChi2()/pt->GetNumberOfClusters();
2431 if (chi>maxchi) continue;
2432
2433 Float_t bfactor=1;
2434 Float_t dens = pt->GetNumberOfClusters()/Float_t(pt->fNFoundable);
2435
2436 //sign only tracks with enoug big density at the beginning
2437
2438 if ((pt->GetDensityFirst(40)<0.75) && pt->GetNumberOfClusters()<meann) continue;
2439
2440
3e5d0aa2 2441 Double_t mindens = TMath::Max(double(mdensity-sdensity*fdensity*bfactor),0.65);
91162307 2442 Double_t minn = TMath::Max(Int_t(meann-fnumber*smeann*bfactor),50);
2443
2444 // if (pt->fBConstrain) mindens = TMath::Max(mdensity-sdensity*fdensity*bfactor,0.65);
2445 if ( (pt->fRemoval==10) && (pt->GetSnp()>0.8)&&(dens>mindens))
2446 minn=0;
2447
2448 if ((dens>mindens && pt->GetNumberOfClusters()>minn) && chi<maxchi ){
2449 //Int_t noc=pt->GetNumberOfClusters();
2450 pt->fBSigned = kTRUE;
2451 for (Int_t i=0; i<160; i++) {
2452
2453 Int_t index=pt->GetClusterIndex2(i);
2454 if (index<0) continue;
2455 AliTPCclusterMI *c= pt->fClusterPointer[i];
2456 if (!c) continue;
2457 // if (!(c->IsUsed(10))) c->Use();
2458 c->Use(10);
2459 }
1c53abe2 2460 }
91162307 2461 }
2462 // gLastCheck = nseed;
2463 // arr->Compress();
2464 if (fDebug>0){
2465 timer.Print();
2466 }
1c53abe2 2467}
2468
2469
47966a6d 2470void AliTPCtrackerMI::StopNotActive(TObjArray * arr, Int_t row0, Float_t th0, Float_t th1, Float_t th2) const
91162307 2471{
2472 // stop not active tracks
2473 // take th1 as threshold for number of founded to number of foundable on last 10 active rows
2474 // take th2 as threshold for number of founded to number of foundable on last 20 active rows
2475 Int_t nseed = arr->GetEntriesFast();
2476 //
2477 for (Int_t i=0; i<nseed; i++) {
2478 AliTPCseed *pt=(AliTPCseed*)arr->UncheckedAt(i);
2479 if (!pt) {
2480 continue;
2481 }
2482 if (!(pt->IsActive())) continue;
2483 StopNotActive(pt,row0,th0, th1,th2);
2484 }
2485}
1c53abe2 2486
1c53abe2 2487
1c53abe2 2488
91162307 2489void AliTPCtrackerMI::StopNotActive(AliTPCseed * seed, Int_t row0, Float_t th0, Float_t th1,
47966a6d 2490 Float_t th2) const
91162307 2491{
2492 // stop not active tracks
2493 // take th1 as threshold for number of founded to number of foundable on last 10 active rows
2494 // take th2 as threshold for number of founded to number of foundable on last 20 active rows
2495 Int_t sumgood1 = 0;
2496 Int_t sumgood2 = 0;
2497 Int_t foundable = 0;
2498 Int_t maxindex = seed->fLastPoint; //last foundable row
2499 if (seed->fNFoundable*th0 > seed->GetNumberOfClusters()) {
2500 seed->Desactivate(10) ;
2501 return;
2502 }
1c53abe2 2503
3e5d0aa2 2504 for (Int_t i=row0; i<maxindex; i++){
91162307 2505 Int_t index = seed->GetClusterIndex2(i);
2506 if (index!=-1) foundable++;
2507 //if (!c) continue;
2508 if (foundable<=30) sumgood1++;
2509 if (foundable<=50) {
2510 sumgood2++;
2511 }
2512 else{
2513 break;
2514 }
2515 }
2516 if (foundable>=30.){
2517 if (sumgood1<(th1*30.)) seed->Desactivate(10);
2518 }
2519 if (foundable>=50)
2520 if (sumgood2<(th2*50.)) seed->Desactivate(10);
2521}
1c53abe2 2522
1c53abe2 2523
d26d9159 2524Int_t AliTPCtrackerMI::RefitInward(AliESD *event)
2525{
2526 //
2527 // back propagation of ESD tracks
2528 //
2529 //return 0;
2530 fEvent = event;
2531 ReadSeeds(event,2);
2532 fIteration=2;
982aff31 2533 //PrepareForProlongation(fSeeds,1);
2534 PropagateForward2(fSeeds);
af32720d 2535
4d158c36 2536 Int_t ntracks=0;
d26d9159 2537 Int_t nseed = fSeeds->GetEntriesFast();
2538 for (Int_t i=0;i<nseed;i++){
2539 AliTPCseed * seed = (AliTPCseed*) fSeeds->UncheckedAt(i);
4d158c36 2540 if (!seed) continue;
eea478d3 2541 if (seed->GetKinkIndex(0)>0) UpdateKinkQualityD(seed); // update quality informations for kinks
2542
d26d9159 2543 seed->PropagateTo(fParam->GetInnerRadiusLow());
51ad6848 2544 seed->UpdatePoints();
d26d9159 2545 AliESDtrack *esd=event->GetTrack(i);
2546 seed->CookdEdx(0.02,0.6);
2547 CookLabel(seed,0.1); //For comparison only
af32720d 2548 //
2549 if (0 && seed!=0&&esd!=0) {
2550 TTreeSRedirector &cstream = *fDebugStreamer;
2551 cstream<<"Crefit"<<
2552 "Esd.="<<esd<<
2553 "Track.="<<seed<<
2554 "\n";
2555 }
51ad6848 2556 if (seed->GetNumberOfClusters()>15){
4d158c36 2557 esd->UpdateTrackParams(seed,AliESDtrack::kTPCrefit);
51ad6848 2558 esd->SetTPCPoints(seed->GetPoints());
b406fdb0 2559 esd->SetTPCPointsF(seed->fNFoundable);
2560 Int_t ndedx = seed->fNCDEDX[0]+seed->fNCDEDX[1]+seed->fNCDEDX[2]+seed->fNCDEDX[3];
2561 Float_t sdedx = (seed->fSDEDX[0]+seed->fSDEDX[1]+seed->fSDEDX[2]+seed->fSDEDX[3])*0.25;
2562 Float_t dedx = seed->GetdEdx();
2563 esd->SetTPCsignal(dedx, sdedx, ndedx);
4d158c36 2564 ntracks++;
d26d9159 2565 }
2566 else{
2567 //printf("problem\n");
2568 }
2569 }
51ad6848 2570 //FindKinks(fSeeds,event);
4d158c36 2571 Info("RefitInward","Number of refitted tracks %d",ntracks);
d26d9159 2572 fEvent =0;
2573 //WriteTracks();
2574 return 0;
2575}
2576
1c53abe2 2577
91162307 2578Int_t AliTPCtrackerMI::PropagateBack(AliESD *event)
2579{
2580 //
2581 // back propagation of ESD tracks
2582 //
1c53abe2 2583
91162307 2584 fEvent = event;
d26d9159 2585 fIteration = 1;
5d837844 2586 ReadSeeds(event,1);
b406fdb0 2587 PropagateBack(fSeeds);
2588 RemoveUsed2(fSeeds,0.4,0.4,20);
2589 //
91162307 2590 Int_t nseed = fSeeds->GetEntriesFast();
4d158c36 2591 Int_t ntracks=0;
91162307 2592 for (Int_t i=0;i<nseed;i++){
2593 AliTPCseed * seed = (AliTPCseed*) fSeeds->UncheckedAt(i);
d9e62e7e 2594 if (!seed) continue;
51ad6848 2595 if (seed->GetKinkIndex(0)<0) UpdateKinkQualityM(seed); // update quality informations for kinks
2596 seed->UpdatePoints();
91162307 2597 AliESDtrack *esd=event->GetTrack(i);
d26d9159 2598 seed->CookdEdx(0.02,0.6);
91162307 2599 CookLabel(seed,0.1); //For comparison only
51ad6848 2600 if (seed->GetNumberOfClusters()>15){
4d158c36 2601 esd->UpdateTrackParams(seed,AliESDtrack::kTPCout);
51ad6848 2602 esd->SetTPCPoints(seed->GetPoints());
167c41ab 2603 esd->SetTPCPointsF(seed->fNFoundable);
2604 Int_t ndedx = seed->fNCDEDX[0]+seed->fNCDEDX[1]+seed->fNCDEDX[2]+seed->fNCDEDX[3];
2605 Float_t sdedx = (seed->fSDEDX[0]+seed->fSDEDX[1]+seed->fSDEDX[2]+seed->fSDEDX[3])*0.25;
2606 Float_t dedx = seed->GetdEdx();
2607 esd->SetTPCsignal(dedx, sdedx, ndedx);
4d158c36 2608 ntracks++;
2609 }
91162307 2610 }
51ad6848 2611 //FindKinks(fSeeds,event);
4d158c36 2612 Info("PropagateBack","Number of back propagated tracks %d",ntracks);
91162307 2613 fEvent =0;
d26d9159 2614 //WriteTracks();
91162307 2615 return 0;
2616}
2617
2618
2619void AliTPCtrackerMI::DeleteSeeds()
2620{
b67e07dc 2621 //
2622 //delete Seeds
91162307 2623 Int_t nseed = fSeeds->GetEntriesFast();
2624 for (Int_t i=0;i<nseed;i++){
2625 AliTPCseed * seed = (AliTPCseed*)fSeeds->At(i);
2626 if (seed) delete fSeeds->RemoveAt(i);
2627 }
2628 delete fSeeds;
2629 fSeeds =0;
2630}
2631
d26d9159 2632void AliTPCtrackerMI::ReadSeeds(AliESD *event, Int_t direction)
91162307 2633{
2634 //
2635 //read seeds from the event
2636
2637 Int_t nentr=event->GetNumberOfTracks();
6bdc18d6 2638 if (fDebug>0){
2639 Info("ReadSeeds", "Number of ESD tracks: %d\n", nentr);
2640 }
91162307 2641 if (fSeeds)
2642 DeleteSeeds();
2643 if (!fSeeds){
4d158c36 2644 fSeeds = new TObjArray(nentr);
91162307 2645 }
4d158c36 2646 UnsignClusters();
2647 // Int_t ntrk=0;
91162307 2648 for (Int_t i=0; i<nentr; i++) {
2649 AliESDtrack *esd=event->GetTrack(i);
51ad6848 2650 ULong_t status=esd->GetStatus();
2651 if (!(status&AliESDtrack::kTPCin)) continue;
b67e07dc 2652 AliTPCtrack t(*esd);
5d837844 2653 t.SetNumberOfClusters(0);
eea478d3 2654 // AliTPCseed *seed = new AliTPCseed(t,t.GetAlpha());
2655 AliTPCseed *seed = new AliTPCseed(t/*,t.GetAlpha()*/);
2656 for (Int_t ikink=0;ikink<3;ikink++) {
2657 Int_t index = esd->GetKinkIndex(ikink);
2658 seed->GetKinkIndexes()[ikink] = index;
2659 if (index==0) continue;
2660 index = TMath::Abs(index);
2661 AliESDkink * kink = fEvent->GetKink(index-1);
2662 if (kink&&esd->GetKinkIndex(ikink)<0){
2663 if ((status & AliESDtrack::kTRDrefit) != 0) kink->SetStatus(1,2);
2664 if ((status & AliESDtrack::kITSout) != 0) kink->SetStatus(1,0);
2665 }
2666 if (kink&&esd->GetKinkIndex(ikink)>0){
2667 if ((status & AliESDtrack::kTRDrefit) != 0) kink->SetStatus(1,6);
2668 if ((status & AliESDtrack::kITSout) != 0) kink->SetStatus(1,4);
2669 }
2670
2671 }
5d837844 2672 if (((status&AliESDtrack::kITSout)==0)&&(direction==1)) seed->ResetCovariance();
982aff31 2673 if ( direction ==2 &&(status & AliESDtrack::kTRDrefit) == 0 ) seed->ResetCovariance();
4d158c36 2674 if ( direction ==2 && ((status & AliESDtrack::kTPCout) == 0) ) {
2675 fSeeds->AddAt(0,i);
2676 delete seed;
2677 continue;
2678 }
2679 if ( direction ==2 &&(status & AliESDtrack::kTRDrefit) > 0 ) {
c0b978f0 2680 Double_t par0[5],par1[5],alpha,x;
2681 esd->GetInnerExternalParameters(alpha,x,par0);
4d158c36 2682 esd->GetExternalParameters(x,par1);
2683 Double_t delta1 = TMath::Abs(par0[4]-par1[4])/(0.000000001+TMath::Abs(par0[4]+par1[4]));
2684 Double_t delta2 = TMath::Abs(par0[3]-par1[3]);
51ad6848 2685 Double_t trdchi2=0;
2686 if (esd->GetTRDncls()>0) trdchi2 = esd->GetTRDchi2()/esd->GetTRDncls();
4d158c36 2687 //reset covariance if suspicious
51ad6848 2688 if ( (delta1>0.1) || (delta2>0.006) ||trdchi2>7.)
4d158c36 2689 seed->ResetCovariance();
2690 }
982aff31 2691
91162307 2692 //
2693 //
2694 // rotate to the local coordinate system
eea478d3 2695 //
2696 fSectors=fInnerSec; fN=fkNIS;
91162307 2697 Double_t alpha=seed->GetAlpha() - fSectors->GetAlphaShift();
2698 if (alpha > 2.*TMath::Pi()) alpha -= 2.*TMath::Pi();
2699 if (alpha < 0. ) alpha += 2.*TMath::Pi();
2700 Int_t ns=Int_t(alpha/fSectors->GetAlpha())%fN;
2701 alpha =ns*fSectors->GetAlpha() + fSectors->GetAlphaShift();
4d158c36 2702 if (alpha<-TMath::Pi()) alpha += 2*TMath::Pi();
2703 if (alpha>=TMath::Pi()) alpha -= 2*TMath::Pi();
91162307 2704 alpha-=seed->GetAlpha();
d9b8978b 2705 if (!seed->Rotate(alpha)) {
2706 delete seed;
2707 continue;
2708 }
d26d9159 2709 seed->fEsd = esd;
4d158c36 2710 // sign clusters
b406fdb0 2711 if (esd->GetKinkIndex(0)<=0){
2712 for (Int_t irow=0;irow<160;irow++){
2713 Int_t index = seed->GetClusterIndex2(irow);
2714 if (index>0){
2715 //
2716 AliTPCclusterMI * cl = GetClusterMI(index);
2717 seed->fClusterPointer[irow] = cl;
2718 if (cl){
2719 if ((index & 0x8000)==0){
2720 cl->Use(10); // accepted cluster
2721 }else{
2722 cl->Use(6); // close cluster not accepted
2723 }
4d158c36 2724 }else{
b406fdb0 2725 Info("ReadSeeds","Not found cluster");
2726 }
4d158c36 2727 }
2728 }
2729 }
2730 fSeeds->AddAt(seed,i);
91162307 2731 }
2732}
2733
2734
2735
2736//_____________________________________________________________________________
2737void AliTPCtrackerMI::MakeSeeds3(TObjArray * arr, Int_t sec, Int_t i1, Int_t i2, Float_t cuts[4],
2738 Float_t deltay, Int_t ddsec) {
2739 //-----------------------------------------------------------------
2740 // This function creates track seeds.
2741 // SEEDING WITH VERTEX CONSTRAIN
2742 //-----------------------------------------------------------------
2743 // cuts[0] - fP4 cut
2744 // cuts[1] - tan(phi) cut
2745 // cuts[2] - zvertex cut
2746 // cuts[3] - fP3 cut
2747 Int_t nin0 = 0;
2748 Int_t nin1 = 0;
2749 Int_t nin2 = 0;
2750 Int_t nin = 0;
2751 Int_t nout1 = 0;
2752 Int_t nout2 = 0;
2753
2754 Double_t x[5], c[15];
2755 // Int_t di = i1-i2;
2756 //
2757 AliTPCseed * seed = new AliTPCseed;
2758 Double_t alpha=fSectors->GetAlpha(), shift=fSectors->GetAlphaShift();
2759 Double_t cs=cos(alpha), sn=sin(alpha);
2760 //
2761 // Double_t x1 =fOuterSec->GetX(i1);
2762 //Double_t xx2=fOuterSec->GetX(i2);
2763
2764 Double_t x1 =GetXrow(i1);
2765 Double_t xx2=GetXrow(i2);
2766
2767 Double_t x3=GetX(), y3=GetY(), z3=GetZ();
2768
2769 Int_t imiddle = (i2+i1)/2; //middle pad row index
2770 Double_t xm = GetXrow(imiddle); // radius of middle pad-row
2771 const AliTPCRow& krm=GetRow(sec,imiddle); //middle pad -row
2772 //
2773 Int_t ns =sec;
2774
2775 const AliTPCRow& kr1=GetRow(ns,i1);
2776 Double_t ymax = GetMaxY(i1)-kr1.fDeadZone-1.5;
2777 Double_t ymaxm = GetMaxY(imiddle)-kr1.fDeadZone-1.5;
2778
2779 //
2780 // change cut on curvature if it can't reach this layer
2781 // maximal curvature set to reach it
2782 Double_t dvertexmax = TMath::Sqrt((x1-x3)*(x1-x3)+(ymax+5-y3)*(ymax+5-y3));
2783 if (dvertexmax*0.5*cuts[0]>0.85){
2784 cuts[0] = 0.85/(dvertexmax*0.5+1.);
2785 }
2786 Double_t r2min = 1/(cuts[0]*cuts[0]); //minimal square of radius given by cut
2787
2788 // Int_t ddsec = 1;
2789 if (deltay>0) ddsec = 0;
2790 // loop over clusters
2791 for (Int_t is=0; is < kr1; is++) {
2792 //
2793 if (kr1[is]->IsUsed(10)) continue;
2794 Double_t y1=kr1[is]->GetY(), z1=kr1[is]->GetZ();
2795 //if (TMath::Abs(y1)>ymax) continue;
2796
2797 if (deltay>0 && TMath::Abs(ymax-TMath::Abs(y1))> deltay ) continue; // seed only at the edge
2798
2799 // find possible directions
2800 Float_t anglez = (z1-z3)/(x1-x3);
2801 Float_t extraz = z1 - anglez*(x1-xx2); // extrapolated z
2802 //
2803 //
2804 //find rotation angles relative to line given by vertex and point 1
2805 Double_t dvertex2 = (x1-x3)*(x1-x3)+(y1-y3)*(y1-y3);
2806 Double_t dvertex = TMath::Sqrt(dvertex2);
2807 Double_t angle13 = TMath::ATan((y1-y3)/(x1-x3));
2808 Double_t cs13 = cos(-angle13), sn13 = sin(-angle13);
2809
2810 //
2811 // loop over 2 sectors
2812 Int_t dsec1=-ddsec;
2813 Int_t dsec2= ddsec;
2814 if (y1<0) dsec2= 0;
2815 if (y1>0) dsec1= 0;
2816
2817 Double_t dddz1=0; // direction of delta inclination in z axis
2818 Double_t dddz2=0;
2819 if ( (z1-z3)>0)
2820 dddz1 =1;
2821 else
2822 dddz2 =1;
2823 //
2824 for (Int_t dsec = dsec1; dsec<=dsec2;dsec++){
2825 Int_t sec2 = sec + dsec;
2826 //
2827 // AliTPCRow& kr2 = fOuterSec[(sec2+fkNOS)%fkNOS][i2];
2828 //AliTPCRow& kr2m = fOuterSec[(sec2+fkNOS)%fkNOS][imiddle];
2829 AliTPCRow& kr2 = GetRow((sec2+fkNOS)%fkNOS,i2);
2830 AliTPCRow& kr2m = GetRow((sec2+fkNOS)%fkNOS,imiddle);
2831 Int_t index1 = TMath::Max(kr2.Find(extraz-0.6-dddz1*TMath::Abs(z1)*0.05)-1,0);
2832 Int_t index2 = TMath::Min(kr2.Find(extraz+0.6+dddz2*TMath::Abs(z1)*0.05)+1,kr2);
2833
2834 // rotation angles to p1-p3
2835 Double_t cs13r = cos(-angle13+dsec*alpha)/dvertex, sn13r = sin(-angle13+dsec*alpha)/dvertex;
2836 Double_t x2, y2, z2;
2837 //
2838 // Double_t dymax = maxangle*TMath::Abs(x1-xx2);
2839
2840 //
2841 Double_t dxx0 = (xx2-x3)*cs13r;
2842 Double_t dyy0 = (xx2-x3)*sn13r;
2843 for (Int_t js=index1; js < index2; js++) {
2844 const AliTPCclusterMI *kcl = kr2[js];
2845 if (kcl->IsUsed(10)) continue;
2846 //
2847 //calcutate parameters
2848 //
2849 Double_t yy0 = dyy0 +(kcl->GetY()-y3)*cs13r;
2850 // stright track
2851 if (TMath::Abs(yy0)<0.000001) continue;
2852 Double_t xx0 = dxx0 -(kcl->GetY()-y3)*sn13r;
2853 Double_t y0 = 0.5*(xx0*xx0+yy0*yy0-xx0)/yy0;
2854 Double_t r02 = (0.25+y0*y0)*dvertex2;
2855 //curvature (radius) cut
2856 if (r02<r2min) continue;
2857
2858 nin0++;
2859 //
2860 Double_t c0 = 1/TMath::Sqrt(r02);
2861 if (yy0>0) c0*=-1.;
2862
2863
2864 //Double_t dfi0 = 2.*TMath::ASin(dvertex*c0*0.5);
2865 //Double_t dfi1 = 2.*TMath::ASin(TMath::Sqrt(yy0*yy0+(1-xx0)*(1-xx0))*dvertex*c0*0.5);
b67e07dc 2866 Double_t dfi0 = 2.*AliTPCFastMath::FastAsin(dvertex*c0*0.5);
2867 Double_t dfi1 = 2.*AliTPCFastMath::FastAsin(TMath::Sqrt(yy0*yy0+(1-xx0)*(1-xx0))*dvertex*c0*0.5);
91162307 2868 //
2869 //
2870 Double_t z0 = kcl->GetZ();
2871 Double_t zzzz2 = z1-(z1-z3)*dfi1/dfi0;
2872 if (TMath::Abs(zzzz2-z0)>0.5) continue;
2873 nin1++;
2874 //
2875 Double_t dip = (z1-z0)*c0/dfi1;
2876 Double_t x0 = (0.5*cs13+y0*sn13)*dvertex*c0;
2877 //
2878 y2 = kcl->GetY();
2879 if (dsec==0){
2880 x2 = xx2;
2881 z2 = kcl->GetZ();
2882 }
2883 else
2884 {
2885 // rotation
2886 z2 = kcl->GetZ();
2887 x2= xx2*cs-y2*sn*dsec;
2888 y2=+xx2*sn*dsec+y2*cs;
2889 }
2890
2891 x[0] = y1;
2892 x[1] = z1;
2893 x[2] = x0;
2894 x[3] = dip;
2895 x[4] = c0;
2896 //
2897 //
2898 // do we have cluster at the middle ?
2899 Double_t ym,zm;
2900 GetProlongation(x1,xm,x,ym,zm);
2901 UInt_t dummy;
2902 AliTPCclusterMI * cm=0;
2903 if (TMath::Abs(ym)-ymaxm<0){
2904 cm = krm.FindNearest2(ym,zm,1.0,0.6,dummy);
2905 if ((!cm) || (cm->IsUsed(10))) {
2906 continue;
2907 }
2908 }
2909 else{
2910 // rotate y1 to system 0
2911 // get state vector in rotated system
2912 Double_t yr1 = (-0.5*sn13+y0*cs13)*dvertex*c0;
2913 Double_t xr2 = x0*cs+yr1*sn*dsec;
2914 Double_t xr[5]={kcl->GetY(),kcl->GetZ(), xr2, dip, c0};
2915 //
2916 GetProlongation(xx2,xm,xr,ym,zm);
2917 if (TMath::Abs(ym)-ymaxm<0){
2918 cm = kr2m.FindNearest2(ym,zm,1.0,0.6,dummy);
2919 if ((!cm) || (cm->IsUsed(10))) {
2920 continue;
2921 }
2922 }
2923 }
2924
2925
2926 Double_t dym = 0;
2927 Double_t dzm = 0;
2928 if (cm){
2929 dym = ym - cm->GetY();
2930 dzm = zm - cm->GetZ();
2931 }
2932 nin2++;
2933
2934
2935 //
2936 //
2937 Double_t sy1=kr1[is]->GetSigmaY2()*2., sz1=kr1[is]->GetSigmaZ2()*2.;
2938 Double_t sy2=kcl->GetSigmaY2()*2., sz2=kcl->GetSigmaZ2()*2.;
2939 //Double_t sy3=400*3./12., sy=0.1, sz=0.1;
2940 Double_t sy3=25000*x[4]*x[4]+0.1, sy=0.1, sz=0.1;
2941 //Double_t sy3=25000*x[4]*x[4]*60+0.5, sy=0.1, sz=0.1;
2942
b67e07dc 2943 Double_t f40=(F1(x1,y1+sy,x2,y2,x3,y3)-x[4])/sy;
2944 Double_t f42=(F1(x1,y1,x2,y2+sy,x3,y3)-x[4])/sy;
2945 Double_t f43=(F1(x1,y1,x2,y2,x3,y3+sy)-x[4])/sy;
2946 Double_t f20=(F2(x1,y1+sy,x2,y2,x3,y3)-x[2])/sy;
2947 Double_t f22=(F2(x1,y1,x2,y2+sy,x3,y3)-x[2])/sy;
2948 Double_t f23=(F2(x1,y1,x2,y2,x3,y3+sy)-x[2])/sy;
91162307 2949
b67e07dc 2950 Double_t f30=(F3(x1,y1+sy,x2,y2,z1,z2)-x[3])/sy;
2951 Double_t f31=(F3(x1,y1,x2,y2,z1+sz,z2)-x[3])/sz;
2952 Double_t f32=(F3(x1,y1,x2,y2+sy,z1,z2)-x[3])/sy;
2953 Double_t f34=(F3(x1,y1,x2,y2,z1,z2+sz)-x[3])/sz;
91162307 2954
1c53abe2 2955 c[0]=sy1;
2956 c[1]=0.; c[2]=sz1;
2957 c[3]=f20*sy1; c[4]=0.; c[5]=f20*sy1*f20+f22*sy2*f22+f23*sy3*f23;
2958 c[6]=f30*sy1; c[7]=f31*sz1; c[8]=f30*sy1*f20+f32*sy2*f22;
2959 c[9]=f30*sy1*f30+f31*sz1*f31+f32*sy2*f32+f34*sz2*f34;
2960 c[10]=f40*sy1; c[11]=0.; c[12]=f40*sy1*f20+f42*sy2*f22+f43*sy3*f23;
2961 c[13]=f30*sy1*f40+f32*sy2*f42;
2962 c[14]=f40*sy1*f40+f42*sy2*f42+f43*sy3*f43;
91162307 2963
2964 // if (!BuildSeed(kr1[is],kcl,0,x1,x2,x3,x,c)) continue;
2965
1c53abe2 2966 UInt_t index=kr1.GetIndex(is);
91162307 2967 AliTPCseed *track=new(seed) AliTPCseed(index, x, c, x1, ns*alpha+shift);
2968
1c53abe2 2969 track->fIsSeeding = kTRUE;
91162307 2970 track->fSeed1 = i1;
2971 track->fSeed2 = i2;
2972 track->fSeedType=3;
c9427e08 2973
91162307 2974
2975 //if (dsec==0) {
2976 FollowProlongation(*track, (i1+i2)/2,1);
2977 Int_t foundable,found,shared;
2978 track->GetClusterStatistic((i1+i2)/2,i1, found, foundable, shared, kTRUE);
2979 if ((found<0.55*foundable) || shared>0.5*found || (track->GetSigmaY2()+track->GetSigmaZ2())>0.5){
2980 seed->Reset();
2981 seed->~AliTPCseed();
2982 continue;
2983 }
2984 //}
2985
2986 nin++;
2987 FollowProlongation(*track, i2,1);
2988
2989
2990 //Int_t rc = 1;
2991 track->fBConstrain =1;
2992 // track->fLastPoint = i1+fInnerSec->GetNRows(); // first cluster in track position
2993 track->fLastPoint = i1; // first cluster in track position
2994 track->fFirstPoint = track->fLastPoint;
2995
2996 if (track->GetNumberOfClusters()<(i1-i2)*0.5 ||
2997 track->GetNumberOfClusters() < track->fNFoundable*0.6 ||
2998 track->fNShared>0.4*track->GetNumberOfClusters() ) {
2999 seed->Reset();
3000 seed->~AliTPCseed();
c9427e08 3001 continue;
3002 }
91162307 3003 nout1++;
3004 // Z VERTEX CONDITION
3005 Double_t zv;
3006 zv = track->GetZ()+track->GetTgl()/track->GetC()*
3007 ( asin(-track->GetEta()) - asin(track->GetX()*track->GetC()-track->GetEta()));
3008 if (TMath::Abs(zv-z3)>cuts[2]) {
3009 FollowProlongation(*track, TMath::Max(i2-20,0));
3010 zv = track->GetZ()+track->GetTgl()/track->GetC()*
3011 ( asin(-track->GetEta()) - asin(track->GetX()*track->GetC()-track->GetEta()));
3012 if (TMath::Abs(zv-z3)>cuts[2]){
3013 FollowProlongation(*track, TMath::Max(i2-40,0));
3014 zv = track->GetZ()+track->GetTgl()/track->GetC()*
3015 ( asin(-track->GetEta()) - asin(track->GetX()*track->GetC()-track->GetEta()));
3016 if (TMath::Abs(zv-z3)>cuts[2] &&(track->GetNumberOfClusters() > track->fNFoundable*0.7)){
3017 // make seed without constrain
3018 AliTPCseed * track2 = MakeSeed(track,0.2,0.5,1.);
3019 FollowProlongation(*track2, i2,1);
3020 track2->fBConstrain = kFALSE;
3021 track2->fSeedType = 1;
3022 arr->AddLast(track2);
3023 seed->Reset();
3024 seed->~AliTPCseed();
3025 continue;
3026 }
3027 else{
3028 seed->Reset();
3029 seed->~AliTPCseed();
3030 continue;
3031
3032 }
3033 }
c9427e08 3034 }
1c53abe2 3035
91162307 3036 track->fSeedType =0;
3037 arr->AddLast(track);
3038 seed = new AliTPCseed;
3039 nout2++;
3040 // don't consider other combinations
3041 if (track->GetNumberOfClusters() > track->fNFoundable*0.8)
3042 break;
1c53abe2 3043 }
3044 }
3045 }
6bdc18d6 3046 if (fDebug>3){
3047 Info("MakeSeeds3","\nSeeding statistic:\t%d\t%d\t%d\t%d\t%d\t%d",nin0,nin1,nin2,nin,nout1,nout2);
91162307 3048 }
3049 delete seed;
1c53abe2 3050}
3051
1627d1c4 3052
91162307 3053void AliTPCtrackerMI::MakeSeeds5(TObjArray * arr, Int_t sec, Int_t i1, Int_t i2, Float_t cuts[4],
3054 Float_t deltay) {
3055
3056
3057
1627d1c4 3058 //-----------------------------------------------------------------
91162307 3059 // This function creates track seeds.
1627d1c4 3060 //-----------------------------------------------------------------
91162307 3061 // cuts[0] - fP4 cut
3062 // cuts[1] - tan(phi) cut
3063 // cuts[2] - zvertex cut
3064 // cuts[3] - fP3 cut
3065
3066
3067 Int_t nin0 = 0;
3068 Int_t nin1 = 0;
3069 Int_t nin2 = 0;
3070 Int_t nin = 0;
3071 Int_t nout1 = 0;
3072 Int_t nout2 = 0;
3073 Int_t nout3 =0;
3074 Double_t x[5], c[15];
3075 //
3076 // make temporary seed
3077 AliTPCseed * seed = new AliTPCseed;
1627d1c4 3078 Double_t alpha=fOuterSec->GetAlpha(), shift=fOuterSec->GetAlphaShift();
3079 // Double_t cs=cos(alpha), sn=sin(alpha);
91162307 3080 //
3081 //
1627d1c4 3082
91162307 3083 // first 3 padrows
3084 Double_t x1 = GetXrow(i1-1);
3085 const AliTPCRow& kr1=GetRow(sec,i1-1);
3086 Double_t y1max = GetMaxY(i1-1)-kr1.fDeadZone-1.5;
3087 //
3088 Double_t x1p = GetXrow(i1);
3089 const AliTPCRow& kr1p=GetRow(sec,i1);
3090 //
3091 Double_t x1m = GetXrow(i1-2);
3092 const AliTPCRow& kr1m=GetRow(sec,i1-2);
1627d1c4 3093
91162307 3094 //
3095 //last 3 padrow for seeding
3096 AliTPCRow& kr3 = GetRow((sec+fkNOS)%fkNOS,i1-7);
3097 Double_t x3 = GetXrow(i1-7);
3098 // Double_t y3max= GetMaxY(i1-7)-kr3.fDeadZone-1.5;
3099 //
3100 AliTPCRow& kr3p = GetRow((sec+fkNOS)%fkNOS,i1-6);
3101 Double_t x3p = GetXrow(i1-6);
3102 //
3103 AliTPCRow& kr3m = GetRow((sec+fkNOS)%fkNOS,i1-8);
3104 Double_t x3m = GetXrow(i1-8);
1627d1c4 3105
91162307 3106 //
3107 //
3108 // middle padrow
3109 Int_t im = i1-4; //middle pad row index
3110 Double_t xm = GetXrow(im); // radius of middle pad-row
3111 const AliTPCRow& krm=GetRow(sec,im); //middle pad -row
3112 // Double_t ymmax = GetMaxY(im)-kr1.fDeadZone-1.5;
3113 //
3114 //
3115 Double_t deltax = x1-x3;
3116 Double_t dymax = deltax*cuts[1];
3117 Double_t dzmax = deltax*cuts[3];
3118 //
3119 // loop over clusters
3120 for (Int_t is=0; is < kr1; is++) {
1627d1c4 3121 //
91162307 3122 if (kr1[is]->IsUsed(10)) continue;
3123 Double_t y1=kr1[is]->GetY(), z1=kr1[is]->GetZ();
1627d1c4 3124 //
91162307 3125 if (deltay>0 && TMath::Abs(y1max-TMath::Abs(y1))> deltay ) continue; // seed only at the edge
3126 //
3127 Int_t index1 = TMath::Max(kr3.Find(z1-dzmax)-1,0);
3128 Int_t index2 = TMath::Min(kr3.Find(z1+dzmax)+1,kr3);
3129 //
3130 Double_t y3, z3;
1627d1c4 3131 //
1627d1c4 3132 //
91162307 3133 UInt_t index;
3134 for (Int_t js=index1; js < index2; js++) {
3135 const AliTPCclusterMI *kcl = kr3[js];
3136 if (kcl->IsUsed(10)) continue;
3137 y3 = kcl->GetY();
3138 // apply angular cuts
3139 if (TMath::Abs(y1-y3)>dymax) continue;
3140 x3 = x3;
3141 z3 = kcl->GetZ();
3142 if (TMath::Abs(z1-z3)>dzmax) continue;
3143 //
3144 Double_t angley = (y1-y3)/(x1-x3);
3145 Double_t anglez = (z1-z3)/(x1-x3);
3146 //
3147 Double_t erry = TMath::Abs(angley)*(x1-x1m)*0.5+0.5;
3148 Double_t errz = TMath::Abs(anglez)*(x1-x1m)*0.5+0.5;
3149 //
3150 Double_t yyym = angley*(xm-x1)+y1;
3151 Double_t zzzm = anglez*(xm-x1)+z1;
3152
3153 const AliTPCclusterMI *kcm = krm.FindNearest2(yyym,zzzm,erry,errz,index);
3154 if (!kcm) continue;
3155 if (kcm->IsUsed(10)) continue;
3156
3157 erry = TMath::Abs(angley)*(x1-x1m)*0.4+0.5;
3158 errz = TMath::Abs(anglez)*(x1-x1m)*0.4+0.5;
3159 //
3160 //
3161 //
3162 Int_t used =0;
3163 Int_t found =0;
3164 //
3165 // look around first
3166 const AliTPCclusterMI *kc1m = kr1m.FindNearest2(angley*(x1m-x1)+y1,
3167 anglez*(x1m-x1)+z1,
3168 erry,errz,index);
3169 //
3170 if (kc1m){
3171 found++;
3172 if (kc1m->IsUsed(10)) used++;
1627d1c4 3173 }
91162307 3174 const AliTPCclusterMI *kc1p = kr1p.FindNearest2(angley*(x1p-x1)+y1,
3175 anglez*(x1p-x1)+z1,
3176 erry,errz,index);
1627d1c4 3177 //
91162307 3178 if (kc1p){
3179 found++;
3180 if (kc1p->IsUsed(10)) used++;
1627d1c4 3181 }
91162307 3182 if (used>1) continue;
3183 if (found<1) continue;
1627d1c4 3184
91162307 3185 //
3186 // look around last
3187 const AliTPCclusterMI *kc3m = kr3m.FindNearest2(angley*(x3m-x3)+y3,
3188 anglez*(x3m-x3)+z3,
3189 erry,errz,index);
3190 //
3191 if (kc3m){
3192 found++;
3193 if (kc3m->IsUsed(10)) used++;
3194 }
3195 else
3196 continue;
3197 const AliTPCclusterMI *kc3p = kr3p.FindNearest2(angley*(x3p-x3)+y3,
3198 anglez*(x3p-x3)+z3,
3199 erry,errz,index);
3200 //
3201 if (kc3p){
3202 found++;
3203 if (kc3p->IsUsed(10)) used++;
3204 }
3205 else
3206 continue;
3207 if (used>1) continue;
3208 if (found<3) continue;
3209 //
3210 Double_t x2,y2,z2;
3211 x2 = xm;
3212 y2 = kcm->GetY();
3213 z2 = kcm->GetZ();
3214 //
3215
1627d1c4 3216 x[0]=y1;
3217 x[1]=z1;
b67e07dc 3218 x[4]=F1(x1,y1,x2,y2,x3,y3);
91162307 3219 //if (TMath::Abs(x[4]) >= cuts[0]) continue;
3220 nin0++;
3221 //
b67e07dc 3222 x[2]=F2(x1,y1,x2,y2,x3,y3);
91162307 3223 nin1++;
3224 //
b67e07dc 3225 x[3]=F3n(x1,y1,x2,y2,z1,z2,x[4]);
91162307 3226 //if (TMath::Abs(x[3]) > cuts[3]) continue;
3227 nin2++;
3228 //
3229 //
3230 Double_t sy1=0.1, sz1=0.1;
3231 Double_t sy2=0.1, sz2=0.1;
3232 Double_t sy3=0.1, sy=0.1, sz=0.1;
1627d1c4 3233
b67e07dc 3234 Double_t f40=(F1(x1,y1+sy,x2,y2,x3,y3)-x[4])/sy;
3235 Double_t f42=(F1(x1,y1,x2,y2+sy,x3,y3)-x[4])/sy;
3236 Double_t f43=(F1(x1,y1,x2,y2,x3,y3+sy)-x[4])/sy;
3237 Double_t f20=(F2(x1,y1+sy,x2,y2,x3,y3)-x[2])/sy;
3238 Double_t f22=(F2(x1,y1,x2,y2+sy,x3,y3)-x[2])/sy;
3239 Double_t f23=(F2(x1,y1,x2,y2,x3,y3+sy)-x[2])/sy;
91162307 3240
b67e07dc 3241 Double_t f30=(F3(x1,y1+sy,x2,y2,z1,z2)-x[3])/sy;
3242 Double_t f31=(F3(x1,y1,x2,y2,z1+sz,z2)-x[3])/sz;
3243 Double_t f32=(F3(x1,y1,x2,y2+sy,z1,z2)-x[3])/sy;
3244 Double_t f34=(F3(x1,y1,x2,y2,z1,z2+sz)-x[3])/sz;
1627d1c4 3245
3246 c[0]=sy1;
91162307 3247 c[1]=0.; c[2]=sz1;
1627d1c4 3248 c[3]=f20*sy1; c[4]=0.; c[5]=f20*sy1*f20+f22*sy2*f22+f23*sy3*f23;
3249 c[6]=f30*sy1; c[7]=f31*sz1; c[8]=f30*sy1*f20+f32*sy2*f22;
3250 c[9]=f30*sy1*f30+f31*sz1*f31+f32*sy2*f32+f34*sz2*f34;
3251 c[10]=f40*sy1; c[11]=0.; c[12]=f40*sy1*f20+f42*sy2*f22+f43*sy3*f23;
3252 c[13]=f30*sy1*f40+f32*sy2*f42;
3253 c[14]=f40*sy1*f40+f42*sy2*f42+f43*sy3*f43;
3254
91162307 3255 // if (!BuildSeed(kr1[is],kcl,0,x1,x2,x3,x,c)) continue;
3256
3257 UInt_t index=kr1.GetIndex(is);
3258 AliTPCseed *track=new(seed) AliTPCseed(index, x, c, x1, sec*alpha+shift);
3259
3260 track->fIsSeeding = kTRUE;
3261
3262 nin++;
3263 FollowProlongation(*track, i1-7,1);
3264 if (track->GetNumberOfClusters() < track->fNFoundable*0.75 ||
3265 track->fNShared>0.6*track->GetNumberOfClusters() || ( track->GetSigmaY2()+ track->GetSigmaZ2())>0.6){
3266 seed->Reset();
3267 seed->~AliTPCseed();
3268 continue;
3269 }
3270 nout1++;
3271 nout2++;
3272 //Int_t rc = 1;
3273 FollowProlongation(*track, i2,1);
3274 track->fBConstrain =0;
3275 track->fLastPoint = i1+fInnerSec->GetNRows(); // first cluster in track position
3276 track->fFirstPoint = track->fLastPoint;
3277
3278 if (track->GetNumberOfClusters()<(i1-i2)*0.5 ||
3279 track->GetNumberOfClusters()<track->fNFoundable*0.7 ||
3280 track->fNShared>2. || track->GetChi2()/track->GetNumberOfClusters()>6 || ( track->GetSigmaY2()+ track->GetSigmaZ2())>0.5 ) {
3281 seed->Reset();
3282 seed->~AliTPCseed();
3283 continue;
3284 }
3285
3286 {
3287 FollowProlongation(*track, TMath::Max(i2-10,0),1);
3288 AliTPCseed * track2 = MakeSeed(track,0.2,0.5,0.9);
3289 FollowProlongation(*track2, i2,1);
3290 track2->fBConstrain = kFALSE;
3291 track2->fSeedType = 4;
3292 arr->AddLast(track2);
3293 seed->Reset();
3294 seed->~AliTPCseed();
3295 }
3296
3297
3298 //arr->AddLast(track);
3299 //seed = new AliTPCseed;
3300 nout3++;
3301 }
3302 }
3303
6bdc18d6 3304 if (fDebug>3){
3305 Info("MakeSeeds5","\nSeeding statiistic:\t%d\t%d\t%d\t%d\t%d\t%d",nin0,nin1,nin2,nin,nout1,nout2,nout3);
91162307 3306 }
3307 delete seed;
3308}
3309
3310
3311//_____________________________________________________________________________
176aff27 3312void AliTPCtrackerMI::MakeSeeds2(TObjArray * arr, Int_t sec, Int_t i1, Int_t i2, Float_t */*cuts[4]*/,
3313 Float_t deltay, Bool_t /*bconstrain*/) {
91162307 3314 //-----------------------------------------------------------------
3315 // This function creates track seeds - without vertex constraint
3316 //-----------------------------------------------------------------
3317 // cuts[0] - fP4 cut - not applied
3318 // cuts[1] - tan(phi) cut
3319 // cuts[2] - zvertex cut - not applied
3320 // cuts[3] - fP3 cut
3321 Int_t nin0=0;
3322 Int_t nin1=0;
3323 Int_t nin2=0;
3324 Int_t nin3=0;
3325 // Int_t nin4=0;
3326 //Int_t nin5=0;
3327
3328
3329
3330 Double_t alpha=fOuterSec->GetAlpha(), shift=fOuterSec->GetAlphaShift();
3331 // Double_t cs=cos(alpha), sn=sin(alpha);
3332 Int_t row0 = (i1+i2)/2;
3333 Int_t drow = (i1-i2)/2;
3334 const AliTPCRow& kr0=fSectors[sec][row0];
3335 AliTPCRow * kr=0;
3336
3337 AliTPCpolyTrack polytrack;
3338 Int_t nclusters=fSectors[sec][row0];
3339 AliTPCseed * seed = new AliTPCseed;
3340
3341 Int_t sumused=0;
3342 Int_t cused=0;
3343 Int_t cnused=0;
3344 for (Int_t is=0; is < nclusters; is++) { //LOOP over clusters
3345 Int_t nfound =0;
3346 Int_t nfoundable =0;
3347 for (Int_t iter =1; iter<2; iter++){ //iterations
3348 const AliTPCRow& krm=fSectors[sec][row0-iter];
3349 const AliTPCRow& krp=fSectors[sec][row0+iter];
3350 const AliTPCclusterMI * cl= kr0[is];
3351
3352 if (cl->IsUsed(10)) {
3353 cused++;
3354 }
3355 else{
3356 cnused++;
3357 }
3358 Double_t x = kr0.GetX();
3359 // Initialization of the polytrack
3360 nfound =0;
3361 nfoundable =0;
3362 polytrack.Reset();
3363 //
3364 Double_t y0= cl->GetY();
3365 Double_t z0= cl->GetZ();
3366 Float_t erry = 0;
3367 Float_t errz = 0;
3368
3369 Double_t ymax = fSectors->GetMaxY(row0)-kr0.fDeadZone-1.5;
3370 if (deltay>0 && TMath::Abs(ymax-TMath::Abs(y0))> deltay ) continue; // seed only at the edge
3371
3372 erry = (0.5)*cl->GetSigmaY2()/TMath::Sqrt(cl->GetQ())*6;
3373 errz = (0.5)*cl->GetSigmaZ2()/TMath::Sqrt(cl->GetQ())*6;
3374 polytrack.AddPoint(x,y0,z0,erry, errz);
3375
3376 sumused=0;
3377 if (cl->IsUsed(10)) sumused++;
3378
3379
3380 Float_t roady = (5*TMath::Sqrt(cl->GetSigmaY2()+0.2)+1.)*iter;
3381 Float_t roadz = (5*TMath::Sqrt(cl->GetSigmaZ2()+0.2)+1.)*iter;
3382 //
3383 x = krm.GetX();
3384 AliTPCclusterMI * cl1 = krm.FindNearest(y0,z0,roady,roadz);
3385 if (cl1 && TMath::Abs(ymax-TMath::Abs(y0))) {
3386 erry = (0.5)*cl1->GetSigmaY2()/TMath::Sqrt(cl1->GetQ())*3;
3387 errz = (0.5)*cl1->GetSigmaZ2()/TMath::Sqrt(cl1->GetQ())*3;
3388 if (cl1->IsUsed(10)) sumused++;
3389 polytrack.AddPoint(x,cl1->GetY(),cl1->GetZ(),erry,errz);
3390 }
3391 //
3392 x = krp.GetX();
3393 AliTPCclusterMI * cl2 = krp.FindNearest(y0,z0,roady,roadz);
3394 if (cl2) {
3395 erry = (0.5)*cl2->GetSigmaY2()/TMath::Sqrt(cl2->GetQ())*3;
3396 errz = (0.5)*cl2->GetSigmaZ2()/TMath::Sqrt(cl2->GetQ())*3;
3397 if (cl2->IsUsed(10)) sumused++;
3398 polytrack.AddPoint(x,cl2->GetY(),cl2->GetZ(),erry,errz);
3399 }
3400 //
3401 if (sumused>0) continue;
3402 nin0++;
3403 polytrack.UpdateParameters();
3404 // follow polytrack
3405 roadz = 1.2;
3406 roady = 1.2;
3407 //
3408 Double_t yn,zn;
3409 nfoundable = polytrack.GetN();
3410 nfound = nfoundable;
3411 //
3412 for (Int_t ddrow = iter+1; ddrow<drow;ddrow++){
3413 Float_t maxdist = 0.8*(1.+3./(ddrow));
3414 for (Int_t delta = -1;delta<=1;delta+=2){
3415 Int_t row = row0+ddrow*delta;
3416 kr = &(fSectors[sec][row]);
3417 Double_t xn = kr->GetX();
3418 Double_t ymax = fSectors->GetMaxY(row)-kr->fDeadZone-1.5;
3419 polytrack.GetFitPoint(xn,yn,zn);
3420 if (TMath::Abs(yn)>ymax) continue;
3421 nfoundable++;
3422 AliTPCclusterMI * cln = kr->FindNearest(yn,zn,roady,roadz);
3423 if (cln) {
3424 Float_t dist = TMath::Sqrt( (yn-cln->GetY())*(yn-cln->GetY())+(zn-cln->GetZ())*(zn-cln->GetZ()));
3425 if (dist<maxdist){
3426 /*
3427 erry = (dist+0.3)*cln->GetSigmaY2()/TMath::Sqrt(cln->GetQ())*(1.+1./(ddrow));
3428 errz = (dist+0.3)*cln->GetSigmaZ2()/TMath::Sqrt(cln->GetQ())*(1.+1./(ddrow));
3429 if (cln->IsUsed(10)) {
3430 // printf("used\n");
3431 sumused++;
3432 erry*=2;
3433 errz*=2;
3434 }
3435 */
3436 erry=0.1;
3437 errz=0.1;
3438 polytrack.AddPoint(xn,cln->GetY(),cln->GetZ(),erry, errz);
3439 nfound++;
3440 }
3441 }
3442 }
3443 if ( (sumused>3) || (sumused>0.5*nfound) || (nfound<0.6*nfoundable)) break;
3444 polytrack.UpdateParameters();
3445 }
3446 }
3447 if ( (sumused>3) || (sumused>0.5*nfound)) {
3448 //printf("sumused %d\n",sumused);
3449 continue;
3450 }
3451 nin1++;
3452 Double_t dy,dz;
3453 polytrack.GetFitDerivation(kr0.GetX(),dy,dz);
3454 AliTPCpolyTrack track2;
3455
3456 polytrack.Refit(track2,0.5+TMath::Abs(dy)*0.3,0.4+TMath::Abs(dz)*0.3);
3457 if (track2.GetN()<0.5*nfoundable) continue;
3458 nin2++;
3459
3460 if ((nfound>0.6*nfoundable) &&( nfoundable>0.4*(i1-i2))) {
3461 //
3462 // test seed with and without constrain
3463 for (Int_t constrain=0; constrain<=0;constrain++){