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

doi:10.1142/S0218195992000093

完整後設資料紀錄

DC 欄位	值	語言
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.date.accessioned	2014-12-08T15:32:50Z	-
dc.date.available	2014-12-08T15:32:50Z	-
dc.date.issued	1992-06-01	en_US
dc.identifier.issn	0218-1959	en_US
dc.identifier.uri	http://dx.doi.org/10.1142/S0218195992000093	en_US
dc.identifier.uri	http://hdl.handle.net/11536/22915	-
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.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
dc.identifier.doi	10.1142/S0218195992000093	en_US
dc.identifier.journal	INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS	en_US
dc.citation.volume	2	en_US
dc.citation.issue	2	en_US
dc.citation.spage	135	en_US
dc.citation.epage	162	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.identifier.wosnumber	WOS:000208795000003	-
dc.citation.woscount	2	-
顯示於類別：	期刊論文