Parallel voronoi diagram in L1 (L) metric on a mesh-connected computer

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

In this paper, we consider the problem of constructing a Voronoi diagram in L1(L) metric for a set of n points in the Cartesian plane on a mesh-connected computer. An O(√n) parallel algorithm on a √n × √n mesh-connected computer is given for solving that problem. This is the first solution on a √n × √n MCC to achieve an asymptotically optimal θ(√n) running time for L1(L) metric.

Original languageEnglish
Pages (from-to)241-252
Number of pages12
JournalParallel Computing
Volume17
Issue number2-3
Publication statusPublished - 1991 Jun 1
Externally publishedYes

    Fingerprint

Keywords

  • mesh-connected computer
  • Parallel algorithm
  • Voronoi diagram

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Hardware and Architecture
  • Computer Science Applications

Cite this