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

Chang Sung Jeong

doi:10.1016/S0167-8191(05)80109-7

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

Chang Sung Jeong^*

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

4 Citations (Scopus)

Abstract

In this paper, we consider the problem of constructing a Voronoi diagram in L₁(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 L₁(L_∞) metric.

Original language	English
Pages (from-to)	241-252
Number of pages	12
Journal	Parallel Computing
Volume	17
Issue number	2-3
DOIs	https://doi.org/10.1016/S0167-8191(05)80109-7
Publication status	Published - 1991 Jun
Externally published	Yes

Bibliographical note

Funding Information:
* Research supported in part by KOSEF grant.

Keywords

Parallel algorithm
Voronoi diagram
mesh-connected computer

ASJC Scopus subject areas

Software
Theoretical Computer Science
Hardware and Architecture
Computer Networks and Communications
Computer Graphics and Computer-Aided Design
Artificial Intelligence

Access to Document

10.1016/S0167-8191(05)80109-7

Cite this

@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 = "Parallel algorithm, Voronoi diagram, mesh-connected computer",

author = "Jeong, \{Chang Sung\}",

note = "Funding Information: * Research supported in part by KOSEF grant.",

year = "1991",

month = jun,

doi = "10.1016/S0167-8191(05)80109-7",

language = "English",

volume = "17",

pages = "241--252",

journal = "Parallel Computing",

issn = "0167-8191",

publisher = "Elsevier B.V.",

number = "2-3",

}

TY - JOUR

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

AU - Jeong, Chang Sung

N1 - Funding Information: * Research supported in part by KOSEF grant.

PY - 1991/6

Y1 - 1991/6

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 - Parallel algorithm

KW - Voronoi diagram

KW - mesh-connected computer

UR - https://www.scopus.com/pages/publications/0026172517

U2 - 10.1016/S0167-8191(05)80109-7

DO - 10.1016/S0167-8191(05)80109-7

M3 - Article

AN - SCOPUS:0026172517

SN - 0167-8191

VL - 17

SP - 241

EP - 252

JO - Parallel Computing

JF - Parallel Computing

IS - 2-3

ER -