DOI 10.1007/s100529800932
The Cambridge jet algorithm: features and applications
Stan Bentvelsen1 - Irmtraud Meyer2
1 CERN, European Organisation for
Particle Physics, CH-1211 Geneva 23, Switzerland
2 III. Physikalisches Institut, RWTH Aachen, D-52056 Aachen,
Germany
Received: 11 March 1998 / Published online: 2 July 1998
Abstract
Jet clustering algorithms are widely used to analyse hadronic events
in high energy collisions. Recently a new clustering method, known as
`Cambridge', has been introduced. In this article we present an algorithm
to determine the transition values of 
for this clustering
scheme, which allows to resolve any event to a
definite number of jets in the final state. We discuss some
particularities of the Cambridge clustering method and compare its
performance to the Durham clustering scheme for Monte Carlo generated
annihilation events.
Copyright Springer-Verlag
