2011/07/22 by Wenqi Huang, Tao Ye, Huang, Wenqi +3 · 1 citation
Computer Science · Engineering · #Advanced Manufacturing and Logistics Optimization #Computational Geometry (cs.CG) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #Optimization and Packing Problems #Scheduling and Optimization Algorithms #cs.CG #cs.DM #cs.DS
paper · pdf · doi:10.48550/arxiv.1107.4463
arxiv created 2011/07/22 · openalex publication_date 2011/07/22 · arxiv updated 2011/07/25 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.