cluster Namespace Reference

Cluster finding and building. More...

Namespaces
	details
	Implementation details of cluster namespace.

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)

Detailed Description

Cluster finding and building.

Cluster reconstruction namespace.

2D end point reconstruction

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]

Function Documentation

bool cluster::SortByLowHit	(	unsigned int	i,
		unsigned int	j
	)

Definition at line 130 of file ClusterCrawlerAlg.cxx.

  {
    return i > j;
  }

bool cluster::SortHits	(	HitLoc const &	h1,
		HitLoc const &	h2
	)

Definition at line 125 of file TrajCluster_module.cc.

  {
    // sort by hit location (Cryostat, TPC, Plane, Wire, StartTick, hit LocalIndex)
    if (h1.ctp != h2.ctp) return h1.ctp < h2.ctp;
    if (h1.wire != h2.wire) return h1.wire < h2.wire;
    if (h1.tick != h2.tick) return h1.tick < h2.tick;
    return h1.localIndex < h2.localIndex;
  } // SortHits

bool cluster::sortHitsByWire	(	art::Ptr< recob::Hit >	a,
		art::Ptr< recob::Hit >	b
	)

Definition at line 72 of file ClusterCheater_module.cc.

  {
    return a->WireID().Wire < b->WireID().Wire;
  }