Home > Back-end >  A two-dimensional rectangular cutting problem
A two-dimensional rectangular cutting problem

Time:09-24

Beg beg for a rectangular plate (L * W) for multiple small rectangle (Li, Wi), the optimal arrangement of utilization rate (the highest)

CodePudding user response:

I'll find what np or something don't understand

CodePudding user response:

A np-hard problem, two dimensional rectangle packing problem, this algorithm is not difficult, and the speed is quick, and row the better

CodePudding user response:

I realized the algorithm, can well solve the problem of rectangular discharge, WeChat lyudongliang, can chat

CodePudding user response:

Each small rectangular as big as big or not? Not as big as the complexity of the very high ~ ~ ~
  • Related