SimpleClustering.h

Go to the documentation of this file.

#ifndef SimpleClustering_h
#define SimpleClustering_h

#include "TssHit2D.h"
#include "larreco/RecoAlg/PMAlg/Utilities.h"

namespace tss
{
        struct bDistToPointLess;
        class Cluster2D;

        class SimpleClustering;
}

struct tss::bDistToPointLess :
        public std::binary_function<const tss::Hit2D*, const tss::Hit2D*, bool>
{
        bDistToPointLess(const TVector2& point) : p0(point) { }
        
        bool operator() (const tss::Hit2D* h1, const tss::Hit2D* h2)
        {
                if (h1 && h2) return pma::Dist2(h1->Point2D(), p0) < pma::Dist2(h2->Point2D(), p0);
                else return false;
        }
        
        private: TVector2 p0;
};

class tss::Cluster2D
{
public:

        Cluster2D(void) : fTag(false), fDenseStart(false), fDenseEnd(false), fIsEM(false) { }
        Cluster2D(const std::vector< const tss::Hit2D* > & hits);

        size_t size(void) const { return fHits.size(); }

        const Hit2D & operator [] (size_t index) const { return *(fHits[index]); }

        const std::vector< const tss::Hit2D* > & hits(void) const { return fHits; }
        std::vector< const tss::Hit2D* > & hits(void) { return fHits; }

        bool has(const tss::Hit2D* hit) const;

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

        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) { fHits.push_back(hit); }
        void take_from(tss::Cluster2D & clu, size_t idx)
        {
                const tss::Hit2D* hit = clu.release_at(idx);
                if (hit) push_back(hit);
        }
        void merge(tss::Cluster2D & clu)
        {
                for (const auto h : clu.hits()) fHits.push_back(h);
                clu.hits().clear();
        }

        const tss::Hit2D* start(void) const
        {
                if (fHits.size()) return fHits.front();
                else return 0;
        }
        const tss::Hit2D* end(void) const
        {
                if (fHits.size()) return fHits.back();
                else return 0;
        }
        void sort(void)
        {
                if (fHits.size() > 2)
                        std::sort(fHits.begin() + 1, fHits.end(),
                                tss::bDistToPointLess(fHits.front()->Point2D()));
        }

        bool isTagged(void) const { return fTag; }
        void setTag(bool b) { fTag = b; }

        bool isDenseStart(void) const { return fDenseStart; }
        void tagDenseStart(bool b) { fDenseStart = b; }
        bool isDenseEnd(void) const { return fDenseEnd; }
        void tagDenseEnd(bool b) { fDenseEnd = b; }

        bool isEM(void) const { return fIsEM; }
        void tagEM(bool b) { fIsEM = 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:

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

        bool fTag, fDenseStart, fDenseEnd, fIsEM;

};

class tss::SimpleClustering
{
public:

        std::vector< tss::Cluster2D > run(const std::vector< tss::Hit2D > & inp) const;
        std::vector< tss::Cluster2D > run(const tss::Cluster2D & inp) const;

        bool hitsTouching(const tss::Hit2D & h1, const tss::Hit2D & h2) const;
        bool hitsTouching(const tss::Cluster2D & c1, const tss::Hit2D & h2) const;
        bool hitsTouching(const tss::Cluster2D & c1, const tss::Cluster2D & c2) const;

private:

        void merge(std::vector< tss::Cluster2D > & clusters) const;
};

#endif