An optimal parallel circle-cover algorithm

Dilip Sarkar, Ivan Stojmenović

Research output: Contribution to journalArticle

2 Scopus citations


Given a set of n circular arcs, we provide an optimal parallel algorithm (on the CREW PRAM model of computation) for finding a minimum number of circular arcs whose union covers the circle. The algorithm runs in O(log n) time with O(n) processors and uses O(n) space. This is a significant improvement over the recent algorithm by Bertossi that runs in O(log n) time with O(n2) processors and uses O(n2) space.

Original languageEnglish (US)
Pages (from-to)3-6
Number of pages4
JournalInformation Processing Letters
Issue number1
StatePublished - Jul 3 1989


  • Analysis of algorithms
  • circle-cover
  • combinatorial problems
  • computational geometry
  • parallel processing

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Signal Processing
  • Information Systems
  • Computer Science Applications

Fingerprint Dive into the research topics of 'An optimal parallel circle-cover algorithm'. Together they form a unique fingerprint.

  • Cite this