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

Authors:
Chang-Sung Jeong
Affiliations:
-
Venue:
Parallel Computing
Year:
1991

Citing 7
Cited 0

An O(n log n) Algorithm for Rectilinear Minimal Spanning Trees

Journal of the ACM (JACM)
Two-Dimensional Voronoi Diagrams in the Lp-Metric

Journal of the ACM (JACM)
Sorting on a mesh-connected parallel computer

Communications of the ACM
Parallel algorithms for geometric problems

Parallel algorithms for geometric problems
Closest-point problems

SFCS '75 Proceedings of the 16th Annual Symposium on Foundations of Computer Science
Parallel computational geometry

SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Data broadcasting in SIMD computers

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

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 x @/n mesh-connected computer is given for solving that problem. This is the first solution on a @/n x @/n MCC to achieve an asymptotically optimal @q(@/n) running time for L"1(L"~) metric.