“…Such problems become more obvious in 3D point cloud registration since the description ability of 3D descriptors is generally weaker than those in 2D domain [42,6,44,43,45] due to the irregular density and the lack of useful texture [11]. Thus, geometric consistency, such as length constraint under rigid transformation, becomes important and is commonly utilized by traditional outlier rejection algorithms and analyzed through spectral techniques [38,20], voting schemes [26,74,61], maximum clique [54,12,64], random walk [14], belief propagation [81] or game theory [59]. Meanwhile, some algorithms based on BnB [11] or SDP [37] are accurate but usually have high time complexity.…”