#include <RoadSearchSeedFinderAlgorithm.h>
Definition at line 45 of file RoadSearchSeedFinderAlgorithm.h.
RoadSearchSeedFinderAlgorithm::RoadSearchSeedFinderAlgorithm | ( | const edm::ParameterSet & | conf | ) |
Definition at line 62 of file RoadSearchSeedFinderAlgorithm.cc.
References allNegativeOnly, allPositiveOnly, edm::ParameterSet::getParameter(), innerSeedHitAccessMode_, innerSeedHitAccessUseRPhi_, innerSeedHitAccessUseStereo_, innerSeedHitVector_, maxBarrelImpactParameter_, maxEndcapImpactParameter_, maxNumberOfSeeds_, mergeSeedsCenterCut_, mergeSeedsCenterCut_A_, mergeSeedsCenterCut_B_, mergeSeedsCenterCut_C_, mergeSeedsDifferentHitsCut_, mergeSeedsRadiusCut_, mergeSeedsRadiusCut_A_, mergeSeedsRadiusCut_B_, mergeSeedsRadiusCut_C_, minPt_, mode_, outerSeedHitAccessMode_, outerSeedHitAccessUseRPhi_, outerSeedHitAccessUseStereo_, outerSeedHitVector_, phiRangeDetIdLookup_, roadsLabel_, DetHitAccess::rphi, DetHitAccess::setMode(), DetHitAccess::standard, tmp, DetHitAccess::use_rphiRecHits(), and DetHitAccess::use_stereoRecHits().
{ minPt_ = conf.getParameter<double>("MinimalReconstructedTransverseMomentum"); maxBarrelImpactParameter_ = conf.getParameter<double>("MaximalBarrelImpactParameter"); maxEndcapImpactParameter_ = conf.getParameter<double>("MaximalEndcapImpactParameter"); phiRangeDetIdLookup_ = conf.getParameter<double>("PhiRangeForDetIdLookupInRings"); mergeSeedsCenterCut_A_ = conf.getParameter<double>("MergeSeedsCenterCut_A"); mergeSeedsRadiusCut_A_ = conf.getParameter<double>("MergeSeedsRadiusCut_A"); mergeSeedsCenterCut_B_ = conf.getParameter<double>("MergeSeedsCenterCut_B"); mergeSeedsRadiusCut_B_ = conf.getParameter<double>("MergeSeedsRadiusCut_B"); mergeSeedsCenterCut_C_ = conf.getParameter<double>("MergeSeedsCenterCut_C"); mergeSeedsRadiusCut_C_ = conf.getParameter<double>("MergeSeedsRadiusCut_C"); mergeSeedsCenterCut_ = mergeSeedsCenterCut_A_; mergeSeedsRadiusCut_ = mergeSeedsRadiusCut_A_; mergeSeedsDifferentHitsCut_ = conf.getParameter<unsigned int>("MergeSeedsDifferentHitsCut"); mode_ = conf.getParameter<std::string>("Mode"); //special parameters for cosmic track reconstruction //cosmicTracking_ = conf.getParameter<bool>("CosmicTracking"); //maxNumberOfClusters_ = conf.getParameter<unsigned int>("MaxNumberOfClusters"); // safety check for mode if ( mode_ != "STANDARD" && mode_ != "STRAIGHT-LINE" ) { mode_ = "STANDARD"; } std::string tmp = conf.getParameter<std::string>("InnerSeedRecHitAccessMode"); if ( tmp == "STANDARD" ) { innerSeedHitAccessMode_ = DetHitAccess::standard; } else if ( tmp == "RPHI" ) { innerSeedHitAccessMode_ = DetHitAccess::rphi; } else { innerSeedHitAccessMode_ = DetHitAccess::standard; } innerSeedHitAccessUseRPhi_ = conf.getParameter<bool>("InnerSeedRecHitAccessUseRPhi"); innerSeedHitAccessUseStereo_ = conf.getParameter<bool>("InnerSeedRecHitAccessUseStereo"); tmp = conf.getParameter<std::string>("OuterSeedRecHitAccessMode"); if ( tmp == "STANDARD" ) { outerSeedHitAccessMode_ = DetHitAccess::standard; } else if ( tmp == "RPHI" ) { outerSeedHitAccessMode_ = DetHitAccess::rphi; } else { outerSeedHitAccessMode_ = DetHitAccess::standard; } outerSeedHitAccessUseRPhi_ = conf.getParameter<bool>("OuterSeedRecHitAccessUseRPhi"); outerSeedHitAccessUseStereo_ = conf.getParameter<bool>("OuterSeedRecHitAccessUseStereo"); // configure DetHitAccess innerSeedHitVector_.setMode(innerSeedHitAccessMode_); innerSeedHitVector_.use_rphiRecHits(innerSeedHitAccessUseRPhi_); innerSeedHitVector_.use_stereoRecHits(innerSeedHitAccessUseStereo_); outerSeedHitVector_.setMode(outerSeedHitAccessMode_); outerSeedHitVector_.use_rphiRecHits(outerSeedHitAccessUseRPhi_); outerSeedHitVector_.use_stereoRecHits(outerSeedHitAccessUseStereo_); roadsLabel_ = conf.getParameter<std::string>("RoadsLabel"); maxNumberOfSeeds_ = conf.getParameter<int32_t>("MaxNumberOfSeeds"); //***top-bottom allPositiveOnly = conf.getParameter<bool>("AllPositiveOnly"); allNegativeOnly = conf.getParameter<bool>("AllNegativeOnly"); //*** }
RoadSearchSeedFinderAlgorithm::~RoadSearchSeedFinderAlgorithm | ( | ) |
Definition at line 129 of file RoadSearchSeedFinderAlgorithm.cc.
{ }
bool RoadSearchSeedFinderAlgorithm::calculateCircleSeedsFromHits | ( | std::vector< RoadSearchCircleSeed > & | circleSeeds, |
const Roads::RoadSeed * | seed, | ||
const Roads::RoadSet * | set, | ||
GlobalPoint | ring1GlobalPoint, | ||
TrackingRecHit * | ring1RecHit, | ||
std::vector< TrackingRecHit * > | ring2RecHits, | ||
std::vector< TrackingRecHit * > | ring3RecHits | ||
) |
Definition at line 626 of file RoadSearchSeedFinderAlgorithm.cc.
References fireworks::addCircle(), RoadSearchCircleSeed::Compare(), TrackerGeometry::idToDet(), RoadSearchCircleSeed::ImpactParameter(), RoadSearchCircleSeed::InBarrel(), maxBarrelImpactParameter_, maxEndcapImpactParameter_, mergeSeedsCenterCut_, mergeSeedsDifferentHitsCut_, mergeSeedsRadiusCut_, minRadius_, RoadSearchCircleSeed::Radius(), query::result, RoadSearchCircleSeed::setSeed(), RoadSearchCircleSeed::setSet(), RoadSearchCircleSeed::straightLine, GeomDet::toGlobal(), tracker_, and RoadSearchCircleSeed::Type().
Referenced by calculateCircleSeedsFromRingsOneInnerOneOuter(), calculateCircleSeedsFromRingsOneInnerTwoOuter(), and calculateCircleSeedsFromRingsTwoInnerOneOuter().
{ // // calculate RoadSearchCircleSeed // // apply circle seed cuts // // return value bool result = true; for ( std::vector<TrackingRecHit*>::iterator ring2RecHit = ring2RecHits.begin(); ring2RecHit != ring2RecHits.end(); ++ring2RecHit) { GlobalPoint ring2GlobalPoint = tracker_->idToDet((*ring2RecHit)->geographicalId())->surface().toGlobal((*ring2RecHit)->localPosition()); for ( std::vector<TrackingRecHit*>::iterator ring3RecHit = ring3RecHits.begin(); ring3RecHit != ring3RecHits.end(); ++ring3RecHit) { GlobalPoint ring3GlobalPoint = tracker_->idToDet((*ring3RecHit)->geographicalId())->surface().toGlobal((*ring3RecHit)->localPosition()); RoadSearchCircleSeed circle(ring1RecHit, *ring2RecHit, *ring3RecHit, ring1GlobalPoint, ring2GlobalPoint, ring3GlobalPoint); bool addCircle = false; if ( circle.Type() == RoadSearchCircleSeed::straightLine ) { addCircle = true; } else { if ( (circle.Radius() > minRadius_) && ((circle.InBarrel() && circle.ImpactParameter() < maxBarrelImpactParameter_) || (!circle.InBarrel() && circle.ImpactParameter() < maxEndcapImpactParameter_)) ) { addCircle = true; // check if circle compatible with previous circles, if not, add for (std::vector<RoadSearchCircleSeed>::iterator alreadyContainedCircle = circleSeeds.begin(), alreadyContainedCircleEnd = circleSeeds.end(); alreadyContainedCircle != alreadyContainedCircleEnd; ++alreadyContainedCircle ) { if ( circle.Compare(&*alreadyContainedCircle, mergeSeedsCenterCut_, mergeSeedsRadiusCut_, mergeSeedsDifferentHitsCut_) ) { addCircle = false; break; } } } } if ( addCircle ) { circle.setSeed(seed); circle.setSet(set); circleSeeds.push_back(circle); } } } return result; }
bool RoadSearchSeedFinderAlgorithm::calculateCircleSeedsFromHits | ( | std::vector< RoadSearchCircleSeed > & | circleSeeds, |
const Roads::RoadSeed * | seed, | ||
const Roads::RoadSet * | set, | ||
GlobalPoint | ring1GlobalPoint, | ||
TrackingRecHit * | ring1RecHit, | ||
std::vector< TrackingRecHit * > | ring2RecHits | ||
) |
Definition at line 696 of file RoadSearchSeedFinderAlgorithm.cc.
References TrackerGeometry::idToDet(), query::result, RoadSearchCircleSeed::setSeed(), RoadSearchCircleSeed::setSet(), GeomDet::toGlobal(), and tracker_.
{ // // calculate RoadSearchCircleSeed from two hits, calculate straight line // // // return value bool result = true; for ( std::vector<TrackingRecHit*>::iterator ring2RecHit = ring2RecHits.begin(); ring2RecHit != ring2RecHits.end(); ++ring2RecHit) { GlobalPoint ring2GlobalPoint = tracker_->idToDet((*ring2RecHit)->geographicalId())->surface().toGlobal((*ring2RecHit)->localPosition()); RoadSearchCircleSeed circle(ring1RecHit, *ring2RecHit, ring1GlobalPoint, ring2GlobalPoint); circle.setSeed(seed); circle.setSet(set); circleSeeds.push_back(circle); } return result; }
bool RoadSearchSeedFinderAlgorithm::calculateCircleSeedsFromRingsOneInnerOneOuter | ( | std::vector< RoadSearchCircleSeed > & | circleSeeds, |
const Roads::RoadSeed * | seed, | ||
const Roads::RoadSet * | set, | ||
const Ring * | ring1, | ||
const Ring * | ring2 | ||
) |
Definition at line 548 of file RoadSearchSeedFinderAlgorithm.cc.
References Ring::begin(), calculateCircleSeedsFromHits(), Ring::end(), DetHitAccess::getHitVector(), TrackerGeometry::idToDet(), innerSeedHitVector_, Ring::lower_bound(), outerSeedHitVector_, PV3DBase< T, PVType, FrameType >::phi(), phiRangeDetIdLookup_, Geom::pi(), query::result, RingESSource_cfi::rings, GeomDet::toGlobal(), tracker_, Geom::twoPi(), and Ring::upper_bound().
Referenced by run().
{ // // calculate RoadSearchCircleSeed // // apply circle seed cuts // // return value bool result = true; // loop over detid's in first rings for ( Ring::const_iterator ring1DetIdIterator = ring1->begin(); ring1DetIdIterator != ring1->end(); ++ring1DetIdIterator ) { DetId ring1DetId = ring1DetIdIterator->second; std::vector<TrackingRecHit*> ring1RecHits = innerSeedHitVector_.getHitVector(&ring1DetId); // loop over inner rechits for (std::vector<TrackingRecHit*>::const_iterator ring1RecHit = ring1RecHits.begin(); ring1RecHit != ring1RecHits.end(); ++ring1RecHit) { GlobalPoint ring1GlobalPoint = tracker_->idToDet((*ring1RecHit)->geographicalId())->surface().toGlobal((*ring1RecHit)->localPosition()); // calculate phi range around inner hit double innerphi = ring1GlobalPoint.phi(); double upperPhiRangeBorder = innerphi + phiRangeDetIdLookup_; double lowerPhiRangeBorder = innerphi - phiRangeDetIdLookup_; if (upperPhiRangeBorder>Geom::pi()) upperPhiRangeBorder -= Geom::twoPi(); if (lowerPhiRangeBorder<(-Geom::pi())) lowerPhiRangeBorder += Geom::twoPi(); // retrieve vectors of TrackingRecHits in ring2 in phi range std::vector<TrackingRecHit*> ring2RecHits; if (lowerPhiRangeBorder <= upperPhiRangeBorder ) { for ( Ring::const_iterator outerRingDetId = ring2->lower_bound(lowerPhiRangeBorder); outerRingDetId != ring2->upper_bound(upperPhiRangeBorder); ++outerRingDetId) { std::vector<TrackingRecHit*> rings = outerSeedHitVector_.getHitVector(&(outerRingDetId->second)); ring2RecHits.insert(ring2RecHits.end(), rings.begin(), rings.end()); } } else { for ( Ring::const_iterator outerRingDetId = ring2->begin(); outerRingDetId != ring2->upper_bound(upperPhiRangeBorder); ++outerRingDetId) { std::vector<TrackingRecHit*> rings = outerSeedHitVector_.getHitVector(&(outerRingDetId->second)); ring2RecHits.insert(ring2RecHits.end(), rings.begin(), rings.end()); } for ( Ring::const_iterator outerRingDetId = ring2->lower_bound(lowerPhiRangeBorder); outerRingDetId != ring2->end(); ++outerRingDetId) { std::vector<TrackingRecHit*> rings = outerSeedHitVector_.getHitVector(&(outerRingDetId->second)); ring2RecHits.insert(ring2RecHits.end(), rings.begin(), rings.end()); } } if ( ring2RecHits.size() > 0 ) { calculateCircleSeedsFromHits(circleSeeds, seed, set, ring1GlobalPoint, *ring1RecHit, ring2RecHits); } } } return result; }
bool RoadSearchSeedFinderAlgorithm::calculateCircleSeedsFromRingsOneInnerTwoOuter | ( | std::vector< RoadSearchCircleSeed > & | circleSeeds, |
const Roads::RoadSeed * | seed, | ||
const Roads::RoadSet * | set, | ||
const Ring * | ring1, | ||
const Ring * | ring2, | ||
const Ring * | ring3 | ||
) |
Definition at line 443 of file RoadSearchSeedFinderAlgorithm.cc.
References Ring::begin(), calculateCircleSeedsFromHits(), Ring::end(), DetHitAccess::getHitVector(), TrackerGeometry::idToDet(), innerSeedHitVector_, Ring::lower_bound(), outerSeedHitVector_, PV3DBase< T, PVType, FrameType >::phi(), phiRangeDetIdLookup_, Geom::pi(), query::result, RingESSource_cfi::rings, GeomDet::toGlobal(), tracker_, Geom::twoPi(), and Ring::upper_bound().
Referenced by run().
{ // // calculate RoadSearchCircleSeed // // apply circle seed cuts // // return value bool result = true; // loop over detid's in first rings for ( Ring::const_iterator ring1DetIdIterator = ring1->begin(); ring1DetIdIterator != ring1->end(); ++ring1DetIdIterator ) { DetId ring1DetId = ring1DetIdIterator->second; std::vector<TrackingRecHit*> ring1RecHits = innerSeedHitVector_.getHitVector(&ring1DetId); // loop over inner rechits for (std::vector<TrackingRecHit*>::const_iterator ring1RecHit = ring1RecHits.begin(); ring1RecHit != ring1RecHits.end(); ++ring1RecHit) { GlobalPoint ring1GlobalPoint = tracker_->idToDet((*ring1RecHit)->geographicalId())->surface().toGlobal((*ring1RecHit)->localPosition()); // calculate phi range around inner hit double innerphi = ring1GlobalPoint.phi(); double upperPhiRangeBorder = innerphi + phiRangeDetIdLookup_; double lowerPhiRangeBorder = innerphi - phiRangeDetIdLookup_; if (upperPhiRangeBorder>Geom::pi()) upperPhiRangeBorder -= Geom::twoPi(); if (lowerPhiRangeBorder<(-Geom::pi())) lowerPhiRangeBorder += Geom::twoPi(); // retrieve vectors of TrackingRecHits in ring2 and ring3 in phi range std::vector<TrackingRecHit*> ring2RecHits; std::vector<TrackingRecHit*> ring3RecHits; if (lowerPhiRangeBorder <= upperPhiRangeBorder ) { for ( Ring::const_iterator outerRingDetId = ring2->lower_bound(lowerPhiRangeBorder); outerRingDetId != ring2->upper_bound(upperPhiRangeBorder); ++outerRingDetId) { std::vector<TrackingRecHit*> rings = outerSeedHitVector_.getHitVector(&(outerRingDetId->second)); ring2RecHits.insert(ring2RecHits.end(), rings.begin(), rings.end()); } for ( Ring::const_iterator outerRingDetId = ring3->lower_bound(lowerPhiRangeBorder); outerRingDetId != ring3->upper_bound(upperPhiRangeBorder); ++outerRingDetId) { std::vector<TrackingRecHit*> rings = outerSeedHitVector_.getHitVector(&(outerRingDetId->second)); ring3RecHits.insert(ring3RecHits.end(), rings.begin(), rings.end()); } } else { for ( Ring::const_iterator outerRingDetId = ring2->begin(); outerRingDetId != ring2->upper_bound(upperPhiRangeBorder); ++outerRingDetId) { std::vector<TrackingRecHit*> rings = outerSeedHitVector_.getHitVector(&(outerRingDetId->second)); ring2RecHits.insert(ring2RecHits.end(), rings.begin(), rings.end()); } for ( Ring::const_iterator outerRingDetId = ring3->begin(); outerRingDetId != ring3->upper_bound(upperPhiRangeBorder); ++outerRingDetId) { std::vector<TrackingRecHit*> rings = outerSeedHitVector_.getHitVector(&(outerRingDetId->second)); ring3RecHits.insert(ring3RecHits.end(), rings.begin(), rings.end()); } for ( Ring::const_iterator outerRingDetId = ring2->lower_bound(lowerPhiRangeBorder); outerRingDetId != ring2->end(); ++outerRingDetId) { std::vector<TrackingRecHit*> rings = outerSeedHitVector_.getHitVector(&(outerRingDetId->second)); ring2RecHits.insert(ring2RecHits.end(), rings.begin(), rings.end()); } for ( Ring::const_iterator outerRingDetId = ring3->lower_bound(lowerPhiRangeBorder); outerRingDetId != ring3->end(); ++outerRingDetId) { std::vector<TrackingRecHit*> rings = outerSeedHitVector_.getHitVector(&(outerRingDetId->second)); ring3RecHits.insert(ring3RecHits.end(), rings.begin(), rings.end()); } } if ( ring2RecHits.size() > 0 && ring3RecHits.size() > 0 ) { calculateCircleSeedsFromHits(circleSeeds, seed, set, ring1GlobalPoint, *ring1RecHit, ring2RecHits, ring3RecHits); } } } return result; }
bool RoadSearchSeedFinderAlgorithm::calculateCircleSeedsFromRingsTwoInnerOneOuter | ( | std::vector< RoadSearchCircleSeed > & | circleSeeds, |
const Roads::RoadSeed * | seed, | ||
const Roads::RoadSet * | set, | ||
const Ring * | ring1, | ||
const Ring * | ring2, | ||
const Ring * | ring3 | ||
) |
Definition at line 338 of file RoadSearchSeedFinderAlgorithm.cc.
References Ring::begin(), calculateCircleSeedsFromHits(), Ring::end(), DetHitAccess::getHitVector(), TrackerGeometry::idToDet(), innerSeedHitVector_, Ring::lower_bound(), outerSeedHitVector_, PV3DBase< T, PVType, FrameType >::phi(), phiRangeDetIdLookup_, Geom::pi(), query::result, RingESSource_cfi::rings, GeomDet::toGlobal(), tracker_, Geom::twoPi(), and Ring::upper_bound().
Referenced by run().
{ // // calculate RoadSearchCircleSeed // // apply circle seed cuts // // return value bool result = true; // loop over detid's in first rings for ( Ring::const_iterator ring1DetIdIterator = ring1->begin(); ring1DetIdIterator != ring1->end(); ++ring1DetIdIterator ) { DetId ring1DetId = ring1DetIdIterator->second; std::vector<TrackingRecHit*> ring1RecHits = innerSeedHitVector_.getHitVector(&ring1DetId); // loop over inner rechits for (std::vector<TrackingRecHit*>::const_iterator ring1RecHit = ring1RecHits.begin(); ring1RecHit != ring1RecHits.end(); ++ring1RecHit) { GlobalPoint ring1GlobalPoint = tracker_->idToDet((*ring1RecHit)->geographicalId())->surface().toGlobal((*ring1RecHit)->localPosition()); // calculate phi range around inner hit double innerphi = ring1GlobalPoint.phi(); double upperPhiRangeBorder = innerphi + phiRangeDetIdLookup_; double lowerPhiRangeBorder = innerphi - phiRangeDetIdLookup_; if (upperPhiRangeBorder>Geom::pi()) upperPhiRangeBorder -= Geom::twoPi(); if (lowerPhiRangeBorder<(-Geom::pi())) lowerPhiRangeBorder += Geom::twoPi(); // retrieve vectors of TrackingRecHits in ring2 and ring3 in phi range std::vector<TrackingRecHit*> ring2RecHits; std::vector<TrackingRecHit*> ring3RecHits; if (lowerPhiRangeBorder <= upperPhiRangeBorder ) { for ( Ring::const_iterator outerRingDetId = ring2->lower_bound(lowerPhiRangeBorder); outerRingDetId != ring2->upper_bound(upperPhiRangeBorder); ++outerRingDetId) { std::vector<TrackingRecHit*> rings = outerSeedHitVector_.getHitVector(&(outerRingDetId->second)); ring2RecHits.insert(ring2RecHits.end(), rings.begin(), rings.end()); } for ( Ring::const_iterator outerRingDetId = ring3->lower_bound(lowerPhiRangeBorder); outerRingDetId != ring3->upper_bound(upperPhiRangeBorder); ++outerRingDetId) { std::vector<TrackingRecHit*> rings = outerSeedHitVector_.getHitVector(&(outerRingDetId->second)); ring3RecHits.insert(ring3RecHits.end(), rings.begin(), rings.end()); } } else { for ( Ring::const_iterator outerRingDetId = ring2->begin(); outerRingDetId != ring2->upper_bound(upperPhiRangeBorder); ++outerRingDetId) { std::vector<TrackingRecHit*> rings = outerSeedHitVector_.getHitVector(&(outerRingDetId->second)); ring2RecHits.insert(ring2RecHits.end(), rings.begin(), rings.end()); } for ( Ring::const_iterator outerRingDetId = ring3->begin(); outerRingDetId != ring3->upper_bound(upperPhiRangeBorder); ++outerRingDetId) { std::vector<TrackingRecHit*> rings = outerSeedHitVector_.getHitVector(&(outerRingDetId->second)); ring3RecHits.insert(ring3RecHits.end(), rings.begin(), rings.end()); } for ( Ring::const_iterator outerRingDetId = ring2->lower_bound(lowerPhiRangeBorder); outerRingDetId != ring2->end(); ++outerRingDetId) { std::vector<TrackingRecHit*> rings = outerSeedHitVector_.getHitVector(&(outerRingDetId->second)); ring2RecHits.insert(ring2RecHits.end(), rings.begin(), rings.end()); } for ( Ring::const_iterator outerRingDetId = ring3->lower_bound(lowerPhiRangeBorder); outerRingDetId != ring3->end(); ++outerRingDetId) { std::vector<TrackingRecHit*> rings = outerSeedHitVector_.getHitVector(&(outerRingDetId->second)); ring3RecHits.insert(ring3RecHits.end(), rings.begin(), rings.end()); } } if ( ring2RecHits.size() > 0 && ring3RecHits.size() > 0 ) { calculateCircleSeedsFromHits(circleSeeds, seed, set, ring1GlobalPoint, *ring1RecHit, ring2RecHits, ring3RecHits); } } } return result; }
unsigned int RoadSearchSeedFinderAlgorithm::ClusterCounter | ( | const edmNew::DetSetVector< SiStripCluster > * | clusters | ) |
Definition at line 813 of file RoadSearchSeedFinderAlgorithm.cc.
References edmNew::DetSetVector< T >::begin(), edmNew::DetSetVector< T >::end(), collect_tpl::input, and edmNew::DetSetVector< T >::size().
{ const edmNew::DetSetVector<SiStripCluster>& input = *clusters; unsigned int totalClusters = 0; //loop over detectors for (edmNew::DetSetVector<SiStripCluster>::const_iterator DSViter=input.begin(); DSViter!=input.end();DSViter++ ) { totalClusters+=DSViter->size(); } return totalClusters; }
Definition at line 744 of file RoadSearchSeedFinderAlgorithm.cc.
References PixelSubdetector::PixelBarrel, GeomDetEnumerators::PixelBarrel, PixelSubdetector::PixelEndcap, GeomDetEnumerators::PixelEndcap, DetId::rawId(), query::result, DetId::subdetId(), StripSubdetector::TEC, sistripsummary::TEC, sistripsummary::TIB, StripSubdetector::TIB, sistripsummary::TID, StripSubdetector::TID, StripSubdetector::TOB, and sistripsummary::TOB.
Referenced by ringsOnSameLayer().
{ // // check whether two detids are on the same layer // // return value bool result = false; // check if both rings belong to same subdetector if ( (unsigned int)id1.subdetId() == StripSubdetector::TIB && (unsigned int)id2.subdetId() == StripSubdetector::TIB ) { // make TIBDetId instance TIBDetId id1TIB(id1.rawId()); TIBDetId id2TIB(id2.rawId()); // check whether both rings are on the same TIB layer if ( id1TIB.layer() == id2TIB.layer() ) { result = true; } } else if ( (unsigned int)id1.subdetId() == StripSubdetector::TOB && (unsigned int)id2.subdetId() == StripSubdetector::TOB ) { // make TOBDetId instance TOBDetId id1TOB(id1.rawId()); TOBDetId id2TOB(id2.rawId()); // check whether both rings are on the same TOB layer if ( id1TOB.layer() == id2TOB.layer() ) { result = true; } } else if ( (unsigned int)id1.subdetId() == StripSubdetector::TID && (unsigned int)id2.subdetId() == StripSubdetector::TID) { // make TIDDetId instance TIDDetId id1TID(id1.rawId()); TIDDetId id2TID(id2.rawId()); // check whether both rings are on the same TID wheel if ( id1TID.wheel() == id2TID.wheel() ) { result = true; } } else if ( (unsigned int)id1.subdetId() == StripSubdetector::TEC && (unsigned int)id2.subdetId() == StripSubdetector::TEC ) { // make TECDetId instance TECDetId id1TEC(id1.rawId()); TECDetId id2TEC(id2.rawId()); // check whether both rings are on the same TEC wheel if ( id1TEC.wheel() == id2TEC.wheel() ) { result = true; } } else if ( (unsigned int)id1.subdetId() == PixelSubdetector::PixelBarrel && (unsigned int)id2.subdetId() == PixelSubdetector::PixelBarrel) { // make PXBDetId instance PXBDetId id1PXB(id1.rawId()); PXBDetId id2PXB(id2.rawId()); // check whether both rings are on the same PXB layer if ( id1PXB.layer() == id2PXB.layer() ) { result = true; } } else if ( (unsigned int)id1.subdetId() == PixelSubdetector::PixelEndcap && (unsigned int)id2.subdetId() == PixelSubdetector::PixelEndcap) { // make PXFDetId instance PXFDetId id1PXF(id1.rawId()); PXFDetId id2PXF(id2.rawId()); // check whether both rings are on the same PXF disk if ( id1PXF.disk() == id2PXF.disk() ) { result = true; } } return result; }
bool RoadSearchSeedFinderAlgorithm::mergeCircleSeeds | ( | std::vector< RoadSearchCircleSeed > & | circleSeeds | ) |
Definition at line 727 of file RoadSearchSeedFinderAlgorithm.cc.
References detIdsOnSameLayer(), Ring::getFirst(), and query::result.
Referenced by run().
void RoadSearchSeedFinderAlgorithm::run | ( | const SiStripRecHit2DCollection * | rphiRecHits, |
const SiStripRecHit2DCollection * | stereoRecHits, | ||
const SiStripMatchedRecHit2DCollection * | matchedRecHits, | ||
const SiPixelRecHitCollection * | pixelRecHits, | ||
const edm::EventSetup & | es, | ||
RoadSearchSeedCollection & | output | ||
) |
Definition at line 133 of file RoadSearchSeedFinderAlgorithm.cc.
References abs, RoadSearchSeed::addHit(), allNegativeOnly, allPositiveOnly, beamSpotZMagneticField_, Roads::begin(), calculateCircleSeedsFromRingsOneInnerOneOuter(), calculateCircleSeedsFromRingsOneInnerTwoOuter(), calculateCircleSeedsFromRingsTwoInnerOneOuter(), CastorDataFrameFilter_impl::check(), Roads::end(), eta(), edm::EventSetup::get(), innerSeedHitVector_, MagneticField::inTesla(), funct::log(), magnet_, maxNumberOfSeeds_, mergeSeedsCenterCut_, mergeSeedsCenterCut_A_, mergeSeedsCenterCut_B_, mergeSeedsCenterCut_C_, mergeSeedsRadiusCut_, mergeSeedsRadiusCut_A_, mergeSeedsRadiusCut_B_, mergeSeedsRadiusCut_C_, minPt_, minRadius_, mode_, outerSeedHitVector_, edm::ESHandle< T >::product(), alignCSCRings::r, ringsOnSameLayer(), RoadMapESSource_cfi::roads, roads_, roadsLabel_, DetHitAccess::setCollections(), RoadSearchSeed::setSeed(), RoadSearchSeed::setSet(), funct::tan(), patCandidatesForDimuonsSequences_cff::tracker, tracker_, usedSeedRingCombinations_, PV3DBase< T, PVType, FrameType >::z(), and z.
Referenced by RoadSearchSeedFinder::produce().
{ // initialize general hit access for road search innerSeedHitVector_.setCollections(rphiRecHits,stereoRecHits,matchedRecHits,pixelRecHits); outerSeedHitVector_.setCollections(rphiRecHits,stereoRecHits,matchedRecHits,pixelRecHits); // get roads edm::ESHandle<Roads> roads; es.get<RoadMapRecord>().get(roadsLabel_,roads); roads_ = roads.product(); // get tracker geometry edm::ESHandle<TrackerGeometry> tracker; es.get<TrackerDigiGeometryRecord>().get(tracker); tracker_ = tracker.product(); // get magnetic field edm::ESHandle<MagneticField> magnetHandle; es.get<IdealMagneticFieldRecord>().get(magnetHandle); magnet_ = magnetHandle.product(); //***top-bottom //TTRHBuilder TkTransientTrackingRecHitBuilder builder(tracker_,0,0,0,false); //*** // get magnetic field for 0,0,0 , approximation for minRadius calculation beamSpotZMagneticField_ = magnet_->inTesla(GlobalPoint(0,0,0)).z(); // calculate minimal radius at globalPoint in cm, take the z component of the magnetic field at GlobalPoint 2 if ( beamSpotZMagneticField_ == 0 ) { minRadius_ = 999999999999.; } else { minRadius_ = minPt_ / 0.3 / beamSpotZMagneticField_ * 100; } // temporary storing collection of circle seeds std::vector<RoadSearchCircleSeed> localCircleSeeds; // loop over seed Ring pairs for ( Roads::const_iterator road = roads_->begin(); road != roads_->end(); ++road ) { localCircleSeeds.clear(); const Roads::RoadSeed *seed = &((*road).first); const Roads::RoadSet *set = &((*road).second); // determine seeding cuts from inner seed ring |eta| double r = std::abs((*seed->first.begin())->getrmax() + (*seed->first.begin())->getrmin())/2.; double z = std::abs((*seed->first.begin())->getzmax() + (*seed->first.begin())->getzmin())/2.; double eta = std::abs(std::log(std::tan(std::atan2(r,z)/2.))); if ( eta < 1.1 ) { mergeSeedsCenterCut_ = mergeSeedsCenterCut_A_; mergeSeedsRadiusCut_ = mergeSeedsRadiusCut_A_; } else if ( (eta >= 1.1) && (eta < 1.6) ) { mergeSeedsCenterCut_ = mergeSeedsCenterCut_B_; mergeSeedsRadiusCut_ = mergeSeedsRadiusCut_B_; } else if ( eta >= 1.6 ) { mergeSeedsCenterCut_ = mergeSeedsCenterCut_C_; mergeSeedsRadiusCut_ = mergeSeedsRadiusCut_C_; } if ( mode_ == "STRAIGHT-LINE" ) { // loop over seed ring pairs // draw straight line for ( std::vector<const Ring*>::const_iterator innerSeedRing = seed->first.begin(); innerSeedRing != seed->first.end(); ++innerSeedRing) { for ( std::vector<const Ring*>::const_iterator outerSeedRing = seed->second.begin(); outerSeedRing != seed->second.end(); ++outerSeedRing) { calculateCircleSeedsFromRingsOneInnerOneOuter(localCircleSeeds, seed, set, *innerSeedRing, *outerSeedRing); } } } else if ( mode_ == "STANDARD" ) { // take combinations of one inner and two outer or two inner and one outer seed ring for ( std::vector<const Ring*>::const_iterator innerSeedRing1 = seed->first.begin(); innerSeedRing1 != seed->first.end(); ++innerSeedRing1) { // two inner, one outer for ( std::vector<const Ring*>::const_iterator innerSeedRing2 = innerSeedRing1+1; innerSeedRing2 != seed->first.end(); ++innerSeedRing2) { if ( !ringsOnSameLayer(*innerSeedRing1,*innerSeedRing2) ) { for ( std::vector<const Ring*>::const_iterator outerSeedRing = seed->second.begin(); outerSeedRing != seed->second.end(); ++outerSeedRing) { // calculate seed ring combination identifier unsigned int identifier = (*innerSeedRing1)->getindex() * 1000000 + (*innerSeedRing2)->getindex() * 1000 + (*outerSeedRing)->getindex(); bool check = true; for ( std::vector<unsigned int>::iterator alreadyChecked = usedSeedRingCombinations_.begin(); alreadyChecked != usedSeedRingCombinations_.end(); ++alreadyChecked ) { if ( identifier == *alreadyChecked ) { check = false; break; } } if ( check ) { usedSeedRingCombinations_.push_back(identifier); calculateCircleSeedsFromRingsTwoInnerOneOuter(localCircleSeeds, seed, set, *innerSeedRing1, *innerSeedRing2, *outerSeedRing); } } } } // one inner, two outer for ( std::vector<const Ring*>::const_iterator outerSeedRing1 = seed->second.begin(); outerSeedRing1 != seed->second.end(); ++outerSeedRing1) { for ( std::vector<const Ring*>::const_iterator outerSeedRing2 = outerSeedRing1+1; outerSeedRing2 != seed->second.end(); ++outerSeedRing2) { if ( !ringsOnSameLayer(*outerSeedRing1,*outerSeedRing2) ) { // calculate seed ring combination identifier unsigned int identifier = (*innerSeedRing1)->getindex() * 1000000 + (*outerSeedRing1)->getindex() * 1000 + (*outerSeedRing2)->getindex(); bool check = true; for ( std::vector<unsigned int>::iterator alreadyChecked = usedSeedRingCombinations_.begin(); alreadyChecked != usedSeedRingCombinations_.end(); ++alreadyChecked ) { if ( identifier == *alreadyChecked ) { check = false; break; } } if ( check ) { usedSeedRingCombinations_.push_back(identifier); calculateCircleSeedsFromRingsOneInnerTwoOuter(localCircleSeeds, seed, set, *innerSeedRing1, *outerSeedRing1, *outerSeedRing2); } } } } } } // fill in eta mapped multi-map for ( std::vector<RoadSearchCircleSeed>::iterator localCircle = localCircleSeeds.begin(), localCircleEnd = localCircleSeeds.end(); localCircle != localCircleEnd; ++localCircle ) { RoadSearchSeed seed; seed.setSet(localCircle->getSet()); seed.setSeed(localCircle->getSeed()); //***top-bottom bool allPositive = true; bool allNegative = true; //*** for (std::vector<const TrackingRecHit*>::const_iterator hit = localCircle->begin_hits(); hit != localCircle->end_hits(); ++hit ) { seed.addHit(*hit); //***top-bottom double seedY = builder.build(*hit)->globalPosition().y(); if (seedY>0) allNegative = false; if (seedY<0) allPositive = false; //*** } //***top-bottom //output.push_back(seed); if (allPositive && allPositiveOnly) output.push_back(seed); if (allNegative && allNegativeOnly) output.push_back(seed); if (!allPositiveOnly && !allNegativeOnly) output.push_back(seed); //*** } if ((maxNumberOfSeeds_ > 0) && (output.size() > size_t(maxNumberOfSeeds_))) { edm::LogError("TooManySeeds") << "Found too many seeds, bailing out.\n"; output.clear(); break; } } usedSeedRingCombinations_.clear(); edm::LogInfo("RoadSearch") << "Found " << output.size() << " seeds."; }
bool RoadSearchSeedFinderAlgorithm::allNegativeOnly [private] |
Definition at line 150 of file RoadSearchSeedFinderAlgorithm.h.
Referenced by RoadSearchSeedFinderAlgorithm(), and run().
bool RoadSearchSeedFinderAlgorithm::allPositiveOnly [private] |
Definition at line 149 of file RoadSearchSeedFinderAlgorithm.h.
Referenced by RoadSearchSeedFinderAlgorithm(), and run().
double RoadSearchSeedFinderAlgorithm::beamSpotZMagneticField_ [private] |
Definition at line 139 of file RoadSearchSeedFinderAlgorithm.h.
Referenced by run().
Definition at line 125 of file RoadSearchSeedFinderAlgorithm.h.
Referenced by RoadSearchSeedFinderAlgorithm().
bool RoadSearchSeedFinderAlgorithm::innerSeedHitAccessUseRPhi_ [private] |
Definition at line 126 of file RoadSearchSeedFinderAlgorithm.h.
Referenced by RoadSearchSeedFinderAlgorithm().
bool RoadSearchSeedFinderAlgorithm::innerSeedHitAccessUseStereo_ [private] |
Definition at line 127 of file RoadSearchSeedFinderAlgorithm.h.
Referenced by RoadSearchSeedFinderAlgorithm().
Definition at line 122 of file RoadSearchSeedFinderAlgorithm.h.
Referenced by calculateCircleSeedsFromRingsOneInnerOneOuter(), calculateCircleSeedsFromRingsOneInnerTwoOuter(), calculateCircleSeedsFromRingsTwoInnerOneOuter(), RoadSearchSeedFinderAlgorithm(), and run().
const MagneticField* RoadSearchSeedFinderAlgorithm::magnet_ [private] |
Definition at line 135 of file RoadSearchSeedFinderAlgorithm.h.
Referenced by run().
double RoadSearchSeedFinderAlgorithm::maxBarrelImpactParameter_ [private] |
Definition at line 106 of file RoadSearchSeedFinderAlgorithm.h.
Referenced by calculateCircleSeedsFromHits(), and RoadSearchSeedFinderAlgorithm().
double RoadSearchSeedFinderAlgorithm::maxEndcapImpactParameter_ [private] |
Definition at line 107 of file RoadSearchSeedFinderAlgorithm.h.
Referenced by calculateCircleSeedsFromHits(), and RoadSearchSeedFinderAlgorithm().
int RoadSearchSeedFinderAlgorithm::maxNumberOfSeeds_ [private] |
Definition at line 120 of file RoadSearchSeedFinderAlgorithm.h.
Referenced by RoadSearchSeedFinderAlgorithm(), and run().
double RoadSearchSeedFinderAlgorithm::mergeSeedsCenterCut_ [private] |
Definition at line 110 of file RoadSearchSeedFinderAlgorithm.h.
Referenced by calculateCircleSeedsFromHits(), RoadSearchSeedFinderAlgorithm(), and run().
double RoadSearchSeedFinderAlgorithm::mergeSeedsCenterCut_A_ [private] |
Definition at line 112 of file RoadSearchSeedFinderAlgorithm.h.
Referenced by RoadSearchSeedFinderAlgorithm(), and run().
double RoadSearchSeedFinderAlgorithm::mergeSeedsCenterCut_B_ [private] |
Definition at line 114 of file RoadSearchSeedFinderAlgorithm.h.
Referenced by RoadSearchSeedFinderAlgorithm(), and run().
double RoadSearchSeedFinderAlgorithm::mergeSeedsCenterCut_C_ [private] |
Definition at line 116 of file RoadSearchSeedFinderAlgorithm.h.
Referenced by RoadSearchSeedFinderAlgorithm(), and run().
unsigned int RoadSearchSeedFinderAlgorithm::mergeSeedsDifferentHitsCut_ [private] |
Definition at line 118 of file RoadSearchSeedFinderAlgorithm.h.
Referenced by calculateCircleSeedsFromHits(), and RoadSearchSeedFinderAlgorithm().
double RoadSearchSeedFinderAlgorithm::mergeSeedsRadiusCut_ [private] |
Definition at line 111 of file RoadSearchSeedFinderAlgorithm.h.
Referenced by calculateCircleSeedsFromHits(), RoadSearchSeedFinderAlgorithm(), and run().
double RoadSearchSeedFinderAlgorithm::mergeSeedsRadiusCut_A_ [private] |
Definition at line 113 of file RoadSearchSeedFinderAlgorithm.h.
Referenced by RoadSearchSeedFinderAlgorithm(), and run().
double RoadSearchSeedFinderAlgorithm::mergeSeedsRadiusCut_B_ [private] |
Definition at line 115 of file RoadSearchSeedFinderAlgorithm.h.
Referenced by RoadSearchSeedFinderAlgorithm(), and run().
double RoadSearchSeedFinderAlgorithm::mergeSeedsRadiusCut_C_ [private] |
Definition at line 117 of file RoadSearchSeedFinderAlgorithm.h.
Referenced by RoadSearchSeedFinderAlgorithm(), and run().
double RoadSearchSeedFinderAlgorithm::minPt_ [private] |
Definition at line 105 of file RoadSearchSeedFinderAlgorithm.h.
Referenced by RoadSearchSeedFinderAlgorithm(), and run().
double RoadSearchSeedFinderAlgorithm::minRadius_ [private] |
Definition at line 140 of file RoadSearchSeedFinderAlgorithm.h.
Referenced by calculateCircleSeedsFromHits(), and run().
std::string RoadSearchSeedFinderAlgorithm::mode_ [private] |
Definition at line 144 of file RoadSearchSeedFinderAlgorithm.h.
Referenced by RoadSearchSeedFinderAlgorithm(), and run().
Definition at line 129 of file RoadSearchSeedFinderAlgorithm.h.
Referenced by RoadSearchSeedFinderAlgorithm().
bool RoadSearchSeedFinderAlgorithm::outerSeedHitAccessUseRPhi_ [private] |
Definition at line 130 of file RoadSearchSeedFinderAlgorithm.h.
Referenced by RoadSearchSeedFinderAlgorithm().
bool RoadSearchSeedFinderAlgorithm::outerSeedHitAccessUseStereo_ [private] |
Definition at line 131 of file RoadSearchSeedFinderAlgorithm.h.
Referenced by RoadSearchSeedFinderAlgorithm().
Definition at line 123 of file RoadSearchSeedFinderAlgorithm.h.
Referenced by calculateCircleSeedsFromRingsOneInnerOneOuter(), calculateCircleSeedsFromRingsOneInnerTwoOuter(), calculateCircleSeedsFromRingsTwoInnerOneOuter(), RoadSearchSeedFinderAlgorithm(), and run().
std::ostringstream RoadSearchSeedFinderAlgorithm::output_ [private] |
Definition at line 137 of file RoadSearchSeedFinderAlgorithm.h.
double RoadSearchSeedFinderAlgorithm::phiRangeDetIdLookup_ [private] |
Definition at line 108 of file RoadSearchSeedFinderAlgorithm.h.
Referenced by calculateCircleSeedsFromRingsOneInnerOneOuter(), calculateCircleSeedsFromRingsOneInnerTwoOuter(), calculateCircleSeedsFromRingsTwoInnerOneOuter(), and RoadSearchSeedFinderAlgorithm().
const Roads* RoadSearchSeedFinderAlgorithm::roads_ [private] |
Definition at line 134 of file RoadSearchSeedFinderAlgorithm.h.
Referenced by run().
std::string RoadSearchSeedFinderAlgorithm::roadsLabel_ [private] |
Definition at line 146 of file RoadSearchSeedFinderAlgorithm.h.
Referenced by RoadSearchSeedFinderAlgorithm(), and run().
const TrackerGeometry* RoadSearchSeedFinderAlgorithm::tracker_ [private] |
Definition at line 133 of file RoadSearchSeedFinderAlgorithm.h.
Referenced by calculateCircleSeedsFromHits(), calculateCircleSeedsFromRingsOneInnerOneOuter(), calculateCircleSeedsFromRingsOneInnerTwoOuter(), calculateCircleSeedsFromRingsTwoInnerOneOuter(), and run().
std::vector<unsigned int> RoadSearchSeedFinderAlgorithm::usedSeedRingCombinations_ [private] |
Definition at line 142 of file RoadSearchSeedFinderAlgorithm.h.
Referenced by run().