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 **************************************************************************/
16 // **************************************************************************
17 // * The package was revised and changed by Boris Batiounia in the time *
18 // * period of March - June 2001 *
19 // **************************************************************************/
21 #include <Riostream.h>
25 #include "AliITSdigitSSD.h"
26 #include "AliITSRawClusterSSD.h"
27 #include "AliITSRecPoint.h"
28 #include "AliITSMapA1.h"
29 #include "AliITSClusterFinderSSD.h"
30 #include "AliITSclusterSSD.h"
31 #include "AliITSpackageSSD.h"
32 #include "AliITSresponseSSD.h"
33 #include "AliITSsegmentationSSD.h"
34 #include "AliITSgeom.h"
36 const Bool_t AliITSClusterFinderSSD::fgkSIDEP=kTRUE;
37 const Bool_t AliITSClusterFinderSSD::fgkSIDEN=kFALSE;
39 ClassImp(AliITSClusterFinderSSD)
41 //____________________________________________________________________
44 //______________________________________________________________________
45 AliITSClusterFinderSSD::AliITSClusterFinderSSD():
46 AliITSClusterFinder(),
66 //______________________________________________________________________
67 AliITSClusterFinderSSD::AliITSClusterFinderSSD(AliITSsegmentation *seg,
68 TClonesArray *digits):
69 AliITSClusterFinder(seg,0),
87 //Standard constructor
90 SetMap(new AliITSMapA1(GetSeg(),Digits()));
91 fITS = (AliITS*)gAlice->GetModule("ITS");
92 fClusterP = new TClonesArray ("AliITSclusterSSD",200);
94 fClusterN = new TClonesArray ("AliITSclusterSSD",200);
96 fPackages = new TClonesArray ("AliITSpackageSSD",200); //packages
98 fDigitsIndexP = new TArrayI(300);
100 fDigitsIndexN = new TArrayI(300);
102 fPitch = GetSeg()->Dpx(0);
103 fPNsignalRatio= 7./8.; // warning: hard-wired number
105 //______________________________________________________________________}
106 AliITSClusterFinderSSD::AliITSClusterFinderSSD(AliITSsegmentation *seg,
107 AliITSresponse *res):
108 AliITSClusterFinder(seg,res),
126 //Standard constructor
128 fITS = (AliITS*)gAlice->GetModule("ITS");
129 fClusterP = new TClonesArray ("AliITSclusterSSD",200);
131 fClusterN = new TClonesArray ("AliITSclusterSSD",200);
133 fPackages = new TClonesArray ("AliITSpackageSSD",200); //packages
135 fDigitsIndexP = new TArrayI(300);
137 fDigitsIndexN = new TArrayI(300);
139 fPitch = GetSeg()->Dpx(0);
140 fPNsignalRatio= 7./8.; // warning: hard-wired number
142 //______________________________________________________________________
143 AliITSClusterFinderSSD::~AliITSClusterFinderSSD(){
144 // Default destructor
150 delete fDigitsIndexP;
151 delete fDigitsIndexN;
153 //______________________________________________________________________
154 void AliITSClusterFinderSSD::InitReconstruction(){
155 // initialization of the cluster finder
157 register Int_t i; //iterator
159 for (i=0;i<fNClusterP;i++) fClusterP->RemoveAt(i);
161 for (i=0;i<fNClusterN;i++) fClusterN->RemoveAt(i);
163 for (i=0;i<fNPackages;i++) fPackages->RemoveAt(i);
167 Float_t stereoP,stereoN;
168 GetSeg()->Angles(stereoP,stereoN);
169 CalcStepFactor(stereoP,stereoN);
170 if(GetDebug(1)) cout<<"fSFF = "<<fSFF<<" fSFB = "<<fSFB<<"\n";
172 //______________________________________________________________________
173 void AliITSClusterFinderSSD::FindRawClusters(Int_t module){
174 // This function findes out all clusters belonging to one module
175 // 1. Zeroes all space after previous module reconstruction
176 // 2. Finds all neighbouring digits, create clusters
177 // 3. If necesery, resolves for each group of neighbouring digits
178 // how many clusters creates it.
179 // 4. Colculate the x and z coordinate
180 Int_t lay, lad, detect;
181 AliITSgeom *geom = fITS->GetITSgeom();
184 geom->GetModuleId(GetModule(),lay, lad, detect);
185 if ( lay == 6 ) ((AliITSsegmentationSSD*)GetSeg())->SetLayer(6);
186 if ( lay == 5 ) ((AliITSsegmentationSSD*)GetSeg())->SetLayer(5);
188 InitReconstruction(); //ad. 1
192 FindNeighbouringDigits(); //ad. 2
193 //SeparateOverlappedClusters(); //ad. 3
194 ClustersToPackages(); //ad. 4
197 //______________________________________________________________________
198 void AliITSClusterFinderSSD::FindNeighbouringDigits(){
199 //If there are any digits on this side, create 1st Cluster,
200 // add to it this digit, and increment number of clusters
203 if ((fNDigitsP>0 ) && (fNDigitsN > 0 )) {
204 Int_t currentstripNo;
205 Int_t *dbuffer = new Int_t [300]; //buffer for strip numbers
206 Int_t dnumber; //curent number of digits in buffer
207 TArrayI &lDigitsIndexP = *fDigitsIndexP;
208 TArrayI &lDigitsIndexN = *fDigitsIndexN;
209 TObjArray &lDigits = *(Digits());
210 TClonesArray &lClusterP = *fClusterP;
211 TClonesArray &lClusterN = *fClusterN;
214 dbuffer[0]=lDigitsIndexP[0];
215 //If next digit is a neigh. of previous, adds to last clust. this digit
216 for (i=1; i<fNDigitsP; i++) {
218 currentstripNo = ((AliITSdigitSSD*)lDigits[lDigitsIndexP[i]])->
220 //check if it is a neighbour of a previous one
221 if((((AliITSdigitSSD*)lDigits[lDigitsIndexP[i-1]])->
223 == (currentstripNo-1) ) dbuffer[dnumber++]=lDigitsIndexP[i];
225 //create a new one side cluster
226 new(lClusterP[fNClusterP++]) AliITSclusterSSD(dnumber,dbuffer,
229 dbuffer[0]=lDigitsIndexP[i];
232 } // end loop over fNDigitsP
233 new(lClusterP[fNClusterP++]) AliITSclusterSSD(dnumber,dbuffer,
236 //for comments, see above
238 dbuffer[0]=lDigitsIndexN[0];
239 //If next digit is a neigh. of previous, adds to last clust. this digit
240 for (i=1; i<fNDigitsN; i++) {
241 currentstripNo = ((AliITSdigitSSD*)(lDigits[lDigitsIndexN[i]]))->
243 if ( (((AliITSdigitSSD*)lDigits[lDigitsIndexN[i-1]])->
245 == (currentstripNo-1) ) dbuffer[dnumber++]=lDigitsIndexN[i];
247 new(lClusterN[fNClusterN++]) AliITSclusterSSD(dnumber,dbuffer,
250 dbuffer[0]=lDigitsIndexN[i];
253 } // end loop over fNDigitsN
254 new(lClusterN[fNClusterN++]) AliITSclusterSSD(dnumber,dbuffer,
258 } // end condition on NDigits
260 if (GetDebug(1)) cout<<"\n Found clusters: fNClusterP = "<<fNClusterP
261 <<" fNClusterN ="<<fNClusterN<<"\n";
263 //______________________________________________________________________
264 void AliITSClusterFinderSSD::SeparateOverlappedClusters(){
265 // overlapped clusters separation
266 register Int_t i; //iterator
267 Double_t factor=0.75; // How many percent must be lower signal
268 // on the middle one digit
269 // from its neighbours
270 Int_t signal0; //signal on the strip before the current one
271 Int_t signal1; //signal on the current one signal
272 Int_t signal2; //signal on the strip after the current one
273 TArrayI *splitlist; // List of splits
274 Int_t numerofsplits=0; // number of splits
275 Int_t initPsize = fNClusterP; //initial size of the arrays
276 Int_t initNsize = fNClusterN; //we have to keep it because it will grow
277 // in this function and it doasn't make
278 // sense to pass through it again
279 splitlist = new TArrayI(300);
281 for (i=0;i<initPsize;i++){
282 if (( ((AliITSclusterSSD*)(*fClusterP)[i])->
283 GetNumOfDigits())==1) continue;
284 if (( ((AliITSclusterSSD*)(*fClusterP)[i])->
285 GetNumOfDigits())==2) continue;
286 Int_t nj=(((AliITSclusterSSD*)(*fClusterP)[i])->GetNumOfDigits()-1);
287 for (Int_t j=1; j<nj; j++){
288 signal1=((AliITSclusterSSD*)(*fClusterP)[i])->GetDigitSignal(j);
289 signal0=((AliITSclusterSSD*)(*fClusterP)[i])->GetDigitSignal(j-1);
290 signal2=((AliITSclusterSSD*)(*fClusterP)[i])->GetDigitSignal(j+1);
291 //if signal is less then factor*signal of its neighbours
292 if ( (signal1<(factor*signal0)) && (signal1<(factor*signal2)) ){
293 (*splitlist)[numerofsplits++]=j;
295 } // end loop over number of digits
296 //split this cluster if necessary
297 if(numerofsplits>0) SplitCluster(splitlist,numerofsplits,i,fgkSIDEP);
299 //in signed places (splitlist)
300 } // end loop over clusters on Pside
302 for (i=0;i<initNsize;i++) {
303 if (( ((AliITSclusterSSD*)(*fClusterN)[i])->
304 GetNumOfDigits())==1) continue;
305 if (( ((AliITSclusterSSD*)(*fClusterN)[i])->
306 GetNumOfDigits())==2) continue;
307 Int_t nj=(((AliITSclusterSSD*)(*fClusterN)[i])->GetNumOfDigits()-1);
308 for (Int_t j=1; j<nj; j++){
309 signal1=((AliITSclusterSSD*)(*fClusterN)[i])->GetDigitSignal(j);
310 signal0=((AliITSclusterSSD*)(*fClusterN)[i])->GetDigitSignal(j-1);
311 signal2=((AliITSclusterSSD*)(*fClusterN)[i])->GetDigitSignal(j+1);
312 //if signal is less then factor*signal of its neighbours
313 if ( (signal1<(factor*signal0)) && (signal1<(factor*signal2)) )
314 (*splitlist)[numerofsplits++]=j;
315 } // end loop over number of digits
316 //split this cluster into more clusters
317 if(numerofsplits>0) SplitCluster(splitlist,numerofsplits,i,fgkSIDEN);
319 //in signed places (splitlist)
320 } // end loop over clusters on Nside
324 //______________________________________________________________________
325 void AliITSClusterFinderSSD::SplitCluster(TArrayI *list, Int_t nsplits,
326 Int_t index, Bool_t side){
327 //This function splits one side cluster into more clusters
328 //number of splits is defined by "nsplits"
329 //Place of splits are defined in the TArray "list"
330 // For further optimisation: Replace this function by two
331 // specialised ones (each for one side)
333 //For comlete comments see AliITSclusterSSD::SplitCluster
334 register Int_t i; //iterator
335 AliITSclusterSSD* curentcluster;
336 Int_t *tmpdigits = new Int_t[100];
339 // side true means P side
341 curentcluster =((AliITSclusterSSD*)((*fClusterP)[index])) ;
342 for (i = nsplits; i>0 ;i--) {
343 nn=curentcluster->SplitCluster((*list)[(i-1)],tmpdigits);
344 new ((*fClusterP)[fNClusterP]) AliITSclusterSSD(nn,tmpdigits,
346 ( (AliITSclusterSSD*)((*fClusterP)[fNClusterP]) )->
347 SetLeftNeighbour(kTRUE);
348 //if left cluster had neighbour on the right before split
349 //new should have it too
350 if ( curentcluster->GetRightNeighbour() )
351 ( (AliITSclusterSSD*)((*fClusterP)[fNClusterP]) )->
352 SetRightNeighbour(kTRUE);
353 else curentcluster->SetRightNeighbour(kTRUE);
355 } // end loop over nplits
357 curentcluster =((AliITSclusterSSD*)((*fClusterN)[index]));
358 for (i = nsplits; i>0 ;i--) {
359 nn=curentcluster->SplitCluster((*list)[(i-1)],tmpdigits);
360 new ((*fClusterN)[fNClusterN]) AliITSclusterSSD(nn,tmpdigits,
362 ((AliITSclusterSSD*)((*fClusterN)[fNClusterN]))->
363 SetRightNeighbour(kTRUE);
364 if (curentcluster->GetRightNeighbour())
365 ( (AliITSclusterSSD*)( (*fClusterN)[fNClusterN]) )->
366 SetRightNeighbour(kTRUE);
367 else curentcluster->SetRightNeighbour(kTRUE);
369 } // end loop over nplits
373 //______________________________________________________________________
374 Int_t AliITSClusterFinderSSD::SortDigitsP(Int_t start, Int_t end){
375 // sort digits on the P side
379 if (start != (end - 1) ){
380 left=this->SortDigitsP(start,(start+end)/2);
381 right=this->SortDigitsP((start+end)/2,end);
382 return (left || right);
384 left = ((AliITSdigitSSD*)((*(Digits()))[(*fDigitsIndexP)[start]]))->
386 right= ((AliITSdigitSSD*)((*(Digits()))[(*fDigitsIndexP)[end]]))->
389 Int_t tmp = (*fDigitsIndexP)[start];
390 (*fDigitsIndexP)[start]=(*fDigitsIndexP)[end];
391 (*fDigitsIndexP)[end]=tmp;
396 //______________________________________________________________________
397 Int_t AliITSClusterFinderSSD::SortDigitsN(Int_t start, Int_t end){
398 // sort digits on the N side
402 if (start != (end - 1)){
403 left=this->SortDigitsN(start,(start+end)/2);
404 right=this->SortDigitsN((start+end)/2,end);
405 return (left || right);
407 left =((AliITSdigitSSD*)((*(Digits()))[(*fDigitsIndexN)[start]]))->
409 right=((AliITSdigitSSD*)((*(Digits()))[(*fDigitsIndexN)[end]]))->
412 Int_t tmp = (*fDigitsIndexN)[start];
413 (*fDigitsIndexN)[start]=(*fDigitsIndexN)[end];
414 (*fDigitsIndexN)[end]=tmp;
419 //______________________________________________________________________
420 void AliITSClusterFinderSSD::FillDigitsIndex(){
421 //Fill the indexes of the clusters belonging to a given ITS module
427 noentries = NDigits();
429 Int_t* psidx = new Int_t [noentries*sizeof(Int_t)];
430 Int_t* nsidx = new Int_t [noentries*sizeof(Int_t)];
431 if (fDigitsIndexP==NULL) fDigitsIndexP = new TArrayI(noentries);
432 if (fDigitsIndexN==NULL) fDigitsIndexN = new TArrayI(noentries);
436 for ( i = 0 ; i< noentries; i++ ) {
437 dig = (AliITSdigitSSD*)GetDigit(i);
440 tmp=dig->GetStripNumber();
441 // I find this totally unnecessary - it's just a
442 // CPU consuming double check
445 if (GetDebug(1)) cout<<"Such a digit exists \n";
451 fDigitsIndexP->AddAt(i,fNDigitsP++);
456 tmp=dig->GetStripNumber();
460 if (GetDebug(1)) cout<<"Such a digit exists \n";
466 fDigitsIndexN->AddAt(i,fNDigitsN++);
475 if(GetDebug(1)) cout<<"Digits: P = "<<fNDigitsP<<" N = "<<fNDigitsN<<endl;
477 //______________________________________________________________________
478 void AliITSClusterFinderSSD::SortDigits(){
482 if(fNDigitsP>1) for (i=0;i<fNDigitsP-1;i++)
483 if (SortDigitsP(0,(fNDigitsP-1-i))==0) break;
484 if(fNDigitsN>1) for (i=0;i<fNDigitsN-1;i++)
485 if(SortDigitsN(0,(fNDigitsN-1-i))==0) break;
487 //______________________________________________________________________
488 void AliITSClusterFinderSSD::FillClIndexArrays(Int_t* arrayP,Int_t *arrayN)
490 // fill cluster index array
493 for (i=0; i<fNClusterP;i++) arrayP[i]=i;
494 for (i=0; i<fNClusterN;i++) arrayN[i]=i;
496 //______________________________________________________________________
497 void AliITSClusterFinderSSD::SortClusters(Int_t* arrayP, Int_t *arrayN){
501 if(fNClusterP>1) for (i=0;i<fNClusterP-1;i++)
502 if (SortClustersP(0,(fNClusterP-1),arrayP)==0) break;
503 if(fNClusterN>1) for (i=0;i<fNClusterN-1;i++)
504 if (SortClustersN(0,(fNClusterN-1),arrayN)==0) break;
506 //______________________________________________________________________
507 Int_t AliITSClusterFinderSSD::SortClustersP(Int_t start, Int_t end,
509 //Sort P side clusters
513 if (start != (end - 1) ) {
514 left=this->SortClustersP(start,(start+end)/2,array);
515 right=this->SortClustersP((start+end)/2,end,array);
516 return (left || right);
518 left =((AliITSclusterSSD*)((*fClusterP)[array[start]]))->
520 right=((AliITSclusterSSD*)((*fClusterP)[array[ end ]]))->
523 Int_t tmp = array[start];
524 array[start]=array[end];
530 //______________________________________________________________________
531 Int_t AliITSClusterFinderSSD::SortClustersN(Int_t start, Int_t end,
533 //Sort N side clusters
537 if (start != (end - 1) ) {
538 left=this->SortClustersN(start,(start+end)/2,array);
539 right=this->SortClustersN((start+end)/2,end,array);
540 return (left || right);
542 left =((AliITSclusterSSD*)((*fClusterN)[array[start]]))->
544 right=((AliITSclusterSSD*)((*fClusterN)[array[ end ]]))->
547 Int_t tmp = array[start];
548 array[start]=array[end];
554 //______________________________________________________________________
555 void AliITSClusterFinderSSD::ClustersToPackages(){
558 Int_t *oneSclP = new Int_t[fNClusterP];//I want to have sorted 1 S clusters
559 Int_t *oneSclN = new Int_t[fNClusterN];//I can not sort it in TClonesArray
560 //so, I create table of indexes and
562 //I do not use TArrayI on purpose
563 //MB: well, that's not true that one
564 //cannot sort objs in TClonesArray
565 AliITSclusterSSD *currentP;
566 AliITSclusterSSD *currentN;
569 //Fills in One Side Clusters Index Array
570 FillClIndexArrays(oneSclP,oneSclN);
571 //Sorts filled Arrays
572 //SortClusters(oneSclP,oneSclN);
575 new ((*fPackages)[0]) AliITSpackageSSD(fClusterP,fClusterN);
577 //This part was includede by Boris Batiounia in March 2001.
578 // Take all recpoint pairs (x coordinates) in both P and N sides
579 // to calculate z coordinates of the recpoints
581 for (j1=0;j1<fNClusterP;j1++) {
582 currentP = GetPSideCluster(oneSclP[j1]);
583 Double_t xP = currentP->GetPosition();
584 Double_t signalP = currentP->GetTotalSignal();
585 for (j2=0;j2<fNClusterN;j2++) {
586 currentN = GetNSideCluster(oneSclN[j2]);
587 Double_t xN = currentN->GetPosition();
588 Double_t signalN = currentN->GetTotalSignal();
589 CreateNewRecPoint(xP,1,xN,1,signalP,signalN,currentP,currentN,
597 //______________________________________________________________________
598 Bool_t AliITSClusterFinderSSD::CreateNewRecPoint(Double_t P,Double_t dP,
599 Double_t N, Double_t dN,
600 Double_t SigP,Double_t SigN,
601 AliITSclusterSSD *clusterP,
602 AliITSclusterSSD *clusterN,
604 // create the recpoints
605 const Double_t kADCtoKeV = 2.16;
606 // 50 ADC units -> 30000 e-h pairs; 1e-h pair -> 3.6e-3 KeV;
607 // 1 ADC unit -> (30000/50)*3.6e-3 = 2.16 KeV
608 const Double_t kconv = 1.0e-4;
609 const Double_t kRMSx = 20.0*kconv;
610 const Double_t kRMSz = 800.0*kconv;
615 if (GetCrossing(P,N)) {
616 //GetCrossingError(dP,dN);
617 dP = dN = prob = 0.0; // to remove unused variable warning.
618 AliITSRawClusterSSD cnew;
619 Int_t nstripsP=clusterP->GetNumOfDigits();
620 Int_t nstripsN=clusterN->GetNumOfDigits();
625 dedx = SigP*kADCtoKeV;
628 dedx = SigN*kADCtoKeV;
629 } // end if SigP>SigN
630 tr = (Int_t*) clusterP->GetTracks(n);
631 ntracks = clusterP->GetNTracks();
632 cnew.SetSignalP(SigP);
633 cnew.SetSignalN(SigN);
634 cnew.SetMultiplicity(nstripsP);
635 cnew.SetMultN(nstripsN);
636 cnew.SetQErr(TMath::Abs(SigP-SigN));
637 cnew.SetNTrack(ntracks);
638 fITS->AddCluster(2,&cnew);
644 rnew.SetSigmaX2( kRMSx* kRMSx);
645 rnew.SetSigmaZ2( kRMSz* kRMSz);
646 rnew.fTracks[0]=tr[0];
647 rnew.fTracks[1]=tr[1];
648 rnew.fTracks[2]=tr[2];
649 fITS->AddRecPoint(rnew);
654 //______________________________________________________________________
655 void AliITSClusterFinderSSD::CalcStepFactor(Double_t Psteo, Double_t Nsteo){
656 // calculate the step factor for matching clusters
657 // 95 is the pitch, 4000 - dimension along z ?
658 Double_t dz=GetSeg()->Dz();
660 fSFF = ( (Int_t) (Psteo*dz/fPitch ) );// +1;
661 fSFB = ( (Int_t) (Nsteo*dz/fPitch ) );// +1;
663 //______________________________________________________________________
664 AliITSclusterSSD* AliITSClusterFinderSSD::GetPSideCluster(Int_t idx){
665 // get P side clusters
667 if((idx<0)||(idx>=fNClusterP)){
668 Info("GetPSideCluster","0<index=%d<=%d out of range",idx,fNClusterP);
671 return (AliITSclusterSSD*)((*fClusterP)[idx]);
674 //______________________________________________________________________
675 AliITSclusterSSD* AliITSClusterFinderSSD::GetNSideCluster(Int_t idx){
676 // get N side clusters
678 if((idx<0)||(idx>=fNClusterN)){
679 Info("GetNSideCluster","0<index=%d >= %d out of range",idx,fNClusterN);
682 return (AliITSclusterSSD*)((*fClusterN)[idx]);
685 //______________________________________________________________________
686 Bool_t AliITSClusterFinderSSD::GetCrossing (Double_t &P, Double_t &N){
688 // This function was rivised and changed by Boris Batiounia in March 2001
689 Double_t dx = GetSeg()->Dx(); // detector size in x direction, microns
690 Double_t dz = GetSeg()->Dz(); // detector size in z direction, microns
691 Double_t xL; // x local coordinate
692 Double_t zL; // z local coordinate
693 Double_t x; // x = xL + dx/2
694 Double_t z; // z = zL + dz/2
695 Double_t xP; // x coordinate in the P side from the first P strip
696 Double_t xN; // x coordinate in the N side from the first N strip
697 Float_t stereoP,stereoN;
699 GetSeg()->Angles(stereoP,stereoN);
700 fTanP=TMath::Tan(stereoP);
701 fTanN=TMath::Tan(stereoN);
702 Double_t kP = fTanP; // Tangent of 0.0075 mrad
703 Double_t kN = fTanN; // Tangent of 0.0275 mrad
707 xP = N; // change the mistake for the P/N
708 xN = P; // coordinates correspondence in this function
710 x = xP + kP*(dz*kN-xP+xN)/(kP+kN);
711 z = (dz*kN-xP+xN)/(kP+kN);
717 if(TMath::Abs(xL) > dx/2 || TMath::Abs(zL) > dz/2) return kFALSE;
719 // Check that xL and zL are inside the detector for the
720 // correspondent xP and xN coordinates
724 //______________________________________________________________________
725 void AliITSClusterFinderSSD::GetCrossingError(Double_t& dP, Double_t& dN){
726 // get crossing error
729 dz = TMath::Abs(( dP + dN )*fPitch/(fTanP + fTanN) );
730 dx = fPitch*(TMath::Abs(dP*(1 - fTanP/(fTanP + fTanN))) +
731 TMath::Abs(dN *fTanP/(fTanP + fTanN) ));