Current clustering process - grasseau/HAhRD GitHub Wiki

Global view of an event in HGCAL:

The current clustering is based on an image processing algorithm which basically computes the local density and the minimum distance between the considered point and any other points with higher density see for more here (not mandatory for GSOC'18) . To determine quickly the neighboring points of a position in the hexagonal mesh, a KD-tree is implemented.

The main routine can be found here