This subproject implements a correspondences solver based on computation of the maximum clique of an undirected graph representing candidate correspondences. Candidate correspondences are those that are pairwise consistent between source and target point clouds. For more details, check out these resources: