### Abstract

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

Original language | English |
---|---|

Pages (from-to) | 241-252 |

Number of pages | 12 |

Journal | Parallel Computing |

Volume | 17 |

Issue number | 2-3 |

Publication status | Published - 1991 Jun 1 |

Externally published | Yes |

### 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

_{1}(L

_{∞}) metric on a mesh-connected computer.

*Parallel Computing*,

*17*(2-3), 241-252.

**Parallel voronoi diagram in L _{1} (L_{∞}) metric on a mesh-connected computer.** / Jeong, Chang-Sung.

Research output: Contribution to journal › Article

_{1}(L

_{∞}) metric on a mesh-connected computer',

*Parallel Computing*, vol. 17, no. 2-3, pp. 241-252.

_{1}(L

_{∞}) metric on a mesh-connected computer. Parallel Computing. 1991 Jun 1;17(2-3):241-252.

}

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 -