1. ## Help

Hi,
Let
R be a set of n red points in the plane, and a let B be a set of n

blue points in the plane. We call a line L
a separator for R and B if Lhas all points of R to
one side and all points of
B to the other side.
I need to find a randomized algorithm that can decide

in
O(n) expected time whether R and B have a separator.

2. Originally Posted by loollool
Hi,

Let
R be a set of n red points in the plane, and a let B be a set of n

blue points in the plane. We call a line L

a separator for R and B if Lhas all points of R to

one side and all points of

B to the other side.

I need to find a randomized algorithm that can decide

in O(n) expected time whether R and B have a separator.

Hi,

Let R be a set of n red points in the plane, and a let B be a set of n blue points in the plane.

We call a line L a separator for R and B if L has all points of R to one side and all points of B to the other side.

I need to find a randomized algorithm that can decide in O(n) expected time whether R and B have a separator.