Abstract
The post-office problem for n point sites in the plane (determine which site is closest to a later specified query point) is generalized to the situation when the residence of each site is uncertain and it is described via uniform distribution within a disk. Two probabilistic concepts of neighborhood — expected closest site and probably closest site — are discussed and the resulting Voronoi diagrams are investigated from a combinatorial and computational point of view.
The first author's work was supported by the ESPRIT II Basic Research Action of the EC under contract no. 3075 (project ALCOM).
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Aurenhammer, F. Voronoi diagrams — a survey of a fundamental geometric data structure. ACM Computing Surveys, to appear. Also available: Rep. 90-09, Institut für Informatik, FU Berlin, Germany.
Aurenhammer, F. Power diagrams: properties, algorithms, and applications. SIAM J. Computing 16 (1987), 78–96.
Chazelle, B., Cole R., Preparata, F.P., Yap, C.K. New upper bounds for neighbor searching. Information and Control 68 (1986), 105–124.
Edelsbrunner, H., Guibas, L.J., Stolfi, J. Optimal point location in a monotone subdivision. SIAM J. Computing 15 (1986), 317–340.
Edelsbrunner H., Maurer, M.A. Finding extreme points in three dimensions and solving the post-office problem in the plane. Inf. Process. Lett. 21 (1985), 39–47.
Fortune, S. A sweepline algorithm for Voronoi diagrams. Algorithmica 2 (1987), 153–174.
Kirkpatrick, D. Optimal search in planar subdivisions. SIAM J. Computing 12 (1983), 28–35.
Klein, R. Concrete and Abstract Voronoi Diagrams. Springer LNCS 400, 1989.
Knuth, D.E. The Art of Computer Programming, Vol III: Searching and Sorting. Addison-Wesley, 1973.
Mehlhorn, K., Meiser, S., O'Dunlaing, C. On the construction of abstract Voronoi diagrams. Discrete Comput. Geometry, to appear.
Shamos, M.I. Geometric complexity. Proc. 7th Ann. ACM Symp. STOC (1987), 224–233.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aurenhammer, F., Stöckl, G., Welzl, E. (1991). The post office problem for fuzzy point sets. In: Bieri, H., Noltemeier, H. (eds) Computational Geometry-Methods, Algorithms and Applications. CG 1991. Lecture Notes in Computer Science, vol 553. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54891-2_1
Download citation
DOI: https://doi.org/10.1007/3-540-54891-2_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54891-1
Online ISBN: 978-3-540-46459-4
eBook Packages: Springer Book Archive