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
SMSLinearizationPointFinder Class Reference

#include <SMSLinearizationPointFinder.h>

Inheritance diagram for SMSLinearizationPointFinder:
CrossingPtBasedLinearizationPointFinder LinearizationPointFinder

Public Member Functions

SMSLinearizationPointFinderclone () const override
 
 SMSLinearizationPointFinder (signed int n_pairs=10, const SMS &sms=SMS())
 
 SMSLinearizationPointFinder (const RecTracksDistanceMatrix *m, signed int n_pairs=-1, const SMS &sms=SMS())
 
- 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 LMS on the n points.

Definition at line 24 of file SMSLinearizationPointFinder.h.

Constructor & Destructor Documentation

◆ SMSLinearizationPointFinder() [1/2]

SMSLinearizationPointFinder::SMSLinearizationPointFinder ( signed int  n_pairs = 10,
const SMS sms = SMS() 
)

Definition at line 4 of file SMSLinearizationPointFinder.cc.

Referenced by clone().

CrossingPtBasedLinearizationPointFinder(const ModeFinder3d &algo, const signed int n_pairs=5)

◆ SMSLinearizationPointFinder() [2/2]

SMSLinearizationPointFinder::SMSLinearizationPointFinder ( const RecTracksDistanceMatrix m,
signed int  n_pairs = -1,
const SMS sms = SMS() 
)

Member Function Documentation

◆ clone()

SMSLinearizationPointFinder * SMSLinearizationPointFinder::clone ( ) const
overridevirtual

Clone method

Reimplemented from CrossingPtBasedLinearizationPointFinder.

Definition at line 12 of file SMSLinearizationPointFinder.cc.

References SMSLinearizationPointFinder().

12  {
13  return new SMSLinearizationPointFinder(*this);
14 }
SMSLinearizationPointFinder(signed int n_pairs=10, const SMS &sms=SMS())