Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

how to find the best algo? #48

Open
helen5106 opened this issue May 26, 2022 · 0 comments
Open

how to find the best algo? #48

helen5106 opened this issue May 26, 2022 · 0 comments

Comments

@helen5106
Copy link

helen5106 commented May 26, 2022

I hava serval rectangles: [[95, 412], [136, 262], [136, 262], [95, 412], [136, 262], [136, 262], [95, 412], [136, 262], [136, 262], [95, 412], [136, 262], [136, 262], [95, 412], [136, 262], [136, 262], [95, 412], [136, 262], [136, 262], [95, 412], [136, 262], [136, 262], [95, 412], [136, 262], [136, 262], [95, 412], [136, 262], [136, 262]]

bin size: [(889,1194),]

I use SORT_AREA,

I do a loop for all the Guillotine,

the result is , it can not pack all the rect, but in photoshop, I can pack it manually

in ps :

https://imgur.com/HLH9TcV

in python:
https://imgur.com/vqW4SCw

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant