Figure 8

Thresholding algorithm. (a) First point with probability greater than threshold is found (with highest probability, as all probabilities points are sorted top to bottom); (b) second point with enough high probability, satisfying additional distance requirement, is found; (c) similar triangle is found, when exists third point which satisfies both distance requirements and guarantee that triangle vertexes permutation is maintained. If needed (N _p = 4), fourth point is searched to obtain similar quadrangle.