首页   按字顺浏览 期刊浏览 卷期浏览 OPTIMAL PARALLEL PREPROCESSING ALGORITHMS FOR TESTING WEAK VISIBILITY OF POLYGONS FROM ...
OPTIMAL PARALLEL PREPROCESSING ALGORITHMS FOR TESTING WEAK VISIBILITY OF POLYGONS FROM SEGMENTS

 

作者: F. R. HSU,   R. C. CHANG,   R. C. T. LEE,  

 

期刊: Parallel Algorithms and Applications  （Taylor Available online 1993）
卷期: Volume 1, issue 2  

页码: 83-98

 

ISSN:1063-7192

 

年代: 1993

 

DOI:10.1080/10637199308915433

 

出版商: Taylor & Francis Group

 

关键词: Parallel algorithm;CREW;computational geometry;visibility;polygon

 

数据来源: Taylor

 

摘要:

For ann-gonP, we sayPis weakly visible from segmentsif any point onPis visible from at least one point of the segment. In this paper, we present an optimal preprocessing algorithm which runs inO(logn)time usingO(n) processors under the concurrent read exclusive write parallel random access machine model such that after preprocessing, it takes O(logn) time to test ifPis weakly visible from a given segment using a single processor.

 

点击下载:  PDF (343KB)



返 回