Computing a ham-sandwich cut in two dimensions Edelsbrunner, Herbert ; https://orcid.org/0000-0002-9823-6833 Waupotitsch, Roman 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. Elsevier 1986 info:eu-repo/semantics/article doc-type:article text http://purl.org/coar/resource_type/c_2df8fbb1 https://research-explorer.ista.ac.at/record/4106 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> eng info:eu-repo/semantics/altIdentifier/doi/10.1016/S0747-7171(86)80020-7 info:eu-repo/semantics/altIdentifier/issn/0747-7171 info:eu-repo/semantics/altIdentifier/e-issn/1095-855X info:eu-repo/semantics/closedAccess