Update the Calo Clustering algorithm in HLT1
We aim to improve the current calo clustering algorithm in Allen adding a "shower overlap"-like function.
The proposed implementation improves the hlt1_reco_allen_calo_efficiency
Moore test as follows:
- 1000 evts: Reference 84.7+-1.7 ; MR 85.4+-1.7
- 40k evts: Reference 80.5+-0.3 ; MR 81.7+-0.3
The changes in the efficiency tests are not significant when testing with bigger event bunches and are expected since the reconstructed cluster values have changed.
Edited by Nuria Valls Canudas