System Notification:
We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

Parallel algorithms for geometric searching problems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Seoung-Jun Oh ; Electronics and Telecommunications Research Institute, Daejun, Korea 302-350 ; Minsoo Suk

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.

Published in:

Supercomputing, 1989. Supercomputing '89. Proceedings of the 1989 ACM/IEEE Conference on

Date of Conference:

12-17 Nov. 1989