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 Revision 1.6 2000/11/01 14:53:20 cblume
19 Merge with TRD-develop
21 Revision 1.1.4.6 2000/10/16 01:16:53 cblume
22 Changed timebin 0 to be the one closest to the readout
24 Revision 1.1.4.5 2000/10/15 23:40:01 cblume
27 Revision 1.1.4.4 2000/10/06 16:49:46 cblume
30 Revision 1.1.4.3 2000/10/04 16:34:58 cblume
31 Replace include files by forward declarations
33 Revision 1.1.4.2 2000/09/22 14:49:49 cblume
34 Adapted to tracking code
36 Revision 1.5 2000/10/02 21:28:19 fca
37 Removal of useless dependecies via forward declarations
39 Revision 1.4 2000/06/08 18:32:58 cblume
40 Make code compliant to coding conventions
42 Revision 1.3 2000/06/07 16:27:01 cblume
43 Try to remove compiler warnings on Sun and HP
45 Revision 1.2 2000/05/08 16:17:27 cblume
48 Revision 1.1.4.1 2000/05/08 15:08:41 cblume
49 Replace AliTRDcluster by AliTRDrecPoint
51 Revision 1.4 2000/06/08 18:32:58 cblume
52 Make code compliant to coding conventions
54 Revision 1.3 2000/06/07 16:27:01 cblume
55 Try to remove compiler warnings on Sun and HP
57 Revision 1.2 2000/05/08 16:17:27 cblume
60 Revision 1.1.4.1 2000/05/08 15:08:41 cblume
61 Replace AliTRDcluster by AliTRDrecPoint
63 Revision 1.1 2000/02/28 18:58:33 cblume
68 ///////////////////////////////////////////////////////////////////////////////
70 // TRD cluster finder for the fast simulator. It takes the hits from the //
71 // fast simulator (one hit per plane) and transforms them //
72 // into cluster, by applying position smearing and merging //
73 // of nearby cluster. The searing is done uniformly in z-direction //
74 // over the length of a readout pad. In rphi-direction a Gaussian //
75 // smearing is applied with a sigma given by fRphiSigma. //
76 // Clusters are considered as overlapping when they are closer in //
77 // rphi-direction than the value defined in fRphiDist. //
78 // Use the macro fastClusterCreate.C to create the cluster. //
80 ///////////////////////////////////////////////////////////////////////////////
88 #include "AliTRDclusterizerV0.h"
89 #include "AliTRDhit.h"
90 #include "AliTRDgeometry.h"
91 #include "AliTRDrecPoint.h"
93 ClassImp(AliTRDclusterizerV0)
95 //_____________________________________________________________________________
96 AliTRDclusterizerV0::AliTRDclusterizerV0():AliTRDclusterizer()
99 // AliTRDclusterizerV0 default constructor
104 //_____________________________________________________________________________
105 AliTRDclusterizerV0::AliTRDclusterizerV0(const Text_t* name, const Text_t* title)
106 :AliTRDclusterizer(name,title)
109 // AliTRDclusterizerV0 default constructor
116 //_____________________________________________________________________________
117 AliTRDclusterizerV0::~AliTRDclusterizerV0()
120 // AliTRDclusterizerV0 destructor
125 //_____________________________________________________________________________
126 void AliTRDclusterizerV0::Init()
129 // Initializes the cluster finder
132 // Position resolution in rphi-direction
134 // Minimum distance of non-overlapping cluster
139 //_____________________________________________________________________________
140 Bool_t AliTRDclusterizerV0::MakeClusters()
143 // Generates the cluster
146 // Get the pointer to the detector class and check for version 1
147 AliTRD *trd = (AliTRD*) gAlice->GetDetector("TRD");
148 if (trd->IsVersion() != 0) {
149 printf("AliTRDclusterizerV0::MakeCluster -- ");
150 printf("TRD must be version 0 (fast simulator).\n");
155 AliTRDgeometry *geo = trd->GetGeometry();
157 printf("AliTRDclusterizerV0::MakeCluster -- ");
158 printf("Start creating cluster.\n");
164 // Get the pointer to the hit tree
165 TTree *hitTree = gAlice->TreeH();
166 // Get the pointer to the reconstruction tree
167 TTree *clusterTree = gAlice->TreeR();
169 TObjArray *chamberArray = new TObjArray();
171 // Get the number of entries in the hit tree
172 // (Number of primary particles creating a hit somewhere)
173 Int_t nTrack = (Int_t) hitTree->GetEntries();
175 // Loop through all the chambers
176 for (Int_t icham = 0; icham < AliTRDgeometry::Ncham(); icham++) {
177 for (Int_t iplan = 0; iplan < AliTRDgeometry::Nplan(); iplan++) {
178 for (Int_t isect = 0; isect < AliTRDgeometry::Nsect(); isect++) {
180 Int_t nColMax = geo->GetColMax(iplan);
181 Float_t row0 = geo->GetRow0(iplan,icham,isect);
182 Float_t col0 = geo->GetCol0(iplan);
183 Float_t time0 = geo->GetTime0(iplan);
185 Float_t rowPadSize = geo->GetRowPadSize(iplan,icham,isect);
186 Float_t colPadSize = geo->GetColPadSize(iplan);
187 Float_t timeBinSize = geo->GetTimeBinSize();
189 // Loop through all entries in the tree
190 for (Int_t iTrack = 0; iTrack < nTrack; iTrack++) {
193 nBytes += hitTree->GetEvent(iTrack);
195 // Get the number of hits in the TRD created by this particle
196 Int_t nHit = trd->Hits()->GetEntriesFast();
198 // Loop through the TRD hits
199 for (Int_t iHit = 0; iHit < nHit; iHit++) {
201 if (!(hit = (AliTRDhit *) trd->Hits()->UncheckedAt(iHit)))
208 Int_t track = hit->Track();
209 Int_t detector = hit->GetDetector();
210 Int_t plane = geo->GetPlane(detector);
211 Int_t sector = geo->GetSector(detector);
212 Int_t chamber = geo->GetChamber(detector);
214 if ((sector != isect) ||
219 // Rotate the sectors on top of each other
221 geo->Rotate(detector,pos,rot);
223 // Add this recPoint to the temporary array for this chamber
224 AliTRDrecPoint *recPoint = new AliTRDrecPoint();
225 recPoint->SetLocalRow(rot[2]);
226 recPoint->SetLocalCol(rot[1]);
227 recPoint->SetLocalTime(rot[0]);
228 recPoint->SetEnergy(0);
229 recPoint->SetDetector(detector);
230 recPoint->AddDigit(track);
231 chamberArray->Add(recPoint);
237 // Loop through the temporary cluster-array
238 for (Int_t iClus1 = 0; iClus1 < chamberArray->GetEntries(); iClus1++) {
240 AliTRDrecPoint *recPoint1 = (AliTRDrecPoint *)
241 chamberArray->UncheckedAt(iClus1);
242 Float_t row1 = recPoint1->GetLocalRow();
243 Float_t col1 = recPoint1->GetLocalCol();
244 Float_t time1 = recPoint1->GetLocalTime();
246 if (recPoint1->GetEnergy() < 0) continue; // Skip marked cluster
248 const Int_t kNsave = 5;
249 Int_t idxSave[kNsave];
252 const Int_t kNsaveTrack = 3;
253 Int_t tracks[kNsaveTrack];
254 tracks[0] = recPoint1->GetDigit(0);
256 // Check the other cluster to see, whether there are close ones
257 for (Int_t iClus2 = iClus1 + 1; iClus2 < chamberArray->GetEntries(); iClus2++) {
259 AliTRDrecPoint *recPoint2 = (AliTRDrecPoint *)
260 chamberArray->UncheckedAt(iClus2);
261 Float_t row2 = recPoint2->GetLocalRow();
262 Float_t col2 = recPoint2->GetLocalCol();
264 if ((TMath::Abs(row1 - row2) < rowPadSize) ||
265 (TMath::Abs(col1 - col2) < fRphiDist)) {
266 if (iSave == kNsave) {
267 printf("AliTRDclusterizerV0::MakeCluster -- ");
268 printf("Boundary error: iSave = %d, kNsave = %d.\n"
272 idxSave[iSave] = iClus2;
274 if (iSave < kNsaveTrack) tracks[iSave] = recPoint2->GetDigit(0);
279 // Merge close cluster
280 Float_t rowMerge = row1;
281 Float_t colMerge = col1;
283 for (Int_t iMerge = 0; iMerge < iSave; iMerge++) {
284 AliTRDrecPoint *recPoint2 =
285 (AliTRDrecPoint *) chamberArray->UncheckedAt(idxSave[iMerge]);
286 rowMerge += recPoint2->GetLocalRow();
287 colMerge += recPoint2->GetLocalCol();
288 recPoint2->SetEnergy(-1); // Mark merged cluster
290 rowMerge /= (iSave + 1);
291 colMerge /= (iSave + 1);
296 // The position smearing in row-direction (uniform over pad width)
297 Int_t row = (Int_t) ((rowMerge - row0) / rowPadSize);
298 smear[0] = (row + gRandom->Rndm()) * rowPadSize + row0;
300 // The position smearing in rphi-direction (Gaussian)
303 smear[1] = gRandom->Gaus(colMerge,fRphiSigma);
304 while ((smear[1] < col0 ) ||
305 (smear[1] > col0 + nColMax * colPadSize));
307 // Time direction stays unchanged
310 // Transform into local coordinates
311 smear[0] = (Int_t) ((smear[0] - row0) / rowPadSize);
312 smear[1] = (Int_t) ((smear[1] - col0) / colPadSize);
313 smear[2] = (Int_t) ((time0 - smear[2]) / timeBinSize);
315 // Add the smeared cluster to the output array
316 Int_t detector = recPoint1->GetDetector();
317 Int_t digits[3] = {0};
319 trd->AddRecPoint(smear,digits,detector,0.0,tr);
323 // Clear the temporary cluster-array and delete the cluster
324 chamberArray->Delete();
330 printf("AliTRDclusterizerV0::MakeCluster -- ");
331 printf("Found %d points.\n",trd->RecPoints()->GetEntries());
332 printf("AliTRDclusterizerV0::MakeCluster -- ");
333 printf("Fill the cluster tree.\n");