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

Chang-Sung Jeong

Research output: Contribution to journal › Article

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

Mesh-connected Computer
Voronoi Diagram
Cartesian plane
Metric
Asymptotically Optimal
Parallel algorithms
Parallel Algorithms

Keywords

  • mesh-connected computer
  • Parallel algorithm
  • Voronoi diagram

ASJC Scopus subject areas

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

Cite this

Parallel voronoi diagram in L1 (L∞) metric on a mesh-connected computer. / Jeong, Chang-Sung.

In: Parallel Computing, Vol. 17, No. 2-3, 01.06.1991, p. 241-252.

Research output: Contribution to journal › Article

Jeong, C-S 1991, 'Parallel voronoi diagram in L1 (L∞) metric on a mesh-connected computer', Parallel Computing, vol. 17, no. 2-3, pp. 241-252.
Jeong C-S. Parallel voronoi diagram in L1 (L∞) metric on a mesh-connected computer. Parallel Computing. 1991 Jun 1;17(2-3):241-252.
Jeong, Chang-Sung. / Parallel voronoi diagram in L1 (L∞) metric on a mesh-connected computer. In: Parallel Computing. 1991 ; Vol. 17, No. 2-3. pp. 241-252.
@article{d9fa9f7567f647bba025d99e1ff71ca7,
title = "Parallel voronoi diagram in L1 (L∞) metric on a mesh-connected computer",
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.",
keywords = "mesh-connected computer, Parallel algorithm, Voronoi diagram",
author = "Chang-Sung Jeong",
year = "1991",
month = "6",
day = "1",
language = "English",
volume = "17",
pages = "241--252",
journal = "Parallel Computing",
issn = "0167-8191",
publisher = "Elsevier",
number = "2-3",

}

TY - JOUR

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

AU - Jeong, Chang-Sung

PY - 1991/6/1

Y1 - 1991/6/1

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

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

KW - mesh-connected computer

KW - Parallel algorithm

KW - Voronoi diagram

UR - http://www.scopus.com/inward/record.url?scp=0026172517&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0026172517&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0026172517

VL - 17

SP - 241

EP - 252

JO - Parallel Computing

JF - Parallel Computing

SN - 0167-8191

IS - 2-3

ER -

Access to Document