I saw that you included some benchmark results with your documentation. Do you also have any insights into how the memory requirements scale with the size of the canvas and the number of boxes? One user of my network visualisation library netgraph (which uses rectangle-packer to arrange disconnected components with respect to each other) ran into a memory issue that traced back to rectangle-packer. I am trying to come up with a divide-and-conquer strategy (as advised in your README) but for that it would be good to know if I need to decrease the search space by reducing the size of the "canvas" or the number of rectangles.
Hi Daniel,
I saw that you included some benchmark results with your documentation. Do you also have any insights into how the memory requirements scale with the size of the canvas and the number of boxes? One user of my network visualisation library
netgraph(which usesrectangle-packerto arrange disconnected components with respect to each other) ran into a memory issue that traced back torectangle-packer. I am trying to come up with a divide-and-conquer strategy (as advised in your README) but for that it would be good to know if I need to decrease the search space by reducing the size of the "canvas" or the number of rectangles.Best, Paul