MbICP.h
134 /* Consecutive points with less Euclidean distance than MaxDistInter are considered to be a segment */
139 /* The associations are ordered by distance and the (1-filter) with greater distance are not used */
144 /* One way to check if the algorithm diverges if to supervise if the number of associatios goes below a thresold */
145 /* When the number of associations is below AsocError, the main function will return error in associations step */
157 /* Error_th=(errorK-1/errorK). When error_th tends to 1 more precise is the solution of the scan matching */
166 /* IterSmoothConv: number of consecutive iterations that satisfity the error criteria (the two above criteria) */
Definition TData.h:47
Definition TData.h:57