Abstract
In this paper, we present a parallel algorithm for solving the all-pairs vertical segment visibility reporting (SVR) problem. Given a set S={S 0, S 1,...,S n−1} of disjoint vertical segments in the plane, the SVR problem asks for the determination and reporting of all the distinct visibility pairs. Our algorithm solves the SVR problem in O(log n) time using O(n) space and O(n) processors on a CREW PRAM (Concurrent Read Exclusive Write Parallel Random Access Machine) computational model.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Atallah, M. J., Cole, R., and Goodrich, M. T. Cascading divide-and-conquer: A technique for designing parallel algorithms. SIAM Journal on Computing, 18, 3, (June 1989), 499–532.
Cole, R. Parallel merge sort. SIAM Journal on Computing, 17, 4 (Aug. 1988), 770–785.
Lodi, E., and Pagli, L. A VLSI solution to the vertical segment visibility problem. IEEE Trans. Comput., C-35, 10 (Oct. 1986), 923–928.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chan, IW., Friesen, D.K. (1991). An optimal parallel algorithm for the vertical segment visibility reporting problem. In: Dehne, F., Fiala, F., Koczkodaj, W.W. (eds) Advances in Computing and Information — ICCI '91. ICCI 1991. Lecture Notes in Computer Science, vol 497. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54029-6_180
Download citation
DOI: https://doi.org/10.1007/3-540-54029-6_180
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54029-8
Online ISBN: 978-3-540-47359-6
eBook Packages: Springer Book Archive