@article{4106,
  abstract     = {Let B be a set of nb black points and W a set of nw, white points in the Euclidean plane. A line h is said to bisect B (or W) if, at most, half of the points of B (or W) lie on any one side of h. A line that bisects both B and W is called a ham-sandwich cut of B and W. We give an algorithm that computes a ham-sandwich cut of B and W in 0((nh+nw) log (min {nb, nw}+ 1)) time. The algorithm is considerably simpler than the previous most efficient one which takes 0((nb + nw) log (nb + nw)) time.},
  author       = {Edelsbrunner, Herbert and Waupotitsch, Roman},
  issn         = {1095-855X},
  journal      = {Journal of Symbolic Computation},
  number       = {2},
  pages        = {171 -- 178},
  publisher    = {Elsevier},
  title        = {{Computing a ham-sandwich cut in two dimensions}},
  doi          = {10.1016/S0747-7171(86)80020-7},
  volume       = {2},
  year         = {1986},
}