<link rel="stylesheet" href="styles.cf390c6bfbe7555f.css">

PARALLEL ALGORITHMS FOR COMPUTING THE CLOSEST VISIBLE VERTEX PAIR BETWEEN TWO POLYGONS

Simple item page
dc.citation.epage162en_US
dc.citation.issue2en_US
dc.citation.spage135en_US
dc.citation.volume2en_US
dc.citation.woscount2
dc.contributor.authorHsu, F. R.en_US
dc.contributor.authorChang, R. C.en_US
dc.contributor.authorLee, R. C. T.en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.department資訊科學與工程研究所zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.contributor.departmentInstitute of Computer Science and Engineeringen_US
dc.date.accessioned2014-12-08T15:32:50Z
dc.date.available2014-12-08T15:32:50Z
dc.date.issued1992-06-01en_US
dc.description.abstractIn 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.doi10.1142/S0218195992000093en_US
dc.identifier.issn0218-1959en_US
dc.identifier.journalINTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONSen_US
dc.identifier.urihttp://dx.doi.org/10.1142/S0218195992000093en_US
dc.identifier.urihttps://ir.lib.nycu.edu.tw/handle/11536/22915
dc.identifier.wosnumberWOS:000208795000003
dc.language.isoen_USen_US
dc.subjectParallel algortihmsen_US
dc.subjectcomputational geometryen_US
dc.subjectvisibilityen_US
dc.titlePARALLEL ALGORITHMS FOR COMPUTING THE CLOSEST VISIBLE VERTEX PAIR BETWEEN TWO POLYGONSen_US
dc.typeArticleen_US

Files

License bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed to upon submission
Description:
Download

Collections

期刊論文;;Articles