OPTIMAL PARALLEL PREPROCESSING ALGORITHMS FOR TESTING WEAK VISIBILITY OF POLYGONS FROM SEGMENTS

For an n-gon P, we say P is weakly visible from segment s if any point on P is visible from at least one point of the segment. In this paper, we present an optimal preprocessing algorithm which runs in O(logn) time using O(n) processors under the concurrent read exclusive write parallel random acces...

Full description

Saved in:
Bibliographic Details
Published in:Parallel algorithms and applications Vol. 1; no. 2; pp. 83 - 98
Main Authors: HSU, F. R., CHANG, R. C., LEE, R. C. T.
Format: Journal Article
Language:English
Published: Taylor & Francis Group 01.01.1993
Subjects:
computational geometry
CREW
Parallel algorithm
polygon
visibility
ISSN:1063-7192
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:For an n-gon P, we say P is weakly visible from segment s if any point on P is visible from at least one point of the segment. In this paper, we present an optimal preprocessing algorithm which runs in O(logn) time using O(n) processors under the concurrent read exclusive write parallel random access machine model such that after preprocessing, it takes O(logn) time to test if P is weakly visible from a given segment using a single processor.
ISSN:1063-7192
DOI:10.1080/10637199308915433