tss::Cluster2D Class Reference

#include <SimpleClustering.h>

Public Member Functions
	Cluster2D (void)
	Cluster2D (const std::vector< const tss::Hit2D * > &hits)
size_t	size (void) const
const Hit2D &	operator[] (size_t index) const
const std::vector< const tss::Hit2D * > &	hits (void) const
std::vector< const tss::Hit2D * > &	hits (void)
bool	has (const tss::Hit2D *hit) const
double	length2 (void) const
double	dist2 (const TVector2 &p2d) const
double	dist2 (const TVector2 &p2d, size_t &hIdx) const
double	dist2 (const tss::Cluster2D &clu) const
const Hit2D *	release_at (size_t idx)
bool	release (const tss::Hit2D *hit)
void	push_back (const tss::Hit2D *hit)
void	take_from (tss::Cluster2D &clu, size_t idx)
void	merge (tss::Cluster2D &clu)
const tss::Hit2D *	start (void) const
const tss::Hit2D *	end (void) const
void	sort (void)
bool	isTagged (void) const
void	setTag (bool b)
bool	isDenseStart (void) const
void	tagDenseStart (bool b)
bool	isDenseEnd (void) const
void	tagDenseEnd (bool b)
bool	isEM (void) const
void	tagEM (bool b)
const Hit2D *	closest (const TVector2 &p2d, size_t &idx) const
const Hit2D *	outermost (size_t &idx) const
const TVector2	min (void) const
const TVector2	max (void) const

Private Attributes
std::vector< const tss::Hit2D * >	fHits
bool	fTag
bool	fDenseStart
bool	fDenseEnd
bool	fIsEM

Detailed Description

Definition at line 37 of file larreco/larreco/ClusterFinder/TrackShowerSplitter/Segmentation2D/SimpleClustering.h.

Constructor & Destructor Documentation

tss::Cluster2D::Cluster2D ( void  )

inline

Definition at line 41 of file larreco/larreco/ClusterFinder/TrackShowerSplitter/Segmentation2D/SimpleClustering.h.

: fTag(false), fDenseStart(false), fDenseEnd(false), fIsEM(false) { }

tss::Cluster2D::Cluster2D

(

const std::vector< const tss::Hit2D * > &

hits

)

Definition at line 11 of file SimpleClustering.cxx.

                                                                 :
        fDenseStart(false), fDenseEnd(false), fIsEM(false)
{
        fHits.reserve(hits.size());
        for (size_t h = 0; h < hits.size(); ++h) fHits.push_back(hits[h]);
}

Member Function Documentation

const tss::Hit2D * tss::Cluster2D::closest	(	const TVector2 &	p2d,
		size_t &	idx
	)		const

Definition at line 41 of file SimpleClustering.cxx.

{
        idx = 0;
        if (!fHits.size()) return 0;

        const tss::Hit2D* hout = fHits.front();
        double d, dmin = pma::Dist2(hout->Point2D(), p2d);
        for (size_t h = 1; h < fHits.size(); ++h)
        {
                d = pma::Dist2(fHits[h]->Point2D(), p2d);
                if (d < dmin) { dmin = d; hout = fHits[h]; idx = h; }
        }
        return hout;
}

double tss::Cluster2D::dist2

(

const TVector2 &

p2d

)

const

Definition at line 124 of file SimpleClustering.cxx.

{
        if (fHits.size())
        {
                double d2, min_d2 = pma::Dist2(fHits.front()->Point2D(), p2d);
                for (size_t i = 1; i < fHits.size(); ++i)
                {
                        d2 = pma::Dist2(fHits[i]->Point2D(), p2d);
                        if (d2 < min_d2) { min_d2 = d2; }
                }
                return min_d2;
        }
        else return 0.0;
}

double tss::Cluster2D::dist2	(	const TVector2 &	p2d,
		size_t &	hIdx
	)		const

Definition at line 140 of file SimpleClustering.cxx.

{
        hIdx = 0;
        if (fHits.size())
        {
                double d2, min_d2 = pma::Dist2(fHits.front()->Point2D(), p2d);
                for (size_t i = 1; i < fHits.size(); ++i)
                {
                        d2 = pma::Dist2(fHits[i]->Point2D(), p2d);
                        if (d2 < min_d2) { min_d2 = d2; hIdx = i; }
                }
                return min_d2;
        }
        else return 0.0;
}

double tss::Cluster2D::dist2

(

const tss::Cluster2D &

clu

)

const

Definition at line 157 of file SimpleClustering.cxx.

