Rich:
It seems to be working. But the results are still preliminary. Im working on an algorithm to
do it faster and then I need to consolidate it to a path.
Its amazingly complex. To take two polygons, ( a tool and a profile), and calculate how that
polygon can traverse the edge of the second polygon , where it will hit and where the optimal route is
is more complex than is believable.. I have to take into effect the possability of undercuts too which makes it a bit
more difficult.
Its looking like we'll do any mixture of rough and fine cuts, rought is no longer necessary to do a fine, but then the fine
will take a great many passes, the number of final passes is dependent on the amount of material left over from the roughing.
In fine passing, you specify the final pass size as well as pass size. The algorithm will look to see when a pass hits no material,
and will make the next pass the first finish pass, so the number of finish passes will totally depend on if it is roughed or not.
To that end I have added a finish button and removed the sensing of "finish pass allowed".
Cant promise when , but thats how its working out so far. Ill post when I have the initial test version ready.
Art