SortByDistanceAlongLine class. More...

#include <TrackRefinementBaseAlgorithm.h>

Public Member Functions
	SortByDistanceAlongLine (const pandora::CartesianVector &startPoint, const pandora::CartesianVector &lineDirection, const bool hitWidthMode)
	Constructor. More...

bool	operator() (const pandora::CaloHit const pLhs, const pandora::CaloHit const pRhs) const
	Sort hits by their projected distance along a line from a start point. More...

Private Attributes
pandora::CartesianVector	m_startPoint
	The line start point. More...

pandora::CartesianVector	m_lineDirection
	The line end point. More...

bool	m_hitWidthMode
	Wether to consider hit widths or not. More...

Detailed Description

SortByDistanceAlongLine class.

Definition at line 36 of file TrackRefinementBaseAlgorithm.h.

Constructor & Destructor Documentation

lar_content::TrackRefinementBaseAlgorithm::SortByDistanceAlongLine::SortByDistanceAlongLine	(	const pandora::CartesianVector &	startPoint,
		const pandora::CartesianVector &	lineDirection,
		const bool	hitWidthMode
	)

inline

Constructor.

Parameters

startPoint	the line start point
lineDirection	the line direction unit vector
hitWidthMode	whether to consider hit widths or not

Definition at line 323 of file TrackRefinementBaseAlgorithm.h.

                                                                                                                     :
     m_startPoint(startPoint),
     m_lineDirection(lineDirection.GetUnitVector()),
     m_hitWidthMode(hitWidthMode)
 {
 }

Member Function Documentation

bool lar_content::TrackRefinementBaseAlgorithm::SortByDistanceAlongLine::operator()	(	const pandora::CaloHit *const	pLhs,
		const pandora::CaloHit *const	pRhs
	)		const

Sort hits by their projected distance along a line from a start point.

Parameters

pLhs	the address of the first hit
pRhs	the address of the second hit

Returns: whether lhs hit has a smaller projected distance along the line than rhs hit

Definition at line 871 of file TrackRefinementBaseAlgorithm.cc.

 {
     const CartesianVector lhsHitPosition(
         m_hitWidthMode ? LArHitWidthHelper::GetClosestPointToLine2D(m_startPoint, m_lineDirection, pLhs) : pLhs->GetPositionVector());
 
     const CartesianVector rhsHitPosition(
         m_hitWidthMode ? LArHitWidthHelper::GetClosestPointToLine2D(m_startPoint, m_lineDirection, pRhs) : pRhs->GetPositionVector());
 
     const float lhsLongitudinal = m_lineDirection.GetDotProduct(lhsHitPosition - m_startPoint);
     const float rhsLongitudinal = m_lineDirection.GetDotProduct(rhsHitPosition - m_startPoint);
 
     if (std::fabs(lhsLongitudinal - rhsLongitudinal) > std::numeric_limits<float>::epsilon())
     {
         // ATTN: Order from closest to furthest away
         return (lhsLongitudinal < rhsLongitudinal);
     }
 
     // ATTN: To deal with tiebreaks
     return LArClusterHelper::SortHitsByPulseHeight(pLhs, pRhs);
 }