PARALLEL ALGORITHMS FOR COMPUTING THE CLOSEST VISIBLE VERTEX PAIR BETWEEN TWO POLYGONS
檔案
本條目沒有附加檔案。
日期
1992-06-01
期刊名稱
INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS
摘要
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.
所屬典藏
期刊論文引用此條目
Hsu, F. R., Chang, R. C., & Lee, R. C. T. (1992). PARALLEL ALGORITHMS FOR COMPUTING THE CLOSEST VISIBLE VERTEX PAIR BETWEEN TWO POLYGONS. INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 2(2), 135–162. https://doi.org/10.1142/S0218195992000093
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/22915