StRoot  1
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Groups Pages
Protected Types | Protected Member Functions | List of all members
StIstSimpleClusterAlgo Class Reference

#include <StIstSimpleClusterAlgo.h>

Inheritance diagram for StIstSimpleClusterAlgo:
StIstIClusterAlgo

Protected Types

enum  { kIstSimpleClusterAlgo = 1 }
 

Protected Member Functions

virtual Int_t doClustering (const StIstCollection &istCollection, StIstRawHitCollection &rawHits, StIstClusterCollection &clusters)
 
Int_t doSplitting (StIstClusterCollection &clusters, unsigned char numTimeBins)
 
Int_t splitCluster (int cSize, int clusterSizeList[], StIstRawHit *rawHitPtr[], StIstCluster *clusterIt, StIstClusterCollection &clusters, unsigned char numTimeBins)
 

Additional Inherited Members

- Public Member Functions inherited from StIstIClusterAlgo
void doClustering (StIstCollection &stIstCollection)
 
void setUsedTimeBin (unsigned char tb=UCHAR_MAX)
 
void setSplitFlag (bool splitFlag=true)
 
- Protected Attributes inherited from StIstIClusterAlgo
Bool_t mSplitCluster
 
UChar_t mTimeBin
 

Detailed Description

Concrete implementation of a simple algorithm for clustering of the raw hits registered by the 2D IST sensors. The clustering is done by searching in the 2D sensor plane indexed by row and column id's.

1) Reads all raw hits per ladder (six sensors) and writes into a vector. 2) Starts from the 1st raw hit, and loops over the vector looking for neighboring raw hits (in a sensor area) and do clustering. The found cluster will be filled into a ladder cluster collection. 3) A case-by-case splitting algorithm can be enabled/disabled for the found clusters (here only works for cases with cluster size <= 4).

Author
Yaping Wang
Date
March 2013
Author
Dmitri Smirnov

Definition at line 28 of file StIstSimpleClusterAlgo.h.


The documentation for this class was generated from the following files: