]>
Commit | Line | Data |
---|---|---|
7f572c00 | 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 | /* $Id$ */ | |
17 | ||
18 | //------------------------------------------------------------------------- | |
19 | // Implementation of the AliHelix class | |
20 | // Origin: Marian Ivanov, CERN, marian.ivanov@cern.ch | |
21 | //------------------------------------------------------------------------- | |
22 | ||
23 | ||
24 | #include "AliHelix.h" | |
25 | #include "AliKalmanTrack.h" | |
51ad6848 | 26 | #include "AliExternalTrackParam.h" |
7f572c00 | 27 | #include "TMath.h" |
28 | ClassImp(AliHelix) | |
29 | ||
30 | ||
31 | //_______________________________________________________________________ | |
32 | AliHelix::AliHelix() | |
33 | { | |
34 | // | |
35 | // Default constructor | |
36 | // | |
37 | for (Int_t i =0;i<9;i++) fHelix[i]=0; | |
38 | } | |
39 | ||
40 | //_______________________________________________________________________ | |
176aff27 | 41 | AliHelix::AliHelix(const AliHelix &t):TObject(t){ |
7f572c00 | 42 | // |
43 | // | |
44 | for (Int_t i=0;i<9;i++) | |
45 | fHelix[i]=t.fHelix[i]; | |
46 | } | |
47 | ||
48 | AliHelix::AliHelix(const AliKalmanTrack &t) | |
49 | { | |
50 | // | |
51 | // | |
52 | Double_t alpha,x,cs,sn; | |
53 | t.GetExternalParameters(x,fHelix); | |
54 | alpha=t.GetAlpha(); | |
55 | // | |
56 | //circle parameters | |
57 | fHelix[4]=fHelix[4]/t.GetConvConst(); // C | |
58 | cs=TMath::Cos(alpha); sn=TMath::Sin(alpha); | |
59 | ||
60 | Double_t xc, yc, rc; | |
61 | rc = 1/fHelix[4]; | |
62 | xc = x-fHelix[2]*rc; | |
63 | yc = fHelix[0]+TMath::Sqrt(1-(x-xc)*(x-xc)*fHelix[4]*fHelix[4])/fHelix[4]; | |
64 | ||
65 | fHelix[6] = xc*cs - yc*sn; | |
66 | fHelix[7] = xc*sn + yc*cs; | |
67 | fHelix[8] = TMath::Abs(rc); | |
68 | // | |
69 | // | |
70 | fHelix[5]=x*cs - fHelix[0]*sn; // x0 | |
71 | fHelix[0]=x*sn + fHelix[0]*cs; // y0 | |
72 | //fHelix[1]= // z0 | |
9be2fe3a | 73 | fHelix[2]=TMath::ATan2(-(fHelix[5]-fHelix[6]),fHelix[0]-fHelix[7]); // phi0 |
74 | if (fHelix[4]>0) fHelix[2]-=TMath::Pi(); | |
75 | ||
7f572c00 | 76 | //fHelix[3]= // tgl |
77 | // | |
78 | // | |
79 | fHelix[5] = fHelix[6]; | |
80 | fHelix[0] = fHelix[7]; | |
7f572c00 | 81 | } |
82 | ||
51ad6848 | 83 | |
84 | AliHelix::AliHelix(const AliExternalTrackParam &t) | |
85 | { | |
86 | // | |
87 | // | |
88 | Double_t alpha,x,cs,sn; | |
89 | const Double_t *param =t.GetParameter(); | |
90 | for (Int_t i=0;i<5;i++) fHelix[i]=param[i]; | |
91 | x = t.X(); | |
92 | alpha=t.Alpha(); | |
93 | // | |
94 | //circle parameters | |
95 | fHelix[4]=fHelix[4]/AliKalmanTrack::GetConvConst(); // C | |
96 | cs=TMath::Cos(alpha); sn=TMath::Sin(alpha); | |
97 | ||
98 | Double_t xc, yc, rc; | |
99 | rc = 1/fHelix[4]; | |
100 | xc = x-fHelix[2]*rc; | |
101 | yc = fHelix[0]+TMath::Sqrt(1-(x-xc)*(x-xc)*fHelix[4]*fHelix[4])/fHelix[4]; | |
102 | ||
103 | fHelix[6] = xc*cs - yc*sn; | |
104 | fHelix[7] = xc*sn + yc*cs; | |
105 | fHelix[8] = TMath::Abs(rc); | |
106 | // | |
107 | // | |
108 | fHelix[5]=x*cs - fHelix[0]*sn; // x0 | |
109 | fHelix[0]=x*sn + fHelix[0]*cs; // y0 | |
110 | //fHelix[1]= // z0 | |
111 | fHelix[2]=TMath::ASin(fHelix[2]) + alpha; // phi0 | |
112 | //fHelix[3]= // tgl | |
113 | // | |
114 | // | |
115 | fHelix[5] = fHelix[6]; | |
116 | fHelix[0] = fHelix[7]; | |
51ad6848 | 117 | } |
118 | ||
7f572c00 | 119 | AliHelix::AliHelix(Double_t x[3], Double_t p[3], Double_t charge, Double_t conversion) |
120 | { | |
121 | // | |
122 | // | |
123 | // | |
124 | Double_t pt = TMath::Sqrt(p[0]*p[0]+p[1]*p[1]); | |
125 | if (TMath::Abs(conversion)<0.00000001) | |
126 | conversion = AliKalmanTrack::GetConvConst(); | |
127 | // | |
128 | // | |
129 | fHelix[4] = charge/(conversion*pt); // C | |
130 | fHelix[3] = p[2]/pt; // tgl | |
131 | // | |
132 | Double_t xc, yc, rc; | |
133 | rc = 1/fHelix[4]; | |
134 | xc = x[0] -rc*p[1]/pt; | |
135 | yc = x[1] +rc*p[0]/pt; | |
136 | // | |
137 | fHelix[5] = x[0]; // x0 | |
138 | fHelix[0] = x[1]; // y0 | |
139 | fHelix[1] = x[2]; // z0 | |
140 | // | |
141 | fHelix[6] = xc; | |
142 | fHelix[7] = yc; | |
143 | fHelix[8] = TMath::Abs(rc); | |
144 | // | |
145 | fHelix[5]=xc; | |
146 | fHelix[0]=yc; | |
147 | // | |
148 | if (TMath::Abs(p[1])<TMath::Abs(p[0])){ | |
149 | fHelix[2]=TMath::ASin(p[1]/pt); | |
150 | if (charge*yc<charge*x[1]) fHelix[2] = TMath::Pi()-fHelix[2]; | |
151 | } | |
152 | else{ | |
153 | fHelix[2]=TMath::ACos(p[0]/pt); | |
154 | if (charge*xc>charge*x[0]) fHelix[2] = -fHelix[2]; | |
155 | } | |
156 | ||
157 | } | |
158 | ||
81e97e0d | 159 | void AliHelix::GetMomentum(Double_t phase, Double_t p[4],Double_t conversion, Double_t *xr) |
7f572c00 | 160 | { |
161 | // return momentum at given phase | |
162 | Double_t x[3],g[3],gg[3]; | |
163 | Evaluate(phase,x,g,gg); | |
164 | if (TMath::Abs(conversion)<0.0001) conversion = AliKalmanTrack::GetConvConst(); | |
165 | Double_t mt = TMath::Sqrt(g[0]*g[0]+g[1]*g[1]); | |
166 | p[0] = fHelix[8]*g[0]/(mt*conversion); | |
167 | p[1] = fHelix[8]*g[1]/(mt*conversion); | |
168 | p[2] = fHelix[8]*g[2]/(mt*conversion); | |
81e97e0d | 169 | if (xr){ |
170 | xr[0] = x[0]; xr[1] = x[1]; xr[2] = x[2]; | |
171 | } | |
7f572c00 | 172 | } |
173 | ||
174 | void AliHelix::GetAngle(Double_t t1, AliHelix &h, Double_t t2, Double_t angle[3]) | |
175 | { | |
176 | // | |
177 | // | |
178 | // | |
179 | Double_t x1[3],g1[3],gg1[3]; | |
180 | Double_t x2[3],g2[3],gg2[3]; | |
181 | Evaluate(t1,x1,g1,gg1); | |
182 | h.Evaluate(t2,x2,g2,gg2); | |
183 | ||
184 | // | |
185 | Double_t norm1r = g1[0]*g1[0]+g1[1]*g1[1]; | |
186 | Double_t norm1 = TMath::Sqrt(norm1r+g1[2]*g1[2]); | |
187 | norm1r = TMath::Sqrt(norm1r); | |
188 | // | |
189 | Double_t norm2r = g2[0]*g2[0]+g2[1]*g2[1]; | |
190 | Double_t norm2 = TMath::Sqrt(norm2r+g2[2]*g2[2]); | |
191 | norm2r = TMath::Sqrt(norm2r); | |
192 | // | |
51ad6848 | 193 | angle[0] = (g1[0]*g2[0]+g1[1]*g2[1])/(norm1r*norm2r); // angle in phi projection |
194 | if (TMath::Abs(angle[0])<1.) angle[0] = TMath::ACos(angle[0]); | |
9be2fe3a | 195 | else{ |
196 | if (angle[0]>0) angle[0] = 0; | |
197 | if (angle[0]<0) angle[0] = TMath::Pi(); | |
198 | } | |
51ad6848 | 199 | // |
200 | angle[1] = ((norm1r*norm2r)+g1[2]*g2[2])/(norm1*norm2); // angle in rz projection | |
201 | if (TMath::Abs(angle[1])<1.) angle[1] = TMath::ACos(angle[1]); | |
9be2fe3a | 202 | else |
203 | angle[1]=0; | |
51ad6848 | 204 | |
205 | angle[2] = (g1[0]*g2[0]+g1[1]*g2[1]+g1[2]*g2[2])/(norm1*norm2); //3D angle | |
206 | if (TMath::Abs(angle[2])<1.) angle[2] = TMath::ACos(angle[2]); | |
9be2fe3a | 207 | else |
208 | angle[2]=0; | |
7f572c00 | 209 | |
51ad6848 | 210 | |
7f572c00 | 211 | |
212 | ||
213 | } | |
214 | ||
215 | ||
216 | void AliHelix::Evaluate(Double_t t, | |
217 | Double_t r[3], //radius vector | |
218 | Double_t g[3], //first defivatives | |
219 | Double_t gg[3]) //second derivatives | |
220 | { | |
221 | //-------------------------------------------------------------------- | |
222 | // Calculate position of a point on a track and some derivatives at given phase | |
223 | //-------------------------------------------------------------------- | |
224 | Double_t phase=fHelix[4]*t+fHelix[2]; | |
225 | Double_t sn=TMath::Sin(phase), cs=TMath::Cos(phase); | |
226 | ||
7f572c00 | 227 | r[0] = fHelix[5] + sn/fHelix[4]; |
228 | r[1] = fHelix[0] - cs/fHelix[4]; | |
229 | r[2] = fHelix[1] + fHelix[3]*t; | |
230 | ||
231 | g[0] = cs; g[1]=sn; g[2]=fHelix[3]; | |
232 | ||
233 | gg[0]=-fHelix[4]*sn; gg[1]=fHelix[4]*cs; gg[2]=0.; | |
234 | } | |
235 | ||
9be2fe3a | 236 | Int_t AliHelix::GetClosestPhases(AliHelix &h, Double_t phase[2][2]) |
237 | { | |
238 | // | |
239 | // get phases to minimize distances | |
240 | // | |
241 | Double_t xyz0[3]; | |
242 | Double_t xyz1[3]; | |
243 | ||
244 | for (Int_t i=0;i<2;i++){ | |
245 | Evaluate(phase[i][0] ,xyz0); | |
246 | h.Evaluate(phase[i][1],xyz1); | |
247 | Double_t mindist = TMath::Sqrt((xyz0[0]-xyz1[0])*(xyz0[0]-xyz1[0])+ | |
248 | (xyz0[1]-xyz1[1])*(xyz0[1]-xyz1[1])+ | |
249 | (xyz0[2]-xyz1[2])*(xyz0[2]-xyz1[2])); | |
250 | Double_t tbest[2]={phase[i][0],phase[i][1]}; | |
251 | for (Int_t i0=-1;i0<=1;i0++){ | |
252 | Double_t t0 = ((phase[i][0]*fHelix[4])+i0*2.*TMath::Pi())/fHelix[4]; | |
253 | Evaluate(t0,xyz0); | |
254 | for (Int_t i1=-1;i1<=1;i1++){ | |
255 | Double_t t1 = ((phase[i][1]*h.fHelix[4])+i1*2.*TMath::Pi())/h.fHelix[4]; | |
256 | h.Evaluate(t1,xyz1); | |
257 | Double_t dist = TMath::Sqrt((xyz0[0]-xyz1[0])*(xyz0[0]-xyz1[0])+ | |
258 | (xyz0[1]-xyz1[1])*(xyz0[1]-xyz1[1])+ | |
259 | (xyz0[2]-xyz1[2])*(xyz0[2]-xyz1[2])); | |
260 | if (dist<=mindist){ | |
261 | tbest[0] = t0; | |
262 | tbest[1] = t1; | |
263 | mindist=dist; | |
264 | } | |
265 | } | |
266 | } | |
267 | phase[i][0] = tbest[0]; | |
268 | phase[i][1] = tbest[1]; | |
269 | } | |
270 | return 1; | |
271 | } | |
272 | ||
81e97e0d | 273 | Double_t AliHelix::GetPointAngle(AliHelix &h, Double_t phase[2], const Float_t * vertex) |
274 | { | |
275 | // | |
276 | // get point angle bettwen two helixes | |
277 | // | |
278 | Double_t r0[3],p0[4]; | |
279 | Double_t r1[3],p1[4]; | |
280 | GetMomentum(phase[0],p0,1,r0); | |
281 | h.GetMomentum(phase[1],p1,1,r1); | |
282 | // | |
283 | Double_t r[3] = {(r0[0]+r1[0])*0.5-vertex[0],(r0[1]+r1[1])*0.5-vertex[1],(r0[2]+r1[2])*0.5-vertex[2]}; | |
284 | //intersection point - relative to the prim vertex | |
285 | Double_t p[3] = { p0[0]+p1[0], p0[1]+p1[1],p0[2]+p1[2]}; | |
286 | // derivation vector | |
287 | Double_t normr = TMath::Sqrt(r[0]*r[0]+r[1]*r[1]+r[2]*r[2]); | |
288 | Double_t normp = TMath::Sqrt(p[0]*p[0]+p[1]*p[1]+p[2]*p[2]); | |
289 | Double_t pointAngle = (r[0]*p[0]+r[1]*p[1]+r[2]*p[2])/(normr*normp); | |
290 | return pointAngle; | |
291 | } | |
292 | ||
7f572c00 | 293 | Double_t AliHelix::GetPhase(Double_t x, Double_t y ) |
294 | ||
295 | { | |
296 | // | |
297 | //calculate helix param at given x,y point | |
298 | // | |
9be2fe3a | 299 | //Double_t phase2 = TMath::ATan2((y-fHelix[0]), (x-fHelix[5]))- TMath::Pi()/2.; |
300 | Double_t phase2 = TMath::ATan2(-(x-fHelix[5]),(y-fHelix[0])); | |
301 | Int_t sign = (fHelix[4]>0)? 1:-1; | |
302 | if (sign>0) phase2 = phase2-TMath::Pi(); | |
303 | // | |
304 | Float_t delta = TMath::Nint((phase2-fHelix[2])/(2.*TMath::Pi())); | |
305 | phase2-= 2*TMath::Pi()*delta; | |
306 | if ( (phase2-fHelix[2])>TMath::Pi()) phase2 -=2.*TMath::Pi(); | |
307 | if ( (phase2-fHelix[2])<-TMath::Pi()) phase2+=2.*TMath::Pi(); | |
7f572c00 | 308 | |
9be2fe3a | 309 | Double_t t = (phase2-fHelix[2]); |
310 | t/=fHelix[4]; | |
7f572c00 | 311 | return t; |
312 | } | |
313 | ||
176aff27 | 314 | Int_t AliHelix::GetPhase(Double_t /*r0*/, Double_t * /*t[2]*/) |
7f572c00 | 315 | { |
316 | // | |
317 | //calculate helix param at given r point - return nearest point () | |
318 | // | |
319 | // not implemented yet | |
320 | ||
321 | ||
322 | return 0; | |
323 | } | |
324 | ||
325 | ||
326 | Double_t AliHelix::GetPhaseZ(Double_t z0) | |
327 | { | |
328 | // | |
329 | // | |
330 | return (z0-fHelix[1])/fHelix[3]; | |
331 | } | |
332 | ||
333 | ||
334 | Int_t AliHelix::GetRPHIintersections(AliHelix &h, Double_t phase[2][2], Double_t ri[2], Double_t cut) | |
335 | { | |
336 | //-------------------------------------------------------------------- | |
337 | // This function returns phase vectors with intesection between helix (0, 1 or 2) | |
338 | // in x-y plane projection | |
339 | //-------------------------------------------------------------------- | |
340 | // | |
341 | // Double_t * c1 = &fHelix[6]; | |
342 | //Double_t * c2 = &(h.fHelix[6]); | |
343 | // Double_t c1[3] = {fHelix[5],fHelix[0],fHelix[8]}; | |
344 | Double_t c1[3] = {0,0,fHelix[8]}; | |
345 | Double_t c2[3] = {h.fHelix[5]-fHelix[5],h.fHelix[0]-fHelix[0],h.fHelix[8]}; | |
346 | ||
347 | Double_t d = TMath::Sqrt(c2[0]*c2[0]+c2[1]*c2[1]); | |
51ad6848 | 348 | if (d<0.000000000001) return 0; |
7f572c00 | 349 | // |
350 | Double_t x0[2]; | |
351 | Double_t y0[2]; | |
352 | // | |
353 | if ( d>=(c1[2]+c2[2])){ | |
354 | if (d>=(c1[2]+c2[2]+cut)) return 0; | |
355 | x0[0] = (d+c1[2]-c2[2])*c2[0]/(2*d)+ fHelix[5]; | |
356 | y0[0] = (d+c1[2]-c2[2])*c2[1]/(2*d)+ fHelix[0]; | |
51ad6848 | 357 | // return 0; |
358 | phase[0][0] = GetPhase(x0[0],y0[0]); | |
359 | phase[0][1] = h.GetPhase(x0[0],y0[0]); | |
360 | ri[0] = x0[0]*x0[0]+y0[0]*y0[0]; | |
361 | return 1; | |
7f572c00 | 362 | } |
363 | if ( (d+c2[2])<c1[2]){ | |
364 | if ( (d+c2[2])+cut<c1[2]) return 0; | |
365 | // | |
366 | Double_t xx = c2[0]+ c2[0]*c2[2]/d+ fHelix[5]; | |
367 | Double_t yy = c2[1]+ c2[1]*c2[2]/d+ fHelix[0]; | |
368 | phase[0][1] = h.GetPhase(xx,yy); | |
369 | // | |
370 | Double_t xx2 = c2[0]*c1[2]/d+ fHelix[5]; | |
371 | Double_t yy2 = c2[1]*c1[2]/d+ fHelix[0]; | |
372 | phase[0][0] = GetPhase(xx2,yy2); | |
373 | ri[0] = xx*xx+yy*yy; | |
374 | return 1; | |
375 | } | |
376 | ||
377 | if ( (d+c1[2])<c2[2]){ | |
378 | if ( (d+c1[2])+cut<c2[2]) return 0; | |
379 | // | |
380 | Double_t xx = -c2[0]*c1[2]/d+ fHelix[5]; | |
381 | Double_t yy = -c2[1]*c1[2]/d+ fHelix[0]; | |
382 | phase[0][1] = GetPhase(xx,yy); | |
383 | // | |
384 | Double_t xx2 = c2[0]- c2[0]*c2[2]/d+ fHelix[5]; | |
385 | Double_t yy2 = c2[1]- c2[1]*c2[2]/d+ fHelix[0]; | |
386 | phase[0][0] = h.GetPhase(xx2,yy2); | |
387 | ri[0] = xx*xx+yy*yy; | |
388 | return 1; | |
389 | } | |
390 | ||
391 | Double_t d1 = (d*d+c1[2]*c1[2]-c2[2]*c2[2])/(2.*d); | |
392 | Double_t v1 = c1[2]*c1[2]-d1*d1; | |
393 | if (v1<0) return 0; | |
394 | v1 = TMath::Sqrt(v1); | |
395 | // | |
396 | x0[0] = (c2[0]*d1+c2[1]*v1)/d + fHelix[5]; | |
397 | y0[0] = (c2[1]*d1-c2[0]*v1)/d + fHelix[0]; | |
398 | // | |
399 | x0[1] = (c2[0]*d1-c2[1]*v1)/d + fHelix[5]; | |
400 | y0[1] = (c2[1]*d1+c2[0]*v1)/d + fHelix[0]; | |
401 | // | |
402 | for (Int_t i=0;i<2;i++){ | |
403 | phase[i][0] = GetPhase(x0[i],y0[i]); | |
404 | phase[i][1] = h.GetPhase(x0[i],y0[i]); | |
405 | ri[i] = x0[i]*x0[i]+y0[i]*y0[i]; | |
406 | } | |
407 | return 2; | |
408 | } | |
409 | ||
7f572c00 | 410 | |
411 | ||
412 | Int_t AliHelix::LinearDCA(AliHelix &h, Double_t &t1, Double_t &t2, | |
413 | Double_t &R, Double_t &dist) | |
414 | { | |
415 | // | |
416 | // | |
417 | // find intersection using linear approximation | |
418 | Double_t r1[3],g1[3],gg1[3]; | |
419 | Double_t r2[3],g2[3],gg2[3]; | |
420 | // | |
421 | Evaluate(t1,r1,g1,gg1); | |
422 | h.Evaluate(t2,r2,g2,gg2); | |
423 | // | |
424 | Double_t g1_2 = g1[0]*g1[0] +g1[1]*g1[1] +g1[2]*g1[2]; | |
425 | Double_t g2_2 = g2[0]*g2[0] +g2[1]*g2[1] +g2[2]*g2[2]; | |
426 | Double_t g1x2 = g1[0]*g2[0] +g1[1]*g2[1] +g1[2]*g2[2]; | |
427 | Double_t det = g1_2*g2_2 - g1x2*g1x2; | |
428 | // | |
429 | if (TMath::Abs(det)>0){ | |
430 | // | |
431 | Double_t r1g1 = r1[0]*g1[0] +r1[1]*g1[1] +r1[2]*g1[2]; | |
432 | Double_t r2g1 = r2[0]*g1[0] +r2[1]*g1[1] +r2[2]*g1[2]; | |
433 | Double_t r1g2 = r1[0]*g2[0] +r1[1]*g2[1] +r1[2]*g2[2]; | |
434 | Double_t r2g2 = r2[0]*g2[0] +r2[1]*g2[1] +r2[2]*g2[2]; | |
435 | // | |
436 | Double_t dt = - ( g2_2*(r1g1-r2g1) - g1x2*(r1g2-r2g2)) / det; | |
437 | Double_t dp = - ( g1_2*(r2g2-r1g2) - g1x2*(r2g1-r1g1)) / det; | |
438 | // | |
439 | t1+=dt; | |
440 | t2+=dp; | |
441 | Evaluate(t1,r1); | |
442 | h.Evaluate(t2,r2); | |
443 | // | |
444 | dist = (r1[0]-r2[0])*(r1[0]-r2[0])+ | |
445 | (r1[1]-r2[1])*(r1[1]-r2[1])+ | |
446 | (r1[2]-r2[2])*(r1[2]-r2[2]); | |
447 | R = ((r1[0]+r2[0])*(r1[0]+r2[0])+(r1[1]+r2[1])*(r1[1]+r2[1]))/4.; | |
448 | } | |
449 | return 0; | |
450 | } | |
451 | ||
452 | ||
7f572c00 | 453 | Int_t AliHelix::ParabolicDCA(AliHelix&h, //helixes |
454 | Double_t &t1, Double_t &t2, | |
455 | Double_t &R, Double_t &dist, Int_t iter) | |
456 | { | |
457 | // | |
458 | // | |
459 | // find intersection using linear fit | |
460 | Double_t r1[3],g1[3],gg1[3]; | |
461 | Double_t r2[3],g2[3],gg2[3]; | |
462 | // | |
463 | Evaluate(t1,r1,g1,gg1); | |
464 | h.Evaluate(t2,r2,g2,gg2); | |
465 | ||
466 | // | |
467 | Double_t dx2=1.; | |
468 | Double_t dy2=1.; | |
469 | Double_t dz2=1.; | |
470 | // | |
471 | Double_t dx=r2[0]-r1[0], dy=r2[1]-r1[1], dz=r2[2]-r1[2]; | |
472 | Double_t dm=dx*dx/dx2 + dy*dy/dy2 + dz*dz/dz2; | |
473 | // | |
474 | ||
475 | iter++; | |
476 | while (iter--) { | |
9be2fe3a | 477 | Double_t gt1=-(dx*g1[0]/dx2 + dy*g1[1]/dy2 + dz*g1[2]/dz2); |
478 | Double_t gt2=+(dx*g2[0]/dx2 + dy*g2[1]/dy2 + dz*g2[2]/dz2); | |
479 | ||
480 | Double_t h11=(g1[0]*g1[0] - dx*gg1[0])/dx2 + | |
481 | (g1[1]*g1[1] - dy*gg1[1])/dy2 + | |
482 | (g1[2]*g1[2] - dz*gg1[2])/dz2; | |
483 | Double_t h22=(g2[0]*g2[0] + dx*gg2[0])/dx2 + | |
484 | (g2[1]*g2[1] + dy*gg2[1])/dy2 + | |
485 | (g2[2]*g2[2] + dz*gg2[2])/dz2; | |
486 | Double_t h12=-(g1[0]*g2[0]/dx2 + g1[1]*g2[1]/dy2 + g1[2]*g2[2]/dz2); | |
487 | ||
488 | Double_t det=h11*h22-h12*h12; | |
489 | ||
490 | Double_t dt1,dt2; | |
491 | if (TMath::Abs(det)<1.e-33) { | |
492 | //(quasi)singular Hessian | |
493 | dt1=-gt1; dt2=-gt2; | |
494 | } else { | |
495 | dt1=-(gt1*h22 - gt2*h12)/det; | |
496 | dt2=-(h11*gt2 - h12*gt1)/det; | |
497 | } | |
498 | ||
499 | if ((dt1*gt1+dt2*gt2)>0) {dt1=-dt1; dt2=-dt2;} | |
500 | ||
501 | //if (TMath::Abs(dt1)/(TMath::Abs(t1)+1.e-3) < 1.e-4) | |
502 | // if (TMath::Abs(dt2)/(TMath::Abs(t2)+1.e-3) < 1.e-4) { | |
503 | // break; | |
504 | // } | |
505 | ||
506 | Double_t dd=dm; | |
507 | for (Int_t div=1 ; div<512 ; div*=2) { | |
508 | Evaluate(t1+dt1,r1,g1,gg1); | |
509 | h.Evaluate(t2+dt2,r2,g2,gg2); | |
510 | dx=r2[0]-r1[0]; dy=r2[1]-r1[1]; dz=r2[2]-r1[2]; | |
511 | dd=dx*dx/dx2 + dy*dy/dy2 + dz*dz/dz2; | |
512 | if (dd<dm) break; | |
513 | dt1*=0.5; dt2*=0.5; | |
514 | if (div==0){ | |
515 | div =1; | |
516 | } | |
517 | if (div>512) { | |
518 | break; | |
519 | } | |
520 | } | |
521 | dm=dd; | |
522 | t1+=dt1; | |
523 | t2+=dt2; | |
7f572c00 | 524 | } |
7f572c00 | 525 | Evaluate(t1,r1,g1,gg1); |
526 | h.Evaluate(t2,r2,g2,gg2); | |
527 | // | |
528 | dist = (r1[0]-r2[0])*(r1[0]-r2[0])+ | |
529 | (r1[1]-r2[1])*(r1[1]-r2[1])+ | |
530 | (r1[2]-r2[2])*(r1[2]-r2[2]); | |
531 | ||
532 | R = ((r1[0]+r2[0])*(r1[0]+r2[0])+(r1[1]+r2[1])*(r1[1]+r2[1]))/4; | |
9be2fe3a | 533 | return 0; |
7f572c00 | 534 | |
535 | } | |
7f572c00 | 536 | |
537 | ||
9be2fe3a | 538 | Int_t AliHelix::ParabolicDCA2(AliHelix&h, //helixes |
7f572c00 | 539 | Double_t &t1, Double_t &t2, |
9be2fe3a | 540 | Double_t &R, Double_t &dist, Double_t err[3], Int_t iter) |
7f572c00 | 541 | { |
542 | // | |
543 | // | |
544 | // find intersection using linear fit | |
545 | Double_t r1[3],g1[3],gg1[3]; | |
546 | Double_t r2[3],g2[3],gg2[3]; | |
547 | // | |
548 | Evaluate(t1,r1,g1,gg1); | |
549 | h.Evaluate(t2,r2,g2,gg2); | |
550 | ||
551 | // | |
9be2fe3a | 552 | Double_t dx2=err[0]; |
553 | Double_t dy2=err[1]; | |
554 | Double_t dz2=err[2]; | |
7f572c00 | 555 | // |
556 | Double_t dx=r2[0]-r1[0], dy=r2[1]-r1[1], dz=r2[2]-r1[2]; | |
557 | Double_t dm=dx*dx/dx2 + dy*dy/dy2 + dz*dz/dz2; | |
558 | // | |
559 | ||
560 | iter++; | |
561 | while (iter--) { | |
562 | Double_t gt1=-(dx*g1[0]/dx2 + dy*g1[1]/dy2 + dz*g1[2]/dz2); | |
563 | Double_t gt2=+(dx*g2[0]/dx2 + dy*g2[1]/dy2 + dz*g2[2]/dz2); | |
564 | ||
565 | Double_t h11=(g1[0]*g1[0] - dx*gg1[0])/dx2 + | |
566 | (g1[1]*g1[1] - dy*gg1[1])/dy2 + | |
567 | (g1[2]*g1[2] - dz*gg1[2])/dz2; | |
568 | Double_t h22=(g2[0]*g2[0] + dx*gg2[0])/dx2 + | |
569 | (g2[1]*g2[1] + dy*gg2[1])/dy2 + | |
570 | (g2[2]*g2[2] + dz*gg2[2])/dz2; | |
571 | Double_t h12=-(g1[0]*g2[0]/dx2 + g1[1]*g2[1]/dy2 + g1[2]*g2[2]/dz2); | |
572 | ||
573 | Double_t det=h11*h22-h12*h12; | |
574 | ||
575 | Double_t dt1,dt2; | |
576 | if (TMath::Abs(det)<1.e-33) { | |
577 | //(quasi)singular Hessian | |
578 | dt1=-gt1; dt2=-gt2; | |
579 | } else { | |
580 | dt1=-(gt1*h22 - gt2*h12)/det; | |
581 | dt2=-(h11*gt2 - h12*gt1)/det; | |
582 | } | |
583 | ||
584 | if ((dt1*gt1+dt2*gt2)>0) {dt1=-dt1; dt2=-dt2;} | |
585 | ||
586 | //if (TMath::Abs(dt1)/(TMath::Abs(t1)+1.e-3) < 1.e-4) | |
587 | // if (TMath::Abs(dt2)/(TMath::Abs(t2)+1.e-3) < 1.e-4) { | |
588 | // break; | |
589 | // } | |
590 | ||
591 | Double_t dd=dm; | |
592 | for (Int_t div=1 ; div<512 ; div*=2) { | |
593 | Evaluate(t1+dt1,r1,g1,gg1); | |
594 | h.Evaluate(t2+dt2,r2,g2,gg2); | |
595 | dx=r2[0]-r1[0]; dy=r2[1]-r1[1]; dz=r2[2]-r1[2]; | |
596 | dd=dx*dx/dx2 + dy*dy/dy2 + dz*dz/dz2; | |
597 | if (dd<dm) break; | |
598 | dt1*=0.5; dt2*=0.5; | |
599 | if (div==0){ | |
600 | div =1; | |
601 | } | |
602 | if (div>512) { | |
603 | break; | |
604 | } | |
605 | } | |
606 | dm=dd; | |
607 | t1+=dt1; | |
608 | t2+=dt2; | |
609 | } | |
610 | Evaluate(t1,r1,g1,gg1); | |
611 | h.Evaluate(t2,r2,g2,gg2); | |
612 | // | |
613 | dist = (r1[0]-r2[0])*(r1[0]-r2[0])+ | |
614 | (r1[1]-r2[1])*(r1[1]-r2[1])+ | |
615 | (r1[2]-r2[2])*(r1[2]-r2[2]); | |
616 | ||
617 | R = ((r1[0]+r2[0])*(r1[0]+r2[0])+(r1[1]+r2[1])*(r1[1]+r2[1]))/4; | |
618 | return 0; | |
619 | ||
620 | } | |
621 |