CMS 3D CMS Logo

All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Properties Friends Macros Modules Pages
List of all members | Public Member Functions
SubsetHSMLinearizationPointFinder Class Reference

#include <SubsetHSMLinearizationPointFinder.h>

Inheritance diagram for SubsetHSMLinearizationPointFinder:
CrossingPtBasedLinearizationPointFinder LinearizationPointFinder

Public Member Functions

SubsetHSMLinearizationPointFinderclone () const override
 
 SubsetHSMLinearizationPointFinder (const signed int n_pairs=10)
 
 SubsetHSMLinearizationPointFinder (const RecTracksDistanceMatrix *m, const signed int n_pairs=-1)
 
- Public Member Functions inherited from CrossingPtBasedLinearizationPointFinder
 CrossingPtBasedLinearizationPointFinder (const ModeFinder3d &algo, const signed int n_pairs=5)
 
 CrossingPtBasedLinearizationPointFinder (const RecTracksDistanceMatrix *m, const ModeFinder3d &algo, const signed int n_pairs=-1)
 
 CrossingPtBasedLinearizationPointFinder (const CrossingPtBasedLinearizationPointFinder &)
 
GlobalPoint getLinearizationPoint (const std::vector< reco::TransientTrack > &) const override
 
GlobalPoint getLinearizationPoint (const std::vector< FreeTrajectoryState > &) const override
 
 ~CrossingPtBasedLinearizationPointFinder () override
 
- Public Member Functions inherited from LinearizationPointFinder
virtual ~LinearizationPointFinder ()
 

Additional Inherited Members

- Protected Attributes inherited from CrossingPtBasedLinearizationPointFinder
const RecTracksDistanceMatrixtheMatrix
 
signed int theNPairs
 
const bool useMatrix
 

Detailed Description

A linearization point finder. It works the following way:

  1. Calculate in an optimal way 'n_pairs' different crossing points. Optimal in this context means the following: a. Try to use as many different tracks as possible; avoid using the same track all the time. b. Use the most energetic tracks. c. Try not to group the most energetic tracks together. Try to group more energetic tracks with less energetic tracks. We assume collimated bundles here, so this is why. d. Perform optimally. Do not sort more tracks (by total energy, see b) than necessary. e. If n_pairs >= (number of all possible combinations), do not leave any combinations out. ( a. and e. are almost but not entirely fulfilled in the current impl )
  2. Do a SubsetHSM on the n points.

Definition at line 23 of file SubsetHSMLinearizationPointFinder.h.

Constructor & Destructor Documentation

◆ SubsetHSMLinearizationPointFinder() [1/2]

SubsetHSMLinearizationPointFinder::SubsetHSMLinearizationPointFinder ( const signed int  n_pairs = 10)

Definition at line 4 of file SubsetHSMLinearizationPointFinder.cc.

Referenced by clone().

◆ SubsetHSMLinearizationPointFinder() [2/2]

SubsetHSMLinearizationPointFinder::SubsetHSMLinearizationPointFinder ( const RecTracksDistanceMatrix m,
const signed int  n_pairs = -1 
)

Member Function Documentation

◆ clone()

SubsetHSMLinearizationPointFinder * SubsetHSMLinearizationPointFinder::clone ( ) const
overridevirtual

Clone method

Reimplemented from CrossingPtBasedLinearizationPointFinder.

Definition at line 11 of file SubsetHSMLinearizationPointFinder.cc.

References SubsetHSMLinearizationPointFinder().

11  {
12  return new SubsetHSMLinearizationPointFinder(*this);
13 }
SubsetHSMLinearizationPointFinder(const signed int n_pairs=10)