|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
|
#ifndef DTOccupancyCluster_H
#define DTOccupancyCluster_H
/** \class DTOccupancyCluster
* Cluster of DTOccupancyPoint used bt DTOccupancyTest to spot problematic layers.
* Layers are clusterized in the plane average cell occupancy - RMS of the cell occupancies.
*
* \author G. Cerminara - INFN Torino
*/
#include "DTOccupancyPoint.h"
#include <vector>
#include <string>
#include <cmath>
#include <set>
class TH2F;
class DTOccupancyCluster {
public:
/// Constructor
// Contruct the cluster from a couple of point
DTOccupancyCluster(const DTOccupancyPoint& firstPoint, const DTOccupancyPoint& secondPoint);
/// Constructor
// Contruct the cluster from a single point: you can not add points to such a cluster
DTOccupancyCluster(const DTOccupancyPoint& singlePoint);
/// Destructor
virtual ~DTOccupancyCluster();
// Operations
/// Check if the cluster candidate satisfies the quality requirements
bool isValid() const;
/// Add a point to the cluster: returns false if the point does not satisfy the
/// quality requirement
bool addPoint(const DTOccupancyPoint& anotherPoint);
/// Compute the distance of a single point from the cluster
/// (minimum distance with respect to the cluster points)
double distance(const DTOccupancyPoint& point) const;
/// average cell occupancy of the layers in the cluster
double averageMean() const;
/// average RMS of the cell occpuancy distributions of the layers in the cluster
double averageRMS() const;
/// max average cell occupancy of the layers in the cluster
double maxMean() const;
/// max RMS of the cell occpuancy distributions of the layers in the cluster
double maxRMS() const;
/// get a TH2F displaying the cluster
TH2F* getHisto(std::string histoName,
int nBinsX,
double minX,
double maxX,
int nBinsY,
double minY,
double maxY,
int fillColor) const;
/// # of layers belonging to the cluster
int nPoints() const;
std::set<DTLayerId> getLayerIDs() const;
protected:
private:
bool qualityCriterion(const DTOccupancyPoint& firstPoint, const DTOccupancyPoint& secondPoint);
bool qualityCriterion(const DTOccupancyPoint& anotherPoint);
void computeRadius();
bool theValidity;
double radius;
std::vector<DTOccupancyPoint> thePoints;
double theMaxMean;
double theMaxRMS;
double theMeanSum;
double theRMSSum;
};
/// for DTOccupancyCluster sorting
bool clusterIsLessThan(const DTOccupancyCluster& clusterOne, const DTOccupancyCluster& clusterTwo);
#endif
|