@article{4111,
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.},
author = {Edelsbrunner, Herbert and Maurer, Hermann},
issn = {1872-6119},
journal = {Information Processing Letters},
number = {1},
pages = {39 -- 47},
publisher = {Elsevier},
title = {{Finding extreme-points in 3-dimensions and solving the post-office problem in the plane}},
doi = {10.1016/0020-0190(85)90107-3},
volume = {21},
year = {1985},
}