--- res: bibo_abstract: - 'This paper describes an optimal solution for the following geometric search problem defined for a set P of n points in three dimensions: Given a plane h with all points of P on one side and a line ℓ in h, determine a point of P that is hit first when h is rotated around ℓ. The solution takes O(n) space and O(log n) time for a query. By use of geometric transforms, the post-office problem for a finite set of points in two dimensions and certain two-dimensional point location problems are reduced to the former problem and thus also optimally solved.@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: Hermann foaf_name: Maurer, Hermann foaf_surname: Maurer bibo_doi: 10.1016/0020-0190(85)90107-3 bibo_issue: '1' bibo_volume: 21 dct_date: 1985^xs_gYear dct_isPartOf: - http://id.crossref.org/issn/0020-0190 - http://id.crossref.org/issn/1872-6119 dct_language: eng dct_publisher: Elsevier@ dct_title: Finding extreme-points in 3-dimensions and solving the post-office problem in the plane@ ...