|
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
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
|
/** \file CSCSegment.cc
*
* \author Matteo Sani
*/
#include <DataFormats/CSCRecHit/interface/CSCSegment.h>
#include <iostream>
namespace {
// Get CSCDetId from one of the rechits, but then remove the layer part so it's a _chamber_ id
inline DetId buildDetId(CSCDetId id) { return CSCDetId(id.endcap(), id.station(), id.ring(), id.chamber(), 0); }
} // namespace
CSCSegment::CSCSegment(const std::vector<const CSCRecHit2D*>& proto_segment,
LocalPoint origin,
LocalVector direction,
const AlgebraicSymMatrix& errors,
double chi2)
: RecSegment(buildDetId(proto_segment.front()->cscDetId())),
theOrigin(origin),
theLocalDirection(direction),
theCovMatrix(errors),
theChi2(chi2),
aME11a_duplicate(false) {
for (unsigned int i = 0; i < proto_segment.size(); ++i)
theCSCRecHits.push_back(*proto_segment[i]);
}
CSCSegment::~CSCSegment() {}
std::vector<const TrackingRecHit*> CSCSegment::recHits() const {
std::vector<const TrackingRecHit*> pointersOfRecHits;
for (std::vector<CSCRecHit2D>::const_iterator irh = theCSCRecHits.begin(); irh != theCSCRecHits.end(); ++irh) {
pointersOfRecHits.push_back(&(*irh));
}
return pointersOfRecHits;
}
std::vector<TrackingRecHit*> CSCSegment::recHits() {
std::vector<TrackingRecHit*> pointersOfRecHits;
for (std::vector<CSCRecHit2D>::iterator irh = theCSCRecHits.begin(); irh != theCSCRecHits.end(); ++irh) {
pointersOfRecHits.push_back(&(*irh));
}
return pointersOfRecHits;
}
LocalError CSCSegment::localPositionError() const {
return LocalError(theCovMatrix[2][2], theCovMatrix[2][3], theCovMatrix[3][3]);
}
LocalError CSCSegment::localDirectionError() const {
return LocalError(theCovMatrix[0][0], theCovMatrix[0][1], theCovMatrix[1][1]);
}
AlgebraicVector CSCSegment::parameters() const {
// For consistency with DT and what we require for the TrackingRecHit interface,
// the order of the parameters in the returned vector should be (dx/dz, dy/dz, x, z)
AlgebraicVector result(4);
result[0] = theLocalDirection.x() / theLocalDirection.z();
result[1] = theLocalDirection.y() / theLocalDirection.z();
result[2] = theOrigin.x();
result[3] = theOrigin.y();
return result;
}
AlgebraicMatrix createStaticMatrix() {
AlgebraicMatrix m(4, 5, 0);
m[0][1] = 1;
m[1][2] = 1;
m[2][3] = 1;
m[3][4] = 1;
return m;
}
static const AlgebraicMatrix theProjectionMatrix = createStaticMatrix();
AlgebraicMatrix CSCSegment::projectionMatrix() const { return theProjectionMatrix; }
void CSCSegment::setDuplicateSegments(std::vector<CSCSegment*>& duplicates) {
theDuplicateSegments.clear();
for (unsigned int i = 0; i < duplicates.size(); ++i) {
theDuplicateSegments.push_back(*duplicates[i]);
//avoid copying duplicates of duplicates of duplicates...
theDuplicateSegments.back().theDuplicateSegments.resize(0);
}
}
bool CSCSegment::testSharesAllInSpecificRecHits(const std::vector<CSCRecHit2D>& specificRecHits_1,
const std::vector<CSCRecHit2D>& specificRecHits_2,
CSCRecHit2D::SharedInputType sharesInput) const {
const std::vector<CSCRecHit2D>* rhContainer_1 = &specificRecHits_1;
const std::vector<CSCRecHit2D>* rhContainer_2 = &specificRecHits_2;
if (specificRecHits_1.size() > specificRecHits_2.size()) {
rhContainer_2 = &specificRecHits_1;
rhContainer_1 = &specificRecHits_2;
}
//
bool shareConditionPassed = true;
for (std::vector<CSCRecHit2D>::const_iterator itRH = rhContainer_1->begin(); itRH != rhContainer_1->end(); ++itRH) {
const CSCRecHit2D* firstRecHit = &(*itRH);
bool sharedHit = false;
for (std::vector<CSCRecHit2D>::const_iterator itRH2 = rhContainer_2->begin(); itRH2 != rhContainer_2->end();
++itRH2) {
if (itRH2->sharesInput(firstRecHit, sharesInput)) {
sharedHit = true;
break;
}
}
if (!sharedHit) {
shareConditionPassed = false;
break;
}
}
return shareConditionPassed;
}
//bool CSCSegment::sharesRecHits(CSCSegment & anotherSegment, CSCRecHit2D::SharedInputType sharesInput){
// 2 tracks through a chamber leave 4 rechits per layer (2 strips x 2 wire groups)
// this function finds segments sharing wires or strips (first the rechits by sharesInput() )
// there could probably be more complicated cases with partial sharing (but this needs studies)
//
//return testSharesAllInSpecificRecHits( theCSCRecHits , anotherSegment.specificRecHits(), sharesInput);
//}
bool CSCSegment::sharesRecHits(const CSCSegment& anotherSegment, CSCRecHit2D::SharedInputType sharesInput) const {
return testSharesAllInSpecificRecHits(theCSCRecHits, anotherSegment.specificRecHits(), sharesInput);
}
//
bool CSCSegment::sharesRecHits(const CSCSegment& anotherSegment) const {
if (testSharesAllInSpecificRecHits(theCSCRecHits, anotherSegment.specificRecHits(), CSCRecHit2D::someWires) &&
testSharesAllInSpecificRecHits(theCSCRecHits, anotherSegment.specificRecHits(), CSCRecHit2D::someStrips)) {
return true;
} else {
return false;
}
}
//
float CSCSegment::time() const {
float averageTime = 0;
std::vector<float> wireTimes;
for (std::vector<CSCRecHit2D>::const_iterator itRH = theCSCRecHits.begin(); itRH != theCSCRecHits.end(); ++itRH) {
const CSCRecHit2D* recHit = &(*itRH);
averageTime += recHit->tpeak();
averageTime += recHit->wireTime();
wireTimes.push_back(recHit->wireTime());
}
averageTime = averageTime / (2 * theCSCRecHits.size());
//The wire times have a long tail that has to be pruned. The strip times (tpeak) are fine
bool modified = true;
while (modified) {
modified = false;
double maxDiff = -1;
std::vector<float>::iterator maxHit;
for (std::vector<float>::iterator itWT = wireTimes.begin(); itWT != wireTimes.end(); ++itWT) {
float diff = fabs(*itWT - averageTime);
if (diff > maxDiff) {
maxDiff = diff;
maxHit = itWT;
}
}
if (maxDiff > 26) {
int N = theCSCRecHits.size() + wireTimes.size();
averageTime = (averageTime * N - (*maxHit)) / (N - 1);
wireTimes.erase(maxHit);
modified = true;
}
}
return averageTime;
}
//
void CSCSegment::print() const { std::cout << *this << std::endl; }
std::ostream& operator<<(std::ostream& os, const CSCSegment& seg) {
os << "CSCSegment: local pos = " << seg.localPosition() << " posErr = (" << sqrt(seg.localPositionError().xx()) << ","
<< sqrt(seg.localPositionError().yy()) << "0,)\n"
<< " dir = " << seg.localDirection() << " dirErr = (" << sqrt(seg.localDirectionError().xx()) << ","
<< sqrt(seg.localDirectionError().yy()) << "0,)\n"
<< " chi2/ndf = " << seg.chi2() / double(seg.degreesOfFreedom())
<< " #rechits = " << seg.specificRecHits().size() << " ME1/1a duplicates : " << seg.duplicateSegments().size();
return os;
}
/*
const CSCChamber* CSCSegment::chamber() const { return theChamber; }
*/
|