8 #ifndef LAR_CROSSED_TRACK_SPLITTING_ALGORITHM_H 9 #define LAR_CROSSED_TRACK_SPLITTING_ALGORITHM_H 1 11 #include "Pandora/Algorithm.h" 18 template <
typename,
unsigned int>
19 class KDTreeLinkerAlgo;
20 template <
typename,
unsigned int>
21 class KDTreeNodeInfoT;
42 typedef std::unordered_map<const pandora::CaloHit *, const pandora::Cluster *>
HitToClusterMap;
44 pandora::StatusCode
ReadSettings(
const pandora::TiXmlHandle xmlHandle);
48 pandora::CartesianVector &splitPosition, pandora::CartesianVector &direction1, pandora::CartesianVector &direction2)
const;
58 pandora::CartesianPointVector &candidateVector)
const;
70 #endif // #ifndef LAR_CROSSED_TRACK_SPLITTING_ALGORITHM_H std::vector< HitKDNode2D > HitKDNode2DList
pandora::StatusCode FindBestSplitPosition(const TwoDSlidingFitResult &slidingFit1, const TwoDSlidingFitResult &slidingFit2, pandora::CartesianVector &splitPosition, pandora::CartesianVector &direction1, pandora::CartesianVector &direction2) const
Find the best split position and direction for a pair of clusters.
float m_minCosRelativeAngle
maximum relative angle between tracks after un-crossing
float m_maxClusterSeparationSquared
maximum separation of two clusters (squared)
Data stored in each KDTree node. The dim1/dim2 fields are usually the duplication of some PFRecHit va...
std::unordered_map< const pandora::CaloHit *, const pandora::Cluster * > HitToClusterMap
KDTreeLinkerAlgo< const pandora::CaloHit *, 2 > HitKDTree2D
KDTreeNodeInfoT< const pandora::CaloHit *, 2 > HitKDNode2D
pandora::StatusCode TidyUpStep()
Tidy up any information cached in e.g. the preparation step.
void FindCandidateSplitPositions(const pandora::Cluster *const pCluster1, const pandora::Cluster *const pCluster2, pandora::CartesianPointVector &candidateVector) const
Find average positions of pairs of hits within a maximum separation.
pandora::StatusCode PreparationStep(const pandora::ClusterVector &clusterVector)
Perform any preparatory actions, such as caching information for subsequent expensive calculations...
pandora::StatusCode ReadSettings(const pandora::TiXmlHandle xmlHandle)
float m_maxClusterSeparation
maximum separation of two clusters
CrossedTrackSplittingAlgorithm class.
std::unordered_map< const pandora::Cluster *, pandora::ClusterSet > ClusterToClustersMap
ClusterToClustersMap m_nearbyClusters
The nearby clusters map.
CrossedTrackSplittingAlgorithm()
Default constructor.
std::vector< art::Ptr< recob::Cluster > > ClusterVector
TwoDSlidingFitSplittingAndSwitchingAlgorithm class.
float m_searchRegion1D
Search region, applied to each dimension, for look-up from kd-trees.
Header file for the two dimensional sliding fit splitting and switching algorithm class...
TwoDSlidingFitResult class.