By Topic

On computing the upper envelope of segments in parallel

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.

The purchase and pricing options are temporarily unavailable. Please try again later.
2 Author(s)
Wei Chen ; Dept. of Inf. & Telecommun. Eng., Nanzan Univ., Japan ; Wada, K.

Given a collection of segments in the plane, if we regard the segments as opaque barriers, their upper envelope consists of the portions of the segments visible from point (0, +∞). In this paper, we present deterministic parallel methods for constructing the upper envelope of segments on the weakest shared-memory model, the EREW PRAM. We show that we can find the upper envelope of n line segments optimally in 0(logn) time using 0(n) processors. Furthermore, if the segments are nonintersecting and their endpoints are sorted in x-coordinate, then we can reduce the number of processors to 0(n/ logn). Our method implies that we can find the upper envelope sequentially in 0(n log log n) time, which improves previous results. We also show that we can find the upper envelope of n k-intersecting segments (any pair of the segments intersects at most k times) with a slightly larger time and processor bound

Published in:

Parallel and Distributed Systems, IEEE Transactions on  (Volume:13 ,  Issue: 1 )