Elsevier

Parallel Computing

Volume 17, Issues 6–7, September 1991, Pages 683-687
Parallel Computing

Short Communication
A faster optimal algorithm for the measure problem

https://doi.org/10.1016/S0167-8191(05)80058-4Get rights and content

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].

References (8)

  • M. Zubair

    An optimal speedup algorithm for the measure problem

    Parallel Comput.

    (1990)
  • M.J. Atallah et al.

    Cascading divide-and-conquer: A technique for designing parallel algorithms

  • J.L. Bentley et al.

    Optimal algorithms for structuring geographic data

  • R. Cole

    Parallel merge sort

There are more references available in the full text version of this article.

Cited by (0)

View full text