CandidateVertexCreationAlgorithm.h

Go to the documentation of this file.

#ifndef LAR_CANDIDATE_VERTEX_CREATION_ALGORITHM_H
#define LAR_CANDIDATE_VERTEX_CREATION_ALGORITHM_H 1

#include "larpandoracontent/LArObjects/LArTwoDSlidingFitResult.h"

#include "Pandora/Algorithm.h"

#include <unordered_map>

namespace lar_content
{

class CandidateVertexCreationAlgorithm : public pandora::Algorithm
{
public:
    CandidateVertexCreationAlgorithm();

private:
    pandora::StatusCode Run();

    void SelectClusters(pandora::ClusterVector &clusterVectorU, pandora::ClusterVector &clusterVectorV, pandora::ClusterVector &clusterVectorW);

    void CreateEndpointCandidates(const pandora::ClusterVector &clusterVector1, const pandora::ClusterVector &clusterVector2) const;

    void CreateEndpointVertex(const pandora::CartesianVector &position1, const pandora::HitType hitType1, const TwoDSlidingFitResult &fitResult2) const;

    void CreateCrossingCandidates(const pandora::ClusterVector &clusterVectorU, const pandora::ClusterVector &clusterVectorV, const pandora::ClusterVector &clusterVectorW) const;

    void FindCrossingPoints(const pandora::ClusterVector &clusterVector, pandora::CartesianPointVector &crossingPoints) const;

    void GetSpacepoints(const pandora::Cluster *const pCluster, pandora::CartesianPointVector &spacePoints) const;

    void FindCrossingPoints(const pandora::CartesianPointVector &spacepoints1, const pandora::CartesianPointVector &spacepoints2,
        pandora::CartesianPointVector &crossingPoints) const;

    void CreateCrossingVertices(const pandora::CartesianPointVector &crossingPoints1, const pandora::CartesianPointVector &crossingPoints2,
        const pandora::HitType hitType1, const pandora::HitType hitType2, unsigned int &nCrossingCandidates) const;

    void AddToSlidingFitCache(const pandora::Cluster *const pCluster);

    const TwoDSlidingFitResult &GetCachedSlidingFitResult(const pandora::Cluster *const pCluster) const;

    void TidyUp();

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

    typedef std::unordered_map<const pandora::Cluster*, pandora::CartesianPointVector> ClusterToSpacepointsMap;

    pandora::StringVector   m_inputClusterListNames;            
    std::string             m_outputVertexListName;             
    bool                    m_replaceCurrentVertexList;         

    unsigned int            m_slidingFitWindow;                 
    TwoDSlidingFitResultMap m_slidingFitResultMap;              

    unsigned int            m_minClusterCaloHits;               
    float                   m_minClusterLengthSquared;          
    float                   m_chiSquaredCut;                    

    bool                    m_enableEndpointCandidates;         
    float                   m_maxEndpointXDiscrepancy;          

    bool                    m_enableCrossingCandidates;         
    unsigned int            m_nMaxCrossingCandidates;           
    float                   m_maxCrossingXDiscrepancy;          
    unsigned int            m_extrapolationNSteps;              
    float                   m_extrapolationStepSize;            
    float                   m_maxCrossingSeparationSquared;     
    float                   m_minNearbyCrossingDistanceSquared; 
};

} // namespace lar_content

#endif // #ifndef LAR_CANDIDATE_VERTEX_CREATION_ALGORITHM_H