Results 1 to 3 of 3

Math Help - Help

  1. #1
    Newbie
    Joined
    Oct 2008
    Posts
    7

    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.
    Any idea please?
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Grand Panjandrum
    Joined
    Nov 2005
    From
    someplace
    Posts
    14,972
    Thanks
    4
    Quote Originally Posted by loollool View Post
    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.
    Any idea please?


    your post should look like:

    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.

    Any idea please?
    It is your responsibility to make your posts legible. To leave a post in the form of your origibnal post shows a lack of respect for potential helpers.

    CB
    Follow Math Help Forum on Facebook and Google+

  3. #3
    Newbie
    Joined
    Oct 2008
    Posts
    7
    oh ok.I didn't pay attention. my bad.Anyone can help?
    Follow Math Help Forum on Facebook and Google+


/mathhelpforum @mathhelpforum