Journal ArticleDOI
Short Communication: A faster optimal algorithm for the measure problem
Stephan Olariu,Zhaofang Wen,Weixiong Zhang +2 more
- Vol. 17, Iss: 6, pp 683-687
Reads0
Chats0
TLDR
It is shown that the measure problem can be solved optimally in O(log n) time using O(n) processors in the same model of computation, thus settling an open problem posed in [8].Abstract:
The measure problem involves computing the area of the union of a set of n iso-oriented rectangles in the plane. Recently, it has been shown that for a set of n such rectangles, the measure problem can be solved in O(log n log log n) time, using O(n/log log n) processors in the CREW PRAM model of computation. In this note we show that the measure problem can be solved optimally in O(log n) time using O(n) processors in the same model of computation, thus settling an open problem posed in [8].read more
References
More filters
Computational geometry. an introduction
TL;DR: This book offers a coherent treatment, at the graduate textbook level, of the field that has come to be known in the last decade or so as computational geometry.
Journal ArticleDOI
Parallel merge sort
TL;DR: A parallel implementation of merge sort on a CREW PRAM that uses n processors and O(logn) time; the constant in the running time is small.
Journal ArticleDOI
Cascading divide-and-conquer: a technique for designing parallel algorithms
TL;DR: Improvements in parallel divide-and-conquer techniques are presented, resulting in improved parallel algorithms for a number of problems, including intersection detection, trapezoidal decomposition, and planar point location.
Journal ArticleDOI
On the complexity of computing the measure of ∪[ai,bi]
TL;DR: The decision tree complexity of computing the measure of the union of n (possibly overlapping) intervals is shown to be &OHgr;(n log n), even if comparisons between linear functions of the interval endpoints are allowed.
Journal ArticleDOI
An optimal speedup algorithm for the measure problem
TL;DR: The parallel algorithm presented in this paper is shown to have a tim complexity of O(log n log log n) with O(n/log log n ) processors.