Abstract
The only way known to obtain good worst-case algorithms for the post-office problem is to reduce it to region location. For the case of regions bounded by straightline segments a simple algorithm was given recently which is optimal (up to constants). For the case of regions bounded by more or less arbitrary curves no optimal algorithm is known to date. We present a simple (non-optimal) algorithm and demonstrate that space-optimal solutions are possible.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Bentley, J.L.: Decomposable searching problems; Information Processing Letters 8(1979), 244–251.
Bentley, J.L., Maurer, H.A.: A note on Euclidean near neighbor searching in the plane; Information Processing Letters 8(1979), 133–136.
Bentley, J.L., Saxe, J.B.: Decomposable searching problemsI: Static to-Dynamic translations; to appear in: Journal of Algorithms.
Dobkin, D.P., Lipton, R.J.: Multidimensional searching problems; SIAM Journal on Computing 5(1976), 181–186.
Edelsbrunner, H., van Leeuwen, J.: Multidimensional algorithms and data structures — a bibliography; Bulletin of the EATCS 11 (1980), 46–74.
Edelsbrunner, H., Maurer, H.A.: On region location in the plane; Report 52, Institut für Informationsverarbeitung Graz (1980).
Kirkpatrick, D.G.: Optimal searching in planar subdivisions; University of British Columbia, Department of Computer Science Report (1979).
Lee, D.T., Preparata, F.P.: Location of a point in a planar subdivision and its applications; SIAM Journal on computing 6 (1977), 594–606.
Leeuwen, J.v., Maurer, H.A.: Dynamic systems of static data-structures; Report 42, Institut für Informationsverarbeitung Graz (1980).
Lipton, R.J., Tarjan, R.E.: Applications of a planar separator theorem; Proc. of the 18th Annual FOCS Symposium (1977), 162–170.
Maurer, H.A.: Datenstrukturen und Programmierverfahren; Teubner, Stuttgart (1974).
Maurer, H.A., Ottmann, Th.: Tree-structures for set manipulation problems; Lecture Notes on Computer Science 53 (1977), 108–121.
Maurer, H.A., Ottmann, Th.: Manipulating sets of points — a survey; Applied Computer Science 13, Carl Hanser (1979), 9–29.
Maurer, H.A., Ottmann, Th.: Dynamic solutions of decomposable searching problems; Discrete Structures and Algorithms, Carl Hanser (1980), 17–24.
Mehlhorn, K.: Effiziente Algorithmen; Teubner, Stuttgart (1977).
Mehlhorn, K.: Private Communication (1980).
Preparata, F.P.: A new approach to planar point location; University of Illionois at Urbana — Champain, Report R — 829 (1978).
Shamos, M.I.: Geometric complexity, Proc. of the 7th Annual Symposium on Theory of Computing (1975), 224–233.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Maurer, H. (1981). The post-office problem and related questions. In: Noltemeier, H. (eds) Graphtheoretic Concepts in Computer Science. WG 1980. Lecture Notes in Computer Science, vol 100. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10291-4_1
Download citation
DOI: https://doi.org/10.1007/3-540-10291-4_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10291-5
Online ISBN: 978-3-540-38435-9
eBook Packages: Springer Book Archive