Abstract
We present optimal parallel solutions to direct dominance problems for planar point sets. Our algorithms are deterministic and designed to run on the concurrent read exclusive write parallel random-access machine (CREW PRAM). In particular, we provide algorithms for counting the number of points that are directly dominated by each point of a planar point set, and for reporting these point sets. The counting algorithm runs in O(log n) time using O(n) processors; the reporting algorithm runs in O(log n) time using O(n+k/log n) processors, where k is the size of the output. The total work of each algorithm matches the respective sequential lower bound. As an application of our results, we present an algorithm for the maximum empty rectangle problem, which is work optimal in the expected case.
This research was supported in part by the ESPRIT Basic Research Actions Program, under contract No. 7141 (project ALCOM II).
This research was in part supported by Natural Sciences and Engineering Council of Canada.
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, D. Kravets, J. Park and S. Sen. Parallel searching in generalized Monge arrays with applications. Proc. 2nd ACM Symp. on Parallel Algorithms and Architectures, 1990, pp. 259–268.
A. Aggarwal and S. Suri. Fast algorithms for computing the largest empty rectangle. Proc. 3rd Annual ACM Symp. on Comp. Geom., 1987, pp. 278–290.
M. Atallah, R. Cole and M. Goodrich. Cascading divide-and-conquer: a technique for designing parallel algorithms. SIAM J. Computing, 18 (1989), pp. 499–532.
M. Atallah and G. Fredrickson. A note on finding the maximum empty rectangle. Discrete Applied Mathematics. 13 (1986) pp. 87–91.
M. Atallah and S. R. Kosaraju. An efficient algorithm for maxdorninance, with applications. Algorithmica 4 (1989) pp. 221–236.
R. Cole. Parallel merge sort. SIAM J. Computing, 17, (1988), pp. 770–785.
B. Chazelle, R. Drysdale and D. T. Lee. Computing the largest empty rectangle. SIAM J. Computing 15 (1986), pp. 300–315.
I. W. Chen and D. K. Friesen. Parallel algorithms for some dominance problems based on a CREW PRAM. Proc. 2nd International Symposium on Algorithms, LNCS 557, 1991, pp. 375–384.
R. Cole and U. Vishkin. The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time. Algorithmica, 3 (1988), pp. 329–346.
R. Cole and U. Vishkin. Approximate parallel scheduling, Part I: The basic technique with applications to optimal parallel list ranking in logarithmic time. SIAM J. Computing, 17 (1988), pp. 128–142.
A. Datta. Efficient algorithms for the largest rectangle problem. Information Sciences, 64 (1992), pp. 121–141.
A. Datta and K. Krithivasan. Efficient algorithms for the maximum empty rectangle problem in shared memory and other architectures. Proc. 1990 International Conference on Parallel Processing, 1990, III, pp. 344–345.
L. Gewali, M. Keil, S. Ntafos, On Covering Orthogonal Polygons with Star-Shaped Polygons. Information Sciences, 65 (1992), pp. 45–63.
M. T. Goodrich. Intersecting line segments in parallel with an output-sensitive number of processors. SIAM J. Computing, 20, (1991), pp. 737–755.
R. Güting, O. Nurmi and T. Ottmann. Fast algorithms for direct enclosures and direct dominances. J. Algorithms 10 (1989), pp. 170–186.
J. JáJá. An Introduction to Parallel Algorithms. Addison-Wesley, 1992.
R. M. Karp and V. Ramachandran, Parallel Algorithms for Shared-Memory Machines, Handbook of Theoretical Computer Science, Ed. J. van Leeuwen, Vol 1, Elsevier Science Publishers B.V, 1990.
A. Namaad, W. Hsu and D. T. Lee. On maximum empty rectangle problem. Discrete Applied Mathematics 8 (1984), pp. 267–277.
M. Orlowski. A new algorithm for the largest empty rectangle problem. Algorithmica 5 (1990), pp. 65–73.
M. Overmars and D. Wood. On rectangular visibility. J. of Algorithms 9 (1988), pp. 372–390.
F. P. Preparata and M. I. Shamos. Computational Geometry: an Introduction. Springer-Verlag, New York, 1985.
B. Schieber and U. Vishkin. On finding lowest common ancestors: Simplification and Parallelization. SIAM. J. Computing, 17 (1988), pp. 1253–1262.
R. E. Tarjan and U. Vishkin. Finding biconnected components and computing tree functions in logarithmic parallel time. SIAM J. Computing, 14 (1985), pp. 862–874.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Datta, A., Maheshwari, A., Sack, JR. (1993). Optimal CREW-PRAM algorithms for direct dominance problems. In: Lengauer, T. (eds) Algorithms—ESA '93. ESA 1993. Lecture Notes in Computer Science, vol 726. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57273-2_48
Download citation
DOI: https://doi.org/10.1007/3-540-57273-2_48
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57273-2
Online ISBN: 978-3-540-48032-7
eBook Packages: Springer Book Archive