LArSoft  v07_13_02
Liquid Argon Software toolkit - http://larsoft.org/
cluster Namespace Reference

Cluster finding and building. More...

Namespaces

 details
 Implementation details of cluster namespace.
 

Classes

class  BlurredClustering
 
class  BlurredClusteringAlg
 
struct  cluster_merge_info
 
class  cluster_params
 
class  ClusterAna
 
class  ClusterAndHitMerger
 Class merging clusters: recomputes start and end position and hit list. More...
 
class  ClusterCheater
 
class  ClusterCrawler
 
class  ClusterCrawlerAlg
 
class  ClusterCreator
 Class managing the creation of a new recob::Cluster object. More...
 
class  ClusterMatchAlg
 
class  ClusterMatchTQ
 
class  ClusterMergeAlg
 
class  ClusterMergeHelper
 
class  ClusterMerger
 Class merging clusters: recomputes start and end position and hit list. More...
 
class  ClusterParamsAlg
 
class  ClusterParamsAlgBase
 Algorithm collection class computing cluster parameters. More...
 
class  ClusterParamsImportWrapper
 Wrapper for ClusterParamsAlgBase objects to accept diverse input. More...
 
class  ClusterPCA
 
class  CRUException
 
class  DBcluster
 
class  DBCluster3D
 
class  DBclusterAna
 
class  DBScan3DAlg
 
class  DBScanAlg
 
class  EndPointAlg
 Algorithm to find 2D end points. More...
 
class  EndPointModule
 module to find 2D end points More...
 
struct  eveLoc
 
class  fuzzyCluster
 
class  fuzzyClusterAlg
 
class  FuzzyClusterMerger
 
struct  HitLoc
 
class  HoughBaseAlg
 
class  HoughLineFinder
 
class  HoughLineFinderAna
 
class  HoughTransform
 
class  HoughTransformCounters
 CountersMap with access optimized for Hough Transform algorithm. More...
 
class  LazyClusterParamsAlg
 Algorithm class inheriting cluster parameters. More...
 
class  LineCluster
 Produces clusters by ClusterCrawler algorithm. More...
 
class  LineMerger
 
class  MergeClusterAlg
 
class  OverriddenClusterParamsAlg
 Algorithm collection class computing cluster parameters. More...
 
class  SimpleClusterMerger
 
class  SimpleLineCluster
 
class  SmallClusterFilter
 
class  SmallClusterFinder
 
class  SmallClusterFinderAlg
 
class  StandardClusterParamsAlg
 Algorithm collection class computing cluster parameters. More...
 
class  TrajCluster
 Produces clusters by the TrajCluster algorithm. More...
 

Enumerations

enum  MergeMode : short int { MergeMode::Shower, MergeMode::Normal, MergeMode::ShowerIntercept, MergeMode::ChargeAsymAngle }
 

Functions

bool sortHitsByWire (art::Ptr< recob::Hit > a, art::Ptr< recob::Hit > b)
 
bool SortHits (HitLoc const &h1, HitLoc const &h2)
 
bool SortByLowHit (unsigned int i, unsigned int j)
 

Variables

const unsigned int kNO_CLUSTER = UINT_MAX
 
const unsigned int kNOISE_CLUSTER = UINT_MAX-1
 

Detailed Description

Cluster finding and building.

2D end point reconstruction

Cluster reconstruction namespace.

The algorithm is based on: C. Harris and M. Stephens (1988). "A combined corner and edge detector". Proceedings of the 4th Alvey Vision Conference. pp. 147-151. B. Morgan (2010). "Interest Point Detection for Reconstruction in High Granularity Tracking Detectors". arXiv:1006.3012v1 [physics.ins-det]

ClusterMatchTQ class

tjyan.nosp@m.g@fn.nosp@m.al.go.nosp@m.v

Algorithm for matching clusters between different views based on time and charge information

Input: a list of clusters and all hits associated with clusters Output: a vector of index vectors. Each group of indices represent a particle candidate

Enumeration Type Documentation

enum cluster::MergeMode : short int
strong
Enumerator
Shower 
Normal 
ShowerIntercept 
ChargeAsymAngle 

Definition at line 49 of file fuzzyClusterAlg.cxx.

Function Documentation

bool cluster::SortByLowHit ( unsigned int  i,
unsigned int  j 
)
bool cluster::SortHits ( HitLoc const &  h1,
HitLoc const &  h2 
)

Definition at line 115 of file TrajCluster_module.cc.

References cluster::HitLoc::ctp, cluster::HitLoc::localIndex, cluster::HitLoc::tick, and cluster::HitLoc::wire.

Referenced by cluster::TrajCluster::produce().

116  {
117  // sort by hit location (Cryostat, TPC, Plane, Wire, StartTick, hit LocalIndex)
118  if(h1.ctp != h2.ctp) return h1.ctp < h2.ctp;
119  if(h1.wire != h2.wire) return h1.wire < h2.wire;
120  if(h1.tick != h2.tick) return h1.tick < h2.tick;
121  return h1.localIndex < h2.localIndex;
122  } // SortHits
TH1F * h2
Definition: plot.C:46
TH1F * h1
Definition: plot.C:43
bool cluster::sortHitsByWire ( art::Ptr< recob::Hit a,
art::Ptr< recob::Hit b 
)

Definition at line 87 of file ClusterCheater_module.cc.

References geo::WireID::Wire, and recob::Hit::WireID().

Referenced by cluster::ClusterCheater::produce().

88  {
89  return a->WireID().Wire < b->WireID().Wire;
90  }
geo::WireID WireID() const
Initial tdc tick for hit.
Definition: Hit.h:234
WireID_t Wire
Index of the wire within its plane.
Definition: geo_types.h:313

Variable Documentation