{
        if (fHits.size())
        {
                double d2, min_d2 = clu.dist2(fHits.front()->Point2D());
                for (size_t i = 1; i < fHits.size(); ++i)
                {
                        d2 = clu.dist2(fHits[i]->Point2D());
                        if (d2 < min_d2) { min_d2 = d2; }
                }
                return min_d2;
        }
        else return 0.0;
}

const tss::Hit2D* tss::Cluster2D::end ( void  ) const

inline

Definition at line 83 of file larreco/larreco/ClusterFinder/TrackShowerSplitter/Segmentation2D/SimpleClustering.h.

        {
                if (fHits.size()) return fHits.back();
                else return 0;
        }

bool tss::Cluster2D::has

(

const tss::Hit2D *

hit

)

const

Definition at line 116 of file SimpleClustering.cxx.

{
        for (size_t i = 0; i < fHits.size(); ++i)
                if (fHits[i] == hit) return true;
        return false;
}

const std::vector< const tss::Hit2D* >& tss::Cluster2D::hits ( void  ) const

inline

Definition at line 48 of file larreco/larreco/ClusterFinder/TrackShowerSplitter/Segmentation2D/SimpleClustering.h.

{ return fHits; }

std::vector< const tss::Hit2D* >& tss::Cluster2D::hits ( void  )

inline

Definition at line 49 of file larreco/larreco/ClusterFinder/TrackShowerSplitter/Segmentation2D/SimpleClustering.h.

{ return fHits; }

bool tss::Cluster2D::isDenseEnd ( void  ) const

inline

Definition at line 100 of file larreco/larreco/ClusterFinder/TrackShowerSplitter/Segmentation2D/SimpleClustering.h.

{ return fDenseEnd; }

bool tss::Cluster2D::isDenseStart ( void  ) const

inline

Definition at line 98 of file larreco/larreco/ClusterFinder/TrackShowerSplitter/Segmentation2D/SimpleClustering.h.

{ return fDenseStart; }

bool tss::Cluster2D::isEM ( void  ) const

inline

Definition at line 103 of file larreco/larreco/ClusterFinder/TrackShowerSplitter/Segmentation2D/SimpleClustering.h.

{ return fIsEM; }

bool tss::Cluster2D::isTagged ( void  ) const

inline

Definition at line 95 of file larreco/larreco/ClusterFinder/TrackShowerSplitter/Segmentation2D/SimpleClustering.h.

{ return fTag; }

double tss::Cluster2D::length2 ( void  ) const

inline

Definition at line 53 of file larreco/larreco/ClusterFinder/TrackShowerSplitter/Segmentation2D/SimpleClustering.h.

        {
                if (size() > 1) return pma::Dist2(fHits.front()->Point2D(), fHits.back()->Point2D());
                else return 0.0;
        }

const TVector2 tss::Cluster2D::max

(

void

)

const

Definition at line 98 of file SimpleClustering.cxx.

{

        TVector2 maximum = fHits[0]->Point2D();

        for (size_t i = 1; i < size(); ++i)
        {
                const TVector2 h = fHits[i]->Point2D();

                if (h.X() > maximum.X()) maximum.Set(h.X(), h.Y());
                if (h.Y() > maximum.Y()) maximum.Set(maximum.X(), h.Y());
        }

        return maximum;
}

void tss::Cluster2D::merge ( tss::Cluster2D &  clu )

inline

Definition at line 72 of file larreco/larreco/ClusterFinder/TrackShowerSplitter/Segmentation2D/SimpleClustering.h.

        {
                for (const auto h : clu.hits()) fHits.push_back(h);
                clu.hits().clear();
        }

const TVector2 tss::Cluster2D::min

(

void

)

const

Definition at line 80 of file SimpleClustering.cxx.

{

        TVector2 minimum = fHits[0]->Point2D();

        for (size_t i = 1; i < size(); ++i)
        {
                const TVector2 h = fHits[i]->Point2D();

                if (h.X() < minimum.X()) minimum.Set(h.X(), h.Y());
                if (h.Y() < minimum.Y()) minimum.Set(minimum.X(), h.Y());
        }

        return minimum;
}

const Hit2D& tss::Cluster2D::operator[] ( size_t  index ) const

inline

Definition at line 46 of file larreco/larreco/ClusterFinder/TrackShowerSplitter/Segmentation2D/SimpleClustering.h.

{ return *(fHits[index]); }

const tss::Hit2D * tss::Cluster2D::outermost

(

size_t &

idx

)

const

Definition at line 57 of file SimpleClustering.cxx.

