{"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","page":"39 - 47","status":"public","citation":{"ieee":"H. Edelsbrunner and H. Maurer, “Finding extreme-points in 3-dimensions and solving the post-office problem in the plane,” <i>Information Processing Letters</i>, vol. 21, no. 1. Elsevier, pp. 39–47, 1985.","ama":"Edelsbrunner H, Maurer H. Finding extreme-points in 3-dimensions and solving the post-office problem in the plane. <i>Information Processing Letters</i>. 1985;21(1):39-47. doi:<a href=\"https://doi.org/10.1016/0020-0190(85)90107-3\">10.1016/0020-0190(85)90107-3</a>","mla":"Edelsbrunner, Herbert, and Hermann Maurer. “Finding Extreme-Points in 3-Dimensions and Solving the Post-Office Problem in the Plane.” <i>Information Processing Letters</i>, vol. 21, no. 1, Elsevier, 1985, pp. 39–47, doi:<a href=\"https://doi.org/10.1016/0020-0190(85)90107-3\">10.1016/0020-0190(85)90107-3</a>.","short":"H. Edelsbrunner, H. Maurer, Information Processing Letters 21 (1985) 39–47.","apa":"Edelsbrunner, H., &#38; Maurer, H. (1985). Finding extreme-points in 3-dimensions and solving the post-office problem in the plane. <i>Information Processing Letters</i>. Elsevier. <a href=\"https://doi.org/10.1016/0020-0190(85)90107-3\">https://doi.org/10.1016/0020-0190(85)90107-3</a>","ista":"Edelsbrunner H, Maurer H. 1985. Finding extreme-points in 3-dimensions and solving the post-office problem in the plane. Information Processing Letters. 21(1), 39–47.","chicago":"Edelsbrunner, Herbert, and Hermann Maurer. “Finding Extreme-Points in 3-Dimensions and Solving the Post-Office Problem in the Plane.” <i>Information Processing Letters</i>. Elsevier, 1985. <a href=\"https://doi.org/10.1016/0020-0190(85)90107-3\">https://doi.org/10.1016/0020-0190(85)90107-3</a>."},"date_created":"2018-12-11T12:07:00Z","month":"07","article_processing_charge":"No","acknowledgement":"Research reported in this paper was partially supported by the Austrian Fonds zur Förderung tier wissenschaftlichen\r\nForschung. \r\n","publication":"Information Processing Letters","publication_status":"published","abstract":[{"text":"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.","lang":"eng"}],"author":[{"orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner"},{"full_name":"Maurer, Hermann","first_name":"Hermann","last_name":"Maurer"}],"doi":"10.1016/0020-0190(85)90107-3","_id":"4111","publication_identifier":{"issn":["0020-0190"],"eissn":["1872-6119"]},"volume":21,"date_updated":"2022-01-31T12:49:12Z","type":"journal_article","extern":"1","date_published":"1985-07-10T00:00:00Z","year":"1985","article_type":"original","publisher":"Elsevier","day":"10","issue":"1","oa_version":"None","title":"Finding extreme-points in 3-dimensions and solving the post-office problem in the plane","scopus_import":"1","quality_controlled":"1","intvolume":"        21","language":[{"iso":"eng"}],"publist_id":"2009"}