On 27 January 2012 17:18, Spiderdab <77...@tiscali.it> wrote: > I personally think this kind of bug are of a main importance, and that > also should be simple to solve
I am not sure it is, in the general case.. Working out the boundary of the space that a non-trivial mechanism can reach while staying inside its joint limits isn't especially easy. The only way I can think to do it is to virtually run through all possible positions. I suspect that the answer should be that a non-trivial machine shouldn't have soft limits in space, only on the joints. It should be possible to check that the inverse kins returns valid joint positions for all end-points of a G-code program, but testing whether intermediate points of arcs are possible is not particularly easy without running the G-code through "virtually" -- atp The idea that there is no such thing as objective truth is, quite simply, wrong. ------------------------------------------------------------------------------ Try before you buy = See our experts in action! The most comprehensive online learning library for Microsoft developers is just $99.99! Visual Studio, SharePoint, SQL - plus HTML5, CSS3, MVC3, Metro Style Apps, more. Free future releases when you subscribe now! http://p.sf.net/sfu/learndevnow-dev2 _______________________________________________ Emc-developers mailing list Emc-developers@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/emc-developers
