Page Menu
Home
HEPForge
Search
Configure Global Search
Log In
Files
F8308621
HSMLinearizationPointFinder.h
No One
Temporary
Actions
Download File
Edit File
Delete File
View Transforms
Subscribe
Mute Notifications
Award Token
Flag For Later
Size
1 KB
Subscribers
None
HSMLinearizationPointFinder.h
View Options
#ifndef HSMLinearizationPointFinder_H
#define HSMLinearizationPointFinder_H
#include
"RecoVertex/LinearizationPointFinders/interface/CrossingPtBasedLinearizationPointFinder.h"
/** 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 HSM on the n points.
*/
class
HSMLinearizationPointFinder
:
public
CrossingPtBasedLinearizationPointFinder
{
public
:
HSMLinearizationPointFinder
(
const
signed
int
n_pairs
=
10
);
HSMLinearizationPointFinder
(
const
RecTracksDistanceMatrix
*
m
,
const
signed
int
n_pairs
=
-
1
);
virtual
HSMLinearizationPointFinder
*
clone
()
const
;
};
#endif
File Metadata
Details
Attached
Mime Type
text/x-c++
Expires
Sat, Dec 21, 12:38 PM (1 d, 20 h)
Storage Engine
blob
Storage Format
Raw Data
Storage Handle
4022797
Default Alt Text
HSMLinearizationPointFinder.h (1 KB)
Attached To
rRAVESVN ravesvn
Event Timeline
Log In to Comment