矩形Packing的左下放置定理
Bottom-Left Placement Theorem for Rectangle Packing
摘要：
本文证明了矩形装箱问题的左下角放置定理，即如果可以将n个任意给定的矩形正交地放置到一个矩形容器中而不重叠，那么我们可以通过将一个矩形依次放置到容器的左下角来实现一个可行的装箱.这个定理表明，即使对于实参数矩形填充问题，我们也可以在有限次左下放置操作之后解决它。基于这个定理，我们可以发展出求解矩形排样问题的有效启发式算法。
英文摘要：
This paper proves a bottom-left placement theorem for the rectangle packing problem, stating that if it is possible to orthogonally place n arbitrarily given rectangles into a rectangular container without overlapping, then we can achieve a feasible packing by successively placing a rectangle onto a bottom-left corner in the container. This theorem shows that even for the real-parameter rectangle packing problem, we can solve it after finite times of bottom-left placement actions. Based on this theorem, we might develop efficient heuristic algorithms for solving the rectangle packing problem.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
