article published yes Herbert Edelsbrunner author 3FB178DA-F248-11E8-B48F-1D18A9856A870000-0002-9823-6833 Roman Waupotitsch author 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. Elsevier1986 eng 0747-7171 1095-855X10.1016/S0747-7171(86)80020-7 22171 - 178 yes Edelsbrunner, Herbert, and Roman Waupotitsch. “Computing a Ham-Sandwich Cut in Two Dimensions.” <i>Journal of Symbolic Computation</i>. Elsevier, 1986. <a href="https://doi.org/10.1016/S0747-7171(86)80020-7">https://doi.org/10.1016/S0747-7171(86)80020-7</a>. Edelsbrunner, Herbert, and Roman Waupotitsch. “Computing a Ham-Sandwich Cut in Two Dimensions.” <i>Journal of Symbolic Computation</i>, vol. 2, no. 2, Elsevier, 1986, pp. 171–78, doi:<a href="https://doi.org/10.1016/S0747-7171(86)80020-7">10.1016/S0747-7171(86)80020-7</a>. Edelsbrunner H, Waupotitsch R. 1986. Computing a ham-sandwich cut in two dimensions. Journal of Symbolic Computation. 2(2), 171–178. Edelsbrunner H, Waupotitsch R. Computing a ham-sandwich cut in two dimensions. <i>Journal of Symbolic Computation</i>. 1986;2(2):171-178. doi:<a href="https://doi.org/10.1016/S0747-7171(86)80020-7">10.1016/S0747-7171(86)80020-7</a> Edelsbrunner, H., &#38; Waupotitsch, R. (1986). Computing a ham-sandwich cut in two dimensions. <i>Journal of Symbolic Computation</i>. Elsevier. <a href="https://doi.org/10.1016/S0747-7171(86)80020-7">https://doi.org/10.1016/S0747-7171(86)80020-7</a> H. Edelsbrunner and R. Waupotitsch, “Computing a ham-sandwich cut in two dimensions,” <i>Journal of Symbolic Computation</i>, vol. 2, no. 2. Elsevier, pp. 171–178, 1986. H. Edelsbrunner, R. Waupotitsch, Journal of Symbolic Computation 2 (1986) 171–178. 41062018-12-11T12:06:58Z2022-02-01T11:22:59Z