#include "VertexSplittingAlgorithm.h"

Inheritance diagram for lar_content::VertexSplittingAlgorithm:

Public Member Functions
	VertexSplittingAlgorithm ()
	Default constructor. More...

Protected Member Functions
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	ReadSettings (const pandora::TiXmlHandle xmlHandle)

pandora::StatusCode	FindBestSplitPosition (const TwoDSlidingFitResult &slidingFitResult, pandora::CartesianVector &splitPosition) const
	Use sliding linear fit to identify the best split position. More...

Private Attributes
float	m_splitDisplacementSquared
	Maximum displacement squared. More...

float	m_vertexDisplacementSquared
	Maximum displacement squared. More...

Detailed Description

VertexSplittingAlgorithm class.

Definition at line 21 of file VertexSplittingAlgorithm.h.

Constructor & Destructor Documentation

lar_content::VertexSplittingAlgorithm::VertexSplittingAlgorithm ( )

Default constructor.

Definition at line 21 of file VertexSplittingAlgorithm.cc.

References lar_content::TwoDSlidingFitSplittingAlgorithm::m_minClusterLength.

                                                    :
     m_splitDisplacementSquared(4.f * 4.f),
     m_vertexDisplacementSquared(1.f * 1.f)
 {
     // ATTN Some default values differ from base class
     m_minClusterLength = 1.f;
 }

Member Function Documentation

StatusCode lar_content::VertexSplittingAlgorithm::FindBestSplitPosition	(	const TwoDSlidingFitResult &	slidingFitResult,
		pandora::CartesianVector &	splitPosition
	)		const

privatevirtual

Use sliding linear fit to identify the best split position.

Parameters

slidingFitResult	the input sliding fit result
splitPosition	the best split position

Returns: pandora::StatusCode

Implements lar_content::TwoDSlidingFitSplittingAlgorithm.

Definition at line 31 of file VertexSplittingAlgorithm.cc.

References lar_content::TwoDSlidingFitResult::GetCluster(), lar_content::LArClusterHelper::GetClusterHitType(), lar_content::TwoDSlidingFitResult::GetGlobalFitProjection(), lar_content::TwoDSlidingFitResult::GetGlobalMaxLayerPosition(), lar_content::TwoDSlidingFitResult::GetGlobalMinLayerPosition(), m_splitDisplacementSquared, m_vertexDisplacementSquared, min, and lar_content::LArGeometryHelper::ProjectPosition().

 {
     // Identify event vertex
     const VertexList *pVertexList(NULL);
     PANDORA_RETURN_RESULT_IF(STATUS_CODE_SUCCESS, !=, PandoraContentApi::GetCurrentList(*this, pVertexList));
 
     if (pVertexList->empty())
         return STATUS_CODE_NOT_INITIALIZED;
 
     if (pVertexList->size() != 1)
         return STATUS_CODE_OUT_OF_RANGE;
 
     const Cluster *const pCluster(slidingFitResult.GetCluster());
     const HitType hitType(LArClusterHelper::GetClusterHitType(pCluster));
 
     const Vertex *const pSelectedVertex(*(pVertexList->begin()));
 
     if (VERTEX_3D != pSelectedVertex->GetVertexType())
         return STATUS_CODE_INVALID_PARAMETER;
 
     const CartesianVector theVertex2D(LArGeometryHelper::ProjectPosition(this->GetPandora(), pSelectedVertex->GetPosition(), hitType));
 
     const CartesianVector innerVertex2D(slidingFitResult.GetGlobalMinLayerPosition());
     const CartesianVector outerVertex2D(slidingFitResult.GetGlobalMaxLayerPosition());
 
     if ((outerVertex2D - innerVertex2D).GetMagnitudeSquared() < 4.f * m_vertexDisplacementSquared)
         return STATUS_CODE_NOT_FOUND;
 
     bool foundSplit(false);
     const StatusCode statusCode(slidingFitResult.GetGlobalFitProjection(theVertex2D, splitPosition));
 
     if (STATUS_CODE_SUCCESS != statusCode)
         return statusCode;
 
     const float splitDisplacementSquared((splitPosition - theVertex2D).GetMagnitudeSquared());
     const float vertexDisplacementSquared(std::min((splitPosition - innerVertex2D).GetMagnitudeSquared(), (splitPosition - outerVertex2D).GetMagnitudeSquared()));
 
     if ((splitDisplacementSquared < m_splitDisplacementSquared) && (vertexDisplacementSquared > m_vertexDisplacementSquared) &&
         (splitDisplacementSquared < vertexDisplacementSquared))
     {
         foundSplit = true;
     }
 
     if (!foundSplit)
         return STATUS_CODE_NOT_FOUND;
 
     return STATUS_CODE_SUCCESS;
 }

StatusCode lar_content::VertexSplittingAlgorithm::ReadSettings ( const pandora::TiXmlHandle xmlHandle )

privatevirtual

Reimplemented from lar_content::TwoDSlidingFitSplittingAlgorithm.

Definition at line 82 of file VertexSplittingAlgorithm.cc.

