Expand description
Jet clustering algorithms
In general, it is recommended to use the general-purpose ClusterHistory. It chooses dynamically between the following specialised algorithms:
-
ClusterNaive: choose this algorithm if you know that the number of partons is not too big, at most about 25. Also use this algorithm for custom distances where the actual nearest neighbours are not always the nearest neighbours in ΔR.
-
ClusterGeom: the fastest implemented algorithm for a number of partons roughly between 25 and 50.
-
ClusterGeomTile: the fastest implemented algorithm for a large number of partons starting at about 50.
Modules
- Clustering using the geometric O(N^2) approach of arXiv:0512210
- Clustering using the geometric O(N^2) approach of arXiv:0512210 with tiling
- Naive clustering
Structs
- General-purpose cluster history
Enums
- Result of a clustering step
Traits
- Objects that can be clustered into jets
- Trait marking a clustering algorithm
Functions
- clusterDeprecatedCluster
partons
into jets using the distance measured
- cluster_ifDeprecatedCluster
partons
into jets using the distance measured
Only jets for whichaccept
is true are returned