andy pugh wrote: > On 15 September 2013 19:06, EBo <[email protected]> wrote: > > >> how about setting up a couple of test programs that do circles and Koch >> snowflakes with different segment lengths and recursive depths. Then >> you can profile the behaviour better. >> > > I don't think that the snowflake is a good test, it is made of > genuinely short segments with sharp corners. single-segment lookahead > is perfectly appropriate for that path. > Exactly right. My torture test was a 2" circle made up of 10,000 line segments. This showed the biggest difference when G64 Pxx was used. It would go from several minutes at G64 mode to about 13 seconds with G64 P0.001 or something like that, almost achieving the programmed speed. But, of course, the rub is that this code SHOULD give the full programmed speed as the acceleration is quite low, and you can compare it to a G03 move describing the same path, which should complete in a couple seconds.
Jon ------------------------------------------------------------------------------ LIMITED TIME SALE - Full Year of Microsoft Training For Just $49.99! 1,500+ hours of tutorials including VisualStudio 2012, Windows 8, SharePoint 2013, SQL 2012, MVC 4, more. BEST VALUE: New Multi-Library Power Pack includes Mobile, Cloud, Java, and UX Design. Lowest price ever! Ends 9/20/13. http://pubads.g.doubleclick.net/gampad/clk?id=58041151&iu=/4140/ostg.clktrk _______________________________________________ Emc-developers mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/emc-developers
