Hello, > De : [email protected] > Envoyé : vendredi 29 août 2014 16:38 > > If your goal is to find nearest the N neighbors of a given point, > look up the K-D Tree algorithm
This is not the case, but I keep your advice in mind. Tree algorithms are often an elegant and efficient way to solve problems, but are less intuitive to me so I don't thin about them first. More generally speaking, I should keep in mind maybe to ask more general questions (i.e. presenting the problem to be solved instead of a solution used to solve it). In my case, I have coordinates of points of an elastic body obtained by finite elemnts analysis. The absolute elongation should be below a given value (this is imho not a relevant criterion, but that's the way it is), so I compute the difference of pairwise distances and look for the greater one. Anyway, tha,ks for the tip. -- Christophe Dang Ngoc Chan Mechanical calculation engineer This e-mail may contain confidential and / or privileged information. If you are not the intended recipient (or have received this e-mail in error), please notify the sender immediately and destroy this e-mail. Any unauthorized copying, disclosure or distribution of the material in this e-mail is strictly forbidden. _______________________________________________ users mailing list [email protected] http://lists.scilab.org/mailman/listinfo/users
