LArSoft
v07_13_02
Liquid Argon Software toolkit - http://larsoft.org/
|
TwoDSlidingFitSplittingAlgorithm class. More...
#include "TwoDSlidingFitSplittingAlgorithm.h"
Public Member Functions | |
TwoDSlidingFitSplittingAlgorithm () | |
Default constructor. More... | |
Protected Member Functions | |
virtual pandora::StatusCode | ReadSettings (const pandora::TiXmlHandle xmlHandle) |
virtual pandora::StatusCode | FindBestSplitPosition (const TwoDSlidingFitResult &slidingFitResult, pandora::CartesianVector &splitPosition) const =0 |
Use sliding linear fit to identify the best split position. More... | |
virtual pandora::StatusCode | Run () |
pandora::StatusCode | RunUsingCurrentList () const |
Run the algorithm using the current cluster list as input. More... | |
Protected Attributes | |
unsigned int | m_slidingFitHalfWindow |
float | m_minClusterLength |
Private Member Functions | |
pandora::StatusCode | DivideCaloHits (const pandora::Cluster *const pCluster, pandora::CaloHitList &firstCaloHitList, pandora::CaloHitList &secondCaloHitList) const |
Divide calo hits in a cluster into two lists, each associated with a separate fragment cluster. More... | |
pandora::StatusCode | DivideCaloHits (const TwoDSlidingFitResult &slidingFitResult, const pandora::CartesianVector &splitPosition, pandora::CaloHitList &firstCaloHitList, pandora::CaloHitList &secondCaloHitList) const |
Use sliding linear fit to separate cluster into two fragments. More... | |
TwoDSlidingFitSplittingAlgorithm class.
Definition at line 21 of file TwoDSlidingFitSplittingAlgorithm.h.
lar_content::TwoDSlidingFitSplittingAlgorithm::TwoDSlidingFitSplittingAlgorithm | ( | ) |
Default constructor.
Definition at line 21 of file TwoDSlidingFitSplittingAlgorithm.cc.
References DivideCaloHits(), f, FindBestSplitPosition(), lar_content::TwoDSlidingFitResult::GetCluster(), lar_content::LArClusterHelper::GetLengthSquared(), lar_content::TwoDSlidingFitResult::GetLocalPosition(), lar_content::LArGeometryHelper::GetWireZPitch(), m_minClusterLength, and m_slidingFitHalfWindow.
|
privatevirtual |
Divide calo hits in a cluster into two lists, each associated with a separate fragment cluster.
pCluster | address of the cluster |
firstCaloHitList | the hits in the first fragment |
secondCaloHitList | the hits in the second fragment |
Implements lar_content::ClusterSplittingAlgorithm.
Referenced by TwoDSlidingFitSplittingAlgorithm().
|
private |
Use sliding linear fit to separate cluster into two fragments.
slidingFitResult | the input sliding fit result |
splitPosition | the split position |
firstCaloHitList | the hits in the first cluster fragment |
secondCaloHitList | the hits in the second cluster fragment |
|
protectedpure virtual |
Use sliding linear fit to identify the best split position.
slidingFitResult | the input sliding fit result |
splitPosition | the best split position |
Implemented in lar_content::KinkSplittingAlgorithm, and lar_content::VertexSplittingAlgorithm.
Referenced by TwoDSlidingFitSplittingAlgorithm().
|
protectedvirtual |
Reimplemented from lar_content::ClusterSplittingAlgorithm.
Reimplemented in lar_content::VertexSplittingAlgorithm, and lar_content::KinkSplittingAlgorithm.
Definition at line 94 of file TwoDSlidingFitSplittingAlgorithm.cc.
References m_minClusterLength, m_slidingFitHalfWindow, and lar_content::ClusterSplittingAlgorithm::ReadSettings().
Referenced by lar_content::KinkSplittingAlgorithm::ReadSettings(), and lar_content::VertexSplittingAlgorithm::ReadSettings().
|
protectedvirtualinherited |
Definition at line 20 of file ClusterSplittingAlgorithm.cc.
|
protectedinherited |
Run the algorithm using the current cluster list as input.
Definition at line 52 of file ClusterSplittingAlgorithm.cc.
|
protected |
Definition at line 44 of file TwoDSlidingFitSplittingAlgorithm.h.
Referenced by ReadSettings(), TwoDSlidingFitSplittingAlgorithm(), and lar_content::VertexSplittingAlgorithm::VertexSplittingAlgorithm().
|
protected |
Definition at line 43 of file TwoDSlidingFitSplittingAlgorithm.h.
Referenced by ReadSettings(), and TwoDSlidingFitSplittingAlgorithm().