--- res: bibo_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.@eng bibo_authorlist: - foaf_Person: foaf_givenName: Herbert foaf_name: Edelsbrunner, Herbert foaf_surname: Edelsbrunner foaf_workInfoHomepage: http://www.librecat.org/personId=3FB178DA-F248-11E8-B48F-1D18A9856A87 orcid: 0000-0002-9823-6833 - foaf_Person: foaf_givenName: Roman foaf_name: Waupotitsch, Roman foaf_surname: Waupotitsch bibo_doi: 10.1016/S0747-7171(86)80020-7 bibo_issue: '2' bibo_volume: 2 dct_date: 1986^xs_gYear dct_isPartOf: - http://id.crossref.org/issn/0747-7171 - http://id.crossref.org/issn/1095-855X dct_language: eng dct_publisher: Elsevier@ dct_title: Computing a ham-sandwich cut in two dimensions@ ...