O(1) Time Algorithm on BSR for Computing Convex Hull

L. Xiang and K. Ushijima (Japan)

Keywords

The Convex Hull Problem, Parallel Algorithms, BSR

Abstract

0(1)Time algorithms on BSR for many problems can be found in the literature. In this paper, an 0(1) time solutionis given on BSR to the convex hull problem with n points, which requires " Ω(nlog n) time on RAM and " Ω(log n) time on PRAM.

Important Links:

• DOI:
• From Proceeding (373) Parallel and Distributed Computing and Systems - 2002

Go Back