Hello,
I currently find myself altering some code within MAPS, mainly for testing purposes. I noticed the lines
if (cv==MAXFLOAT) {
Array<int> cur_choice;
get_cluster_choice(&cur_choice);
int i=2;
for ( ; i<cur_choice.get_size(); i++) {
if (cur_choice(i)!=0) break;
}
if (i==cur_choice.get_size()) break;
}
within the loop iterating over all cluster choices (that are to be tested according to MAPS’ hierarchical selection rules). This code causes an early break out of that loop for a given test set of (two dimensional) structures for a cluster choice consisting of only 2 point- and 29 pair-clusters.
I wonder if someone could explain to me what the rational behind this is? I don’t get why it’s clear - at that point - that there is no use in looking at more cluster choices.
Might this has something to do with the arising of guaranteed collinearities due to the lengths of the largest pairs in conjunction with the dimensions of the structures in this particular test set? Or am I completely mistaken here?
As this left me quite puzzled for some time now, any suggestions would be greatly appreciated.
Thank you very much in advance and best regards
christopher