1 /**************************************************************************
2 * Copyright(c) 1998-2003, 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 **************************************************************************/
15 ////////////////////////////////////////////////////////////////////////////
16 // Implementation of the ITS clusterer V2 class //
18 // Origin: Iouri Belikov, CERN, Jouri.Belikov@cern.ch //
20 ///////////////////////////////////////////////////////////////////////////
24 #include "AliITSClusterFinderV2.h"
25 #include "AliITSRecPoint.h"
26 #include "AliITSgeomTGeo.h"
27 #include "AliITSDetTypeRec.h"
28 #include <TParticle.h>
31 ClassImp(AliITSClusterFinderV2)
33 extern AliRun *gAlice;
35 AliITSClusterFinderV2::AliITSClusterFinderV2(AliITSDetTypeRec* dettyp):AliITSClusterFinder(dettyp),
36 fNModules(AliITSgeomTGeo::GetNModules()),
41 //______________________________________________________________________
42 AliITSClusterFinderV2::AliITSClusterFinderV2(const AliITSClusterFinderV2 &source) : AliITSClusterFinder(source),
43 fNModules(source.fNModules),
44 fEvent(source.fEvent) {
46 // Copies are not allowed. The method is protected to avoid misuse.
47 AliError("Copy constructor not allowed\n");
50 //______________________________________________________________________
51 //AliITSClusterFinderV2& AliITSClusterFinderV2::operator=(const AliITSClusterFinderV2& /* source */){
52 // Assignment operator
53 // Assignment is not allowed. The method is protected to avoid misuse.
54 //Fatal("= operator","Assignment operator not allowed\n");
59 //______________________________________________________________________
60 void AliITSClusterFinderV2::CheckLabels2(Int_t lab[10]) {
61 //------------------------------------------------------------
62 // Tries to find mother's labels
63 //------------------------------------------------------------
64 AliRunLoader *rl = AliRunLoader::GetRunLoader();
65 TTree *trK=(TTree*)rl->TreeK();
69 for (Int_t i=0;i<10;i++) if (lab[i]>=0) nlabels++;
70 if(nlabels == 0) return; // In case of no labels just exit
73 Int_t ntracks = gAlice->GetMCApp()->GetNtrack();
75 for (Int_t i=0;i<10;i++){
77 if (label>=0 && label<ntracks) {
78 TParticle *part=(TParticle*)gAlice->GetMCApp()->Particle(label);
80 if (part->P() < 0.02) {
81 Int_t m=part->GetFirstMother();
85 if (part->GetStatusCode()>0) {
91 if (part->P() < 0.12 && nlabels>3) {
97 if ( (label>ntracks||label <0) && nlabels>3) {
104 for (Int_t i=0;i<10;i++){
106 Int_t label = lab[i];
107 if (label>=0 && label<ntracks) {
108 TParticle *part=(TParticle*)gAlice->GetMCApp()->Particle(label);
109 if (part->P() < 0.1) {
118 //compress labels -- if multi-times the same
120 for (Int_t i=0;i<10;i++) lab2[i]=-2;
121 for (Int_t i=0;i<10 ;i++){
122 if (lab[i]<0) continue;
123 for (Int_t j=0;j<10 &&lab2[j]!=lab[i];j++){
130 for (Int_t j=0;j<10;j++) lab[j]=lab2[j];
135 //______________________________________________________________________
136 void AliITSClusterFinderV2::AddLabel(Int_t lab[10], Int_t label) {
137 //add label to the cluster
138 AliRunLoader *rl = AliRunLoader::GetRunLoader();
139 TTree *trK=(TTree*)rl->TreeK();
141 if(label<0) return; // In case of no label just exit
143 Int_t ntracks = gAlice->GetMCApp()->GetNtrack();
144 if (label>ntracks) return;
145 for (Int_t i=0;i<10;i++){
146 // if (label<0) break;
147 if (lab[i]==label) break;
157 //______________________________________________________________________
158 void AliITSClusterFinderV2::
159 FindCluster(Int_t k,Int_t maxz,AliBin *bins,Int_t &n,Int_t *idx) {
160 //------------------------------------------------------------
161 // returns an array of indices of digits belonging to the cluster
162 // (needed when the segmentation is not regular)
163 //------------------------------------------------------------
164 if (n<200) idx[n++]=bins[k].GetIndex();
167 if (bins[k-maxz].IsNotUsed()) FindCluster(k-maxz,maxz,bins,n,idx);
168 if (bins[k-1 ].IsNotUsed()) FindCluster(k-1 ,maxz,bins,n,idx);
169 if (bins[k+maxz].IsNotUsed()) FindCluster(k+maxz,maxz,bins,n,idx);
170 if (bins[k+1 ].IsNotUsed()) FindCluster(k+1 ,maxz,bins,n,idx);
172 if (bins[k-maxz-1].IsNotUsed()) FindCluster(k-maxz-1,maxz,bins,n,idx);
173 if (bins[k-maxz+1].IsNotUsed()) FindCluster(k-maxz+1,maxz,bins,n,idx);
174 if (bins[k+maxz-1].IsNotUsed()) FindCluster(k+maxz-1,maxz,bins,n,idx);
175 if (bins[k+maxz+1].IsNotUsed()) FindCluster(k+maxz+1,maxz,bins,n,idx);
179 //______________________________________________________________________
180 Bool_t AliITSClusterFinderV2::IsMaximum(Int_t k,Int_t max,const AliBin *bins) {
181 //------------------------------------------------------------
182 //is this a local maximum ?
183 //------------------------------------------------------------
184 UShort_t q=bins[k].GetQ();
185 if (q==1023) return kFALSE;
186 if (bins[k-max].GetQ() > q) return kFALSE;
187 if (bins[k-1 ].GetQ() > q) return kFALSE;
188 if (bins[k+max].GetQ() > q) return kFALSE;
189 if (bins[k+1 ].GetQ() > q) return kFALSE;
190 if (bins[k-max-1].GetQ() > q) return kFALSE;
191 if (bins[k+max-1].GetQ() > q) return kFALSE;
192 if (bins[k+max+1].GetQ() > q) return kFALSE;
193 if (bins[k-max+1].GetQ() > q) return kFALSE;
197 //______________________________________________________________________
198 void AliITSClusterFinderV2::
199 FindPeaks(Int_t k,Int_t max,AliBin *b,Int_t *idx,UInt_t *msk,Int_t& n) {
200 //------------------------------------------------------------
202 //------------------------------------------------------------
204 if (IsMaximum(k,max,b)) {
205 idx[n]=k; msk[n]=(2<<n);
209 if (b[k-max].GetMask()&1) FindPeaks(k-max,max,b,idx,msk,n);
210 if (b[k-1 ].GetMask()&1) FindPeaks(k-1 ,max,b,idx,msk,n);
211 if (b[k+max].GetMask()&1) FindPeaks(k+max,max,b,idx,msk,n);
212 if (b[k+1 ].GetMask()&1) FindPeaks(k+1 ,max,b,idx,msk,n);
215 //______________________________________________________________________
216 void AliITSClusterFinderV2::
217 MarkPeak(Int_t k, Int_t max, AliBin *bins, UInt_t m) {
218 //------------------------------------------------------------
220 //------------------------------------------------------------
221 UShort_t q=bins[k].GetQ();
223 bins[k].SetMask(bins[k].GetMask()|m);
225 if (bins[k-max].GetQ() <= q)
226 if ((bins[k-max].GetMask()&m) == 0) MarkPeak(k-max,max,bins,m);
227 if (bins[k-1 ].GetQ() <= q)
228 if ((bins[k-1 ].GetMask()&m) == 0) MarkPeak(k-1 ,max,bins,m);
229 if (bins[k+max].GetQ() <= q)
230 if ((bins[k+max].GetMask()&m) == 0) MarkPeak(k+max,max,bins,m);
231 if (bins[k+1 ].GetQ() <= q)
232 if ((bins[k+1 ].GetMask()&m) == 0) MarkPeak(k+1 ,max,bins,m);
235 //______________________________________________________________________
236 void AliITSClusterFinderV2::
237 MakeCluster(Int_t k,Int_t max,AliBin *bins,UInt_t m,AliITSRecPoint &c) {
238 //------------------------------------------------------------
239 //make cluster using digits of this peak
240 //------------------------------------------------------------
241 Float_t q=(Float_t)bins[k].GetQ();
242 Int_t i=k/max, j=k-i*max;
245 c.SetY(c.GetY()+i*q);
246 c.SetZ(c.GetZ()+j*q);
247 c.SetSigmaY2(c.GetSigmaY2()+i*i*q);
248 c.SetSigmaZ2(c.GetSigmaZ2()+j*j*q);
250 bins[k].SetMask(0xFFFFFFFE);
252 if (bins[k-max].GetMask() == m) MakeCluster(k-max,max,bins,m,c);
253 if (bins[k-1 ].GetMask() == m) MakeCluster(k-1 ,max,bins,m,c);
254 if (bins[k+max].GetMask() == m) MakeCluster(k+max,max,bins,m,c);
255 if (bins[k+1 ].GetMask() == m) MakeCluster(k+1 ,max,bins,m,c);