screenshot please. You can use the horizontal slider to make it obvious which section it is skipping.
Keep in mind that minimizing the travels is a complicated business. Trying every combination of which lines to do in which order to see which is the fastest will usually take more computing cycles than would be possible to do in less than a minute even if you had the computing power of every computer on the planet. Even if every atom in the universe was as powerful as your computer, it would probably take longer than the age of the universe. This is common. What seems simple actually is a difficult problem. This problem actually has a name: "the travelling salesman problem" and there are many algorithms that come close to the best possible solution but none of them guarantee the best solution and as you saw yourself, some solutions seem pretty obviously *not* the fastest solution. But humans are better at some tasks than computers.
This algorithm has to run 1000 times if you have 1000 layers sliced and people get upset if it takes an hour to slice their part so a compromise was made. I agree that a better algorithm could be chosen but this is not easy to do.
Recommended Posts
electric_monk 0
I'm having this exact problem with a model with a large flat rectangular base - it skips a chunk in the middle as it's doing all the parallel lines and then comes back for it. Seems a very eccentric thing for the program to do.
Link to post
Share on other sites