Jeong, C.S., An improved parallel algorithm for constructing Voronoi diagram on a mesh-connected computer, Parallel Computing 17 (1991) 505-514. While constructing a Voronoi diagram Vp for a set P of n points on a mesh-connected computer (MCC), it is necessary to find a set B of edges which are intersected by the dividing chain C during the merge process of two Voronoi diagrams Vt, and V R, where L and R contain the leftmost [n/2l points and the rightmost [n/2J points of P respectively_ Theâ€¦Â CONTINUE READING