kreso-t wrote: ↑Thu Aug 16, 2018 8:07 pm Thx for the info, will do that

But first need to do some more testing myself, I noticed an issue in some cases (for example when tool need to pass through very narrow area) that I need to fix.

Ok, as I am not familiar with the process of testing and approving the FreeCAD PRs - would it help if I make these changes now in the forked FreeCAD code (i.e. in my github profile)? I could probably do that in the next few days. Yes - that's how it should be done. Fork the official FreeCAD repo on...

I would definitely go for having this in Path but want more people testing and weighing in. Ok, as I am not familiar with the process of testing and approving the FreeCAD PRs - would it help if I make these changes now in the forked FreeCAD code (i.e. in my github profile)? I could probably do that...

pybind11 is used for surface flattening in FreeCAD already: https://forum.freecadweb.org/viewtopic.php?t=18010&start=120 From wmayer: it's also already used by Path.Area (libarea/pyarea.cpp), there are also "boost" bindings there (libarea/PythonStuff.cpp). It should not be a problem t...

Hi sliptonic, Thx, I don't see it as big effort to put it inside the Path.Area now, it's a matter of adding the adaptive.Xpp source and binding it to the Path.Area python module, maybe would require a little refactoring. Python side already uses all the base classes and concepts from the FreeCAD Pat...

Just finished porting the core algorithm to C++. You may check it out at https://github.com/kreso-t/FreeCAD_Mod_Adaptive_Path-Cpp Works a lot faster now and does not have dependency to pyclipper anymore (uses clipper.hpp/clipper.cpp - same as Path.Area) The core part is implemented as one hpp + cpp ...

+1

Hi, On my laptop (windows): i7-3610QM CPU @ 2.30GHz according to cProfile it takes in average ~1.3 ms to calculate one step/point (all iterations), to calculate only one cut area (the red polygon on the second picture) it takes avg. ~0.13 ms I just tried to do some parts of it in C++, it's like 15 t...

For example, if at some point (step n) we have the following cleared area, tool position + direction: step1.png In the next step we try to move the tool by certain small distance (i.e. it is not tool radius as the image may imply, it's smaller variable step) in the direction "deflected" by...

I tried it quickly - worked great! I think the performance was OK'ish.. I'm not sure how, but initially, the algorithm took quite a while to run, it visualized all the steps on screen and then produced the final path. But then when I changed some settings, the path also updated "on the fly&quo...