Abstract
We present a parallel algorithm which constructs the Voronoi diagram of a planar n-point set within a square window. When the points are independently drawn from a uniform distribution, the algorithm runs in O(log n) expected time on CRCW PRAM with O(n/log n) processors. The fast operation of the algorithm results from the efficiency of a new multi-level bucketing technique convenient in processor assignment. The concurrent write is used only for the distribution of points in their home buckets in the bottom level.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A. Aggarwal, B. Chazelle, L. Guibas, C. O'Dunlaing, and C. Yap, Parallel Computational Geometry, in Proc. 25th Annual IEEE Symposium on Foundations of Computer Science 1985, 468–477.
M. J. Atallah and M.T. Goodrich, Efficient Parallel Solutions to Some Geometric Problems, Journal of Parallel and Distributed Computing 3, 492–507, 1986.
M.J. Atallah and M.T. Goodrich, Efficient Plane Sweeping in Parallel, Proc. of the 2nd Ann. Symposium on Computational Geometry, Yorktown Heights, 1986.
J.L. Bentley, B.W. Weide, A.C. Yao, Optimal expected-time algorithms for closest point problems, ACM Transactions on Mathematical Software 6, pp. 563–580.
B.C. Chazelle, Computational Geometry on a Systolic Chip, IEEE Trans. on Comp., C-33 pp. 774–785.
P.J. Green, R. Sibson, Computing Dirichlet tessellations in the plane, The Computer Journal 21, pp. 168–173.
L.J. Guibas, J. Stofli, Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams, ACM Transactions on Graphics 4, pp. 74–123.
S. Fortune, A Sweepline Algorithm for Voronoi Diagrams, Proc. of the 2nd Ann. Symposium on Computational Geometry, Yorktown Heights, 1986.
S. Fortune and J. Wyllie, Parallelism in random access machines, in Proc. 21st Annual ACM Sympos. on Theory of Comput., San Diego, California, 1978, pp. 114–118.
J. Katajainen, Bucketing and Filtering in Computational Geometry, Ph. D. dissertation, University of Turku.
R. Miller, Q.F. Stout, Computational Geometry on a mesh-connected computer, Proc. Int. Conf. on Parallel Processing, 1984.
F.P. Preparata and M.I. Shamos, Computational Geometry, An Introduction, Texts and Monographs in Computer Science, Springer Verlag, New York.
J.H. Reif, An Optimal Parallel Algorithm for Integer Sorting, Proc. 26th Ann. Symp. on Foundations of Computer Science, 1985.
S. Rajasekaran and S. Sen, On parallel sorting, Tech. Rept CS-187-38, Dept of Computer Science, Duke University.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Levcopoulos, C., Katajainen, J., Lingas, A. (1988). An optimal expected-time parallel algorithm for Voronoi diagrams. In: Karlsson, R., Lingas, A. (eds) SWAT 88. SWAT 1988. Lecture Notes in Computer Science, vol 318. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-19487-8_21
Download citation
DOI: https://doi.org/10.1007/3-540-19487-8_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-19487-3
Online ISBN: 978-3-540-39288-0
eBook Packages: Springer Book Archive