Abstract
We present an O(log(n))-time-algorithm for computing Voronoi-diagrams using a CREW-PRAM with n 3 processors. We also show,that the same idea works for Power-diagrams using the same time, number of processors and model of computation.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
K.Mehlhorn: Data Structures and Algorithms 3: Multi-dimensional Searching and Computatonal Geometry, EATCS Monographs on Theoretical Computer Science, 1984, Springer-Verlag.
A.Aggarwal, B.Chazelle, L.Guibas, C.Ó'Dúnlaing, C.Yap: Parallel Computational Geometry, extendet abstract.
A.Aggarwal, B.Chazelle, L.Guibas, C.Ó'Dúnlaing, C.Yap: Parallel Computational Geometry, submitted for publication in 1988.
F.Aurenhammer: Power Diagrams: Properties, Algorithms and Applications, SIAM J. Comput. Vol. 16, February 1987, p. 78–96
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Preilowski, W., Mumbeck, W. (1989). A time-optimal parallel algorithm for the computing of Voronoi-diagrams. In: van Leeuwen, J. (eds) Graph-Theoretic Concepts in Computer Science. WG 1988. Lecture Notes in Computer Science, vol 344. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50728-0_60
Download citation
DOI: https://doi.org/10.1007/3-540-50728-0_60
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-50728-4
Online ISBN: 978-3-540-46076-3
eBook Packages: Springer Book Archive