Algorithm Improvements #1
載入中…
新增問題並參考
No description provided.
刪除分支「%!s(<nil>)」
Deleting a branch is permanent. Although the deleted branch may continue to exist for a short time before it actually gets removed, it CANNOT be undone in most cases. Continue?
Although the current packing algorithm is OK, we need to improve it to make it even better.
Currently, the algorithm uses X and Y scanlines that radiate out from (0, 0). It checks the X scanline first, and then it checks the Y scanline. It should instead find and store the first place found on both axes, and pick best one out of the two.
Here's an example packing result:
It might be worth noting that normally, you wouldn't give it so many different awkwards shapes.
It might also be worth noting that the algorithm hasn't been check to make sure it handles non-square images correctly. Some of the placement errors may have occurred due to the fact that the input images were not square.
I've just noticed that the 48x32 image near the bottom is potentially overlapping with the 80x128 image. We can't be having that! We definitely need to test this thing some more.