Given a rectangle R with area and a set of n positive reals A = {a 1 , a 2 ,. .. , a n } with a i... more Given a rectangle R with area and a set of n positive reals A = {a 1 , a 2 ,. .. , a n } with a i ∈A a i = , we consider the problem of dissecting R into n rectangles r i with area a i (i = 1, 2,. .. , n) so that the set R of resulting rectangles minimizes an objective function such as the sum of the perimeters of the rectangles in R, the maximum perimeter of the rectangles in R, and the maximum aspect ratio of the rectangles in R, where we call the problems with these objective functions PERI-SUM, PERI-MAX and ASPECT-RATIO, respectively. We propose an O(n log n) time algorithm that finds a dissection R of R that is a 1.25-approximate solution to PERI-SUM, a 2 √ 3-approximate solution to PERI-MAX, and has an aspect ratio at most max{ (R), 3, 1 + max i=1,...,n−1 a i+1 a i }, where (R) denotes the aspect ratio of R.
Given a rectangle R with area and a set of n positive reals A = {a 1 , a 2 ,. .. , a n } with a i... more Given a rectangle R with area and a set of n positive reals A = {a 1 , a 2 ,. .. , a n } with a i ∈A a i = , we consider the problem of dissecting R into n rectangles r i with area a i (i = 1, 2,. .. , n) so that the set R of resulting rectangles minimizes an objective function such as the sum of the perimeters of the rectangles in R, the maximum perimeter of the rectangles in R, and the maximum aspect ratio of the rectangles in R, where we call the problems with these objective functions PERI-SUM, PERI-MAX and ASPECT-RATIO, respectively. We propose an O(n log n) time algorithm that finds a dissection R of R that is a 1.25-approximate solution to PERI-SUM, a 2 √ 3-approximate solution to PERI-MAX, and has an aspect ratio at most max{ (R), 3, 1 + max i=1,...,n−1 a i+1 a i }, where (R) denotes the aspect ratio of R.
Uploads
Papers by abul kashem