scholarly journals A parallel algorithm for understanding design spaces and performing convex hull computations

Author(s):  
Adam Siegel
1996 ◽  
Vol 06 (02) ◽  
pp. 231-241 ◽  
Author(s):  
OMER BERKMAN ◽  
BARUCH SCHIEBER ◽  
UZI VISHKIN

We present a parallel algorithm for finding the convex hull of a sorted point set. The algorithm runs in O( log log n) (doubly logarithmic) time using n/ log log n processors on a Common CRCW PRAM. To break the Ω( log n/ log log n) time barrier required to output the convex hull in a contiguous array, we introduce a novel data structure for representing the convex hull. The algorithm is optimal in two respects: (1) the time-processor product of the algorithm, which is linear, cannot be improved, and (2) the running time, which is doubly logarithmic, cannot be improved even by using a linear number of processors. The algorithm demonstrates the power of the “the divide-and-conquer doubly logarithmic paradigm” by presenting a non-trivial extension to situations that previously were known to have only slower algorithms.


1989 ◽  
Vol 136 (6) ◽  
pp. 530
Author(s):  
G.R. Wilson ◽  
B.G. Batchelor
Keyword(s):  

2019 ◽  
Vol 31 (5) ◽  
pp. 761
Author(s):  
Xiao Lin ◽  
Zuxiang Liu ◽  
Xiaomei Zheng ◽  
Jifeng Huang ◽  
Lizhuang Ma

2010 ◽  
Vol 24 (7) ◽  
pp. 638-642
Author(s):  
Linli Cui ◽  
Fan Yang ◽  
Qicong Peng

Sign in / Sign up

Export Citation Format

Share Document