ISA 1991: ISA'91 Algorithms pp 375-384 | Cite as

Parallel algorithms for some dominance problems based on a CREW PRAM

  • Ip-Wang Chan
  • Donald K. Friesen
Conference paper
First Online:
Part of the Lecture Notes in Computer Science book series (LNCS, volume 557)

Abstract

Two parallel geometric algorithms based on the idea of point domination are presented. The first algorithm solves the d-dimensional isothetic rectangles intersection counting problem of input size N/2d, where d > 1 and N is a multiple of 2d, in O(logd−1N) time and O(N) space. The second algorithm solves the direct dominance reporting problem for a set of N points in the plane in O(log N+J) time and O(N log N) space, where J denotes the maximum of the number of direct dominances reported by any single point in the set. Both algorithms make use of the CREW PRAM (Concurrent Read Exclusive Write Parallel Random Access Machine) consisting of O(N) processors as the computational model.

Keywords

Binary Tree Target Pointer Computational Geometry Counting Problem Dominance Region 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    M. J. Atallah, R. Cole, and M. T. Goodrich, Cascading divide-and-conquer: A technique for designing parallel algorithms, SIAM J. Comput. 18 (1989) 499–532.Google Scholar
  2. [2]
    M. J. Atallah and M. T. Goodrich, Efficient plane sweeping in parallel, in: Proc. of the Second ACM Symposium on Computational Geometry (1986) 216–225.Google Scholar
  3. [3]
    J. L. Bentley, Multidimensional divide-and-conquer, Commun. ACM 22 (1980) 214–229.Google Scholar
  4. [4]
    R. Cole, Parallel merge sort, SIAM J. Comput. 17 (1988) 770–785.Google Scholar
  5. [5]
    H. Edelsbrunner and M. H. Overmars, On the equivalence of some rectangle problems, Inform. Process. Lett. 14 (1982) 124–127.Google Scholar
  6. [6]
    R. H. Güting, O. Nurmi, and T. Ottmann, The direct dominance problem, in: Proc. of the First ACM Symposium on Computational Geometry (1985) 81–88.Google Scholar
  7. [7]
    R. E. Ladner and M. J. Fischer, Parallel prefix computation, JACM 27 (1980) 831–838.Google Scholar
  8. [8]
    D. T. Lee and F. P. Preparata, Computational geometry — A survey, IEEE Trans. Comput. C-33 (1984) 1072–1101.Google Scholar
  9. [9]
    K. Mehlhorn, Data Structures and Algorithms 3: Multi-dimensional Searching and Computational Geometry. (Springer Verlag, New York, 1984).Google Scholar
  10. [10]
    F. P. Preparata and M. I. Shamos, Computational Geometry: An Introduction. (Springer Verlag, New York, 1985).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Ip-Wang Chan
    • 1
  • Donald K. Friesen
    • 2
  1. 1.Department of Information Systems and Computer ScienceNational University of SingaporeSingapore
  2. 2.Department of Computer ScienceTexas A&M UniversityCollege StationUSA

Personalised recommendations