1 /**************************************************************************
2 * Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *
4 * Author: The ALICE Off-line Project. *
5 * Contributors are mentioned in the code where appropriate. *
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 **************************************************************************/
17 // This class stores a tracklet (a track that lives only in a single TPC
18 // sector). Its objects can be constructed out of TPCseeds, that are
19 // holding the necessary cluster information.
24 #include "AliTPCTracklet.h"
25 #include "TObjArray.h"
26 #include "TLinearFitter.h"
27 #include "AliTPCseed.h"
28 #include "AliESDVertex.h"
29 #include "AliTracker.h"
30 #include "TTreeStream.h"
32 #include "TDecompChol.h"
37 ClassImp(AliTPCTracklet)
39 const Double_t AliTPCTracklet::kB2C=0.299792458e-3;
40 Float_t AliTPCTracklet::fgEdgeCutY=3;
41 Float_t AliTPCTracklet::fgEdgeCutX=0;
43 AliTPCTracklet::AliTPCTracklet()
44 : fNClusters(0),fNStoredClusters(0),fClusters(0),fSector(-1),fOuter(0),
45 fInner(0),fPrimary(0) {
47 // The default constructor. It is intended to be used for I/O only.
51 AliTPCTracklet::AliTPCTracklet(const AliTPCseed *track,Int_t sector,
52 TrackType type,Bool_t storeClusters)
53 : fNClusters(0),fNStoredClusters(0),fClusters(0),fSector(sector),fOuter(0),
54 fInner(0),fPrimary(0) {
56 // Contructor for a tracklet out of a track. Only clusters within a given
60 //TODO: only kalman works
62 for (Int_t i=0;i<160;++i) {
63 AliTPCclusterMI *c=track->GetClusterPointer(i);
64 if (c && RejectCluster(c)) continue;
65 if (c&&c->GetDetector()==sector)
70 fClusters=new AliTPCclusterMI[fNClusters];
71 for (Int_t i=0;i<160;++i) {
72 AliTPCclusterMI *c=track->GetClusterPointer(i);
73 if (c && RejectCluster(c)) continue;
74 if (c&&c->GetDetector()==sector)
75 fClusters[fNStoredClusters]=*c;
82 FitKalman(track,sector);
86 FitLinear(track,sector,type);
89 FitRiemann(track,sector);
95 AliTPCTracklet::AliTPCTracklet(const TObjArray &/*clusters*/,Int_t sector,
96 TrackType /*type*/,Bool_t /*storeClusters*/)
97 : fNClusters(0),fNStoredClusters(0),fClusters(0),fSector(sector),fOuter(0),
98 fInner(0),fPrimary(0) {
102 AliTPCTracklet::AliTPCTracklet(const AliTPCTracklet &t)
103 : TObject(t),fNClusters(t.fNClusters),fNStoredClusters(t.fNStoredClusters),fClusters(0),
104 fSector(t.fSector),fOuter(0),fInner(0),
107 // The copy constructor. You can copy tracklets!
111 fClusters=new AliTPCclusterMI[t.fNStoredClusters];
112 for (int i=0;i<t.fNStoredClusters;++i)
113 fClusters[i]=t.fClusters[i];
116 fOuter=new AliExternalTrackParam(*t.fOuter);
118 fInner=new AliExternalTrackParam(*t.fInner);
120 fPrimary=new AliExternalTrackParam(*t.fPrimary);
123 AliTPCTracklet& AliTPCTracklet::operator=(const AliTPCTracklet &t) {
125 // The assignment constructor. You can assign tracklets!
128 fNClusters=t.fNClusters;
129 fNStoredClusters=fNStoredClusters;
132 fClusters=new AliTPCclusterMI[t.fNStoredClusters];
133 for (int i=0;i<t.fNStoredClusters;++i)
134 fClusters[i]=t.fClusters[i];
143 fOuter=new AliExternalTrackParam(*t.fOuter);
154 fInner=new AliExternalTrackParam(*t.fInner);
163 *fPrimary=*t.fPrimary;
165 fPrimary=new AliExternalTrackParam(*t.fPrimary);
175 AliTPCTracklet::~AliTPCTracklet() {
177 // The destructor. Yes, you can even destruct tracklets.
188 void AliTPCTracklet::FitKalman(const AliTPCseed *track,Int_t sector) {
190 // Fit using Kalman filter
192 AliTPCseed *t=new AliTPCseed(*track);
193 if (!t->Rotate(TMath::DegToRad()*(sector%18*20.+10.)-t->GetAlpha())) {
197 // fit from inner to outer row
199 for (Int_t i=0;i<15;i++) covar[i]=0;
202 covar[5]=10.*10./(64.*64.);
203 covar[9]=10.*10./(64.*64.);
207 AliTPCseed *outerSeed=new AliTPCseed(*t);
209 for (Int_t i=0;i<160;++i) {
211 AliTPCclusterMI *c=t->GetClusterPointer(i);
212 if (c && RejectCluster(c,outerSeed)) continue;
213 if (c&&c->GetDetector()==sector) {
215 outerSeed->ResetCovariance(100.);
216 outerSeed->AddCovariance(covar);
219 Double_t r[3]={c->GetX(),c->GetY(),c->GetZ()};
220 Double_t cov[3]={0.01,0.,0.01}; //TODO: correct error parametrisation
221 if (!outerSeed->PropagateTo(r[0]) ||
222 !static_cast<AliExternalTrackParam*>(outerSeed)->Update(&r[1],cov)) {
230 fOuter=new AliExternalTrackParam(*outerSeed);
231 // fit from outer to inner rows
232 // AliTPCseed *innerSeed=new AliTPCseed(*t);
233 AliTPCseed *innerSeed=0;
234 if (fOuter) innerSeed=new AliTPCseed(*outerSeed);
235 if (!innerSeed) innerSeed=new AliTPCseed(*t);
239 for (Int_t i=159;i>=0;--i) {
240 AliTPCclusterMI *c=t->GetClusterPointer(i);
241 if (c && RejectCluster(c, innerSeed)) continue;
242 if (c&&c->GetDetector()==sector) {
244 innerSeed->ResetCovariance(100.);
245 innerSeed->AddCovariance(covar);
248 Double_t r[3]={c->GetX(),c->GetY(),c->GetZ()};
249 Double_t cov[3]={0.01,0.,0.01};
250 if (!innerSeed->PropagateTo(r[0]) ||
251 !static_cast<AliExternalTrackParam*>(innerSeed)->Update(&r[1],cov)) {
259 fInner=new AliExternalTrackParam(*innerSeed);
260 // propagate to the primary vertex
262 AliTPCseed *primarySeed=new AliTPCseed(*innerSeed);
263 Double_t pos[]={0.,0.,0.};
264 Double_t sigma[]={.1,.1,.1}; //TODO: is this correct?
265 AliESDVertex vertex(pos,sigma);
266 if (primarySeed->PropagateToVertex(&vertex))
267 fPrimary=new AliExternalTrackParam(*primarySeed);
269 // for better comparison one does not want to have alpha changed...
270 if (fPrimary) if (!fPrimary->Rotate(fInner->GetAlpha())) {
282 void AliTPCTracklet::FitKalman(const AliTPCseed *seed,Int_t sector) {
284 // Fit using Kalman filter
286 AliTPCseed *track=new AliTPCseed(*seed);
287 if (!track->Rotate(TMath::DegToRad()*(sector%18*20.+10.)-track->GetAlpha())) {
291 // fit from inner to outer row
293 for (Int_t i=0;i<15;i++) covar[i]=0;
296 covar[5]=10.*10./(64.*64.);
297 covar[9]=10.*10./(64.*64.);
299 Float_t xmin=1000, xmax=-10000;
300 Int_t imin=158, imax=0;
301 for (Int_t i=0;i<160;i++) {
302 AliTPCclusterMI *c=track->GetClusterPointer(i);
304 if (c->GetDetector()!=sector) continue;
305 if (c->GetX()<xmin) xmin=c->GetX();
306 if (c->GetX()>xmax) xmax=c->GetX();
315 for (Float_t x=track->GetX(); x<xmin; x++) track->PropagateTo(x);
316 track->AddCovariance(covar);
318 AliExternalTrackParam paramIn;
319 AliExternalTrackParam paramOut;
324 for (Int_t i=imin; i<=imax; i++){
325 AliTPCclusterMI *c=track->GetClusterPointer(i);
327 if (RejectCluster(c,track)) continue;
328 Double_t r[3]={c->GetX(),c->GetY(),c->GetZ()};
329 Double_t cov[3]={0.01,0.,0.01}; //TODO: correct error parametrisation
330 if (!track->PropagateTo(r[0])) {
334 if ( !((static_cast<AliExternalTrackParam*>(track)->Update(&r[1],cov)))) isOK=kFALSE;
336 if (!isOK) { delete track; return;}
337 track->AddCovariance(covar);
341 for (Int_t i=imax; i>=imin; i--){
342 AliTPCclusterMI *c=track->GetClusterPointer(i);
344 if (RejectCluster(c,track)) continue;
345 Double_t r[3]={c->GetX(),c->GetY(),c->GetZ()};
346 Double_t cov[3]={0.01,0.,0.01}; //TODO: correct error parametrisation
347 if (!track->PropagateTo(r[0])) {
351 if ( !((static_cast<AliExternalTrackParam*>(track)->Update(&r[1],cov)))) isOK=kFALSE;
353 if (!isOK) { delete track; return;}
355 track->AddCovariance(covar);
358 for (Int_t i=imin; i<=imax; i++){
359 AliTPCclusterMI *c=track->GetClusterPointer(i);
361 if (RejectCluster(c,track)) continue;
362 Double_t r[3]={c->GetX(),c->GetY(),c->GetZ()};
363 Double_t cov[3]={0.01,0.,0.01}; //TODO: correct error parametrisation
364 if (!track->PropagateTo(r[0])) {
368 if ( !((static_cast<AliExternalTrackParam*>(track)->Update(&r[1],cov)))) isOK=kFALSE;
370 if (!isOK) { delete track; return;}
375 fOuter=new AliExternalTrackParam(paramOut);
376 fInner=new AliExternalTrackParam(paramIn);
380 // // propagate to the primary vertex
382 // AliExternalTrackParam *param= new AliExternalTrackParam(*fInner);
383 // Double_t pos[]={0.,0.,0.};
384 // Double_t sigma[]={.1,.1,.1}; //TODO: is this correct?
385 // AliESDVertex vertex(pos,sigma);
386 // if (param->PropagateToVertex(&vertex))
387 // fPrimary=new AliExternalTrackParam(*param);
389 // // for better comparison one does not want to have alpha changed...
390 // if (fPrimary) if (!fPrimary->Rotate(fInner->GetAlpha())) {
402 void AliTPCTracklet::FitLinear(const AliTPCseed *track,Int_t sector,
406 fy.StoreData(kFALSE);
407 fz.StoreData(kFALSE);
410 fy.SetFormula("1 ++ x");
411 fz.SetFormula("1 ++ x");
414 fy.SetFormula("1 ++ x ++ x*x");
415 fz.SetFormula("1 ++ x");
423 for (Int_t i=0;i<160;++i) {
424 AliTPCclusterMI *c=track->GetClusterPointer(i);
425 if (c && RejectCluster(c)) continue;
426 if (c&&c->GetDetector()==sector) {
427 Double_t x=c->GetX();
428 fy.AddPoint(&x,c->GetY());
429 fz.AddPoint(&x,c->GetZ());
430 xmax=TMath::Max(xmax,x);
431 xmin=TMath::Min(xmin,x);
436 Double_t a[3]={fy.GetParameter(0),
438 type==kQuadratic?fy.GetParameter(2):0.};
439 Double_t ca[6]={fy.GetCovarianceMatrixElement(0,0),
440 fy.GetCovarianceMatrixElement(1,0),
441 fy.GetCovarianceMatrixElement(1,1),
442 type==kQuadratic?fy.GetCovarianceMatrixElement(2,0):0.,
443 type==kQuadratic?fy.GetCovarianceMatrixElement(2,1):0.,
444 type==kQuadratic?fy.GetCovarianceMatrixElement(2,2):0.};
445 for (int i=0;i<6;++i) ca[i]*=fy.GetChisquare()/fNClusters;
446 Double_t b[2]={fz.GetParameter(0),
448 Double_t cb[3]={fz.GetCovarianceMatrixElement(0,0),
449 fz.GetCovarianceMatrixElement(1,0),
450 fz.GetCovarianceMatrixElement(1,1)};
451 for (int i=0;i<3;++i) cb[i]*=fz.GetChisquare()/fNClusters;
454 Double_t alpha=track->GetAlpha();
455 Quadratic2Helix(a,ca,b,cb,0.,p,c);
456 fPrimary=new AliExternalTrackParam(0.,alpha,p,c);
457 Quadratic2Helix(a,ca,b,cb,xmin,p,c);
458 fInner=new AliExternalTrackParam(xmin,alpha,p,c);
459 Quadratic2Helix(a,ca,b,cb,xmax,p,c);
460 fOuter=new AliExternalTrackParam(xmax,alpha,p,c);
463 void AliTPCTracklet::Quadratic2Helix(Double_t *a,Double_t *ca,
464 Double_t *b,Double_t *cb,
466 Double_t *p,Double_t *c) {
467 // y(x)=a[0]+a[1]*x+a[2]*x^2
469 // parametrises the corosponding helix at x0
471 // get the polynoms at x0
472 Double_t a0=x0*x0*a[2] + x0*a[1] + a[0];
473 Double_t a1=2.*x0*a[2] + a[1];
475 Double_t ca00=ca[0]+x0*(2.*ca[1]+x0*(ca[2]+2.*ca[3]+x0*(2.*ca[4]+x0*ca[5])));
476 Double_t ca10=ca[1]+x0*(ca[2]+2.*ca[3]+x0*(3.*ca[4]+x0*2.*ca[5]));
477 Double_t ca11=ca[2]+x0*4.*(ca[4]+x0*ca[5]);
478 Double_t ca20=ca[3]+x0*(ca[4]+x0*ca[5]);
479 Double_t ca21=ca[3]+x0*2.*ca[5];
482 Double_t b0=x0*b[1] + b[0];
484 Double_t cb00=cb[0]+x0*(2.*cb[1]+x0*cb[2]);
485 Double_t cb10=cb[1]+x0*cb[2];
488 // transform to helix parameters
489 Double_t f =1.+a1*a1;
492 Double_t fi12=TMath::Sqrt(fi);
493 Double_t fi32=fi*fi12;
495 Double_t fi52=fi2*fi12;
496 Double_t fi3 =fi2*fi;
497 Double_t fi5 =fi2*fi3;
499 Double_t xyz[3]={0.}; // TODO...
500 Double_t fc=1./(GetBz(xyz)*kB2C);
506 p[4]=2.*a2*fi32*fc; // 1/pt
511 c[3] =ca10*fi32; // snp-y0
513 c[5] =ca11*fi3; // snp-snp
515 c[7] =cb10; // tgl-z0
517 c[9] =cb11; // tgl-tgl
518 c[10]=2.*(-3.*a1*a2*ca10+f*ca20)*fi3*fc; // 1/pt-y0
520 c[12]=2.*(-3.*a1*a2*ca11+f*ca21)*fi52*fc; // 1/pt-snp
521 c[13]=0.; // 1/pt-tgl
522 c[14]=(-12.*a1*a2*(-3.*a1*a2*ca11+2.*f*ca21)+4.*f2*ca22)*fi5
527 void AliTPCTracklet::FitRiemann(const AliTPCseed *track,Int_t sector) {
529 fy.StoreData(kFALSE);
530 fy.SetFormula("hyp2");
533 for (Int_t i=0;i<160;++i) {
534 AliTPCclusterMI *c=track->GetClusterPointer(i);
535 if (c && RejectCluster(c)) continue;
536 if (c&&c->GetDetector()==sector) {
537 Double_t x=c->GetX();
538 Double_t y=c->GetY();
539 Double_t xy[2]={x,y};
541 Double_t errx=1.,erry=1.;//TODO!
542 Double_t err=TMath::Sqrt(4.*x*x*errx+4.*y*y*erry);
544 fy.AddPoint(xy,r,err);
545 xmax=TMath::Max(xmax,x);
546 xmin=TMath::Min(xmin,x);
550 Double_t a[3]={fy.GetParameter(0),
553 Double_t ca[6]={fy.GetCovarianceMatrixElement(0,0),
554 fy.GetCovarianceMatrixElement(1,0),
555 fy.GetCovarianceMatrixElement(1,1),
556 fy.GetCovarianceMatrixElement(2,0),
557 fy.GetCovarianceMatrixElement(2,1),
558 fy.GetCovarianceMatrixElement(2,2)};
561 fz.StoreData(kFALSE);
562 fz.SetFormula("hyp1");
563 Double_t R=.5*TMath::Sqrt(4.*a[0]+a[1]*a[1]+a[2]*a[2]);
567 for (Int_t i=0;i<160;++i) {
568 AliTPCclusterMI *c=track->GetClusterPointer(i);
569 if (c && RejectCluster(c)) continue;
570 if (c&&c->GetDetector()==sector) {
571 Double_t x=c->GetX();
572 Double_t y=c->GetY();
575 phi+=2.*TMath::Abs(TMath::ATan2(.5*TMath::Sqrt(dx*dx+dy*dy),R));
577 fz.AddPoint(&phi,c->GetZ(),err);
583 Double_t b[2]={fz.GetParameter(0),
585 Double_t cb[3]={fz.GetCovarianceMatrixElement(0,0),
586 fz.GetCovarianceMatrixElement(1,0),
587 fz.GetCovarianceMatrixElement(1,1)};
591 Double_t alpha=track->GetAlpha();
592 if (Riemann2Helix(a,ca,b,cb,0.,p,c))
593 fPrimary=new AliExternalTrackParam(0.,alpha,p,c);
594 if (Riemann2Helix(a,ca,b,cb,xmin,p,c))
595 fInner=new AliExternalTrackParam(xmin,alpha,p,c);
596 if (Riemann2Helix(a,ca,b,cb,xmax,p,c))
597 fOuter=new AliExternalTrackParam(xmax,alpha,p,c);
600 Bool_t AliTPCTracklet::Riemann2Helix(Double_t *a,Double_t */*ca*/,
601 Double_t *b,Double_t */*cb*/,
603 Double_t *p,Double_t *c) {
606 Double_t xr0=.5*a[1];
607 Double_t yr0=.5*a[2];
608 Double_t R=.5*TMath::Sqrt(4.*a[0]+a[1]*a[1]+a[2]*a[2]);
610 if (dx*dx>=R*R) return kFALSE;
611 Double_t dy=TMath::Sqrt(R*R-dx*dx); //sign!!
612 if (TMath::Abs(yr0+dy)>TMath::Abs(yr0-dy))
615 Double_t tgp=-dx/dy; //TODO: dy!=0
616 Double_t z0=b[0]+TMath::ATan(tgp)*b[1];
617 Double_t xyz[3]={x0,y0,z0};
618 Double_t fc=1./(GetBz(xyz)*kB2C);
622 p[2]=tgp/TMath::Sqrt(1.+tgp*tgp); // snp
624 p[4]=1./R*fc; // 1/pt
638 c[12]=0.; // 1/pt-snp
639 c[13]=0.; // 1/pt-tgl
640 c[14]=0.; // 1/pt-1/pt
645 TObjArray AliTPCTracklet::CreateTracklets(const AliTPCseed *track,
647 Bool_t storeClusters,
649 Int_t maxTracklets) {
650 // The tracklet factory: It creates several tracklets out of a track. They
651 // are created for sectors that fullfill the constraint of having enough
652 // clusters inside. Futhermore you can specify the maximum amount of
653 // tracklets that are to be created.
654 // The tracklets appear in a sorted fashion, beginning with those having the
657 Int_t sectors[72]={0};
658 for (Int_t i=0;i<160;++i) {
659 AliTPCclusterMI *c=track->GetClusterPointer(i);
660 if (c && RejectCluster(c)) continue;
662 ++sectors[c->GetDetector()];
665 TMath::Sort(72,sectors,indices);
667 if (maxTracklets>72) maxTracklets=72; // just to protect against "users".
668 for (Int_t i=0;i<maxTracklets&§ors[indices[i]]>=minClusters;++i) {
669 tracklets.Add(new AliTPCTracklet(track,indices[i],type,storeClusters));
674 TObjArray AliTPCTracklet::CreateTracklets(const TObjArray &/*clusters*/,
676 Bool_t /*storeClusters*/,
677 Int_t /*minClusters*/,
678 Int_t /*maxTracklets*/) {
685 Bool_t AliTPCTracklet::PropagateToMeanX(const AliTPCTracklet &t1,
686 const AliTPCTracklet &t2,
687 AliExternalTrackParam *&t1m,
688 AliExternalTrackParam *&t2m) {
689 // This function propagates two Tracklets to a common x-coordinate. This
690 // x is dermined as the one that is in the middle of the two tracklets (they
691 // are assumed to live on two distinct x-intervalls).
692 // The inner parametrisation of the outer Tracklet and the outer
693 // parametrisation of the inner Tracklet are used and propagated to this
694 // common x. This result is saved not inside the Tracklets but two new
695 // ExternalTrackParams are created (that means you might want to delete
697 // In the case that the alpha angles of the Tracklets differ both angles
698 // are tried out for this propagation.
699 // In case of any failure kFALSE is returned, no AliExternalTrackParam
700 // is created und the pointers are set to 0.
702 if (t1.GetInner() && t1.GetOuter() &&
703 t2.GetInner() && t2.GetOuter()) {
704 if (t1.GetOuter()->GetX()<t2.GetInner()->GetX()) {
705 t1m=new AliExternalTrackParam(*t1.GetOuter());
706 t2m=new AliExternalTrackParam(*t2.GetInner());
709 t1m=new AliExternalTrackParam(*t1.GetInner());
710 t2m=new AliExternalTrackParam(*t2.GetOuter());
712 Double_t mx=.5*(t1m->GetX()+t2m->GetX());
719 if (t1m->Rotate(t2m->GetAlpha())
720 && t1m->PropagateTo(mx,b1)
721 && t2m->PropagateTo(mx,b2));
723 if (t2m->Rotate(t1m->GetAlpha())
724 && t1m->PropagateTo(mx,b1)
725 && t2m->PropagateTo(mx,b2));
738 double AliTPCTracklet::GetBz(Double_t *xyz) {
739 if (AliTracker::UniformField())
740 return AliTracker::GetBz();
742 return AliTracker::GetBz(xyz);
745 void AliTPCTracklet::RandomND(Int_t ndim,const Double_t *p,const Double_t *c,
747 // This function generates a n-dimensional random variable x with mean
748 // p and covariance c.
749 // That is done using the cholesky decomposition of the covariance matrix,
750 // Begin_Latex C=U^{t} U End_Latex, with Begin_Latex U End_Latex being an
751 // upper triangular matrix. Given a vector v of iid gausian random variables
752 // with variance 1 one obtains the asked result as: Begin_Latex x=U^t v
754 // c is expected to be in a lower triangular format:
759 static TRandom3 random;
760 Double_t *c2= new Double_t[ndim*ndim];
762 for (Int_t i=0;i<ndim;++i)
763 for (Int_t j=0;j<=i;++j)
764 c2[i*ndim+j]=c2[j*ndim+i]=c[k++];
765 TMatrixDSym cm(ndim,c2);
767 TDecompChol chol(cm);
769 const TVectorD pv(ndim);
770 const_cast<TVectorD*>(&pv)->Use(ndim,const_cast<Double_t*>(p));
773 for (Int_t i=0;i<ndim;++i)
775 TMatrixD L=chol.GetU();
780 TEllipse AliTPCTracklet::ErrorEllipse(Double_t x,Double_t y,
781 Double_t sx,Double_t sy,Double_t sxy) {
783 r_{1,2}=1/2 (a+c#pm#sqrt{(a-c)^{2}+(2b)^{2}})
785 Double_t det1=1./(sx*sy-sxy*sxy);
787 Double_t b=-sxy*det1;
790 Double_t s=TMath::Sqrt(d*d+4.*b*b);
791 Double_t r1=TMath::Sqrt(.5*(a+c-s));
792 Double_t r2=TMath::Sqrt(.5*(a+c+s));
793 Double_t alpha=.5*TMath::ATan2(2.*b,d);
794 return TEllipse(x,y,r1,r2,0.,360.,alpha*TMath::RadToDeg());
797 void AliTPCTracklet::Test(const char* filename) {
800 AliTPCTracklet::Test("");
801 TFile f("AliTPCTrackletDebug.root");
802 TTree *t=f.Get("AliTPCTrackletDebug");
804 TEllipse e=AliTPCTracklet::ErrorEllipse(0.,0.,4.,1.,1.8);
807 TTreeSRedirector ds(filename);
814 for (Int_t i=0;i<10000;++i) {
817 ds<<"AliTPCTrackletDebug"
830 Double_t param[5]={0.};
831 Double_t covar[15]={1.,
836 AliExternalTrackParam track(x,alpha,param,covar);
840 for (Int_t i=0;i<points.GetNPoints();++i) {
843 Double_t param[5]={0.};
844 Double_t covar[15]={1.,
849 AliExternalTrackParam track(x,alpha,param,covar);
850 for (x=90.;x<250.;x+=1.) {
851 track.PropagateTo(x,b);
859 Bool_t AliTPCTracklet::RejectCluster(AliTPCclusterMI* cl, AliExternalTrackParam * param){
861 // check the acceptance of cluster
862 // Cut on edge effects
864 Bool_t isReject = kFALSE;
865 Float_t edgeY = cl->GetX()*TMath::Tan(TMath::Pi()/18);
866 Float_t dist = edgeY - TMath::Abs(cl->GetY());
867 if (param) dist = edgeY - TMath::Abs(param->GetY());
868 if (dist<fgEdgeCutY) isReject=kTRUE;
869 if (cl->GetType()<0) isReject=kTRUE;