{
        idx = 0;
        if (!fHits.size()) return 0;

        TVector2 mean(0., 0.);
        for (size_t h = 0; h < fHits.size(); ++h)
        {
                mean += fHits[h]->Point2D();
        }
        mean *= 1.0 / fHits.size();

        const tss::Hit2D* hout = fHits.front();
        double d, dmax = pma::Dist2(hout->Point2D(), mean);
        for (size_t h = 1; h < fHits.size(); ++h)
        {
                d = pma::Dist2(fHits[h]->Point2D(), mean);
                if (d > dmax) { dmax = d; hout = fHits[h]; idx = h; }
        }
        return hout;
}

void tss::Cluster2D::push_back ( const tss::Hit2D *  hit )

inline

Definition at line 66 of file larreco/larreco/ClusterFinder/TrackShowerSplitter/Segmentation2D/SimpleClustering.h.

{ fHits.push_back(hit); }

bool tss::Cluster2D::release

(

const tss::Hit2D *

hit

)

Definition at line 31 of file SimpleClustering.cxx.

{
        for (size_t h = 0; h < fHits.size(); ++h)
                if (fHits[h] == hit)
        {
                fHits.erase(fHits.begin() + h); return true;
        }
        return false;
}

const tss::Hit2D * tss::Cluster2D::release_at

(

size_t

idx

)

Definition at line 19 of file SimpleClustering.cxx.

{
        const tss::Hit2D* hit = 0;
        if (idx < fHits.size())
        {
                hit = fHits[idx];
                fHits.erase(fHits.begin() + idx);
        }
        return hit;
}

void tss::Cluster2D::setTag ( bool  b )

inline

Definition at line 96 of file larreco/larreco/ClusterFinder/TrackShowerSplitter/Segmentation2D/SimpleClustering.h.

{ fTag = b; }

size_t tss::Cluster2D::size ( void  ) const

inline

Definition at line 44 of file larreco/larreco/ClusterFinder/TrackShowerSplitter/Segmentation2D/SimpleClustering.h.

{ return fHits.size(); }

void tss::Cluster2D::sort ( void  )

inline

Definition at line 88 of file larreco/larreco/ClusterFinder/TrackShowerSplitter/Segmentation2D/SimpleClustering.h.

        {
                if (fHits.size() > 2)
                        std::sort(fHits.begin() + 1, fHits.end(),
                                tss::bDistToPointLess(fHits.front()->Point2D()));
        }

const tss::Hit2D* tss::Cluster2D::start ( void  ) const

inline

Definition at line 78 of file larreco/larreco/ClusterFinder/TrackShowerSplitter/Segmentation2D/SimpleClustering.h.

        {
                if (fHits.size()) return fHits.front();
                else return 0;
        }

void tss::Cluster2D::tagDenseEnd ( bool  b )

inline

Definition at line 101 of file larreco/larreco/ClusterFinder/TrackShowerSplitter/Segmentation2D/SimpleClustering.h.

{ fDenseEnd = b; }

void tss::Cluster2D::tagDenseStart ( bool  b )

inline

Definition at line 99 of file larreco/larreco/ClusterFinder/TrackShowerSplitter/Segmentation2D/SimpleClustering.h.

{ fDenseStart = b; }

void tss::Cluster2D::tagEM ( bool  b )

inline

Definition at line 104 of file larreco/larreco/ClusterFinder/TrackShowerSplitter/Segmentation2D/SimpleClustering.h.

{ fIsEM = b; }

void tss::Cluster2D::take_from ( tss::Cluster2D &  clu, size_t  idx  )

inline

Definition at line 67 of file larreco/larreco/ClusterFinder/TrackShowerSplitter/Segmentation2D/SimpleClustering.h.

        {
                const tss::Hit2D* hit = clu.release_at(idx);
                if (hit) push_back(hit);
        }

Member Data Documentation

bool tss::Cluster2D::fDenseEnd

private

Definition at line 116 of file larreco/larreco/ClusterFinder/TrackShowerSplitter/Segmentation2D/SimpleClustering.h.

bool tss::Cluster2D::fDenseStart

private

Definition at line 116 of file larreco/larreco/ClusterFinder/TrackShowerSplitter/Segmentation2D/SimpleClustering.h.

std::vector< const tss::Hit2D* > tss::Cluster2D::fHits

private

Definition at line 114 of file larreco/larreco/ClusterFinder/TrackShowerSplitter/Segmentation2D/SimpleClustering.h.

bool tss::Cluster2D::fIsEM

private

Definition at line 116 of file larreco/larreco/ClusterFinder/TrackShowerSplitter/Segmentation2D/SimpleClustering.h.

bool tss::Cluster2D::fTag

private

Definition at line 116 of file larreco/larreco/ClusterFinder/TrackShowerSplitter/Segmentation2D/SimpleClustering.h.

---

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

• larreco/larreco/ClusterFinder/TrackShowerSplitter/Segmentation2D/SimpleClustering.h
• SimpleClustering.cxx