]>
Commit | Line | Data |
---|---|---|
46d29e70 | 1 | /************************************************************************** |
2 | * Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. * | |
3 | * * | |
4 | * Author: The ALICE Off-line Project. * | |
5 | * Contributors are mentioned in the code where appropriate. * | |
6 | * * | |
7 | * Permission to use, copy, modify and distribute this software and its * | |
8 | * documentation strictly for non-commercial purposes is hereby granted * | |
9 | * without fee, provided that the above copyright notice appears in all * | |
10 | * copies and that both the copyright notice and this permission notice * | |
11 | * appear in the supporting documentation. The authors make no claims * | |
12 | * about the suitability of this software for any purpose. It is * | |
13 | * provided "as is" without express or implied warranty. * | |
14 | **************************************************************************/ | |
15 | ||
16 | /* | |
17 | $Log$ | |
71d9fa7b | 18 | Revision 1.8 2000/12/20 13:00:44 cblume |
19 | Modifications for the HP-compiler | |
20 | ||
d1b06c24 | 21 | Revision 1.7 2000/12/08 16:07:02 cblume |
22 | Update of the tracking by Sergei | |
23 | ||
bbf92647 | 24 | Revision 1.6 2000/11/30 17:38:08 cblume |
25 | Changes to get in line with new STEER and EVGEN | |
26 | ||
1819f4bb | 27 | Revision 1.5 2000/11/14 14:40:27 cblume |
28 | Correction for the Sun compiler (kTRUE and kFALSE) | |
29 | ||
57527628 | 30 | Revision 1.4 2000/11/10 14:57:52 cblume |
31 | Changes in the geometry constants for the DEC compiler | |
32 | ||
dd56b762 | 33 | Revision 1.3 2000/10/15 23:40:01 cblume |
34 | Remove AliTRDconst | |
35 | ||
0e9c2ad5 | 36 | Revision 1.2 2000/10/06 16:49:46 cblume |
37 | Made Getters const | |
38 | ||
46d29e70 | 39 | Revision 1.1.2.2 2000/10/04 16:34:58 cblume |
40 | Replace include files by forward declarations | |
41 | ||
42 | Revision 1.1.2.1 2000/09/22 14:47:52 cblume | |
43 | Add the tracking code | |
44 | ||
45 | */ | |
bbf92647 | 46 | |
1819f4bb | 47 | #include <iostream.h> |
46d29e70 | 48 | |
49 | #include <TFile.h> | |
50 | #include <TROOT.h> | |
51 | #include <TBranch.h> | |
52 | #include <TTree.h> | |
53 | ||
54 | #include "AliRun.h" | |
46d29e70 | 55 | #include "AliTRD.h" |
46d29e70 | 56 | #include "AliTRDgeometry.h" |
57 | #include "AliTRDrecPoint.h" | |
58 | #include "AliTRDcluster.h" | |
59 | #include "AliTRDtrack.h" | |
60 | #include "AliTRDtrackingSector.h" | |
61 | #include "AliTRDtimeBin.h" | |
62 | ||
63 | #include "AliTRDtracker.h" | |
64 | ||
65 | ClassImp(AliTRDtracker) | |
66 | ||
bbf92647 | 67 | const Int_t AliTRDtracker::fSeedGap = 35; |
68 | const Int_t AliTRDtracker::fSeedStep = 5; | |
69 | ||
70 | ||
71 | const Float_t AliTRDtracker::fMinClustersInTrack = 0.5; | |
72 | const Float_t AliTRDtracker::fMinClustersInSeed = 0.5; | |
73 | const Float_t AliTRDtracker::fSeedDepth = 0.5; | |
74 | const Float_t AliTRDtracker::fSkipDepth = 0.2; | |
75 | const Float_t AliTRDtracker::fMaxSeedDeltaZ = 30.; | |
76 | const Float_t AliTRDtracker::fMaxSeedC = 0.01; | |
77 | const Float_t AliTRDtracker::fMaxSeedTan = 1.2; | |
78 | const Float_t AliTRDtracker::fMaxSeedVertexZ = 200.; | |
79 | const Float_t AliTRDtracker::fLabelFraction = 0.5; | |
80 | const Float_t AliTRDtracker::fWideRoad = 30.; | |
81 | ||
82 | const Double_t AliTRDtracker::fMaxChi2 = 12.; | |
83 | const Double_t AliTRDtracker::fSeedErrorSY = 0.1; | |
84 | const Double_t AliTRDtracker::fSeedErrorSY3 = 2.5; | |
85 | const Double_t AliTRDtracker::fSeedErrorSZ = 0.1; | |
86 | ||
46d29e70 | 87 | //____________________________________________________________________ |
88 | AliTRDtracker::AliTRDtracker() | |
89 | { | |
90 | // | |
91 | // Default constructor | |
92 | // | |
93 | ||
46d29e70 | 94 | fEvent = 0; |
46d29e70 | 95 | fGeom = NULL; |
bbf92647 | 96 | |
46d29e70 | 97 | fNclusters = 0; |
98 | fClusters = NULL; | |
99 | fNseeds = 0; | |
100 | fSeeds = NULL; | |
101 | fNtracks = 0; | |
102 | fTracks = NULL; | |
103 | ||
104 | } | |
105 | ||
106 | //____________________________________________________________________ | |
107 | AliTRDtracker::AliTRDtracker(const Text_t* name, const Text_t* title) | |
108 | :TNamed(name, title) | |
109 | { | |
46d29e70 | 110 | fEvent = 0; |
46d29e70 | 111 | fGeom = NULL; |
bbf92647 | 112 | |
46d29e70 | 113 | fNclusters = 0; |
114 | fClusters = new TObjArray(2000); | |
115 | fNseeds = 0; | |
116 | fSeeds = new TObjArray(20000); | |
117 | fNtracks = 0; | |
118 | fTracks = new TObjArray(10000); | |
119 | ||
120 | } | |
121 | ||
46d29e70 | 122 | //___________________________________________________________________ |
123 | AliTRDtracker::~AliTRDtracker() | |
124 | { | |
46d29e70 | 125 | delete fClusters; |
126 | delete fTracks; | |
127 | delete fSeeds; | |
128 | delete fGeom; | |
129 | } | |
130 | ||
bbf92647 | 131 | //___________________________________________________________________ |
132 | void AliTRDtracker::Clusters2Tracks() | |
133 | { | |
134 | Int_t inner, outer; | |
135 | Int_t fTotalNofTimeBins = fGeom->GetTimeMax() * AliTRDgeometry::Nplan(); | |
136 | Int_t nSteps = (Int_t) (fTotalNofTimeBins * fSeedDepth)/fSeedStep; | |
137 | ||
138 | for(Int_t i=0; i<nSteps; i++) { | |
139 | printf("step %d out of %d \n", i+1, nSteps); | |
140 | outer=fTotalNofTimeBins-1-i*fSeedStep; inner=outer-fSeedGap; | |
141 | MakeSeeds(inner,outer); | |
142 | FindTracks(); | |
143 | } | |
144 | } | |
46d29e70 | 145 | |
146 | //_____________________________________________________________________ | |
bbf92647 | 147 | Double_t AliTRDtracker::ExpectedSigmaY2(Double_t r, Double_t tgl, Double_t pt) |
46d29e70 | 148 | { |
149 | // Parametrised "expected" error of the cluster reconstruction in Y | |
150 | ||
bbf92647 | 151 | Double_t s = 0.2; |
46d29e70 | 152 | return s; |
153 | } | |
154 | ||
155 | //_____________________________________________________________________ | |
bbf92647 | 156 | Double_t AliTRDtracker::ExpectedSigmaZ2(Double_t r, Double_t tgl) |
46d29e70 | 157 | { |
158 | // Parametrised "expected" error of the cluster reconstruction in Z | |
159 | ||
71d9fa7b | 160 | // Take an example pad size for the time being, check back |
161 | // again with Sergei | |
162 | Double_t s, pad = fGeom->GetRowPadSize(0,2,0); | |
46d29e70 | 163 | s = pad * pad /12.; |
164 | return s; | |
165 | } | |
166 | ||
167 | //_____________________________________________________________________ | |
168 | inline Double_t f1trd(Double_t x1,Double_t y1, | |
169 | Double_t x2,Double_t y2, | |
170 | Double_t x3,Double_t y3) | |
171 | { | |
172 | // Initial approximation of the track curvature | |
173 | // Origin: Iouri Belikov, CERN, Jouri.Belikov@cern.ch | |
174 | ||
175 | Double_t d=(x2-x1)*(y3-y2)-(x3-x2)*(y2-y1); | |
176 | Double_t a=0.5*((y3-y2)*(y2*y2-y1*y1+x2*x2-x1*x1)- | |
177 | (y2-y1)*(y3*y3-y2*y2+x3*x3-x2*x2)); | |
178 | Double_t b=0.5*((x2-x1)*(y3*y3-y2*y2+x3*x3-x2*x2)- | |
179 | (x3-x2)*(y2*y2-y1*y1+x2*x2-x1*x1)); | |
180 | ||
181 | Double_t xr=TMath::Abs(d/(d*x1-a)), yr=d/(d*y1-b); | |
182 | ||
183 | return -xr*yr/sqrt(xr*xr+yr*yr); | |
184 | } | |
185 | ||
186 | //_____________________________________________________________________ | |
187 | inline Double_t f2trd(Double_t x1,Double_t y1, | |
188 | Double_t x2,Double_t y2, | |
189 | Double_t x3,Double_t y3) | |
190 | { | |
191 | // Initial approximation of the track curvature times center of curvature | |
192 | // Origin: Iouri Belikov, CERN, Jouri.Belikov@cern.ch | |
193 | ||
194 | Double_t d=(x2-x1)*(y3-y2)-(x3-x2)*(y2-y1); | |
195 | Double_t a=0.5*((y3-y2)*(y2*y2-y1*y1+x2*x2-x1*x1)- | |
196 | (y2-y1)*(y3*y3-y2*y2+x3*x3-x2*x2)); | |
197 | Double_t b=0.5*((x2-x1)*(y3*y3-y2*y2+x3*x3-x2*x2)- | |
198 | (x3-x2)*(y2*y2-y1*y1+x2*x2-x1*x1)); | |
199 | ||
200 | Double_t xr=TMath::Abs(d/(d*x1-a)), yr=d/(d*y1-b); | |
201 | ||
202 | return -a/(d*y1-b)*xr/sqrt(xr*xr+yr*yr); | |
203 | } | |
204 | ||
205 | //_____________________________________________________________________ | |
206 | inline Double_t f3trd(Double_t x1,Double_t y1, | |
207 | Double_t x2,Double_t y2, | |
208 | Double_t z1,Double_t z2) | |
209 | { | |
210 | // Initial approximation of the tangent of the track dip angle | |
211 | // Origin: Iouri Belikov, CERN, Jouri.Belikov@cern.ch | |
212 | ||
213 | return (z1 - z2)/sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2)); | |
214 | } | |
215 | ||
216 | ||
217 | //___________________________________________________________________ | |
218 | ||
bbf92647 | 219 | Int_t AliTRDtracker::FindProlongation(AliTRDtrack& t, AliTRDtrackingSector *sec, |
d1b06c24 | 220 | Int_t s, Int_t rf) |
46d29e70 | 221 | { |
222 | // Starting from current position on track=t this function tries | |
223 | // to extrapolate the track up to timeBin=rf and to confirm prolongation | |
224 | // if a close cluster is found. *sec is a pointer to allocated | |
225 | // array of sectors, in which the initial sector has index=s. | |
226 | ||
bbf92647 | 227 | const Int_t TIME_BINS_TO_SKIP=Int_t(fSkipDepth*sec->GetNtimeBins()); |
46d29e70 | 228 | Int_t try_again=TIME_BINS_TO_SKIP; |
229 | ||
0e9c2ad5 | 230 | Double_t alpha=AliTRDgeometry::GetAlpha(); |
46d29e70 | 231 | |
232 | Int_t ns=Int_t(2*TMath::Pi()/alpha+0.5); | |
233 | ||
234 | for (Int_t nr=sec->GetTimeBinNumber(t.GetX())-1; nr>=rf; nr--) { | |
235 | Double_t x=sec->GetX(nr), ymax=sec->GetMaxY(nr); | |
236 | if (!t.PropagateTo(x)) { | |
237 | cerr<<"Can't propagate to x = "<<x<<endl; | |
238 | return 0; | |
239 | } | |
240 | ||
241 | AliTRDcluster *cl=0; | |
242 | UInt_t index=0; | |
243 | ||
bbf92647 | 244 | Double_t max_chi2=fMaxChi2; |
245 | ||
46d29e70 | 246 | AliTRDtimeBin& time_bin=sec[s][nr]; |
bbf92647 | 247 | Double_t sy2=ExpectedSigmaY2(t.GetX(),t.GetTgl(),t.GetPt()); |
248 | Double_t sz2=ExpectedSigmaZ2(t.GetX(),t.GetTgl()); | |
46d29e70 | 249 | Double_t road=5.*sqrt(t.GetSigmaY2() + sy2), y=t.GetY(), z=t.GetZ(); |
250 | ||
bbf92647 | 251 | if (road>fWideRoad) { |
46d29e70 | 252 | if (t.GetNclusters() > 4) { |
253 | cerr<<t.GetNclusters()<<" FindProlongation: Road is too wide !\n"; | |
254 | } | |
255 | return 0; | |
256 | } | |
257 | ||
258 | if (time_bin) { | |
259 | for (Int_t i=time_bin.Find(y-road); i<time_bin; i++) { | |
260 | AliTRDcluster* c=(AliTRDcluster*)(time_bin[i]); | |
261 | if (c->GetY() > y+road) break; | |
262 | if (c->IsUsed() > 0) continue; | |
263 | ||
264 | if((c->GetZ()-z)*(c->GetZ()-z) > 25. + sz2) continue; | |
265 | ||
266 | Double_t chi2=t.GetPredictedChi2(c); | |
267 | ||
268 | if (chi2 > max_chi2) continue; | |
269 | max_chi2=chi2; | |
270 | cl=c; | |
271 | index=time_bin.GetIndex(i); | |
272 | } | |
273 | } | |
274 | if (cl) { | |
275 | ||
276 | // Float_t l=sec->GetPitch(); | |
277 | // t.SetSampledEdx(cl->fQ/l,Int_t(t)); | |
278 | ||
279 | t.Update(cl,max_chi2,index); | |
280 | ||
281 | try_again=TIME_BINS_TO_SKIP; | |
282 | } else { | |
283 | if (try_again==0) break; | |
284 | if (y > ymax) { | |
285 | cerr<<"y > ymax: "<<y<<" > "<<ymax<<endl; | |
286 | s = (s+1) % ns; | |
287 | if (!t.Rotate(alpha)) { | |
288 | cerr<<"Failed to rotate, alpha = "<<alpha<<endl; | |
289 | return 0; | |
290 | } | |
291 | } else if (y <-ymax) { | |
292 | cerr<<"y < -ymax: "<<y<<" < "<<-ymax<<endl; | |
293 | s = (s-1+ns) % ns; | |
294 | if (!t.Rotate(-alpha)) { | |
295 | cerr<<"Failed to rotate, alpha = "<<alpha<<endl; | |
296 | return 0; | |
297 | } | |
298 | } | |
299 | try_again--; | |
300 | } | |
301 | } | |
302 | ||
303 | return 1; | |
304 | } | |
305 | ||
306 | ||
307 | ||
308 | //_____________________________________________________________________________ | |
bbf92647 | 309 | void AliTRDtracker::GetEvent(const Char_t *hitfile, const Char_t *clusterfile) |
46d29e70 | 310 | { |
311 | // Opens a ROOT-file with TRD-clusters and reads in the cluster-tree | |
46d29e70 | 312 | |
bbf92647 | 313 | ReadClusters(fClusters, clusterfile); |
314 | ||
315 | // get geometry from the file with hits | |
316 | ||
317 | TFile *fInputFile = (TFile*) gROOT->GetListOfFiles()->FindObject(hitfile); | |
46d29e70 | 318 | if (!fInputFile) { |
319 | printf("AliTRDtracker::Open -- "); | |
bbf92647 | 320 | printf("Open the ALIROOT-file %s.\n",hitfile); |
321 | fInputFile = new TFile(hitfile); | |
46d29e70 | 322 | } |
323 | else { | |
324 | printf("AliTRDtracker::Open -- "); | |
bbf92647 | 325 | printf("%s is already open.\n",hitfile); |
46d29e70 | 326 | } |
327 | ||
328 | // Get AliRun object from file or create it if not on file | |
46d29e70 | 329 | |
bbf92647 | 330 | gAlice = (AliRun*) fInputFile->Get("gAlice"); |
331 | if (gAlice) { | |
332 | printf("AliTRDtracker::GetEvent -- "); | |
333 | printf("AliRun object found on file.\n"); | |
334 | } | |
335 | else { | |
336 | printf("AliTRDtracker::GetEvent -- "); | |
337 | printf("Could not find AliRun object.\n"); | |
338 | } | |
46d29e70 | 339 | |
340 | // Import the Trees for the event nEvent in the file | |
341 | Int_t nparticles = gAlice->GetEvent(fEvent); | |
342 | cerr<<"nparticles = "<<nparticles<<endl; | |
343 | ||
344 | if (nparticles <= 0) { | |
345 | printf("AliTRDtracker::GetEvent -- "); | |
346 | printf("No entries in the trees for event %d.\n",fEvent); | |
347 | } | |
348 | ||
349 | AliTRD *TRD = (AliTRD*) gAlice->GetDetector("TRD"); | |
350 | fGeom = TRD->GetGeometry(); | |
351 | ||
46d29e70 | 352 | } |
353 | ||
354 | ||
355 | //_____________________________________________________________________________ | |
356 | void AliTRDtracker::SetUpSectors(AliTRDtrackingSector *sec) | |
357 | { | |
358 | // Fills clusters into TRD tracking_sectors | |
359 | // Note that the numbering scheme for the TRD tracking_sectors | |
360 | // differs from that of TRD sectors | |
361 | ||
bbf92647 | 362 | for (Int_t i=0; i<AliTRDgeometry::Nsect(); i++) sec[i].SetUp(); |
46d29e70 | 363 | |
364 | // Sort clusters into AliTRDtimeBin's within AliTRDtrackSector's | |
365 | ||
366 | cerr<<"MakeSeeds: sorting clusters"<<endl; | |
367 | ||
368 | Int_t ncl=fClusters->GetEntriesFast(); | |
369 | UInt_t index; | |
370 | while (ncl--) { | |
371 | printf("\r %d left",ncl); | |
372 | AliTRDcluster *c=(AliTRDcluster*)fClusters->UncheckedAt(ncl); | |
373 | Int_t detector=c->GetDetector(), local_time_bin=c->GetLocalTimeBin(); | |
374 | Int_t sector=fGeom->GetSector(detector); | |
375 | ||
376 | Int_t tracking_sector=sector; | |
dd56b762 | 377 | if(sector > 0) tracking_sector = AliTRDgeometry::kNsect - sector; |
46d29e70 | 378 | |
379 | Int_t tb=sec[sector].GetTimeBin(detector,local_time_bin); | |
380 | index=ncl; | |
381 | sec[tracking_sector][tb].InsertCluster(c,index); | |
382 | } | |
383 | printf("\r\n"); | |
384 | } | |
385 | ||
386 | ||
387 | //_____________________________________________________________________________ | |
388 | void AliTRDtracker::MakeSeeds(Int_t inner, Int_t outer) | |
389 | { | |
390 | // Creates track seeds using clusters in timeBins=i1,i2 | |
391 | ||
bbf92647 | 392 | Int_t i2 = inner, i1 = outer; |
46d29e70 | 393 | |
394 | if (!fClusters) return; | |
395 | ||
dd56b762 | 396 | AliTRDtrackingSector fTrSec[AliTRDgeometry::kNsect]; |
46d29e70 | 397 | SetUpSectors(fTrSec); |
398 | ||
399 | // find seeds | |
400 | ||
401 | Double_t x[5], c[15]; | |
dd56b762 | 402 | Int_t max_sec=AliTRDgeometry::kNsect; |
46d29e70 | 403 | |
0e9c2ad5 | 404 | Double_t alpha=AliTRDgeometry::GetAlpha(); |
405 | Double_t shift=AliTRDgeometry::GetAlpha()/2.; | |
46d29e70 | 406 | Double_t cs=cos(alpha), sn=sin(alpha); |
407 | ||
408 | Double_t x1 =fTrSec[0].GetX(i1); | |
409 | Double_t xx2=fTrSec[0].GetX(i2); | |
410 | ||
411 | for (Int_t ns=0; ns<max_sec; ns++) { | |
412 | ||
413 | Int_t nl=fTrSec[(ns-1+max_sec)%max_sec][i2]; | |
414 | Int_t nm=fTrSec[ns][i2]; | |
415 | Int_t nu=fTrSec[(ns+1)%max_sec][i2]; | |
416 | ||
417 | AliTRDtimeBin& r1=fTrSec[ns][i1]; | |
418 | ||
419 | for (Int_t is=0; is < r1; is++) { | |
420 | Double_t y1=r1[is]->GetY(), z1=r1[is]->GetZ(); | |
421 | ||
422 | for (Int_t js=0; js < nl+nm+nu; js++) { | |
423 | const AliTRDcluster *cl; | |
424 | Double_t x2, y2, z2; | |
425 | Double_t x3=0.,y3=0.; | |
426 | ||
427 | if (js<nl) { | |
428 | AliTRDtimeBin& r2=fTrSec[(ns-1+max_sec)%max_sec][i2]; | |
429 | cl=r2[js]; | |
430 | y2=cl->GetY(); z2=cl->GetZ(); | |
431 | ||
432 | x2= xx2*cs+y2*sn; | |
433 | y2=-xx2*sn+y2*cs; | |
434 | ||
435 | } else | |
436 | if (js<nl+nm) { | |
437 | AliTRDtimeBin& r2=fTrSec[ns][i2]; | |
438 | cl=r2[js-nl]; | |
439 | x2=xx2; y2=cl->GetY(); z2=cl->GetZ(); | |
440 | } else { | |
441 | AliTRDtimeBin& r2=fTrSec[(ns+1)%max_sec][i2]; | |
442 | cl=r2[js-nl-nm]; | |
443 | y2=cl->GetY(); z2=cl->GetZ(); | |
444 | ||
445 | x2=xx2*cs-y2*sn; | |
446 | y2=xx2*sn+y2*cs; | |
447 | ||
448 | } | |
449 | ||
450 | Double_t zz=z1 - z1/x1*(x1-x2); | |
451 | ||
bbf92647 | 452 | if (TMath::Abs(zz-z2)>fMaxSeedDeltaZ) continue; |
46d29e70 | 453 | |
454 | Double_t d=(x2-x1)*(0.-y2)-(0.-x2)*(y2-y1); | |
455 | if (d==0.) {cerr<<"TRD MakeSeeds: Straight seed !\n"; continue;} | |
456 | ||
457 | x[0]=y1; | |
458 | x[1]=z1; | |
459 | x[2]=f1trd(x1,y1,x2,y2,x3,y3); | |
460 | ||
bbf92647 | 461 | if (TMath::Abs(x[2]) >= fMaxSeedC) continue; |
46d29e70 | 462 | |
463 | x[3]=f2trd(x1,y1,x2,y2,x3,y3); | |
464 | ||
465 | if (TMath::Abs(x[2]*x1-x[3]) >= 0.99999) continue; | |
466 | ||
467 | x[4]=f3trd(x1,y1,x2,y2,z1,z2); | |
468 | ||
bbf92647 | 469 | if (TMath::Abs(x[4]) > fMaxSeedTan) continue; |
46d29e70 | 470 | |
471 | Double_t a=asin(x[3]); | |
472 | Double_t zv=z1 - x[4]/x[2]*(a+asin(x[2]*x1-x[3])); | |
bbf92647 | 473 | if (TMath::Abs(zv)>fMaxSeedVertexZ) continue; |
46d29e70 | 474 | |
bbf92647 | 475 | Double_t sy1=r1[is]->GetSigmaY2(), sz1=r1[is]->GetSigmaZ2(); |
476 | Double_t sy2=cl->GetSigmaY2(), sz2=cl->GetSigmaZ2(); | |
477 | Double_t sy3=fSeedErrorSY3, sy=fSeedErrorSY, sz=fSeedErrorSZ; | |
46d29e70 | 478 | |
479 | Double_t f20=(f1trd(x1,y1+sy,x2,y2,x3,y3)-x[2])/sy; | |
480 | Double_t f22=(f1trd(x1,y1,x2,y2+sy,x3,y3)-x[2])/sy; | |
481 | Double_t f24=(f1trd(x1,y1,x2,y2,x3,y3+sy)-x[2])/sy; | |
482 | Double_t f30=(f2trd(x1,y1+sy,x2,y2,x3,y3)-x[3])/sy; | |
483 | Double_t f32=(f2trd(x1,y1,x2,y2+sy,x3,y3)-x[3])/sy; | |
484 | Double_t f34=(f2trd(x1,y1,x2,y2,x3,y3+sy)-x[3])/sy; | |
485 | Double_t f40=(f3trd(x1,y1+sy,x2,y2,z1,z2)-x[4])/sy; | |
486 | Double_t f41=(f3trd(x1,y1,x2,y2,z1+sz,z2)-x[4])/sz; | |
487 | Double_t f42=(f3trd(x1,y1,x2,y2+sy,z1,z2)-x[4])/sy; | |
488 | Double_t f43=(f3trd(x1,y1,x2,y2,z1,z2+sz)-x[4])/sz; | |
489 | ||
490 | c[0]=sy1; | |
491 | c[1]=0.; c[2]=sz1; | |
492 | c[3]=f20*sy1; c[4]=0.; c[5]=f20*sy1*f20+f22*sy2*f22+f24*sy3*f24; | |
493 | c[6]=f30*sy1; c[7]=0.; c[8]=f30*sy1*f20+f32*sy2*f22+f34*sy3*f24; | |
494 | c[9]=f30*sy1*f30+f32*sy2*f32+f34*sy3*f34; | |
495 | c[10]=f40*sy1; c[11]=f41*sz1; c[12]=f40*sy1*f20+f42*sy2*f22; | |
496 | c[13]=f40*sy1*f30+f42*sy2*f32; | |
497 | c[14]=f40*sy1*f40+f41*sz1*f41+f42*sy2*f42+f43*sz2*f43; | |
498 | ||
499 | UInt_t index=r1.GetIndex(is); | |
bbf92647 | 500 | AliTRDtrack *track=new AliTRDtrack(index, x, c, x1, ns*alpha+shift); |
46d29e70 | 501 | |
502 | Int_t rc=FindProlongation(*track,fTrSec,ns,i2); | |
503 | ||
bbf92647 | 504 | if ((rc < 0) || |
505 | (track->GetNclusters() < (i1-i2)*fMinClustersInSeed)) delete track; | |
46d29e70 | 506 | else { |
507 | fSeeds->AddLast(track); fNseeds++; | |
508 | cerr<<"found seed "<<fNseeds<<endl; | |
509 | } | |
510 | } | |
511 | } | |
512 | } | |
513 | ||
46d29e70 | 514 | fSeeds->Sort(); |
515 | } | |
516 | ||
517 | //___________________________________________________________________ | |
518 | void AliTRDtracker::FindTracks() | |
519 | { | |
520 | if (!fClusters) return; | |
521 | ||
dd56b762 | 522 | AliTRDtrackingSector fTrSec[AliTRDgeometry::kNsect]; |
46d29e70 | 523 | SetUpSectors(fTrSec); |
524 | ||
525 | // find tracks | |
526 | ||
527 | Int_t num_of_time_bins = fTrSec[0].GetNtimeBins(); | |
528 | Int_t nseed=fSeeds->GetEntriesFast(); | |
529 | ||
530 | Int_t nSeedClusters; | |
531 | for (Int_t i=0; i<nseed; i++) { | |
532 | cerr<<"FindTracks: seed "<<i+1<<" out of "<<nseed<<endl; | |
533 | ||
bbf92647 | 534 | AliTRDtrack& t=*((AliTRDtrack*)fSeeds->UncheckedAt(i)); |
46d29e70 | 535 | |
536 | nSeedClusters = t.GetNclusters(); | |
bbf92647 | 537 | Double_t alpha=t.GetAlpha(); |
46d29e70 | 538 | |
539 | if (alpha > 2.*TMath::Pi()) alpha -= 2.*TMath::Pi(); | |
540 | if (alpha < 0. ) alpha += 2.*TMath::Pi(); | |
dd56b762 | 541 | Int_t ns=Int_t(alpha/AliTRDgeometry::GetAlpha())%AliTRDgeometry::kNsect; |
46d29e70 | 542 | |
543 | if (FindProlongation(t,fTrSec,ns)) { | |
544 | cerr<<"No of clusters in the track = "<<t.GetNclusters()<<endl; | |
bbf92647 | 545 | if (t.GetNclusters() >= Int_t(fMinClustersInTrack*num_of_time_bins)) { |
46d29e70 | 546 | Int_t label = GetTrackLabel(t); |
547 | t.SetLabel(label); | |
46d29e70 | 548 | UseClusters(t); |
bbf92647 | 549 | |
550 | AliTRDtrack *pt = new AliTRDtrack(t); | |
551 | fTracks->AddLast(pt); fNtracks++; | |
552 | ||
46d29e70 | 553 | cerr<<"found track "<<fNtracks<<endl; |
554 | } | |
555 | } | |
bbf92647 | 556 | delete fSeeds->RemoveAt(i); |
46d29e70 | 557 | } |
558 | } | |
559 | ||
560 | //__________________________________________________________________ | |
bbf92647 | 561 | void AliTRDtracker::UseClusters(AliTRDtrack t) { |
46d29e70 | 562 | Int_t ncl=t.GetNclusters(); |
563 | for (Int_t i=0; i<ncl; i++) { | |
564 | Int_t index = t.GetClusterIndex(i); | |
565 | AliTRDcluster *c=(AliTRDcluster*)fClusters->UncheckedAt(index); | |
566 | c->Use(); | |
567 | } | |
568 | } | |
569 | ||
570 | //__________________________________________________________________ | |
bbf92647 | 571 | Int_t AliTRDtracker::GetTrackLabel(AliTRDtrack t) { |
46d29e70 | 572 | |
573 | Int_t label=123456789, index, i, j; | |
574 | Int_t ncl=t.GetNclusters(); | |
bbf92647 | 575 | const Int_t range = AliTRDgeometry::kNplan * fGeom->GetTimeMax(); |
46d29e70 | 576 | Bool_t label_added; |
577 | ||
d1b06c24 | 578 | // Int_t s[range][2]; |
579 | Int_t **s = new Int_t* [range]; | |
580 | for (i=0; i<range; i++) { | |
581 | s[i] = new Int_t[2]; | |
582 | } | |
46d29e70 | 583 | for (i=0; i<range; i++) { |
584 | s[i][0]=-1; | |
585 | s[i][1]=0; | |
586 | } | |
587 | ||
588 | Int_t t0,t1,t2; | |
589 | for (i=0; i<ncl; i++) { | |
590 | index=t.GetClusterIndex(i); | |
591 | AliTRDcluster *c=(AliTRDcluster*)fClusters->UncheckedAt(index); | |
592 | t0=c->GetTrackIndex(0); | |
593 | t1=c->GetTrackIndex(1); | |
594 | t2=c->GetTrackIndex(2); | |
595 | } | |
596 | ||
597 | for (i=0; i<ncl; i++) { | |
598 | index=t.GetClusterIndex(i); | |
599 | AliTRDcluster *c=(AliTRDcluster*)fClusters->UncheckedAt(index); | |
600 | for (Int_t k=0; k<3; k++) { | |
601 | label=c->GetTrackIndex(k); | |
57527628 | 602 | label_added=kFALSE; j=0; |
46d29e70 | 603 | if (label >= 0) { |
604 | while ( (!label_added) && ( j < range ) ) { | |
605 | if (s[j][0]==label || s[j][1]==0) { | |
606 | s[j][0]=label; | |
607 | s[j][1]=s[j][1]+1; | |
57527628 | 608 | label_added=kTRUE; |
46d29e70 | 609 | } |
610 | j++; | |
611 | } | |
612 | } | |
613 | } | |
614 | } | |
615 | ||
46d29e70 | 616 | Int_t max=0; |
617 | label = -123456789; | |
618 | ||
619 | for (i=0; i<range; i++) { | |
620 | if (s[i][1]>max) { | |
621 | max=s[i][1]; label=s[i][0]; | |
622 | } | |
623 | } | |
d1b06c24 | 624 | delete []s; |
bbf92647 | 625 | if(max > ncl*fLabelFraction) return label; |
46d29e70 | 626 | else return -1; |
627 | } | |
628 | ||
629 | //___________________________________________________________________ | |
630 | ||
bbf92647 | 631 | Int_t AliTRDtracker::WriteTracks(const Char_t *filename) { |
46d29e70 | 632 | |
633 | TDirectory *savedir=gDirectory; | |
634 | ||
bbf92647 | 635 | TFile *out=TFile::Open(filename,"RECREATE"); |
46d29e70 | 636 | |
637 | TTree tracktree("TreeT","Tree with TRD tracks"); | |
638 | ||
639 | AliTRDtrack *iotrack=0; | |
640 | tracktree.Branch("tracks","AliTRDtrack",&iotrack,32000,0); | |
641 | ||
642 | Int_t ntracks=fTracks->GetEntriesFast(); | |
643 | ||
644 | for (Int_t i=0; i<ntracks; i++) { | |
645 | AliTRDtrack *pt=(AliTRDtrack*)fTracks->UncheckedAt(i); | |
646 | iotrack=pt; | |
647 | tracktree.Fill(); | |
648 | cerr<<"WriteTracks: put track "<<i<<" in the tree"<<endl; | |
649 | } | |
650 | ||
651 | tracktree.Write(); | |
652 | out->Close(); | |
653 | ||
654 | savedir->cd(); | |
655 | ||
656 | cerr<<"WriteTracks: done"<<endl; | |
657 | return 0; | |
658 | } | |
659 | ||
46d29e70 | 660 | //_____________________________________________________________________________ |
bbf92647 | 661 | void AliTRDtracker::ReadClusters(TObjArray *array, const Char_t *filename, |
d1b06c24 | 662 | Int_t option) |
46d29e70 | 663 | { |
664 | // | |
665 | // Reads AliTRDclusters (option >= 0) or AliTRDrecPoints (option < 0) | |
666 | // from the file. The names of the cluster tree and branches | |
667 | // should match the ones used in AliTRDclusterizer::WriteClusters() | |
668 | // | |
669 | ||
670 | TDirectory *savedir=gDirectory; | |
671 | ||
672 | TFile *file = TFile::Open(filename); | |
673 | if (!file->IsOpen()) {printf("Can't open file %s !\n",filename); return;} | |
674 | ||
bbf92647 | 675 | TTree *tree = (TTree*)file->Get("ClusterTree"); |
46d29e70 | 676 | Int_t nentr = (Int_t) tree->GetEntries(); |
bbf92647 | 677 | printf("found %d entries in %s.\n",nentr,tree->GetName()); |
678 | ||
679 | TBranch *branch; | |
680 | TObjArray *ioArray = new TObjArray(400); | |
681 | ||
682 | if( option < 0 ) { | |
683 | branch = tree->GetBranch("RecPoints"); | |
684 | ||
685 | for (Int_t i=0; i<nentr; i++) { | |
686 | branch->SetAddress(&ioArray); | |
687 | tree->GetEvent(i); | |
688 | Int_t npoints = ioArray->GetEntriesFast(); | |
689 | printf("Read %d rec. points from entry %d \n", npoints, i); | |
690 | ||
691 | for(Int_t j=0; j<npoints; j++) { | |
692 | AliTRDrecPoint *p=(AliTRDrecPoint*)ioArray->UncheckedAt(j); | |
693 | array->AddLast(p); | |
694 | ioArray->RemoveAt(j); | |
695 | } | |
696 | } | |
697 | } | |
698 | else { | |
699 | branch = tree->GetBranch("Clusters"); | |
700 | ||
701 | for (Int_t i=0; i<nentr; i++) { | |
702 | branch->SetAddress(&ioArray); | |
703 | tree->GetEvent(i); | |
704 | Int_t npoints = ioArray->GetEntriesFast(); | |
705 | printf("Read %d clusters from entry %d \n", npoints, i); | |
706 | ||
707 | for(Int_t j=0; j<npoints; j++) { | |
708 | AliTRDcluster *c=(AliTRDcluster*)ioArray->UncheckedAt(j); | |
709 | array->AddLast(c); | |
710 | ioArray->RemoveAt(j); | |
711 | } | |
46d29e70 | 712 | } |
713 | } | |
714 | ||
715 | file->Close(); | |
716 | savedir->cd(); | |
bbf92647 | 717 | |
46d29e70 | 718 | } |
719 |