Reduce comparision of Iterative Closest Point algorithm using kdtree python

I have a working Iterative Closest Point algorithm in python. In one of the function(getvalueCorrespondences), all points from one mesh are compared to all points from other mesh. I want to reduce this comparision using kdtree and make the code faster.