ConvexHull.h

Go to the documentation of this file.

#ifndef ConvexHull_h
#define ConvexHull_h

// Algorithm includes
#include "larreco/RecoAlg/Cluster3DAlgs/Cluster3D.h"

// std includes
#include <list>
#include <algorithm>
//------------------------------------------------------------------------------------------------------------------------------------------

namespace lar_cluster3d
{
class ConvexHull
{
public:
    using Point           = std::tuple<float,float,const reco::ClusterHit3D*>;   
    using PointList       = std::list<Point>;                                    
    using PointPair       = std::pair<Point,Point>;
    using MinMaxPointPair = std::pair<PointPair,PointPair>;
    
    ConvexHull(const PointList&, float = 0.85, float = 0.35);

    virtual ~ConvexHull();
    
    const PointList& getPointsList() {return fPoints;}
    
    const PointList& getConvexHull() const {return fConvexHull;}
    
    const MinMaxPointPair& getMinMaxPointPair() const {return fMinMaxPointPair;}
    
    const PointList& getExtremePoints();
    
    const reco::ConvexHullKinkTupleList& getKinkPoints();

    float getConvexHullArea() const {return fConvexHullArea;}
    
    PointPair findNearestEdge(const Point&, float&) const;
    
    float findNearestDistance(const Point&) const;

private:
    
    void getConvexHull(const PointList&);

    float crossProduct(const Point& p0, const Point& p1, const Point& p2) const;

    float Area() const;

    bool isLeft(const Point& p0, const Point& p1, const Point& pCheck) const;
    
    float                         fKinkAngle;
    float                         fMinEdgeDistance;
    
    const PointList&              fPoints;
    PointList                     fConvexHull;
    MinMaxPointPair               fMinMaxPointPair;
    float                         fConvexHullArea;
    PointList                     fExtremePoints;
    reco::ConvexHullKinkTupleList fKinkPoints;
};
    
} // namespace lar_cluster3d
#endif