Chapter 5 Guillotine Cut
description
Transcript of Chapter 5 Guillotine Cut
![Page 2: Chapter 5 Guillotine Cut](https://reader034.fdocuments.us/reader034/viewer/2022042511/56816802550346895ddd8234/html5/thumbnails/2.jpg)
Rectilinear Steiner Tree
• Given a set of points in the rectilinear plane, find a minimum length tree interconnecting them.
• Those given points are called terminals.
![Page 3: Chapter 5 Guillotine Cut](https://reader034.fdocuments.us/reader034/viewer/2022042511/56816802550346895ddd8234/html5/thumbnails/3.jpg)
Initially
Edge length< RSMT
![Page 4: Chapter 5 Guillotine Cut](https://reader034.fdocuments.us/reader034/viewer/2022042511/56816802550346895ddd8234/html5/thumbnails/4.jpg)
Initially
n x n grid2 2
n = # of terminalsL
nL
nLn 2
Total movingLength:
If PTAS exists for grid points, then it exists for general case.
![Page 5: Chapter 5 Guillotine Cut](https://reader034.fdocuments.us/reader034/viewer/2022042511/56816802550346895ddd8234/html5/thumbnails/5.jpg)
(1/3-2/3)-cut
Longer edge1/3 2/3
Shorter edge
Longer edge
> 1/3
![Page 6: Chapter 5 Guillotine Cut](https://reader034.fdocuments.us/reader034/viewer/2022042511/56816802550346895ddd8234/html5/thumbnails/6.jpg)
Cut line position
n x n grid2 2
L
Cut line alwayspasses throughthe center of a cell.
1 ( assume)
![Page 7: Chapter 5 Guillotine Cut](https://reader034.fdocuments.us/reader034/viewer/2022042511/56816802550346895ddd8234/html5/thumbnails/7.jpg)
Depth of (1/3-2/3)-cut
Note that every two parallel cut lines has distanceat least one. Therefore, the smallest rectangle hasarea 1.
After one cut, each resulting rectangle has area Within a factor of 2/3 from the original one.
Hence, depth of cuts < (4 log n)/(log (3/2)) = O(log n) since
(2/3) n > 1depth 4
![Page 8: Chapter 5 Guillotine Cut](https://reader034.fdocuments.us/reader034/viewer/2022042511/56816802550346895ddd8234/html5/thumbnails/8.jpg)
(1/3-2/3)-Partition
O(log n)
![Page 9: Chapter 5 Guillotine Cut](https://reader034.fdocuments.us/reader034/viewer/2022042511/56816802550346895ddd8234/html5/thumbnails/9.jpg)
Portals
m portals divide a cut segment equally.
![Page 10: Chapter 5 Guillotine Cut](https://reader034.fdocuments.us/reader034/viewer/2022042511/56816802550346895ddd8234/html5/thumbnails/10.jpg)
Restriction
A rectilinear Steiner tree T is restricted if
there exists a (1/3-2/3)-partition such thatIf a segment of T passes through a cutLine, it passes at a portal.
![Page 11: Chapter 5 Guillotine Cut](https://reader034.fdocuments.us/reader034/viewer/2022042511/56816802550346895ddd8234/html5/thumbnails/11.jpg)
Minimum Restricted RST can be computed in time n 2 bydynamic programming
O(m)
Choices of each cut line = O(n )2
# of subproblems = n 2O(m)24
26
![Page 12: Chapter 5 Guillotine Cut](https://reader034.fdocuments.us/reader034/viewer/2022042511/56816802550346895ddd8234/html5/thumbnails/12.jpg)
# of subproblem
Each subproblems can be described by three facts:
1. Position of for edges of a rectangle.
2. Position of portals at each edge.
4. Partition of using portals on the boundary. (In each part of the partition, all portals are connected and every terminal inside of the rectangle is connected to some tree containing a portal. )
O(n )8
O(n )4
2O(m)3. Set of using portals.
2O(m)
![Page 13: Chapter 5 Guillotine Cut](https://reader034.fdocuments.us/reader034/viewer/2022042511/56816802550346895ddd8234/html5/thumbnails/13.jpg)
Position of portals
O(n )O(n )2 2
![Page 14: Chapter 5 Guillotine Cut](https://reader034.fdocuments.us/reader034/viewer/2022042511/56816802550346895ddd8234/html5/thumbnails/14.jpg)
# of partitions
![Page 15: Chapter 5 Guillotine Cut](https://reader034.fdocuments.us/reader034/viewer/2022042511/56816802550346895ddd8234/html5/thumbnails/15.jpg)
1 k
N(k) = # of partitions
N(k) = N(k-1) + N(k-2)N(1) + ··· + N(1)N(k-2) + N(k-1) = N(k-1)N(0) + N(k-2)N(1) + ··· + N(0)N(k-1)
N(0)=1
f(x) = N(0) + N(1)x + N(2)x + ··· + N(k)x + ···2 k
xf(x) = f(x) - 12
![Page 16: Chapter 5 Guillotine Cut](https://reader034.fdocuments.us/reader034/viewer/2022042511/56816802550346895ddd8234/html5/thumbnails/16.jpg)
)(
12
1
1
2
2)1()1(
)50()250)(150(50
2/)4(12/1
)(
)2/()4(2/1
2411)(
have we,1)0( Since
.2
411)(
kO
kk
k
k
k
kk....
kkN
xxkx
xxf
fxxxf
![Page 17: Chapter 5 Guillotine Cut](https://reader034.fdocuments.us/reader034/viewer/2022042511/56816802550346895ddd8234/html5/thumbnails/17.jpg)
Analysis (idea)
• Consider a MRST T.• Choose a (1/3-2/3)-partition. • Modify it into a restricted RST by moving
cross-points to portals.• Estimate the total cost of moving cross-
points.
![Page 18: Chapter 5 Guillotine Cut](https://reader034.fdocuments.us/reader034/viewer/2022042511/56816802550346895ddd8234/html5/thumbnails/18.jpg)
Choice of (1/3-2/3)-partition
Each cut is chosen to minimize # of cross-points.
(# of cross-points) x (1/3 longer edge length)< (length of T lying in rectangle).
1/3 2/3
![Page 19: Chapter 5 Guillotine Cut](https://reader034.fdocuments.us/reader034/viewer/2022042511/56816802550346895ddd8234/html5/thumbnails/19.jpg)
Moving cross-points to portals
Cost = (# of cross-points) x ( edge length/(m+1)) < (3/(m+1)) x (length of T lying in rectangle)
![Page 20: Chapter 5 Guillotine Cut](https://reader034.fdocuments.us/reader034/viewer/2022042511/56816802550346895ddd8234/html5/thumbnails/20.jpg)
Moving cost at each level of(1/3-2/3)-Partition < (3/(m+1)) x (length of T )
O(log n)
Total cost < O(log n)(3 / (m+1)) x (length of T)
Choose m = (1/ε) O(log n). Then 2 = n . O(m) O(1/ε)
![Page 21: Chapter 5 Guillotine Cut](https://reader034.fdocuments.us/reader034/viewer/2022042511/56816802550346895ddd8234/html5/thumbnails/21.jpg)
RSMT has (1+ε)-approximation with running Time n .
O(1/ε)
![Page 22: Chapter 5 Guillotine Cut](https://reader034.fdocuments.us/reader034/viewer/2022042511/56816802550346895ddd8234/html5/thumbnails/22.jpg)
Thanks, End