B
A
!" f : A → B #$ $ % ! & '#
•
-. & '#
•
; /01 & <#
•
(
) & * $ + ! ,
/01 2
n $ )89 :
3 ! 4. 5 067
%89 8= $ B
< |(x − y)
) ,+ )+ $ > )89 ? ! @A B
D ED = !I+
M 2
y
x
+
!J
x+y+z+w =
+ K!J
) B
n
& 4. 89 + ! B
06
C
F ,
G + H4 )5 !I & <#
<<< ,
G + H4 ; NO •
!" :( & '#
M *" > :+ !I+ :M P M
n
L
Q
! &,D
:O :! 2>
:! $ :O&+P
+ *D M : ! : :+ R=A
n=
) :( & '#
•
ST(
.
F 2
: ! : :+ R=A
n = ) .
f (n) =
f (n −
&O BSP
•
D(U 8 & <#
V
. R!D & <#
'
n = , n = n = ,n = n>
) − f (n − ) + f (n − )
B
:( & <#
AW ;D!>F
Algorithm RandBSP
Input: A set S = {s½ , s¾ , . . . sn } of non-intersecting line segments
Output: A Binary Space Partitioning (BSP) structure of S
1. Pick a permutation π of {, , . . . n} uniformly at random from the n! possible permutations
2. While a region contains more than one segment, cut it with the line through si where i is first in the ordering π such
that si cuts that region
,D X N YU + B(U )
N $ &
D + -!Z [A $ + D D,U
literal
4+ ; k-SAT ! 5 ! B T S T ( ! D ( B ( U DAU 9 ! )I ) A
x ^ = ) #x̄ x [! W ∧ >0 0! 0I ) ! c & 4+ ; & U ; ! U Y X 6
a 1 : ! True
∨
[ d
&U B
F! a! A $ False True = R = A & U B F! E D $ x E D & '#
CNF M F! a!A $ ! b F! )a!A !
B
k
literal
S
)! J
& > O $ D t
FD.
M ( D ! 0 I + & M ( & literal
S W T ) ! > B
J9 D B
) 1 . :O 0 I ) B
fB
YX6
d+ B 4 ) S
B
CNF
F! a! A $ False True = a! A 2 ) E D : ! D + 3-SAT a!A $ (x ∨ y ∨ z) ∧ (x̄ ∨ z) ∧ (x ∨ ȳ)
YX6
&,D
k
D :O [PI k-SAT a!A !" )! J
M
a D .
U
f
[e
Probabilistic Method
& G [!W )!I+ [e
h iA!j
]
\ + + R!D DA +A 5 !T BT $ AW P [!W
+ Y _ >0
\X D( $ : !0 & '#
\ X K N O W T ( &! 9 : + )+& B 0
P r(X ≤ t) > &>O E(X) ≤ t U
d+ $ f
t B4
B
!I+
N 2
g
`