Browsing by Author "Lee, R. C. T."

Now showing 1 - 1 of 1

PARALLEL ALGORITHMS FOR COMPUTING THE CLOSEST VISIBLE VERTEX PAIR BETWEEN TWO POLYGONS
(1992-06-01)
Hsu, F. R.
;
Chang, R. C.
;
Lee, R. C. T.
;
資訊工程學系
;
資訊科學與工程研究所
In this paper, we are concerned with the closest visible vertex pair problem, which is defined as follows: we are given two simple non-intersecting polygons P and Q with in and n vertices respectively, we are asked to find a closest visible pair of vertices between P and Q. We shall show that we can solve this problem in O(log(m + n)) time with O(m + n) processors in the CREW PRAM model.