CrossedTrackSplittingAlgorithm.h

Go to the documentation of this file.

#ifndef LAR_CROSSED_TRACK_SPLITTING_ALGORITHM_H
#define LAR_CROSSED_TRACK_SPLITTING_ALGORITHM_H 1

#include "Pandora/Algorithm.h"

#include "larpandoracontent/LArTwoDReco/LArClusterSplitting/TwoDSlidingFitSplittingAndSwitchingAlgorithm.h"

namespace lar_content
{

template<typename, unsigned int> class KDTreeLinkerAlgo;
template<typename, unsigned int> class KDTreeNodeInfoT;

//------------------------------------------------------------------------------------------------------------------------------------------

class CrossedTrackSplittingAlgorithm : public TwoDSlidingFitSplittingAndSwitchingAlgorithm
{
public:
    CrossedTrackSplittingAlgorithm();

private:
    typedef KDTreeLinkerAlgo<const pandora::CaloHit*, 2> HitKDTree2D;
    typedef KDTreeNodeInfoT<const pandora::CaloHit*, 2> HitKDNode2D;
    typedef std::vector<HitKDNode2D> HitKDNode2DList;

    typedef std::unordered_map<const pandora::Cluster*, pandora::ClusterSet> ClusterToClustersMap;
    typedef std::unordered_map<const pandora::CaloHit*, const pandora::Cluster*> HitToClusterMap;

    pandora::StatusCode ReadSettings(const pandora::TiXmlHandle xmlHandle);
    pandora::StatusCode PreparationStep(const pandora::ClusterVector &clusterVector);
    pandora::StatusCode TidyUpStep();
    pandora::StatusCode FindBestSplitPosition(const TwoDSlidingFitResult &slidingFit1, const TwoDSlidingFitResult &slidingFit2,
        pandora::CartesianVector &splitPosition, pandora::CartesianVector &direction1, pandora::CartesianVector &direction2) const;

    void FindCandidateSplitPositions(const pandora::Cluster *const pCluster1, const pandora::Cluster *const pCluster2,
        pandora::CartesianPointVector &candidateVector) const;

    float                   m_maxClusterSeparation;             
    float                   m_maxClusterSeparationSquared;      
    float                   m_minCosRelativeAngle;              

    float                   m_searchRegion1D;                   
    ClusterToClustersMap    m_nearbyClusters;                   
};

} // namespace lar_content

#endif // #ifndef LAR_CROSSED_TRACK_SPLITTING_ALGORITHM_H