Do you have a link to the previous discussion?
I tried the Z-level raster - I don't like it for similar reasons to the X- or Y-raster. In the case of the Z-raster, the roughing path appears to hog out area based on the underlying structure. It looks like its going to carve the ultimate shape at each Z-depth, but ends up hogging out all the material in a "walk-in-the-park" strategy - "I'll carve this out here, then --- squirrel --- go over there, then --- shiny object --- come back here..." It's very frustrating to have so much machine time tied up in repetition. Mine does not do an inordinate amount of squirreling around? Is it the most efficient? No, but it is not horrible either. I don't why you think it is going to carve out the ultimate shape at each Z depth, it is a roughing routine, so it hogs, that is what it is supposed to do.
I heard or read some time ago that "skipping" the already completed background graphics was the key to reducing the size of MPEG video files. Couldn't a similar strategy be employed in the raster technique? If the detail is already there, why repeat it? Just because we say raster, do we have to accept it's inefficiencies?Video files are two dimensional, x and y if you will. 3D carving is obviously NOT 2d like a video file so it is not a trivial matter to do what you suggest, things like slopes and curved surfaces need to be accounted for. That is why the 3d raster version works the best but wastes a lot of time.
I don't have the necessary programming skills to implement such a strategy. I'm sure Vectric does. How do we get suggestions to them?
It is one of those software things. . . it LOOKS like it should be easy because we engage our super computers between our ears and the solution is soooo obvious. I have tried engaging my own super puter on this issue. Put it this way, if we can do it by using our own brains and doing it more or less manually then it should be able to be done in software. Give it a try sometime, I have. . . . after a couple of hours I understood what some of the issues are. It is not pretty.
Tell ya a fast story from years ago (feeling blabby again today). Had a customer who was drilling circuit board holes. His boards could have like 3000 holes in them. Of course his software ran all over the place wasting time and costing him money. He asked me to come up with a solution. I set up a simple test on my brute force algorithm that had 50 holes. Well, it ran for a few hours so I figured it was stuck in an endless loop I had created. Hmmm, nope, it was proceeding as it should have. I let it run all night and into the next day, still not done. I double, triple, quadruple checked my algorithm. Still no go.
Then I remembered an article I read in Scientific American, I think Aug '82 about the traveling salesman problem. Yanno, shortest route a traveling salesman can travel. Turns out that these sort of problem are geometric in nature, maybe logarithmic? Anyhow, the problem I was working on would not have finished in my lifetime given the computing power of the time. Anything over 7 locations tipped the scales.
So how come they can do it now (think google maps)? Parallel computing, they break the problem down into much smaller subsets and reiterate through that a few times and voila, you have the shortest route with stops in between.
Doing what you suggest is actually much worse than the simple traveling salesman problem.
"If you see a good fight, get in it." Dr. Vernon Jones