32 #include "canvas/Persistency/Common/FindManyP.h" 68 double angle1 = a1.Angle(a2);
69 if (angle1 > TMath::PiOver2()) angle1 = TMath::Pi() - angle1;
70 double angle2 = a1.Angle(p1 - p2);
71 if (angle2 > TMath::PiOver2()) angle2 = TMath::Pi() - angle2;
72 if (angle1 < angcut && angle2 < angcut)
81 const std::vector<trkPoint>& trkpts2,
86 if (!trkpts1.size())
return match;
87 if (!trkpts2.size())
return match;
88 if ((trkpts1[0].
hit)->WireID().Cryostat == (trkpts2[0].hit)->
WireID().Cryostat &&
89 (trkpts1[0].hit)->
WireID().TPC == (trkpts2[0].hit)->
WireID().TPC)
112 trkpts1.back().pos, trkpts2[0].pos, trkpts1.back().dir, trkpts2[0].dir, angcut))
115 trkpts1[0].pos, trkpts2.back().pos, trkpts1[0].dir, trkpts2.back().dir, angcut))
118 trkpts1.back().pos, trkpts2.back().pos, trkpts1.back().dir, trkpts2.back().dir, angcut))
133 return tp1.
pos.X() < tp2.
pos.X();
139 return tp1.
pos.X() > tp2.
pos.X();
145 return tp1.
pos.Y() < tp2.
pos.Y();
151 return tp1.
pos.Y() > tp2.
pos.Y();
157 return tp1.
pos.Z() < tp2.
pos.Z();
163 return tp1.
pos.Z() > tp2.
pos.Z();
169 const double* xyz1 = h1.
XYZ();
170 const double* xyz2 = h2.
XYZ();
171 return xyz1[0] < xyz2[0];
177 const double* xyz1 = h1.
XYZ();
178 const double* xyz2 = h2.
XYZ();
179 return xyz1[0] > xyz2[0];
185 const double* xyz1 = h1.
XYZ();
186 const double* xyz2 = h2.
XYZ();
187 return xyz1[1] < xyz2[1];
193 const double* xyz1 = h1.
XYZ();
194 const double* xyz2 = h2.
XYZ();
195 return xyz1[1] > xyz2[1];
201 const double* xyz1 = h1.
XYZ();
202 const double* xyz2 = h2.
XYZ();
203 return xyz1[2] < xyz2[2];
209 const double* xyz1 = h1.
XYZ();
210 const double* xyz2 = h2.
XYZ();
211 return xyz1[2] > xyz2[2];
251 fDisCut = pset.get<
double>(
"DisCut");
252 fAngCut = pset.get<
double>(
"AngCut");
255 produces<std::vector<recob::Track>>();
256 produces<std::vector<recob::SpacePoint>>();
257 produces<art::Assns<recob::Track, recob::Cluster>>();
258 produces<art::Assns<recob::Track, recob::SpacePoint>>();
259 produces<art::Assns<recob::SpacePoint, recob::Hit>>();
260 produces<art::Assns<recob::Track, recob::Hit>>();
271 std::unique_ptr<std::vector<recob::Track>> tcol(
new std::vector<recob::Track>);
272 std::unique_ptr<std::vector<recob::SpacePoint>> spcol(
new std::vector<recob::SpacePoint>);
273 std::unique_ptr<art::Assns<recob::Track, recob::SpacePoint>> tspassn(
275 std::unique_ptr<art::Assns<recob::Track, recob::Cluster>> tcassn(
277 std::unique_ptr<art::Assns<recob::Track, recob::Hit>> thassn(
279 std::unique_ptr<art::Assns<recob::SpacePoint, recob::Hit>> shassn(
294 std::vector<art::Ptr<recob::Cluster>> clusterlist;
307 std::vector<std::vector<trkPoint>> trkpts(matchedclusters.size());
308 for (
size_t itrk = 0; itrk < matchedclusters.size(); ++itrk) {
310 std::vector<art::Ptr<recob::Hit>> hitlist;
311 for (
size_t iclu = 0; iclu < matchedclusters[itrk].size(); ++iclu) {
313 std::vector<art::Ptr<recob::Hit>> hits = fm.at(matchedclusters[itrk][iclu]);
314 for (
size_t ihit = 0; ihit < hits.size(); ++ihit) {
315 hitlist.push_back(hits[ihit]);
322 for (
size_t i = 0; i < hitlist.size(); ++i) {
326 trkpt.
hit = hitlist[i];
327 trkpts[itrk].push_back(trkpt);
339 size_t spStart = spcol->size();
340 std::vector<recob::SpacePoint> spacepoints;
351 spStart + spacepoints.size());
352 spacepoints.push_back(mysp);
353 spcol->push_back(mysp);
356 size_t spEnd = spcol->size();
358 std::sort(spacepoints.begin(), spacepoints.end(),
spt_sort_x0);
359 std::sort(spcol->begin() + spStart, spcol->begin() + spEnd,
spt_sort_x0);
362 std::sort(spacepoints.begin(), spacepoints.end(),
spt_sort_x1);
363 std::sort(spcol->begin() + spStart, spcol->begin() + spEnd,
spt_sort_x1);
366 std::sort(spacepoints.begin(), spacepoints.end(),
spt_sort_y0);
367 std::sort(spcol->begin() + spStart, spcol->begin() + spEnd,
spt_sort_y0);
370 std::sort(spacepoints.begin(), spacepoints.end(),
spt_sort_y1);
371 std::sort(spcol->begin() + spStart, spcol->begin() + spEnd,
spt_sort_y1);
374 std::sort(spacepoints.begin(), spacepoints.end(),
spt_sort_z0);
375 std::sort(spcol->begin() + spStart, spcol->begin() + spEnd,
spt_sort_z0);
378 std::sort(spacepoints.begin(), spacepoints.end(),
spt_sort_z1);
379 std::sort(spcol->begin() + spStart, spcol->begin() + spEnd,
spt_sort_z1);
382 if (spacepoints.size() > 0) {
385 std::vector<TVector3> xyz(spacepoints.size());
386 for (
size_t s = 0;
s < spacepoints.size(); ++
s) {
387 xyz[
s] = TVector3(spacepoints[
s].XYZ());
390 TVector3 startpointVec, endpointVec, DirCos;
391 startpointVec = xyz[0];
392 endpointVec = xyz.back();
393 DirCos = endpointVec - startpointVec;
399 std::cout <<
"The Spacepoint is infinitely small" <<
std::endl;
402 std::vector<TVector3> dircos(spacepoints.size(), DirCos);
420 std::vector<art::Ptr<recob::Hit>> trkhits;
421 for (
size_t ihit = 0; ihit < hitlist.size(); ++ihit) {
422 trkhits.push_back(hitlist[ihit]);
431 std::vector<std::vector<unsigned int>> trkidx;
434 for (
size_t itrk1 = 0; itrk1 < trkpts.size(); ++itrk1) {
435 for (
size_t itrk2 = itrk1 + 1; itrk2 < trkpts.size(); ++itrk2) {
439 for (
size_t i = 0; i < trkidx.size(); ++i) {
440 for (
size_t j = 0; j < trkidx[i].size(); ++j) {
441 if (trkidx[i][j] == itrk1) found1 = i;
442 if (trkidx[i][j] == itrk2) found2 = i;
445 if (found1 == -1 && found2 == -1) {
446 std::vector<unsigned int>
tmp;
447 tmp.push_back(itrk1);
448 tmp.push_back(itrk2);
449 trkidx.push_back(tmp);
451 else if (found1 == -1 && found2 != -1) {
452 trkidx[found2].push_back(itrk1);
454 else if (found1 != -1 && found2 == -1) {
455 trkidx[found1].push_back(itrk2);
457 else if (found1 != found2) {
458 trkidx[found1].insert(
459 trkidx[found1].
end(), trkidx[found2].
begin(), trkidx[found2].
end());
460 trkidx.erase(trkidx.begin() + found2);
465 for (
size_t itrk = 0; itrk < trkpts.size(); ++itrk) {
467 for (
size_t i = 0; i < trkidx.size(); ++i) {
468 for (
size_t j = 0; j < trkidx[i].size(); ++j) {
469 if (trkidx[i][j] == itrk) found =
true;
473 std::vector<unsigned int>
tmp;
475 trkidx.push_back(tmp);
480 trkidx.resize(trkpts.size());
481 for (
size_t i = 0; i < trkpts.size(); ++i) {
482 trkidx[i].push_back(i);
487 for (
size_t i = 0; i < trkidx.size(); ++i) {
489 std::vector<trkPoint> finaltrkpts;
491 std::vector<art::Ptr<recob::Cluster>> clustersPerTrack;
493 std::vector<art::Ptr<recob::Hit>> hitlist;
494 for (
size_t j = 0; j < trkidx[i].size(); ++j) {
495 for (
size_t k = 0;
k < trkpts[trkidx[i][j]].size(); ++
k) {
496 finaltrkpts.push_back(trkpts[trkidx[i][j]][
k]);
497 hitlist.push_back(trkpts[trkidx[i][j]][k].
hit);
499 for (
size_t iclu = 0; iclu < matchedclusters[trkidx[i][j]].size(); ++iclu) {
501 matchedclusters[trkidx[i][j]][iclu]);
502 clustersPerTrack.push_back(cluster);
514 size_t spStart = spcol->size();
515 std::vector<recob::SpacePoint> spacepoints;
516 for (
size_t ipt = 0; ipt < finaltrkpts.size(); ++ipt) {
520 hitcoord[0] = finaltrkpts[ipt].pos.X();
521 hitcoord[1] = finaltrkpts[ipt].pos.Y();
522 hitcoord[2] = finaltrkpts[ipt].pos.Z();
527 spStart + spacepoints.size());
528 spacepoints.push_back(mysp);
529 spcol->push_back(mysp);
532 size_t spEnd = spcol->size();
533 if (spacepoints.size() > 0) {
535 std::vector<TVector3> xyz(spacepoints.size());
536 std::vector<TVector3> dircos(spacepoints.size());
537 for (
size_t s = 0;
s < spacepoints.size(); ++
s) {
538 xyz[
s] = TVector3(spacepoints[
s].XYZ());
539 dircos[
s] = finaltrkpts[
s].dir;
541 if (spacepoints.size() > 1) {
543 TVector3 xyz1 = TVector3(spacepoints[
s + 1].XYZ());
544 TVector3
dir = xyz1 - xyz[
s];
545 if (dir.Angle(dircos[
s]) > 0.8 * TMath::Pi()) { dircos[
s] = -dircos[
s]; }
548 TVector3
dir = xyz[
s] - xyz[
s - 1];
549 if (dir.Angle(dircos[
s]) > 0.8 * TMath::Pi()) { dircos[
s] = -dircos[
s]; }
572 std::vector<art::Ptr<recob::Hit>> trkhits;
573 for (
size_t ihit = 0; ihit < hitlist.size(); ++ihit) {
574 trkhits.push_back(hitlist[ihit]);
583 for (
unsigned int i = 0; i < tcol->size(); ++i)
bool spt_sort_x1(const recob::SpacePoint h1, const recob::SpacePoint h2)
end
while True: pbar.update(maxval-len(onlies[E][S])) #print iS, "/", len(onlies[E][S]) found = False for...
bool sp_sort_x1(const trkPoint &tp1, const trkPoint &tp2)
MaybeLogger_< ELseverityLevel::ELsev_info, true > LogVerbatim
void cluster(In first, In last, Out result, Pred *pred)
bool sp_sort_y1(const trkPoint &tp1, const trkPoint &tp2)
ROOT::Math::SMatrix< Double32_t, 5, 5, ROOT::Math::MatRepSym< Double32_t, 5 > > SMatrixSym55
std::vector< Vector_t > convertCollToVector(std::vector< Vector > const &coll)
geo::WireID WireID() const
TrackTrajectory::Flags_t Flags_t
std::vector< TVector3 > trajPos
bool sp_sort_z1(const trkPoint &tp1, const trkPoint &tp2)
bool MatchTrack(const std::vector< trkPoint > &trkpts1, const std::vector< trkPoint > &trkpts2, double discut, double angcut)
art::Ptr< recob::Hit > hit
std::vector< TVector3 > trkDir
WireID_t Wire
Index of the wire within its plane.
bool fTrajOnly
Only use trajectory points from TrackTrajectoryAlg for debugging.
trkf::CosmicTrackerAlg fCTAlg
bool fStitchTracks
Stitch tracks from different TPCs.
std::vector< std::vector< unsigned int > > MatchedClusters(const detinfo::DetectorClocksData &clockdata, const detinfo::DetectorPropertiesData &detProp, const std::vector< art::Ptr< recob::Cluster >> &clusterlist, const art::FindManyP< recob::Hit > &fm) const
art framework interface to geometry description
double fAngCut
Angle cut for track merging.
bool sp_sort_z0(const trkPoint &tp1, const trkPoint &tp2)
bool sp_sort_y0(const trkPoint &tp1, const trkPoint &tp2)
bool sp_sort_x0(const trkPoint &tp1, const trkPoint &tp2)
bool AnglesConsistent(const TVector3 &p1, const TVector3 &p2, const TVector3 &a1, const TVector3 &a2, double angcut)
bool getByLabel(std::string const &label, std::string const &instance, Handle< PROD > &result) const
bool SortByWire(art::Ptr< recob::Hit > const &h1, art::Ptr< recob::Hit > const &h2)
#define DEFINE_ART_MODULE(klass)
IDparameter< geo::WireID > WireID
Member type of validated geo::WireID parameter.
void push_back(Ptr< U > const &p)
A trajectory in space reconstructed from hits.
bool spt_sort_y0(const recob::SpacePoint h1, const recob::SpacePoint h2)
bool spt_sort_z1(const recob::SpacePoint h1, const recob::SpacePoint h2)
void produce(art::Event &evt)
ProductID put(std::unique_ptr< PROD > &&edp, std::string const &instance={})
bool CreateAssn(PRODUCER const &prod, art::Event &evt, std::vector< T > const &a, art::Ptr< U > const &b, art::Assns< U, T > &assn, std::string a_instance, size_t indx=UINT_MAX)
Creates a single one-to-one association.
std::vector< Point_t > convertCollToPoint(std::vector< Point > const &coll)
cluster::ClusterMatchTQ fClusterMatch
void err(const char *fmt,...)
double fDisCut
Distance cut for track merging.
Detector simulation of raw signals on wires.
Q_EXPORT QTSManip setw(int w)
std::vector< TVector3 > trkPos
Declaration of signal hit object.
std::string fClusterModuleLabel
label for input cluster collection
bool spt_sort_z0(const recob::SpacePoint h1, const recob::SpacePoint h2)
void SPTReco(detinfo::DetectorClocksData const &clockData, detinfo::DetectorPropertiesData const &detProp, std::vector< art::Ptr< recob::Hit >> &fHits)
bool spt_sort_x0(const recob::SpacePoint h1, const recob::SpacePoint h2)
Provides recob::Track data product.
bool spt_sort_y1(const recob::SpacePoint h1, const recob::SpacePoint h2)
const Double32_t * XYZ() const
static constexpr double fm
decltype(auto) constexpr begin(T &&obj)
ADL-aware version of std::begin.
constexpr double kBogusD
obviously bogus double value
void fill_ptr_vector(std::vector< Ptr< T >> &ptrs, H const &h)
std::string fSortDir
sort space points
Q_EXPORT QTSManip setfill(int f)
Track from a non-cascading particle.A recob::Track consists of a recob::TrackTrajectory, plus additional members relevant for a "fitted" track:
QTextStream & endl(QTextStream &s)
std::vector< std::vector< art::Ptr< recob::Hit > > > trajHit