SMSLinearizationPointFinder Class Reference

#include <SMSLinearizationPointFinder.h>

Inheritance diagram for SMSLinearizationPointFinder:

Public Member Functions
virtual SMSLinearizationPointFinder *	clone () const
	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 &)
virtual GlobalPoint	getLinearizationPoint (const std::vector< reco::TransientTrack > &) const
virtual GlobalPoint	getLinearizationPoint (const std::vector< FreeTrajectoryState > &) const
	~CrossingPtBasedLinearizationPointFinder ()
Public Member Functions inherited from LinearizationPointFinder
virtual	~LinearizationPointFinder ()

Additional Inherited Members
Protected Attributes inherited from CrossingPtBasedLinearizationPointFinder
const RecTracksDistanceMatrix *	theMatrix
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::SMSLinearizationPointFinder	(	signed int	n_pairs = 10,
		const SMS &	sms = SMS()
	)

Definition at line 4 of file SMSLinearizationPointFinder.cc.

Referenced by clone().

                                                :
  CrossingPtBasedLinearizationPointFinder ( 
      SmsModeFinder3d( sms ), n_pairs )
{ }

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

Definition at line 10 of file SMSLinearizationPointFinder.cc.

                                                                                   :
  CrossingPtBasedLinearizationPointFinder ( m , 
      SmsModeFinder3d( sms ), n_pairs )
{ }

Member Function Documentation

SMSLinearizationPointFinder * SMSLinearizationPointFinder::clone ( ) const

virtual

Clone method

Reimplemented from CrossingPtBasedLinearizationPointFinder.

Definition at line 16 of file SMSLinearizationPointFinder.cc.

References SMSLinearizationPointFinder().

{
  return new SMSLinearizationPointFinder ( * this );
}