CrossGapsAssociationAlgorithm.h

Go to the documentation of this file.

#ifndef LAR_CROSS_GAPS_ASSOCIATION_ALGORITHM_H
#define LAR_CROSS_GAPS_ASSOCIATION_ALGORITHM_H 1

#include "Pandora/Algorithm.h"

#include "larpandoracontent/LArObjects/LArTwoDSlidingFitResult.h"

#include "larpandoracontent/LArTwoDReco/LArClusterAssociation/ClusterAssociationAlgorithm.h"

namespace lar_content
{

class CrossGapsAssociationAlgorithm : public ClusterAssociationAlgorithm
{
public:
    CrossGapsAssociationAlgorithm();

private:
    void GetListOfCleanClusters(const pandora::ClusterList *const pClusterList, pandora::ClusterVector &clusterVector) const;
    void PopulateClusterAssociationMap(const pandora::ClusterVector &clusterVector, ClusterAssociationMap &clusterAssociationMap) const;
    bool IsExtremalCluster(const bool isForward, const pandora::Cluster *const pCurrentCluster, const pandora::Cluster *const pTestCluster) const;

    bool AreClustersAssociated(const TwoDSlidingFitResult &innerFitResult, const TwoDSlidingFitResult &outerFitResult) const;

    bool IsAssociated(const pandora::CartesianVector &startPosition, const pandora::CartesianVector &startDirection,
        const TwoDSlidingFitResult &targetFitResult) const;

    bool IsNearCluster(const pandora::CartesianVector &samplingPoint, const TwoDSlidingFitResult &targetFitResult) const;

    pandora::StatusCode ReadSettings(const pandora::TiXmlHandle xmlHandle);

    unsigned int m_minClusterHits;           
    unsigned int m_minClusterLayers;         
    unsigned int m_slidingFitWindow;         
    unsigned int m_maxSamplingPoints;        
    float m_sampleStepSize;                  
    unsigned int m_maxUnmatchedSampleRun;    
    float m_maxOnClusterDistance;            
    unsigned int m_minMatchedSamplingPoints; 
    float m_minMatchedSamplingFraction;      
    float m_gapTolerance;                    
};

} // namespace lar_content

#endif // #ifndef LAR_CROSS_GAPS_ASSOCIATION_ALGORITHM_H