Optimal, output-sensitive algorithms for constructing upper envelope of line segments in parallel

In this paper we focus on the problem of designing very fast parallel algorithms for constructing the upper envelope of straight-line segments that achieve the O(n log H) work-bound for input size n and output size H. Our algorithms are designed for the arbitrary CRCW PRAM model. We first describe an O(log n (log H + log log n)) time deterministic algorithm for the problem, that achieves O(n log H) work bound for H = Ω(log n). We present a fast randomized algorithm that runs in expected time O(log H log log n) with high probability and does O(n log H) work. For log H =Ω(log log n), we can achieve the running time of O(logH) while simultaneously keeping the work optimal. We also present a fast randomized algorithm that runs in O(log n/log k) time with nk processors, k > log Ω(1) n. The algorithms do not assume any input distribution and the running times hold with high probability.