Hello, > De : Pinçon Bruno > Envoyé : lundi 30 janvier 2017 16:21 > > a possibility would be to compute > the convex-hull of the (x-y coordinates) interpolation points and > to test if each grid point is inside but I 'm not sure you can do > that immediatly with Scilab
For your information, I put a piece of code that contains a function called marche_jarvis() here: https://fr.wikipedia.org/wiki/Discussion:Probl%C3%A8me_du_cercle_minimum#Programme_Scilab Apart from the fact that the comments are in French, the function is a boiler plate (I hope). It uses the Jarvis walk algorithm, which is not the most efficient but is rather simple to implement (-: HTH -- 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
