5 research outputs found
On three soft rectangle packing problems with guillotine constraints
We investigate how to partition a rectangular region of length and
height into rectangles of given areas using
two-stage guillotine cuts, so as to minimize either (i) the sum of the
perimeters, (ii) the largest perimeter, or (iii) the maximum aspect ratio of
the rectangles. These problems play an important role in the ongoing Vietnamese
land-allocation reform, as well as in the optimization of matrix multiplication
algorithms. We show that the first problem can be solved to optimality in
, while the two others are NP-hard. We propose mixed
integer programming (MIP) formulations and a binary search-based approach for
solving the NP-hard problems. Experimental analyses are conducted to compare
the solution approaches in terms of computational efficiency and solution
quality, for different objectives
Decomposing and packing polygons / Dania el-Khechen.
In this thesis, we study three different problems in the field of computational geometry: the partitioning of a simple polygon into two congruent components, the partitioning of squares and rectangles into equal area components while minimizing the perimeter of the cuts, and the packing of the maximum number of squares in an orthogonal polygon. To solve the first problem, we present three polynomial time algorithms which given a simple polygon P partitions it, if possible, into two congruent and possibly nonsimple components P 1 and P 2 : an O ( n 2 log n ) time algorithm for properly congruent components and an O ( n 3 ) time algorithm for mirror congruent components. In our analysis of the second problem, we experimentally find new bounds on the optimal partitions of squares and rectangles into equal area components. The visualization of the best determined solutions allows us to conjecture some characteristics of a class of optimal solutions. Finally, for the third problem, we present three linear time algorithms for packing the maximum number of unit squares in three subclasses of orthogonal polygons: the staircase polygons, the pyramids and Manhattan skyline polygons. We also study a special case of the problem where the given orthogonal polygon has vertices with integer coordinates and the squares to pack are (2 {604} 2) squares. We model the latter problem with a binary integer program and we develop a system that produces and visualizes optimal solutions. The observation of such solutions aided us in proving some characteristics of a class of optimal solutions