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 **************************************************************************/
18 static int PropagateTo(TVector &x, Double_t fX, Double_t xk) {
19 if (TMath::Abs(x(2)*xk - x(3)) >= 0.999) {
20 cerr<<"Propagation failed !\n";
24 Double_t x1=fX, x2=x1+(xk-x1), dx=x2-x1;//, y1=x(0), z1=x(1);
25 Double_t c1=x(2)*x1 - x(3), r1=sqrt((1.-c1)*(1.+c1));
26 Double_t c2=x(2)*x2 - x(3), r2=sqrt((1.-c2)*(1.+c2));
28 x(0) += dx*(c1+c2)/(r1+r2);
29 x(1) += dx*(c1+c2)/(c1*r2 + c2*r1)*x(4);
34 static int Rotate(TVector &x, Double_t fX, Double_t alpha) {
35 Double_t x1=fX, y1=x(0);
36 Double_t ca=cos(alpha), sa=sin(alpha);
37 Double_t r1=x(2)*fX - x(3);
41 x(3)=x(3)*ca + (x(2)*y1 + sqrt((1.-r1)*(1.+r1)))*sa;
43 Double_t r2=x(2)*fX - x(3);
44 if (TMath::Abs(r2) >= 0.999) {
45 //cerr<<"Rotation failed !\n";
49 Double_t y0=x(0) + sqrt((1.-r2)*(1.+r2))/x(2);
50 if ((x(0)-y0)*x(2) >= 0.) {
51 //cerr<<"Rotation failed !!!\n";
58 //_____________________________________________________________________________
59 static int templ(TVector par, Double_t x, Double_t dy, Double_t dz,
60 const AliTPCSector *sec, int s, int rf=0)
62 //-----------------------------------------------------------------
63 // This function tries to find a track prolongation.
65 // Origin: Iouri Belikov, CERN, Jouri.Belikov@cern.ch
66 //-----------------------------------------------------------------
68 const int ROWS_TO_SKIP=100;
69 int try_again=ROWS_TO_SKIP;
70 Double_t alpha=sec->GetAlpha();
71 int ns=int(2*TMath::Pi()/alpha+0.5);
74 for (int nr=sec->GetRowNumber(x)-1; nr>=rf; nr--,xold=x) {
76 Double_t x=sec->GetX(nr), ymax=sec->GetMaxY(nr);
77 if (!PropagateTo(par,xold,x)) return 0;
80 const AliTPCRow& row=sec[s][nr];
81 Double_t road=dy, y=par(0), z=par(1);
88 for (int i=row.Find(y-road); i<row; i++) {
89 AliTPCcluster* c=(AliTPCcluster*)(row[i]);
90 if (c->fY > y+road) break;
91 if (TMath::Abs(c->fZ - z) > dz) continue;
96 par(0)=cl->fY; par(1)=cl->fZ;
97 //dy=TMath::Sqrt(cl->fSigmaY2); dz=TMath::Sqrt(cl->fSigmaZ2);
98 //cerr<<nr<<' '<<cl->fTracks[0]<<' '<<cl->fTracks[1]<<' '<<cl->fTracks[2]<<endl;
100 try_again=ROWS_TO_SKIP;
102 if (try_again==0) break;
105 if (!Rotate(par,x,alpha)) return 0;
107 } else if (y <-ymax) {
109 if (!Rotate(par,x,-alpha)) return 0;