PARALLEL ALGORITHMS FOR COMPUTING THE CLOSEST VISIBLE VERTEX PAIR BETWEEN TWO POLYGONS
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
162 | en_US |
dc.citation.issue |
2 | en_US |
dc.citation.spage |
135 | en_US |
dc.citation.volume |
2 | en_US |
dc.citation.woscount |
2 | |
dc.contributor.author |
Hsu, F. R. | en_US |
dc.contributor.author |
Chang, R. C. | en_US |
dc.contributor.author |
Lee, R. C. T. | en_US |
dc.contributor.department |
資訊工程學系 | zh_TW |
dc.contributor.department |
資訊科學與工程研究所 | zh_TW |
dc.contributor.department |
Department of Computer Science | en_US |
dc.contributor.department |
Institute of Computer Science and Engineering | en_US |
dc.date.accessioned |
2014-12-08T15:32:50Z | |
dc.date.available |
2014-12-08T15:32:50Z | |
dc.date.issued |
1992-06-01 | en_US |
dc.description.abstract |
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. | en_US |
dc.identifier.doi |
10.1142/S0218195992000093 | en_US |
dc.identifier.issn |
0218-1959 | en_US |
dc.identifier.journal |
INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1142/S0218195992000093 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/22915 | |
dc.identifier.wosnumber |
WOS:000208795000003 | |
dc.language.iso |
en_US | en_US |
dc.subject |
Parallel algortihms | en_US |
dc.subject |
computational geometry | en_US |
dc.subject |
visibility | en_US |
dc.title |
PARALLEL ALGORITHMS FOR COMPUTING THE CLOSEST VISIBLE VERTEX PAIR BETWEEN TWO POLYGONS | en_US |
dc.type |
Article | en_US |
檔案
本條目沒有附加檔案。
所屬典藏: 期刊論文
引用此條目
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