References m_splitDisplacementSquared, m_vertexDisplacementSquared, and lar_content::TwoDSlidingFitSplittingAlgorithm::ReadSettings().

 {
     float splitDisplacement = std::sqrt(m_splitDisplacementSquared);
     PANDORA_RETURN_RESULT_IF_AND_IF(STATUS_CODE_SUCCESS, STATUS_CODE_NOT_FOUND, !=, XmlHelper::ReadValue(xmlHandle,
         "SplitDisplacement", splitDisplacement));
     m_splitDisplacementSquared = splitDisplacement * splitDisplacement;
 
     float vertexDisplacement = std::sqrt(m_vertexDisplacementSquared);
     PANDORA_RETURN_RESULT_IF_AND_IF(STATUS_CODE_SUCCESS, STATUS_CODE_NOT_FOUND, !=, XmlHelper::ReadValue(xmlHandle,
         "VertexDisplacement", vertexDisplacement));
     m_vertexDisplacementSquared = vertexDisplacement * vertexDisplacement;
 
     return TwoDSlidingFitSplittingAlgorithm::ReadSettings(xmlHandle);
 }

StatusCode lar_content::ClusterSplittingAlgorithm::Run ( )

protectedvirtualinherited

Definition at line 20 of file ClusterSplittingAlgorithm.cc.

 {
     if (m_inputClusterListNames.empty())
         return this->RunUsingCurrentList();
 
     std::string originalListName;
     PANDORA_RETURN_RESULT_IF(STATUS_CODE_SUCCESS, !=, PandoraContentApi::GetCurrentListName<Cluster>(*this, originalListName));
 
     for (const std::string &clusterListName : m_inputClusterListNames)
     {
         const StatusCode listChangeStatusCode(PandoraContentApi::ReplaceCurrentList<Cluster>(*this, clusterListName));
 
         if (STATUS_CODE_NOT_FOUND == listChangeStatusCode)
         {
             if (PandoraContentApi::GetSettings(*this)->ShouldDisplayAlgorithmInfo())
                 std::cout << "ClusterSplittingAlgorithm: cluster list not found " << clusterListName << std::endl;
 
             continue;
         }
 
         if (STATUS_CODE_SUCCESS != listChangeStatusCode)
             return listChangeStatusCode;
 
         PANDORA_RETURN_RESULT_IF(STATUS_CODE_SUCCESS, !=, this->RunUsingCurrentList());
     }
 
     PANDORA_RETURN_RESULT_IF(STATUS_CODE_SUCCESS, !=, PandoraContentApi::ReplaceCurrentList<Cluster>(*this, originalListName));
     return STATUS_CODE_SUCCESS;
 }

StatusCode lar_content::ClusterSplittingAlgorithm::RunUsingCurrentList ( ) const

protectedinherited

Run the algorithm using the current cluster list as input.

Definition at line 52 of file ClusterSplittingAlgorithm.cc.

 {
     const ClusterList *pClusterList = NULL;
     PANDORA_RETURN_RESULT_IF(STATUS_CODE_SUCCESS, !=, PandoraContentApi::GetCurrentList(*this, pClusterList));
 
     ClusterList internalClusterList(pClusterList->begin(), pClusterList->end());
     internalClusterList.sort(LArClusterHelper::SortByNHits);
 
     for (ClusterList::iterator iter = internalClusterList.begin(); iter != internalClusterList.end(); ++iter)
     {
         const Cluster *const pCluster = *iter;
         ClusterList clusterSplittingList;
 
         if (STATUS_CODE_SUCCESS != this->SplitCluster(pCluster, clusterSplittingList))
             continue;
 
         internalClusterList.splice(internalClusterList.end(), clusterSplittingList);
         *iter = NULL;
     }
 
     return STATUS_CODE_SUCCESS;
 }

Member Data Documentation

float lar_content::TwoDSlidingFitSplittingAlgorithm::m_minClusterLength

protectedinherited

Definition at line 44 of file TwoDSlidingFitSplittingAlgorithm.h.

Referenced by lar_content::TwoDSlidingFitSplittingAlgorithm::ReadSettings(), lar_content::TwoDSlidingFitSplittingAlgorithm::TwoDSlidingFitSplittingAlgorithm(), and VertexSplittingAlgorithm().

unsigned int lar_content::TwoDSlidingFitSplittingAlgorithm::m_slidingFitHalfWindow

protectedinherited

Definition at line 43 of file TwoDSlidingFitSplittingAlgorithm.h.

Referenced by lar_content::TwoDSlidingFitSplittingAlgorithm::ReadSettings(), and lar_content::TwoDSlidingFitSplittingAlgorithm::TwoDSlidingFitSplittingAlgorithm().

float lar_content::VertexSplittingAlgorithm::m_splitDisplacementSquared

private

Maximum displacement squared.

Definition at line 33 of file VertexSplittingAlgorithm.h.

Referenced by FindBestSplitPosition(), and ReadSettings().

float lar_content::VertexSplittingAlgorithm::m_vertexDisplacementSquared

private

Maximum displacement squared.

Definition at line 34 of file VertexSplittingAlgorithm.h.

Referenced by FindBestSplitPosition(), and ReadSettings().

The documentation for this class was generated from the following files:

/cvmfs/larsoft.opensciencegrid.org/products/larpandoracontent/v03_14_03/source/larpandoracontent/LArTwoDReco/LArClusterSplitting/VertexSplittingAlgorithm.h
/cvmfs/larsoft.opensciencegrid.org/products/larpandoracontent/v03_14_03/source/larpandoracontent/LArTwoDReco/LArClusterSplitting/VertexSplittingAlgorithm.cc

Public Member Functions

Protected Member Functions

Protected Attributes

Private Member Functions

Private Attributes

Detailed Description

Constructor & Destructor Documentation

Member Function Documentation

Member Data Documentation