Please note that the traveling salesman problem is NP hard, so the auto-arrange algorithm will never aim for a “perfect”/ fastest arrangement.
It just ensures that the parts have a minimum distance to each other while keeping them as close as possible to the center of the build plate
Please note that the traveling salesman problem is NP hard, so the auto-arrange algorithm will never aim for a “perfect”/ fastest arrangement. It just ensures that the parts have a minimum distance to each other while keeping them as close as possible to the center of the build plate