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 //////////////////////////////////////////////////////////////////////////////
19 // Clusterization class for IHEP reconstruction.
20 // Performs clusterization (collects neighbouring active cells)
21 // It differs from AliPHOSClusterizerv1 in neighbour definition only
22 //*-- Author: Boris Polichtchouk, IHEP
24 // --- ROOT system ---
25 #include "TBenchmark.h"
27 // --- Standard library ---
29 // --- AliRoot header files ---
31 #include "AliPHOSClusterizerv2.h"
32 #include "AliPHOSGetter.h"
34 #include "AliPHOSEvalRecPoint.h"
35 #include "AliPHOSRecCpvManager.h"
36 #include "AliPHOSRecEmcManager.h"
37 #include "AliPHOSGeometry.h"
39 ClassImp(AliPHOSClusterizerv2)
41 //____________________________________________________________________________
42 AliPHOSClusterizerv2::AliPHOSClusterizerv2() : AliPHOSClusterizerv1()
45 //____________________________________________________________________________
46 AliPHOSClusterizerv2::AliPHOSClusterizerv2(const char * headerFile, const char * name):
47 AliPHOSClusterizerv1(headerFile,name)
50 //____________________________________________________________________________
51 AliPHOSClusterizerv2::AliPHOSClusterizerv2(const AliPHOSClusterizerv2 & clu):
52 AliPHOSClusterizerv1(clu)
55 //____________________________________________________________________________
56 void AliPHOSClusterizerv2::GetNumberOfClustersFound(int* numb) const
58 // Returns the number of found EMC and CPV rec.points
60 AliPHOSGetter * gime = AliPHOSGetter::Instance() ;
61 numb[0] = gime->EmcRecPoints()->GetEntries();
62 numb[1] = gime->CpvRecPoints()->GetEntries();
65 //____________________________________________________________________________
66 void AliPHOSClusterizerv2::Exec(Option_t* option)
70 if(strstr(option,"tim"))
71 gBenchmark->Start("PHOSClusterizer");
73 if(strstr(option,"print"))
76 AliPHOSGetter * gime = AliPHOSGetter::Instance() ;
78 TFolder* wPoolF = gime->PhosLoader()->GetDetectorDataFolder();
80 TObjArray* wPool = new TObjArray(400);
81 wPool->SetName("SmartPoints");
85 Int_t nevents = gime->MaxEvent() ;
88 for(ievent = 0; ievent<nevents; ievent++) {
90 gime->Event(ievent,"D") ;
92 AliInfo(Form("MakeClusters invoked..")) ;
94 AliInfo(Form("MakeClusters done.")) ;
97 //SmartRecPoints will communicate with wPool.
99 AliPHOSEvalRecPoint* rp=0;
101 // CPV reconstruction
103 AliPHOSRecCpvManager* recCpv = new AliPHOSRecCpvManager();
106 Int_t iPoint; //loop variable
108 for(iPoint=0; iPoint<gime->CpvRecPoints()->GetEntriesFast(); iPoint++) {
109 rp = new AliPHOSEvalRecPoint(iPoint, kTRUE);
113 AliPHOSEvalRecPoint pt;
114 pt.UpdateWorkingPool();
116 TObjArray * cpvRecPoints = gime->CpvRecPoints() ;
117 Int_t nOldCpv = cpvRecPoints->GetEntries();
118 cpvRecPoints->Delete();
119 cpvRecPoints->Compress();
121 Int_t i; //loop variable
123 for(i=0; i<wPool->GetEntries(); i++)
124 cpvRecPoints->Add(wPool->At(i));
129 wPoolF->Remove(recCpv);
132 AliInfo(Form(" %d", gime->CpvRecPoints()->GetEntries() )) ;
133 AliInfo(Form(" %d cpvRecPoints", cpvRecPoints->GetEntries() )) ;
136 // Now Emc reconstruction
138 AliPHOSRecEmcManager* recEmc = new AliPHOSRecEmcManager();
141 for(iPoint=0; iPoint<gime->EmcRecPoints()->GetEntriesFast(); iPoint++) {
142 rp = new AliPHOSEvalRecPoint(iPoint, kFALSE);
146 pt.UpdateWorkingPool();
148 TObjArray * emcRecPoints = gime->EmcRecPoints() ;
149 Int_t nOldEmc = emcRecPoints->GetEntries();
150 emcRecPoints->Delete();
151 emcRecPoints->Compress();
153 for(i=0; i<wPool->GetEntries(); i++)
154 emcRecPoints->Add(wPool->At(i));
159 wPoolF->Remove(recEmc);
163 message = " %d OLD cpvRecPoints\n" ;
165 message += " %d cpvRecPoints\n" ;
167 message += " %d OLD emcRecPoints " ;
169 message += " %d emcRecPoints\n" ;
171 AliInfo(Form("%s", message.Data(),
173 gime->CpvRecPoints()->GetEntries(),cpvRecPoints->GetEntries(),
175 gime->EmcRecPoints()->GetEntries(), emcRecPoints->GetEntries() ));
180 } // loop over events
182 if(strstr(option,"tim")) {
183 gBenchmark->Stop("PHOSClusterizer");
184 AliInfo(Form("took %f seconds for Clusterizing", gBenchmark->GetCpuTime("PHOSClusterizer") )) ;
188 //____________________________________________________________________________
189 Int_t AliPHOSClusterizerv2::AreNeighbours(AliPHOSDigit* d1, AliPHOSDigit* d2) const
191 // Points are neighbours if they have common edge.
192 // Points with common vertex are NOT neighbours.
193 // This treatment of neighbourship is the part of
194 // IHEP algorithm of clusterization.
196 // Gives the neighbourness of two digits = 0 are not neighbour but continue searching
198 // = 2 are not neighbour but do not continue searching
199 // The order of d1 and d2 is important: first (d1) should be a digit already in a cluster
200 // which is compared to a digit (d2) not yet in a cluster
202 const AliPHOSGeometry * geom = AliPHOSGetter::Instance()->PHOSGeometry();
207 geom->AbsToRelNumbering(d1->GetId(), relid1) ;
210 geom->AbsToRelNumbering(d2->GetId(), relid2) ;
212 if ( (relid1[0] == relid2[0]) && (relid1[1]==relid2[1]) ) { // inside the same PHOS module and the same PPSD Module
213 Int_t rowdiff = TMath::Abs( relid1[2] - relid2[2] ) ;
214 Int_t coldiff = TMath::Abs( relid1[3] - relid2[3] ) ;
216 if ( ( (coldiff < 1) && (rowdiff <= 1) ) || ( ( coldiff <= 1 ) && ( rowdiff < 1 ) ) ){
220 if((relid2[2] > relid1[2]) && (relid2[3] > relid1[3]+1))
221 rv = 2; // Difference in row numbers is too large to look further
227 if( (relid1[0] < relid2[0]) || (relid1[1] < relid2[1]) )