Parallel algorithms for geometric searching problems

Authors:
S.-J. Oh;M. Suk
Affiliations:
Electronics and Telecommunications Research Institute, Daejun, Korea 302-350;Dept. of Electrical and Computer Eng., Link Hall, Syracuse University, Syracuse, NY
Venue:
Proceedings of the 1989 ACM/IEEE conference on Supercomputing
Year:
1989

Citing 8
Cited 1

Computational geometry: an introduction

Computational geometry: an introduction
Principles of interactive computer graphics (2nd ed.)

Principles of interactive computer graphics (2nd ed.)
O(n1/2) algorithms for the maximal elements and ECDF searching problem on a mesh-connected parallel computer

Information Processing Letters
Layout design and verification

Layout design and verification
Multidimensional divide-and-conquer

Communications of the ACM
Computing the Largest Empty Rectangle

STACS '84 Proceedings of the Symposium of Theoretical Aspects of Computer Science
Divide and conquer algorithms for closest point problems in multidimensional space.

Divide and conquer algorithms for closest point problems in multidimensional space.
Computational geometry.

Computational geometry.

Computation as estimation: a general framework for robustness and energy efficiency in SoCs

IEEE Transactions on Signal Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Computational Geometry is concerned with the design and analysis of computational algorithms which solve geometry problems. In this paper SIMD-MCC algorithms for solving geometric searching problems such as the point domination, the point maxima, the range searching, and the closest point problems are designed by using the parallel divide-and-conquer technique. The computational complexities of all these algorithms for N input points in the k-dimensional space are O(CkN0.5), where Ck = (20.5 + 1)k-2.