Skip to content

how to find the best algo? #48

Description

@helen5106

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

Activity

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Metadata

Metadata

Assignees

No one assigned

    Labels

    No labels
    No labels

    Projects

    No projects

      Milestone

      No milestone

      Relationships

      None yet

      Development

      No branches or pull requests

      Issue actions